偶数求和

 1 #include <stdio.h>
 2 
 3 int main(){
 4     int sequence[101];
 5     int i;
 6     int j;
 7     int n;
 8     int m;
 9     int result;
10     int remainder;
11     int flag;
12     
13     for(i=0;i<101;i++)
14         sequence[i]=(i+1)*2;
15         
16     while((scanf("%d%d",&n,&m))!=EOF){
17         result=0;
18         j=1;
19         flag=0;
20         
21         remainder=n%m;
22         
23         for(i=0;i<=n;i++){
24             if(j<=m){
25                 result+=sequence[i];
26             }
27             
28             else{
29                 if(flag==0)
30                     printf("%d",result/m);
31                     
32                 else
33                     printf(" %d",result/m);
34                     
35                 flag=1;
36                 j=1;
37                 result=sequence[i];
38             }    
39             j++;
40         }
41         
42         if(remainder){
43             printf(" %d",(result-sequence[n])/remainder);
44         }
45         
46         printf("\n");
47     }
48         
49         
50             
51     
52     return 0;
53 }