- 博客(16)
- 收藏
- 关注
RSS订阅原创 Attack Survival
Attack SurvivalProblem StatementTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manag...
2019-11-19 21:56:13
288
1
原创 Powerful Discount Tickets
Powerful Discount TicketsProblem StatementTakahashi is going to buy N items one by one.The price of the i-th item he buys is Ai yen (the currency of Japan).He has M discount tickets, and he...
2019-11-19 21:36:47
234
原创 Lower
LowerProblem StatementThere are N squares arranged in a row from left to right.The height of the i-th square from the left is Hi.You will land on a square of your choice, then repeat moving...
2019-11-19 20:56:50
185
原创 Monsters Battle Royale
Monsters Battle RoyaleProblem StatementThere are N monsters, numbered 1,2,…,N.Initially, the health of Monster i is Ai.Below, a monster with at least 1 health is called alive.Until there ...
2019-11-19 19:44:52
240
原创 ModSum
ModSumProblem StatementFor an integer N, we will choose a permutation {P1,P2,…,PN} of {1,2,…,N}.Then, for each i=1,2,…,N, let Mi be the remainder when i is divided by Pi.Find the maximum po...
2019-11-19 19:29:55
173
原创 Consecutive Integers
Consecutive IntegersProblem StatementSnuke has N integers: 1,2,[ldots],N. He will choose K of them and give those to Takahashi.How many ways are there to choose K consecutive integers?Const...
2019-11-19 19:07:52
899
原创 Odd Sum Segments（数）
Odd Sum SegmentsYou are given an array aa consisting of nn integers a1,a2,…,ana1,a2,…,an . You want to split it into exactly kk non-empty non-intersecting subsegments such that each subsegment has o...
2019-11-16 18:20:19
175
原创 Three Piles of Candies
Three Piles of CandiesAlice and Bob have received three big piles of candies as a gift. Now they want to divide these candies as fair as possible. To do this, Alice takes one pile of candies, then B...
2019-11-16 17:55:46
136
原创 Rng(nb）
RngAvin is studying how to synthesize data. Given an integer n, he constructs an interval using the following method: he first generates a integer r between 1 and n (both inclusive) uniform-randomly...
2019-11-15 20:52:50
210
原创 Wave
WaveAvin is studying series. A series is called "wave" if the following conditions are satisfied:1) It contains at least two elements;2) All elements at odd positions are the same;3) All elements...
2019-11-15 20:33:08
106
原创 基本字符串练习（最大子段和问题）
题目描述给定长度非0的非空01串SSS。找出SSS的非空连续子串TTT满足串中'0'的个数-'1'的个数最大。你只需要输出最大值即可。输入格式一行一个01串表示SSS。输出格式一行一个数表示答案。输入输出样例输入 #1复制0111100101输出 #1复制2最大子段和问题#include<bits/stdc++.h>us...
2019-11-15 20:19:51
271
原创 Traffic
TrafficAvin is observing the cars at a crossroads. He finds that there are n cars running in the east-west direction with the i-th car passing the intersection at time ai . There are another m cars ...
2019-11-12 17:47:32
162
原创 String
StringAvin has a string. He would like to uniform-randomly select four characters (selecting the same character is allowed) from it. You are asked to calculate the probability of the four characters...
2019-11-12 16:43:30
264
原创 Budget
BudgetAvin’s company has many ongoing projects with different budgets. His company records the budgets using numbers rounded to 3 digits after the decimal place. However, the company is updating the...
2019-11-12 16:33:38
370
原创 Worker
WorkerAvin meets a rich customer today. He will earn 1 million dollars if he can solve a hard problem. There are n warehouses and m workers. Any worker in the i-th warehouse can handle ai orders per...
2019-11-12 16:22:30
132
原创 LCA（倍增）
学长讲的时候敲的LCA（倍增）代码 然后注释了一点点#pragma GCC optimize(2) //O2优化// 倍增LCA //#include<bits/stdc++.h>#include<iostream>#include<vector>#include<cstring> using namespace std;co...
2019-08-08 14:50:48
151
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人