HDU 2015 偶数求和

xiaoxiao2025-04-07  22

关键在于判断一下每次求平均的结束点

#include <stdio.h> void main() { //先构建数列 int a[100]; for(int i=0;i < 100;i++) a[i]=(i+1)*2; int n,m; while(scanf("%d %d",&n,&m) != EOF) { int cnt = 0; int sum = 0; bool bFirst = true; for(int i=0;i < n;i++) { sum+=a[i]; cnt++; if(cnt == m || i+1 == n) { if(bFirst) { printf("%d",sum/cnt); bFirst = false; } else printf(" %d",sum/cnt); cnt = 0; sum = 0; } } printf("\n"); } }

 

转载请注明原文地址: https://www.6miu.com/read-5027685.html

最新回复(0)