742 A - Arpa’s hard exam and Mehrdad’s naive cheat codeforces
2016-12-27 22:13
513 查看
#include<bits/stdc++.h> using namespace std; int main() { int n,num[10]; cin>>n; num[1]=8;num[2]=4;num[3]=2;num[4]=6; if(n==0) { cout<<1<<endl; } else { n%=4; if(n==0) { cout<<num[4]<<endl; } else { cout<<num <<endl; } } return 0; }
相关文章推荐
- Codeforces Round #383 (Div. 2) A.Arpa’s hard exam and Mehrdad’s naive cheat【循环节/快速幂】
- Codeforces Round #383 (Div. 2) A. Arpa’s hard exam and Mehrdad’s naive cheat(快速幂水题)
- Codeforces Round #383 (Div. 2) 742A Arpa’s hard exam and Mehrdad’s naive cheat
- A. Arpa’s hard exam and Mehrdad’s naive cheat
- Arpa’s hard exam and Mehrdad’s naive cheat
- B - Arpa’s hard exam and Mehrdad’s naive cheat vj
- Codeforces 742A-Arpa’s hard exam and Mehrdad’s naive cheat(快速幂)
- 【codeforces 742A】Arpa’s hard exam and Mehrdad’s naive cheat
- Codeforces Round #383 (Div. 2) A. Arpa’s hard exam and Mehrdad’s naive cheat(水题)
- Codeforces Round #383 (Div. 2)-A. Arpa’s hard exam and Mehrdad’s naive cheat
- Arpa's weak amphitheater and Mehrdad's valuable Hoses CodeForces - 742D (分组背包)
- 742 C. Arpa's loud Owf and Mehrdad's evil plan codeforces
- 742 B - Arpa’s obvious problem and Mehrdad’s terrible solution codeforces
- CodeForces 742A Arpa’s hard exam and Mehrdad’s naive cheat
- Codeforces Round #383 (Div. 2)C. Arpa's loud Owf and Mehrdad's evil plan(dfs&lcm)
- Codeforces Round #383 (Div. 2) B. Arpa’s obvious problem and Mehrdad’s terrible solution
- Arpa’s obvious problem and Mehrdad’s terrible solution CodeForces - 742B (异或)
- Codeforces C. Arpa’s overnight party and Mehrdad’s silent entering
- codeforce 742 E. Arpa’s overnight party and Mehrdad’s silent entering (分食物||二分图染色+dfs)
- Codeforces Round #383 (Div. 2)-C. Arpa's loud Owf and Mehrdad's evil plan