心随我动

Codeforces Round #413 Div. 1 + Div. 2 A. Carrot Cakes A. Carrot Cakes time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output In some game by Play

Codeforces Round #412 C - Success Rate算出最小倍数就可以了  p要大于等于yq要大于等于x对于x增加 y也随增加(y-x)*i#include #include #define read(); freopen("input.txt","r",stdin);using namespace std;typedef l

codeforces 807A Is it rated?#include #include #define read(); freopen("input.txt","r",stdin);using namespace std;int s[1005][2];int main(){ int n; cin>>n; int flag=0; for(int i=1;i<=n;

codeforces Round 21 808D Array DivisionD. Array Divisiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

Educational Codeforces Round 21 808C Tea PartyC. Tea Partytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outpu

Educational Codeforces Round 21 808B Average Sleep TimeB. Average Sleep Timetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutput

Educational Codeforces Round 21  808A Lucky Year  A. Lucky Yeartime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outp

We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each step we choose one of substrings "ab" in the string and replace it with the string "bba". If we have no "

题目大意： 1-n个城市 每个城市走一边 找出一条路线 使得路线 之和最小 方案 从1走到n n走到2 2走到n-1 n-1走到3 3走到n-2 依次这样走 没走两步结果加一

Codeforces Round #414, rated, Div. 1 + Div. 2 B. Cutting CarrotB. Cutting Carrottime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputout

Codeforces Round #414, rated, Div. 1 + Div. 2 A. Bank RobberyA. Bank Robberytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputs

In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick.He is too selfish, so for a given n he wants to obtain a string

除非l==r 最大值等于本身  那就是2是最多的  每两个数有一个被除数2 #include #include #define mod 1000000007#define ll long long using namespace std;int l,r; int main() { cin>>l>>r; if(l==r) cout<<l; else

Codeforces Round #413 Div. 1 + Div. 2 C. Fountains C. Fountains time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Arkady plays Gardenscapes

Codeforces Round #413 Div. 1 + Div. 2 B. T-shirt buying B. T-shirt buying time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output A new pack of n

codeforces Round 21 808E. Selling Souvenirs 【dp好题】E. Selling Souvenirstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstand