codeforces
秋天的风--
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
展开
-
codeforces 359A
#include #define N 60 int map[N][N]; int main() { int n,m,i,j,flag; while(scanf("%d%d",&n,&m)!=EOF) { flag=0; for(i=1;i for(j=1;j scanf("%d",&map[i][j]); if(map[i][j]&&(i==1原创 2013-11-21 11:59:41 · 857 阅读 · 0 评论 -
codeforces 257B
#include #define mod 1000000007 int main() { __int64 n,m,i,j,k,x,y,z; while(scanf("%I64d%I64d%I64d",&x,&y,&n)!=EOF) { z=y-x; i=n%3; j=n/3; if(i==0) { i=3; j--; }原创 2014-07-20 10:34:16 · 514 阅读 · 0 评论 -
codeforces 371D
#include #define N 210000 struct node { int x,next; __int64 count,vec; }pre[N]; int n,flag; int find(int x) { if(x==n+1) return n+1; if(pre[x].count>pre[x].vec) { int h=pre[x].next; pr原创 2013-12-09 19:18:08 · 735 阅读 · 0 评论 -
codeforces 371c
#include int main() { char s[200]; __int64 r,nb,ns,nc,pb,ps,pc,i,sum,tob,tos,toc; while(scanf("%s",s)!=EOF) { scanf("%I64d%I64d%I64d",&nb,&ns,&nc); scanf("%I64d%I64d%I64d",&pb,&ps,&pc); scanf(原创 2013-12-09 19:24:48 · 798 阅读 · 0 评论 -
codeforces 371B - Fox Dividing Cheese
#include int count; int gcd(int a,int b) { if(b==0) return a; return gcd(b,a%b); } int seach(int a) { if(a%2==0) { count++; return seach(a/2); } if(a%3==0) { count++; return seach(a/原创 2013-12-08 23:24:47 · 694 阅读 · 0 评论 -
codeforces 369B
#include//题没读懂,没做出来 int main() { int n,k,l,r,s,s1,m,a,i; while(scanf("%d%d%d%d%d%d",&n,&k,&l,&r,&s,&s1)!=EOF) { m=s1/k; a=s1-m*k; if(a==0) { printf("%d",m); for(i=2;i printf(" %d",m); }原创 2013-12-01 15:34:56 · 506 阅读 · 0 评论 -
codeforces 361A
//这题看着吓人,为何这么水 #include int main() { int n,m,i,j; while(scanf("%d%d",&n,&m)!=EOF) { for(i=1;i for(j=1;j if(j==n) { if(i==j) printf("%d",m); else printf("0"原创 2013-11-22 15:27:36 · 1222 阅读 · 0 评论 -
codeforces365B
#include int main() { int a,b,c,n,sum,max,i; while(scanf("%d",&n)!=EOF) { if(n scanf("%d",&a); printf("1\n"); continue; } scanf("%d%d",&a,&b); sum=2;max=2; for(i=3;i scanf("%d",&c); if(c=原创 2013-11-20 10:32:36 · 768 阅读 · 0 评论 -
codeforces365A
#include #include//刚做codeforces上的比赛题我都没看懂啊啊啊啊啊啊 int main() { int n,m,i,k,visit[110],total; while(scanf("%d%d",&n,&m)!=EOF) { total=0; while(n--) { scanf("%d",&k); memset(visit,0,sizeof(visit))原创 2013-11-20 10:42:25 · 811 阅读 · 0 评论 -
codeforces 363B
#include #include #define inf 999999999 #define N 151000 int a[N],b[N],c[N]; int main() { int n,k,i,j,min,p; while(scanf("%d%d",&n,&k)!=EOF) { for(i=1;i b[i]=inf; memset(c,0,sizeof(c)); for原创 2013-11-20 11:17:36 · 903 阅读 · 0 评论 -
codeforces 363A
#include//这题挺有意思小学学的算盘 int main() { int n,i,m; while(scanf("%d",&n)!=EOF) { if(n==0) { printf("O-|-OOOO\n"); continue; } while(n) { m=n%10; if(m>=5) { printf("-O|"); m-=5; } else printf原创 2013-11-20 20:04:30 · 767 阅读 · 0 评论 -
codeforces 362A找规律
刚开始以为是搜索白忙活了原来是个简单的找规律,以后要多想啊 http://blog.csdn.net/firwaless/article/details/16342823 #include #include int main() { int m,i,j,t,startx,starty,endx,endy; char s[10][10]; scanf("%d",&t); while(转载 2013-11-20 21:08:30 · 917 阅读 · 0 评论 -
codeforces 361B
#include int a[100100]; int main() { int n,i,k; while(scanf("%d%d",&n,&k)!=EOF) { if(k==n) { printf("-1\n"); continue; } for(i=2;i a[i]=i; for(i=k+3;i a[i]=i-1; a[i-1]=i; } if(i-1==n) {原创 2013-11-20 21:43:29 · 801 阅读 · 0 评论 -
codeforces 257c
#include int main() { __int64 n,m,k,i,j,a,b; while(scanf("%I64d%I64d%I64d",&n,&m,&k)!=EOF) { if(n+m-2<k) { printf("-1\n"); continue; } a=k+1; b=1; if(k+1>n) {原创 2014-07-20 10:38:17 · 759 阅读 · 0 评论