三水的鱼塘♂

A. Key racestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo boys decided to compete in text typing on t

http://codeforces.com/problemset/problem/884/C#include using namespace std;int con=0;long long int ans[111111]; bool vis[111111]; int ma[111111];void dfs(int x,int num

http://codeforces.com/problemset/problem/876/D#includeusing namespace std;int main(){ int a[333333]; bool b[333333]; int n; while(scanf("%d",&n)!=EOF) { memset(b,0,s

http://codeforces.com/problemset/problem/876/C#includeusing namespace std;int main(){ int n; while(cin>>n) { int vis=0; int m=n; int a[11111]; if(n==2){ cout<<"1"

http://codeforces.com/problemset/problem/876/B#includeusing namespace std;int main(){ int n,k,m; while(cin>>n>>k>>m) { int nu[111111]; in

http://codeforces.com/problemset/problem/876/A#includeusing namespace std;int main(){ int n; while(cin>>n) { int a,b,c; cin>>a>>b>>c; int s=min(min(a,b

http://codeforces.com/problemset/problem/868/C#includeusing namespace std;int main(){ int n,k; while(cin>>n>>k) { int tm[22]; int ts[22]; int i,j;

http://codeforces.com/problemset/problem/868/B#includeusing namespace std;int main(){ int h,m,s,t1,t2; while(cin>>h>>m>>s>>t1>>t2) { double ss=s*1.0*6;

http://codeforces.com/problemset/problem/868/A#includeusing namespace std;int main(){ char a[22]; char b[111]; while(cin>>a) { int n; cin>>n; int i,j; int f1=0,f2=0;

http://codeforces.com/problemset/problem/884/B#include using namespace std;int main(){ int n,t; while(cin>>n>>t) { long long int ans=0; long long in

http://codeforces.com/problemset/problem/332/B#includeusing namespace std;int a[222222];long long int b[222222];long long int c[222222];long long int w[22222

http://codeforces.com/problemset/problem/39/F模拟具体看代码#include&lt;iostream&gt;#include&lt;algorithm&gt;#include&lt;cstring&gt;#include&lt;iomanip&gt;using namespace std;struct node{ int id; int ...

http://codeforces.com/problemset/problem/760/C#includeusing namespace std;int ans;int ans1;int ma[222222];bool vis[222222];void dfs(int x){ if(vis[ma[x]]==1){ a

http://codeforces.com/problemset/problem/760/A#includeusing namespace std;int main(){ int n,m; int mo[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; while(cin>>n>>

http://codeforces.com/problemset/problem/711/A#includeusing namespace std;int main(){ int n,m; while(cin>>n) { char a[1111][6]; int flag=1; for(int i=1;

http://codeforces.com/problemset/problem/711/B#includeusing namespace std; long long int a[555][555]; long long int b[555]; long long int c[555];int main(){

http://codeforces.com/problemset/problem/760/B#includeusing namespace std; long long int a[555][555]; long long int b[555]; long long int c[555];int main(){ int n,m,k;

http://codeforces.com/problemset/problem/333/A#includeusing namespace std;int main(){ long long int n; while(scanf("%I64d",&n)!=EOF) { long long int _3

http://codeforces.com/problemset/problem/332/A#includeusing namespace std;int main(){ long long int n; while(scanf("%I64d",&n)!=EOF) { char a[2222]; cin>>a; int l=strlen(a

http://codeforces.com/problemset/problem/864/D#includeusing namespace std;int num[222222];int vis[222222];int vs[222222];int ans[222222];int main(){ int n; whil

http://codeforces.com/problemset/problem/864/C#includeusing namespace std;int main(){ long long int a,b,f,k; while(cin>>a>>b>>f>>k) { bool dir=0; int bb=

http://codeforces.com/problemset/problem/862/A#include#includeusing namespace std;int main(){ int n,k; while(cin>>n>>k){ int a[1111]; int i,j; for(i=0;i<n;i++) cin>>

A. Text Volumetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a text of single-space separate

B. Flag of Berlandtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe flag of Berland is such rectangular f

http://codeforces.com/contest/841/problem/B一道奇偶博弈题，两个人轮流拿一串数列中的数字，第一个人能拿总和为奇数的数字，第二个人能拿总和为偶数的数字。如果对博弈很感兴趣的人一下就能发现，因为一个数只有减去（拿掉）奇数部分的时候，它本身的奇偶性才会发生变化，拿偶数则是不会发生变化的。那么第二个人想要赢就只有可能是先手的人第一步都走不下去的

http://codeforces.com/contest/841/problem/A给一串包含小写字母的字符串，每个字符代表不同颜色的气球，再给出一个人数，问能否把气球发完并保证不存在一个人拿2个相同颜色的气球。只要保证数量最多的那种颜色的气球不超过人数即可。#include#includeusing namespace std;int main(){ int

http://codeforces.com/problemset/problem/840/A题目意思的算最小期望，给出2行数，第二行代表的是期望计算的概率，只不过是分子部分（可以这么看）；然后计算第一行的数字乘以第二行数字的总和最小，将重新排序后的第一行数字输出。其实只要在输入的时候加入一个代表顺序的优先级变量来记录顺序就好了，然后就可以随心所欲的按要求对号入座了。

C. Star skytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Cartesian coordinate system is set in the s

B. The number on the boardtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSome natural number was written

http://codeforces.com/problemset/problem/847/M#include#include#includeusing namespace std;int main(){ int a[1111]; int n; while(scanf("%d",&n)!=EOF) { int i,j; for(i=

http://codeforces.com/problemset/problem/858/A#include #include #include #include #include using namespace std;int main(){ long long int n,k; while(cin>>

http://codeforces.com/problemset/problem/864/B#includeusing namespace std;int main(){ int n; char a[1111]; while(cin>>n) { cin>>a; int za=0; int lette

http://codeforces.com/problemset/problem/864/A#includeusing namespace std;int main(){ int n; while(cin>>n) { int a[1111]; int i; for(i=1;i<=n;i++) ci

http://codeforces.com/problemset/problem/855/A#includeusing namespace std;int main(){ int n; while(cin>>n) { int a[1111]; int i; for(i=1;i<=n;i++) cin>>a

http://codeforces.com/problemset/problem/863/C#include#includeusing namespace std;long long int an1=0,an2=0;void did(long long int x,long long int y){ if(x==1) { if(

http://codeforces.com/problemset/problem/863/A#include#include#include#includeusing namespace std;int main(){ char a[111]; while(cin>>a) { int l=strlen(a); in

http://codeforces.com/problemset/problem/847/G#include#include#includeusing namespace std;int main(){ char a[1111][8]; int n; while(scanf("%d",&n)!=EOF) { memset(a,0,si

http://codeforces.com/problemset/problem/863/B#include#include#include#includeusing namespace std;int main(){ int a; while(cin>>a) { int i,j; int b[1111]; for(i=0;i<2*a

http://codeforces.com/contest/1005id：threeh20A数1出现的个数，水题B从尾部遍历记录后缀一样部分的长度C用map记录哪些数字出现过，并且出现了几次。然后对于每一个数字，用2^0-2^32这32个数字去减，看剩下的数字在map中存不存在。要注意如果剩下的数字和本来这个数字一样，那么map的值应该&gt;1 才可以Ddp[i]记录前i个中能够分割出能被三整除...