摘要:
阅读全文
摘要:
Codeforces Round #721 (Div. 2) A - And Then There Were K 打表找规律 int main() { IOS; VI a(1); while (a.back() < 1e9) { ll cur = a.back() * 2 + 1; if (cur 阅读全文
摘要:
AtCoder Regular Contest 118 A - Tax Included Price int main() { IOS; ll k, c; cin >> n >> k; c = (100 * k - 1) / n + 1; cout << (n + 100) * c / 100 - 阅读全文
摘要:
牛客练习赛82 A - Mocha 的字符串 int a[N], c, ans = 2e9; char s[N], t[] = "mocha"; bool check(int x) { rep (i, 0, 4) if (s[i + x] ^ t[i]) return 0; return 1; } 阅读全文
摘要:
KYOCERA Programming Contest 2021(AtCoder Beginner Contest 200) A - Century int main() { IOS; cin >> n; n = n / 100 + (n % 100 != 0); cout << n; return 阅读全文
摘要:
阅读全文
摘要:
阅读全文
摘要:
阅读全文