题目链接
https://www.patest.cn/contests/gplt/L1-008
AC代码
#include <iostream> #include <cstdio> #include <algorithm> #include <cmath> #include <deque> #include <vector> #include <queue> #include <string> #include <cstring> #include <map> #include <stack> #include <set> #include <cstdlib> #include <ctype.h> #include <numeric> #include <sstream> using namespace std; typedef long long LL; const double PI = 3.14159265358979323846264338327; const double E = 2.718281828459; const double eps = 1e-6; const int MAXN = 0x3f3f3f3f; const int MINN = 0xc0c0c0c0; const int maxn = 1e5 + 5; const int MOD = 1e9 + 7; int main() { int a, b; cin >> a >> b; int sum = 0; int vis; for (vis = 1; a <= b; a++, vis++) { printf("]", a); sum += a; if (vis % 5 == 0) cout << endl; } if ((vis - 1) % 5 != 0) cout << endl; printf("Sum = %d\n", sum); }转载于:https://www.cnblogs.com/Dup4/p/9433347.html
