CodeForces
蔗蓝
OIer
展开
-
Codeforces Round #734 (Div. 3)
A. Polycarp and Coin#include <iostream>using namespace std;int main() { int t, n; cin >> t; while (t--) { cin >> n; switch (n % 3) { case 0: cout << n / 3 << ' ' << n /原创 2021-07-24 00:45:07 · 228 阅读 · 0 评论 -
CodeForces - Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2)
A. Digits Sum找规律题,没想到看样例直接蒙对……#include <iostream>using namespace std;int main() { int t, n; cin >> t; while (t--) { cin >> n; cout << (n + 1) / 10 << endl; } return 0;}B. Reverse Stri原创 2021-07-23 01:18:48 · 304 阅读 · 0 评论