CF 628B. New Skateboard
来源:互联网 发布:淘宝网开网店 编辑:程序博客网 时间:2024/06/05 08:02
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and started to press the keys randomly. Unfortunately Max has forgotten the number which he had calculated. The only thing he knows is that the number is divisible by 4.
You are given a string s consisting of digits (the number on the display of the calculator after Yusuf randomly pressed the keys). Your task is to find the number of substrings which are divisible by 4. A substring can start with a zero.
A substring of a string is a nonempty sequence of consecutive characters.
For example if string s is 124 then we have four substrings that are divisible by 4: 12, 4, 24 and 124. For the string 04 the answer is three: 0, 4, 04.
As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use gets/scanf/printf instead of getline/cin/cout in C++, prefer to useBufferedReader/PrintWriter instead of Scanner/System.out in Java.
The only line contains string s (1 ≤ |s| ≤ 3·105). The string s contains only digits from 0 to 9.
Print integer a — the number of substrings of the string s that are divisible by 4.
Note that the answer can be huge, so you should use 64-bit integer type to store it. In C++ you can use thelong long integer type and in Java you can use long integer type.
124
4
04
3
5810438174
9
能被4整除,末两位是4的倍数,不过首先要处理长度为1的子串情况。
#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<cmath>#include<algorithm>using namespace std;typedef long long ll;const int INF =0x3f3f3f3f;const int maxn=3*100000 ;char s[maxn+10];int n;int main(){ while(~scanf("%s",s+1)) { n=strlen(s+1); ll ans=0; for(int i=1;i<=n;i++) { int x= (s[i]-'0'); if(x%4==0) ans++; if(i-1<1) continue; int y=s[i-1]-'0'; int num=10*y+x; if(num%4) continue; ans+=i-1; } printf("%I64d\n",ans); } return 0;}
- CF 628B. New Skateboard
- codeforces 628 B. New Skateboard
- codeforces 628B New Skateboard
- CodeForces 628B New Skateboard
- CodeForces 628B New Skateboard
- CodeForces 628B New Skateboard
- CodeForces 628B New Skateboard
- CodeForces 628 B New Skateboard
- codeforces 628B New Skateboard
- Codeforces 628B New Skateboard (数学)
- Codeforces 628B New Skateboard【数学】
- CodeForces 628 B. New Skateboard(水~)
- CodeForce 628B New Skateboard 水题
- CodeForces 628B New Skateboard (数学)
- Codeforces 628B New Skateboard【数学】
- (CodeForces 628B)New Skateboard
- 【CodeForces 628B】 New Skateboard (数学水)
- codeforces 628 B. New Skateboard (数学-被4整除)
- <C#入门经典>学习笔记1之初识C#
- BZOJ 1901 Zju2112 Dynamic Rankings 树套"树"
- 第六周上机实践项目-书面作业2
- SOCKET通信中TCP、UDP数据包大小的确定
- 晶振
- CF 628B. New Skateboard
- gtk 开发实践第一篇
- 【POJ2891】Strange Way to Express Integers——中国剩余定理(非互质)
- Lua中rawset和rawget的使用方法
- 上拉加载XListView
- ArrayList and LinkedList Demo
- 5-10 计算工资 (15分)
- 【JQuery】使用each()方法遍历元素
- [Unity热更新]tolua# & LuaFramework(三):lua使用list与事件委托