codeforces 260 div2 B题
2014-08-09 07:57
323 查看
打表发现规律,对4取模为0的结果为4,否则为0,因此只需要判断输入的数据是不是被4整出即可,数据最大可能是100000位的整数,判断能否被4整出不能直接去判断,只需要判断最后两位(如果有)或一位能否被4整出即可。
#include<map> #include<cmath> #include<queue> #include<cstdio> #include<string> #include<vector> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int main(){ string str; cin >> str; int len = str.size(), num; if(len == 1){ num = str[0]-'0'; } else { num = (str[len-2]-'0')*10 + str[len-1]-'0'; } if(num % 4==0) printf("4\n"); else printf("0\n"); }
相关文章推荐
- codeforces 260 div2 A,B,C
- codeforces 260 div1
- 第九次codeforces竞技结束 #260 Div 2
- codeforces 260 div2 A,B,C
- codeforces 260 div2 B题
- codeforces 260 div2 virtual Participation
- codeforces 260 div2 B题
- codeforces 260 div2 C题
- codeforces 260 div2 C题
- codeforces 260 div2 C题
- Codeforces 285 div2 a
- CodeForces 506 Div.1 A. Mr. Kitayuta, the Treasure Hunter
- [DP] Codeforces 150D #107 (Div. 1) D. Mission Impassable
- codeforces 167 div 2
- codeforces 167 Div2 A
- 第八次codeforces竞技结束 #259 Div 2
- Codeforces Round #260 (Div. 2) A. Laptops
- codeforces 713C(Round #371 Div2 E) Sonya and Problem Wihtout a Legend Dp + 前缀 +离散化
- Codeforces 716B Complete the Word【模拟】 (Codeforces Round #372 (Div. 2))
- CodeForces 653 A. Bear and Three Balls——(IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2))