Time Limit: 2000/1000 MS
(Java/Others) Memory Limit: 65536/32768 K
(Java/Others)
Total Submission(s): 68932 Accepted
Submission(s): 26152
1 #include<stdio.h> 2 3 int month[] = {31,28,31,30,31,30,31,31,30,31,30,31}; 4 int is_leap(int m) 5 { 6 return (m%400==0 || (m%4==0&&m%100!=0)); 7 } 8 int count(int y, int m) 9 { 10 int i, day = 0; 11 for(i = 0; i < m; i++) 12 day +=month[i]; 13 if(m > 1) 14 day += is_leap(y); 15 return day; 16 } 17 int main() 18 { 19 int y, m, d, day; 20 while(scanf("%d/%d/%d", &y, &m, &d)== 3) 21 { 22 day = d+count(y,m-1); 23 printf("%d\n", day); 24 } 25 return 0; 26 }
原文:http://www.cnblogs.com/la0bei/p/3649443.html