(CodeForces 628B)New Skateboard
来源:互联网 发布:金10数据官网财经日历 编辑:程序博客网 时间:2024/06/04 19:53
(CodeForces 628B)New Skateboard
time limit per test:1 second
memory limit per test:256 megabytes
input:standard input
output:standard output
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 use BufferedReader/PrintWriter instead of Scanner/System.out in Java.
3Input
The only line contains string s (1 ≤ |s| ≤ 3·105). The string s contains only digits from 0 to 9.
Output
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 the long long integer type and in Java you can use long integer type.
Examples
input
124
output
4
input
04
output
3
input
5810438174
output
9
题目大意:给出一个数字序列,有多少个子序列可以被4整除。
思路:因为100可以被4整除,所以只要判断一下两位数就好了。
#include<cstdio>#include<cstring>using namespace std;typedef long long LL;const int maxn=300005;char s[maxn];int main(){ while(~scanf("%s",s)) { int len=strlen(s); LL ans=0; if(s[0]%4==0) ans++; for(int i=1;i<len;i++) { int y=s[i]-'0'; if(y%4==0) ans++; int x=s[i-1]-'0'; if((x*10+y)%4==0) ans+=i; } printf("%lld\n",ans); } return 0;}
- Codeforces 628B New Skateboard (数学)
- CodeForces 628 B. 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 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 628B New Skateboard【数学】
- codeforces 628 B. New Skateboard (数学-被4整除)
- CF 628B. New Skateboard
- Educational Codeforces Round 8-B. New Skateboard
- QRgb的qalpha
- thinkphp5 入口文件绑定别的模块
- LeetCode
- MWeb和七牛云上传照片
- 3n+1猜想
- (CodeForces 628B)New Skateboard
- HDU
- 洛谷 1578 奶牛沐场 最大子矩阵 解题报告
- The Doors
- python --- 函数学习的准备
- 基于图学习的图像降噪(一)——初识图
- 习题
- spring 5.0 从入门到放弃 01
- mysql存储过程之循环结构邂逅leave