普通网友-CSDN博客

原创 zoj 1168

#includeint v[21][21][21]={0};int w(int a, int b, int c){ if(a <= 0 || b <=0 || c <= 0) { return 1; } if(a > 20

2011-08-21 09:28:04 629

原创 zoj 1152 A Mathematical Curiosity

//简单题，注意输出格式、#include#includeint main(){ int num,m,n,i,j,k,count; scanf("%d",&num); while(num--) { k=1; whi

2011-08-23 16:58:33 471

原创 zoj 1489 2^x mod n = 1

#includeint main(){ int flag=0,a,i,n; while(scanf("%d",&n)!=EOF) { flag=0; if(n%2==1) { a=1;

2011-08-23 10:24:12 425

原创 hdu 3953

I'll play a trick on youTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 471 A

2011-08-21 08:51:54 814

原创 zoj 2892

昨天看到这道题没思路，今天又令我纠结了半天的问题啊！！！开始还理解错了，有木有！！下面是代码：#include#includeint s[9][130],d[9][130],b[260];//s存储和，d存储差 int power(int n)//求2的n次方的函数

2011-08-19 15:55:22 480

原创 zoj 1045

简单题#includeint main(){ double l,sum=0; int i=2; while(scanf("%lf",&l)!=EOF) { if(l==0.00) return 0;

2011-08-19 09:35:59 420

原创 zoj 1037

找规律#includeint main(){ int m,n,i,t; while(scanf("%d",&t)!=EOF) { for(i=0;i<t;i++) { scanf("%d%d",&n,&m);

2011-08-19 09:32:18 317

原创 zoj 2947

你懂的、、、#include#includechar a[60],b[60],c[6],d[6];int main(){ int num,i,j,k,m,n; scanf("%d",&num); while(num--) {

2011-08-18 17:49:17 297

原创 zoj 2883

ALL WATER专刷水题#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int a[20001];int main(){ int num,

2011-08-18 16:02:04 475

原创 zoj 2878

WATER WATER#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main(){ int i,num,n,a[101],dis;

2011-08-18 14:48:07 362

原创 zoj 2857

水题、、、源码：#includeint r[101][101],g[101][101],b[101][101],aver[101][101];int main(){ int m,n,i,j,k=0; while(scanf("%d%d",&m,&n)

2011-08-18 10:57:32 379

原创 zoj 3498 javabeans

水题啊、、、#includeint main(){ int num; unsigned long ds,count,temp; while(scanf("%d",&num)!=EOF) { while

2011-08-18 09:35:45 505

原创 zoj 3019

开始没看懂题啊、、、、晕、#includeint a[10010],b[10010];int cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main(){ int i,j

2011-08-17 11:21:29 338

原创 zoj 2781

水题，不解释#includeint main(){ unsigned long x,y; int i,j,k,num,t; int a[10]; scanf("%d",&num); for(i=0;i<num;i++) {

2011-08-14 11:24:31 321

转载【转自百度百科】最小生成树prim算法

#include #include #include#define maxint 1073741824int main(){ FILE *input=fopen("input.txt","r"),*out=fopen("output.txt","w"); int

2011-08-14 11:05:29 425

原创 zoj 3468

Dice WarTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeDice war is a board game. In each turn, the attacker wil

2011-08-13 15:44:41 427 2

原创能写博客了，O(∩_∩)O哈哈~

RT能写博客了，O(∩_∩)O哈哈~

2011-08-07 09:07:28 274