1、http://acm.hdu.edu.cn/showproblem.php?pid=2113
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7369 Accepted Submission(s): 3124
415326 3262
12 10
AC代码:
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { int n,flag=0; while(scanf("%d",&n)!=EOF) { int k,sum=0; while(n) { int k=n%10; if(k%2==0) sum+=k; n/=10; } if(flag==0) { printf("%d\n",sum); flag=1; } else { printf("\n"); printf("%d\n",sum); } } return 0; }
2、http://acm.hdu.edu.cn/showproblem.php?pid=2115
题目:
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5247 Accepted Submission(s): 1810
10 Iverson 17:19 Bryant 07:03 Nash 09:33 Wade 07:03 Davies 11:13 Carter 14:28 Jordan 29:34 James 20:48 Parker 24:49 Kidd 26:46 0
Case #1 Bryant 1 Wade 1 Nash 3 Davies 4 Carter 5 Iverson 6 James 7 Parker 8 Kidd 9 Jordan 10
Ac代码:
#include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; #define N 15 struct node { string name; int h; int m; int r; }a[N]; int cmp(node b,node c) { if(b.h==c.h && b.m==c.m) return b.name<c.name; if(b.h==c.h) return b.m<c.m; return b.h<c.h; } int main() { int n,cas=0; char ch; while(scanf("%d",&n)!=EOF) { if(n==0) break; cas++; if(cas!=1) { printf("\n"); } for(int i=1;i<=n;i++) { cin>>a[i].name>>a[i].h>>ch>>a[i].m; //scanf("%s%d:%d",a[i].name,&a[i].h,&a[i].m); } sort(a+1,a+n+1,cmp); printf("Case #%d\n",cas); //printf("%s 1\n",a[1].name); cout<<a[1].name<<" "<<1<<endl; // a[1].r=1; int m=1; for(int i=2;i<=n;i++) { if(a[i].h==a[i-1].h && a[i].m==a[i-1].m) { //printf("%s %d\n",a[i].name,a[i-1].r); cout<<a[i].name<<" "<<m<<endl; //a[i].r=a[i-1].r; } else { //printf("s %d\n",a[i].name,i); cout<<a[i].name<<" "<<i<<endl; m=i; } } } return 0; } /* 5 ab 00:00 a 01:00 b 01:00 abc 01:10 aa 01:10 */
3、http://acm.hdu.edu.cn/showproblem.php?pid=2117
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2072 Accepted Submission(s): 968
4 2 5 7 123 123
5 0 8
Ac代码:
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int k=1,j=0,sum=1; for(int i=1;i<=m+1;i++) { k=sum/n; j=sum%n; sum=j*10; } printf("%d\n",k); } return 0; }