c语言 - 随笔分类 - 海暗

2009 c语言补考第二题

摘要：#include<stdio.h>#include<string.h>char c[334][1000],ttt=0;int read(char b[],char a[],int a1,int a2){ int i=0; for(;a1<=a2;a1++) b[i++]=a[a1]; b[i]='\0'; return 0;}int compare(char b[],char a[],int a1,int a2){ int i=0; while(a[a1]==b[i]&&a1<=a2){i++,a1++;} if(a1==a2 阅读全文

posted @ 2013-03-03 15:42 海暗阅读(187) 评论(0) 推荐(0)

Dima and Friends

摘要：#include<stdio.h>int main(){ int a,i,j=0,n,t=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&a); t+=a; } for(i=1;i<=5;i++) { if((t+i)%(n+1)!=1) j++; } printf("%d",j); return 0;}http://codeforces.com/contest/272/problem/A 阅读全文

posted @ 2013-02-24 16:49 海暗阅读(146) 评论(0) 推荐(0)

津津的储蓄计划

摘要：#include<stdio.h>int main(){ int i,j=0,k,t=0; for(i=1;i<=12;i++) { t+=300; scanf("%d",&k); if(k>t) { printf("%d",-i); return 0; } else while(k<=t-100) { t-=100; j+=100; ... 阅读全文

posted @ 2013-02-24 16:43 海暗阅读(1881) 评论(0) 推荐(0)

Lights Out

摘要：#include<stdio.h>int main(){ int j,k,t,a[5][5]={0},i; for(i=1;i<=3;i++) for(j=1;j<=3;j++) { scanf("%d",&a[i][j]); } for(i=1;i<=3;i++) { for(j=1;j<=3;j++) { k=(a[i][j]+a[i-1][j]+a[i+1][j]+a[i][j-1]+a[i][j+1])%2; ... 阅读全文

posted @ 2013-02-24 16:10 海暗阅读(150) 评论(0) 推荐(0)

Easy Number Challenge

摘要：#include<iostream>#include <cstdlib> #include<cmath>using namespace std;int aaa[1000001]={0};int d(int k){ int i,t=0; if(aaa[k]!=0)return aaa[k]; else for(i=1;i<=(int)sqrt((float) k);i++) { if(k%i==0) t+=2; if(i*i==k)t--; } return aa... 阅读全文

posted @ 2013-02-17 16:13 海暗阅读(201) 评论(0) 推荐(0)

Free Cash

摘要：#include<iostream>#include <cstdlib> using namespace std;int main(){ int a,b,t=1,t1=1,i,a1=0,b1=0,n; cin>>n; for(i=1;i<=n;i++) { cin>>a>>b; if(a==a1&&b==b1)t1++; else { a1=a,b1=b; if(t<t1)t=t1; t1=1; } } if(t<t1)t=... 阅读全文

posted @ 2013-02-17 16:12 海暗阅读(225) 评论(0) 推荐(0)

采药

摘要：#include<iostream>using namespace std;int main(){ int a[1001]={0},i,j,n,T,M,k,t,b1,b2; cin>>T>>M; for(i=1;i<=M;i++) { cin>>b1>>b2; for(j=T;j>0;j--) { if(j>=b1) a[j]= a[j]>a[j-b1]+b2?a[j]:a[j-b1]+b2; else break; } } co... 阅读全文

posted @ 2013-02-17 14:41 海暗阅读(114) 评论(0) 推荐(0)

BIF树

摘要：#include<stdio.h>int a[1025];int pandin(int i,int j){ int t,t1,t2; if(i==j) { switch(a[i]) { case 1:printf("I");return 1; case 0:printf("B");return 0; } } t=pandin(i,(i+j-1)/2)+pandin((i+j+1)/2,j); if(t==0){printf("B");return 0;} if(t==1||t>=3)... 阅读全文

posted @ 2013-02-08 20:53 海暗阅读(173) 评论(0) 推荐(0)

A. Points on Line

摘要：#include<stdio.h>int main(){ int i,j,n,k,p; __int64 t=0,t1=0,a[100001]={1}; scanf("%d %d",&n,&p); scanf("%I64d",&a[1]); for(i=2;i<=n;i++) { scanf("%I64d",&a[i]); while((a[i]-a[a[0]])>p)a[0]++; t+=((i-a[0])*(i-a[0]-1))/2; } printf("%I64d& 阅读全文

posted @ 2013-02-08 20:52 海暗阅读(150) 评论(0) 推荐(0)

Games

摘要：#include<iostream>int main(){ using namespace std; int j,i,t=0,n,a[50],b[50]; cin>>n; for(i=1;i<=n;i++)cin>>a[i]>>b[i]; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(a[i]==b[j]&&i!=j)t++; } } cout<<t; return 0;}http://codeforces.com/contest/268... 阅读全文

posted @ 2013-02-08 20:50 海暗阅读(181) 评论(0) 推荐(0)

