2013年06月_Wss0130

原创题目1490：字符串链接

http://ac.jobdu.com/problem.php?pid=1490#include#includechar s[2000];void MyStrcat(char *s1,char *s2){ int l1,l2,k,i; l1=strlen(s1); l2=strlen(s2); k=0; for(i=0;i

2013-06-07 17:37:28 412

原创题目1489：计算两个矩阵的乘积

http://ac.jobdu.com/problem.php?pid=1489 // 注意输出格式。。。不小心PE了一次。。。#include#includeint main(){ int i,j,a[5][5],b[5][5],c[5][5]; while(scanf("%d %d %d",&a[0][0],&a[0][1],&a[0][2])!=E

2013-06-07 17:28:38 893

原创题目1488：百万富翁问题

http://ac.jobdu.com/problem.php?pid=1488// 真心感觉题意不清晰。。。// 这里应该是按2的次方求和。。。#includeint main(){ long i,sum=0; for(i=0;i sum=2*sum+1; } printf("300 %

2013-06-07 17:04:41 973

原创题目1051：数字阶梯求和

http://ac.jobdu.com/problem.php?pid=1051#includeint main(){ int i,j,a,n,count; int c1[1000],c; while(scanf("%d %d",&a,&n)!=EOF){ c=0; for(i=0;i c1

2013-06-07 16:56:03 614

原创题目1053：互换最大最小数

http://ac.jobdu.com/problem.php?pid=1053#include#include#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main(){ int i,n,a[1000],b[1000];

2013-06-07 07:53:21 596

原创题目1065：输出梯形

http://ac.jobdu.com/problem.php?pid=1065#include#include#includeint main(){ int i,j,h; while(scanf("%d",&h)!=EOF){ for(j=1;j for(i=1;i for(i=2

2013-06-07 07:36:38 702

原创题目1066：字符串排序

http://ac.jobdu.com/problem.php?pid=1066#include#include#includeint cmp(const void *a,const void *b){ return *(char *)a - *(char *)b; }int main(){ char s[100]; while(s

2013-06-07 07:19:17 610

原创题目1068：球的半径和体积

http://ac.jobdu.com/problem.php?pid=1068#include#include#define IP acos(-1) // 注意反函数的使用int main(){ double x0,x1,y0,y1,z0,z1,R,V; while(scanf("%lf %lf %lf %lf %lf %lf",&

2013-06-07 00:25:40 509

原创题目1069：查找学生信息

http://ac.jobdu.com/problem.php?pid=1069#include#includestruct node{ char num[100]; char name[100]; char sex[10]; int age; }stu[1005];int main(){ int i,j,

2013-06-07 00:18:14 814

原创题目1057：众数

http://ac.jobdu.com/problem.php?pid=1057#include#include // 忘了写这句了，结果CE了3次。。。int num[20];int main(){ int i,flag,a,temp; while(scanf("%d",&a)!=EOF){

2013-06-07 00:05:59 746

原创题目1056：最大公约数

http://ac.jobdu.com/problem.php?pid=1056辗转相除法求最大公约数#includeint main(){ int m,n,t; while(scanf("%d %d",&m,&n)!=EOF){ while(n>0){ m=m%n; t=n;

2013-06-06 23:33:17 510

原创题目1055：数组逆置

http://ac.jobdu.com/problem.php?pid=1055#include#includeint main(){ char s[205]; int i; while(scanf("%s",s)!=EOF){ for(i=strlen(s)-1;i>=0;i--) printf("%c",s[i]);

2013-06-06 23:28:41 577

原创题目1050：完数

http://ac.jobdu.com/problem.php?pid=1050#includeint wanshu(int n){ int i,sum=0; for(i=1;i if(n%i==0) sum+=i; } if(sum==i) return 1; else return 0;

2013-06-06 23:12:50 619

原创题目1040：Prime Number

http://ac.jobdu.com/problem.php?pid=1040#include#includeint a[200005]; void initial(){ long int i; int j,count=2; a[1]=2; a[2]=3;

2013-06-06 22:59:45 513

原创题目1041：Simple Sorting

http://ac.jobdu.com/problem.php?pid=1041// 坑爹的一道题，不能用qsort( )或sort( )排序函数，必须自己写一个排序。。。 #includeint main(){ int i,j,t,n,a[1005]; while(scanf("%d",&n)!=EOF){ for(i=0;i

2013-06-06 22:31:01 592

原创题目1128：求平均年龄

http://ac.jobdu.com/problem.php?pid=1128#includeint main(){ int i,n,age[105],sum; while(scanf("%d",&n)!=EOF){ sum=0; for(i=0;i scanf("%d",&age[i]);

2013-06-05 00:32:19 694

原创题目1052：找x

http://ac.jobdu.com/problem.php?pid=1052#includeint main(){ int i,n,a[205],x; while(scanf("%d",&n)!=EOF){ for(i=0;i scanf("%d",&x); for(i=0;i

2013-06-05 00:26:36 612

原创题目1031：xxx定律

