HDU ACM 11 2015 偶数求和

来源:互联网 发布:英文原版书籍淘宝店 编辑:程序博客网 时间:2024/06/05 17:49
#include <iostream>using namespace std;int main(){    int n, m, i, j = 0, s = 0, sum = 0, average;    while (cin >> n >> m && n <= 100)    {        for (i = 0; i < n; i++)        {            s += 2;            sum += s;            j++;            if (j == m && i < n - 1)            {average = sum/m;printf("%d ", average);j = 0;                sum = 0;            }else if (j == m && i == n - 1){average = sum/m;printf("%d", average);j = 0;sum = 0;}        }        if (n%m == 0)        {printf("%\n");            s = 0;        }        if (j < m && i > (n/m*m))            {                average = sum/(n%m);printf("%d\n", average);                j = 0;                sum = 0;                s = 0;            }    }    return 0;}

0 0
原创粉丝点击