张洪基

C. K-th Not Divisible by ntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two positive integers n and k. Print the k-th positive integer that is not divisible by n.For example, if n=3

C. K-Complete Wordtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputWord s of length n is called k-complete ifs is a palindrome, i.e. si=sn+1−...

B. Composite Coloringtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputA positive integer is called composite if it can be represented as a pro...

A. Exercising Walktime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputAlice has a cute cat. To keep her cat fit, Alice wants to design an exercis...

D2. Prefix-Suffix Palindrome (Hard version)time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis is the hard version of the problem. The diffe...

思路：map <int,bool> q;int t,n;int u[100020],v[100020],w[100020];int ind[100020];int main() { scanf("%d",&n); for(int i=1; i<n; i++) { cin>>u[i]>>v[i]; ...

思路：int main() { ll x,y,u,v; cin>>u>>v; if((v-u)%2!=0) cout<<-1<<endl; else{ if(v-u>0){ x=(v-u)/2; y=(v+u)/2; ...

等补题

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTo become the king of Codeforces, Kuroni has to solve the following problem.He is given n numb...

思路：给定长度为n的字符串，规定操作——某一字符的前一位或者后一位的字符在字典序中比它小一，那么就可以删除这个字符，问最多可以删除多少个字符贪心思路，每次按字典序递减的顺序从字符串内查找进行删除处理，进行递归就可以得到最大操作数ll n,t,s;char x[1000010];int main() { scanf("%lld\n",&n); cin>&...

题意：给定n，在一个2n多边形内满足相邻三条边x,a,b,y满足x+a+b=a+b+y+1或者x+a+b=a+b+y-1n为奇数的时候可以满足，为偶数的时候不满足输出NOtypedef long long ll;const ll maxn=2e5+10;ll n,a[maxn];int main() { scanf("%lld",&n); if(n&amp...

You are given n integer numbers a1,a2,…,an. Consider graph on n nodes, in which nodes i, j (i≠j) are connected if and only if, ai AND aj≠0, where AND denotes the bitwise AND operation.Find the length...

F. Moving Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n points on a coordinate axis OX. The i-th point is located at the ...

time limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputVK news recommendation system daily selects interesting publications of one of n disjoint cate...

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe only difference between easy and hard versions is the size of the input.You are given...

time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are a coach at your local university. There are n students under your supervision, the pro...

time limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe new camp by widely-known over the country Spring Programming Camp is going to start soon. H...

DiscriptionGildong owns a bulgogi restaurant. The restaurant has a lot of customers, so many of them like to make a reservation before visiting it.Gildong tries so hard to satisfy the customers that...

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two integers a and m. Calculate the number of integers x such that 0≤x<m and ...

A. ConneR and the A.R.C. Markland-Ntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSakuzyo - ImprintingA.R.C. Markland-N is a tall building w...

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTry guessing the statement from this picture http://tiny.cc/ogyoiz.You are given two integers ...

B. Just Eat It!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday, Yasser and Adel are at the shop buying cupcakes. There are n cupcake typ...

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSo the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the conte...

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a permutation p=[p1,p2,…,pn] of integers from 1 to n. Let’s call the number m (1≤...

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA PIN code is a string that consists of exactly 4 digits. Examples of possible PIN codes: 7013,...

C. League of Leesinstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob is an avid fan of the video game “League of Leesins”, and today he ce...

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou’re given two arrays a[1…n] and b[1…n], both of the same length n.In order to perform a pus...

A k-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by k. That is, there are no two integers x and y (x < y) from the set,...

Let’s consider equation:x2 + s(x)·x - n = 0, where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.You are given an integer n, ...

**Ice Skating**Bajtek is learning to skate on ice. He’s a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands ...

题目链接：http://codeforces.com/problemset/problem/234/CScientists say a lot about the problems of global warming and cooling of the Earth. Indeed, such natural phenomena strongly influence all life on ou...

You’ve got an array a, consisting of n integers: a1, a2, …, an. Your task is to find a minimal by inclusion segment [l, r] (1 ≤ l ≤ r ≤ n) such, that among numbers al,  al + 1,  …,  ar there are exact...

Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in...

One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges ...

A subsequence of length |x| of string s = s1s2… s|s| (where |s| is the length of string s) is a string x = sk1sk2… sk|x| (1 ≤ k1 < k2 < … < k|x| ≤ |s|).You’ve got two strings — s and t. Let’...

A piece of paper contains an array of n integers a1, a2, …, an. Your task is to find a number that occurs the maximum number of times in this array.However, before looking for such number, you are al...

Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists knows exactly one language. For convenience, we enumerate all lan...

Little Elephant and ArrayThe Little Elephant loves playing with arrays. He has array a, consisting of n positive integers, indexed from 1 to n. Let’s denote the number with index i as ai.Additionall...

Consider the following equation:z=[x/2]+y+x*y，where sign [a] represents the integer part of number a.Let’s find all integer z (z > 0), for which this equation is unsolvable in positive integers....

There are n piles of stones of sizes a1, a2, …, an lying on the table in front of you.During one move you can take one pile and add it to the other. As you add pile i to pile j, the size of pile j in...