随笔分类 -  codeforces

codeforces 257c
摘要：#includeint main() { __int64 n,m,k,i,j,a,b; while(scanf("%I64d%I64d%I64d",&n,&m,&k)!=EOF) { if(n+m-2n) { a=n; b=k+2-n; } i=(n/a)*(m... 阅读全文
posted @ 2014-07-20 10:38 HYDhyd 阅读(207) 评论(0) 推荐(0)
codeforces 257B
摘要：#include#define mod 1000000007int 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; i... 阅读全文
posted @ 2014-07-20 10:34 HYDhyd 阅读(203) 评论(0) 推荐(0)
codeforces 371c
摘要：#includeint 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("%... 阅读全文
posted @ 2013-12-09 19:24 HYDhyd 阅读(140) 评论(0) 推荐(0)
codeforces 371D
摘要：#include#define N 210000struct 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[... 阅读全文
posted @ 2013-12-09 19:18 HYDhyd 阅读(150) 评论(0) 推荐(0)
codeforces 371B - Fox Dividing Cheese
摘要：#includeint 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) {cou... 阅读全文
posted @ 2013-12-08 23:24 HYDhyd 阅读(154) 评论(0) 推荐(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)... 阅读全文
posted @ 2013-12-01 15:34 HYDhyd 阅读(125) 评论(0) 推荐(0)
codeforces 361A
摘要：//这题看着吓人，为何这么水#includeint main() {int n,m,i,j;while(scanf("%d%d",&n,&m)!=EOF) {for(i=1;i<=n;i++) {for(j=1;j<=n;j++) {if(j==n) {if(i==j)printf("%d",m);... 阅读全文
posted @ 2013-11-22 15:27 HYDhyd 阅读(133) 评论(0) 推荐(0)
codeforces 359A
摘要：#include#define N 60int map[N][N];int main() {int n,m,i,j,flag;while(scanf("%d%d",&n,&m)!=EOF) {flag=0;for(i=1;i<=n;i++)for(j=1;j<=m;j++) {scanf("%d",... 阅读全文
posted @ 2013-11-21 11:59 HYDhyd 阅读(125) 评论(0) 推荐(0)
codeforces 361B
摘要：#includeint 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<=k+1;i++)a[i]=i;for(i=k+3;i<... 阅读全文
posted @ 2013-11-20 21:43 HYDhyd 阅读(133) 评论(0) 推荐(0)
codeforces 362A找规律
摘要：刚开始以为是搜索白忙活了原来是个简单的找规律，以后要多想啊此题是两马同时跳A. Two Semiknights Meettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstan... 阅读全文
posted @ 2013-11-20 21:08 HYDhyd 阅读(151) 评论(0) 推荐(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... 阅读全文
posted @ 2013-11-20 20:04 HYDhyd 阅读(113) 评论(0) 推荐(0)
codeforces 363B
摘要：#include#include#define inf 999999999#define N 151000int a[N],c[N];int main() {int n,k,i,j,min,p,t;while(scanf("%d%d",&n,&k)!=EOF) {min=inf;memset(c,0... 阅读全文
posted @ 2013-11-20 11:17 HYDhyd 阅读(151) 评论(0) 推荐(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"... 阅读全文
posted @ 2013-11-20 10:42 HYDhyd 阅读(109) 评论(0) 推荐(0)
codeforces365B
摘要：#includeint main() {int a,b,c,n,sum,max,i;while(scanf("%d",&n)!=EOF) {if(nmax)max=sum;sum=2;}}if(sum>max)max=sum;printf("%d\n",max);}return 0;} 阅读全文
posted @ 2013-11-20 10:32 HYDhyd 阅读(117) 评论(0) 推荐(0)