金明的预算方案

摘要：#include<iostream>using namespace std;int v1,p,q,i,j,n,m,k,v[61][3]={},w[61][3]={},f[61][32001];int main(){ cin>>n>>m; for(i=1;i<=m;i++) { cin>>v1>>p>>q; if(q==0){v[i][0]=v1,w[i][0]=v1*p;} else if(v[q][1]==0){v[q][1]=v1,w[q][1]=v1*p;} else {v[q][2]=v1,w[q][2]=v 阅读全文

posted @ 2013-02-08 20:49 海暗阅读(219) 评论(0) 推荐(0)

Magical Boxes

摘要：#include<stdio.h>int main(){ int n,i,j,b1,t=0,a,b; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d %d",&a,&b); b1=1; for(j=0;b1<b;b1*=4,j++); j+=a; if(j>t)t=j; if(a+1>t)t=a+1; } printf("%d",t); return 0;}input11 12input11 42http://codeforc... 阅读全文

posted @ 2013-02-02 01:39 海暗阅读(174) 评论(0) 推荐(0)

B.Multithreading

摘要：#include<stdio.h>#include<math.h>int a[100001]={0};int main(){ int n,i,j,m,k,t=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&a[i]); } for(i=n;i>=1;i--) { if(a[i]>a[i-1])t++; else { printf("%d",n-t-1); return 0; } ... 阅读全文

posted @ 2013-02-02 01:37 海暗阅读(129) 评论(0) 推荐(0)

A.Fancy Fence

摘要：#include<stdio.h>#include<math.h>int main(){ int n,i,m,j,flag=0,a,b,t; scanf("%d",&n); for(i=1;i<=n;i++) { flag=0; scanf("%d",&a); for(j=3;j<=360;j++) { t=(j-2)*180; if(t%j==0)t=t/j; else continue; if(t==a){flag=1;br... 阅读全文

posted @ 2013-02-02 01:36 海暗阅读(248) 评论(0) 推荐(0)

Queue at the School

摘要：#include<stdio.h>#include<string.h>int main(){ char a[51]; int m,n,t,i,j; scanf("%d %d",&n,&t); scanf("%s",a); for(j=1;j<=t;j++) for(i=0;i<n-1;i++) { if(a[i]=='B'&&a[i+1]=='G'&&i+1<n) { m=a[i]; a[i]=a[i+1]; a[i+1]=m; i+ 阅读全文

posted @ 2013-01-23 12:22 海暗阅读(242) 评论(0) 推荐(0)

Below the Diagonal

摘要：#include<stdio.h>int main(){ int b[3001][3],n,m,i,j,t=0,a[1001][2]; scanf("%d",&n); for(i=1;i<n;i++) { scanf("%d %d",&a[i][0],&a[i][1]); } for(i=1,t=1;i<n;i++) { if(a[i][0]!=i+1) { for(j=i+1;j<n;j++)if(a[j][0]==a[i][0])a[j][0]=i+1; else... 阅读全文

posted @ 2013-01-23 12:22 海暗阅读(211) 评论(0) 推荐(0)

Stones on the Table

摘要：#include<stdio.h>#include<string.h>int main(){ char a[51]; int i,t=0,n; scanf("%d",&n); scanf("%s",a); for(i=0;i<n-1;i++) { if(a[i]==a[i+1]) t++; } printf("%d",t); return 0;}#include<stdio.h>#include<string.h>int main(){ char a[51]; int i, 阅读全文

posted @ 2013-01-23 12:21 海暗阅读(181) 评论(0) 推荐(0)

Escape from Stones

摘要：#include<stdio.h>#include<string.h>int main(){ char b[1000001]; int a[1000001],i,t=0,n,k; scanf("%s",b); n=strlen(b); for(i=0;i<n;i++) { if(b[i]=='l'){a[t]=i+1;t++;} else printf("%d\n",i+1); } t--; for(;t>=0;t--)printf("%d\n",a[t]); return 0;}h 阅读全文

posted @ 2013-01-21 00:25 海暗阅读(187) 评论(0) 推荐(0)

Roadside Trees

摘要：#include<stdio.h>#include<string.h>int main(){ int a,i,n,m,k,t=0,b=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&a); if(i==1)t=a; else { if(a>=b)t+=a-b+1; else t+=b-a+1; } b=a; } printf("%d",t+n); retu... 阅读全文

posted @ 2013-01-21 00:24 海暗阅读(143) 评论(0) 推荐(0)

Colorful Stones

摘要：#include<stdio.h>#include<string.h>int main(){ char a[51],b[51]; int i,n,t=1; scanf("%s %s",a,b); n=strlen(b); for(i=0;i<n;i++) { if(a[t-1]==b[i])t++; } printf("%d",t); return 0;}http://codeforces.com/contest/265/problem/A 阅读全文

posted @ 2013-01-21 00:23 海暗阅读(193) 评论(0) 推荐(0)

随笔分类 - c语言