codeforces
RedPolya
这个作者很懒,什么都没留下…
展开
-
Codeforces Round 383
A Arpa’s hard exam and Mehrdad’s naive cheat求1378n1378^n个位是几。找规律。。。。#include <cstdio> #include <cstring> const int d[]={6,8,4,2}; int main(){ int n; while(~scanf("%d",&n)){ if(n==0)pri原创 2016-12-07 13:34:15 · 654 阅读 · 0 评论 -
Codeforces Round #404 (Div. 2)
A.Anton and Polyhedrons告诉你N个英文单词 每个英文单词代表X面体,统计总共多少面。#include <cstdio> #include <string> #include <map> #include <iostream> using namespace std;map<string,int> mp;int main(){ mp.clear(); mp["T原创 2017-03-16 20:59:19 · 517 阅读 · 0 评论 -
Codeforces Round #419 (Div. 2)
A过几分钟回文。#include <cstdio> #include <cstring> #include <iostream>using namespace std;bool check(int hour,int min){ int t1=hour/10; int t2=hour%10; int t3=min/10; int t4=min%10; if(t1原创 2017-06-18 17:36:38 · 398 阅读 · 0 评论