摘要：
Codeforces Round 379 (Div. 2) A. Anton and Danik 题意： 输入一个长度为n(n include const int maxn = 1e5 + 3; char arr[maxn]; int n; int main() { //freopen("input 阅读全文
摘要：
Codeforces Round 383 (Div. 2) A. Arpa’s hard exam and Mehrdad’s naive cheat 题意： 求1378^n的末位数字(0 include int main() { //freopen("input.txt", "r", stdin) 阅读全文
摘要：
Codeforces Round 382 (Div. 2) A. Ostap and Grasshopper 题意： 给出一个字符串（n include const int maxn = 100 + 3; int n, k; char arr[maxn]; int main() { //freope 阅读全文