http://ac.jobdu.com/problem.php?pid=1031#includeint main(){ int n,count; while(scanf("%d",&n)!=EOF && n!=0){ count=0; while(n!=1){ if(n%2==0) n/=2;

2013-06-05 00:18:05 515

原创题目1196：成绩排序

http://ac.jobdu.com/problem.php?pid=1196#include#includestruct node{ int num; int score; }stu[105];int cmp(const void *a,const void *b){ struct node c = *(struct node *

2013-06-05 00:12:35 558

原创题目1177：查找

http://ac.jobdu.com/problem.php?pid=1177#include#includeint main(){ int i,j,n,start,len; char str[105],s[105],temp; while(scanf("%s",str)!=EOF){ scanf("%d",&n);

2013-06-04 23:46:13 518

原创题目1060：完数VS盈数

http://ac.jobdu.com/problem.php?pid=1060#include#includeint check(int x){ int i,sum=0; for(i=1;i if(x%i==0) sum+=i; } if(sum==i) return 0; //

2013-06-04 14:05:37 540

原创题目1059：abc

http://ac.jobdu.com/problem.php?pid=1059#include#includeint main(){ char i,j,k; int a,b; for(i='1';i for(j='1';j for(k='0';k a=(i-'0')*1

2013-06-04 13:47:39 434

原创题目1058：反序输出

http://ac.jobdu.com/problem.php?pid=1058#include#includeint main(){ int i; char s[5]; while(scanf("%s",s)!=EOF){ for(i=3;i>=0;i--) printf("%c",s[i]); printf(

2013-06-04 13:41:36 510

原创题目1170：找最小数

http://ac.jobdu.com/problem.php?pid=1170#include#includestruct node{ int x; int y; }m[1005];int cmp(const void *a, const void *b){ struct node c = *(struct node *)a;

2013-06-04 13:37:16 482

原创题目1169：比较奇偶数个数

http://ac.jobdu.com/problem.php?pid=1169#includeint main(){ int i,a,b1,b2,n; while(scanf("%d",&n)!=EOF){ b1=0;b2=0; for(i=0;i scanf("%d",&a);

2013-06-04 13:27:30 519

原创题目1175：打牌

http://ac.jobdu.com/problem.php?pid=1175明明是一道水题，却wa了15次。。。// AC#include#include#include int main(){ int la,lb,i,flag; char a[1010],b[1010]; int c[10]; while(scanf

2013-06-04 13:20:05 570

原创题目1174：查找第K小数

http://ac.jobdu.com/problem.php?pid=1174// AC#include#include#includeint cmp(const void *a,const void *b){ return *(int *)a - *(int *)b;}int main(){ int i,j,k,n,a[1000];

2013-06-04 00:04:10 842

原创题目1173：查找

http://ac.jobdu.com/problem.php?pid=1173#includeint main(){ int i,j,m,n; int a[1000],b[1000]; while(scanf("%d",&n)!=EOF){ for(i=0;i scanf("%d",&m); fo

2013-06-03 23:40:05 605

原创题目1097：取中值

http://ac.jobdu.com/problem.php?pid=1097#includeint aa[1000000],bb[1000000],cc[1000000];int main(){ int i,j,a,b,c,d,n,na,nb; while(scanf("%d",&n)!=EOF){ while(n--){

2013-06-03 23:30:42 515

原创题目1098：字母统计

http://ac.jobdu.com/problem.php?pid=1098#include#includeint main(){ int i,count[1000]; char c,s[1000]; while(scanf("%s",s)!=EOF){ memset(count,0,sizeof(count));

2013-06-03 23:15:15 473

原创题目1048：判断三角形类型

http://ac.jobdu.com/problem.php?pid=1048#include#includeint main(){ int a,b,c,A,B,C; while(scanf("%d %d %d",&a,&b,&c)!=EOF){ A=b*b+c*c-a*a; B=a*a+c*c-b*b;

2013-06-03 23:07:22 701

原创题目1047：素数判定

http://ac.jobdu.com/problem.php?pid=1047#include#includeint main(){ int i,n; while(scanf("%d",&n)!=EOF){ if(n else if(n==2){ printf("yes\n"); } else{

2013-06-03 22:56:00 503

原创题目1046：求最大值

http://ac.jobdu.com/problem.php?pid=1046#include#includeint cmp(const void *a,const void *b){ return *(int *)a - *(int *)b;}int main(){ int i,n[10]; while(scanf("%d",&n[

2013-06-03 22:49:10 475

原创题目1045：百鸡问题

http://ac.jobdu.com/problem.php?pid=1045#includeint main(){ int x,y,z,n; while(scanf("%d",&n)!=EOF){ for(x=0;x for(y=0;y for(z=0;z

2013-06-03 22:41:25 699

原创题目1049：字符串去特定字符

http://ac.jobdu.com/problem.php?pid=1049#include#includeint main(){ int i; char c,s[1000]; while(scanf("%s",s)!=EOF){ getchar(); scanf("%c",&c); for(i

2013-06-03 22:20:20 497

恋&空的专栏