知与谁i的博客

Breaking Good Breaking Good is a new video game which a lot of gamers want to have. There is a certain level in the game that is really difficult even for experienced gamers.Walter William, th

C. Destroying Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array consisting of n n

D. Shovel Saletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n shovels in Polycarp's shop. The i

B. Coachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA programming coach has n students to teach. We kn

D. Love Rescuetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputValya and Tolya are an ideal pair, but they

C. Industrial Nimtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputThere are n stone quarries in Petrograd.

C. Pie or dietime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVolodya and Vlad play the following game. The

C. Beaver Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo beavers, Timur and Marsel, play the following game.There are n logs, each of exac...

C. Interesting Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo best friends Serozha and Gena play a game.Initially there is one pile consi...

B. Marlintime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe city of Fishtopia can be imagined as a grid of

D. Inversion Countingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of size n is an array o

C. Remove Extra Onetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a permutation p of length

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe tram in Berland goes along a straight line from the point 0 t

C. Bunstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLavrenty, a baker, is going to make several buns wi

codeforces1A题目链接：http://codeforces.com/problemset/problem/1/A题意：给定一个n*m的矩形，然后给一个a*a的地板，求最少需要多少地板可以铺满这个矩形（不可以割断，可以重叠）思路：做除法上取整，然后结果相乘即可，（注意相乘的结果用long long 保存）【知识点】int数据范围#include using names

C. Maximum splittingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given several queries. In the 

B. Divisiblity of Differencestime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a multiset of n

A. Classroom Watchtime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputEighth-grader Vova is on duty today in th

题目链接：http://codeforces.com/problemset/problem/839/D题意：有n个士兵，每个士兵的力量值为a[i]，现在按照输入的顺序选择k个数（即选择i，i+1,i+3,i+j....i+k），使得这k个数的最大公约数大于1，并计算gcd*k，然后对这些gcd*k求和思路：利用埃氏筛的原理，求出在a[j]的数组中有多少i的倍数，假设有x个数是i的倍数，则这

题目链接：http://codeforces.com/problemset/problem/896/A题意：给你一个数字n，代表f(n)，然后给定数字k，在f(n)中查找第k个字符，如果k > f(n)的长度，返回‘.’；思路：在f(n)中找到f(n-1)处，递归查找即可#include #define LL long longusing namespace std;char

题目链接：http://codeforces.com/problemset/problem/903/D思路：对于一个给定的a[x]来说，对于 d(a[1],a[x]) + d(a[2],a[x])+.......+d(a[i].a[x])的结果是 i * a[x] - sum(sum为前x-1项元素的和) + (a[i] - a[x]  == 1的所有数的和，即所有等于a[x]+1的数的和)

题目链接：http://codeforces.com/problemset/problem/768/E题意：给定n堆石子，第i堆石子有a[i]个，两个玩家交替从n堆中取石子，不过如果一个玩家在第i堆中取过m个石子，则另一个玩家则不能在第i堆再取m个石子，最后不能取石子的人为输，jon赢则输出YES否则输出NO，jon为后手思路：对于玩家来说，第i堆石子不能拿以前拿过的数量，求出第i堆石子最

A.题目链接：http://codeforces.com/contest/1213/problem/A题意：把所有的chips都移动到同一个位置，求花费coins最少的移动方法。移动方法有两种：一是向左或者向右移动两个位置，不花费任何coins，二是向左或向右移动一个位置，花费一个coins。思路：分别求出奇数位置和偶数位置上chip的数目，取最小值。代码：#include...