zoukankan      html  css  js  c++  java
  • Education Round 8 A

    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 and124. 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 ofScanner/System.out in Java.

    Input

    The only line contains string s (1 ≤ |s| ≤ 3·105). The string s contains only digits from 0to 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 Javayou can use long integer type.

    Example

    Input
    124
    Output
    4
    Input
    04
    Output
    3
    Input
    5810438174
    Output
    9

     1  /*首先,容易想到100是4的倍数。
     2     所以我们只用考虑后两位数字就能够判断一个数字能否被4整除,因为
     3     x*100+y=y (mod 4)
     4     其中y代表超过100的数字部分。
     5     于是只需要对所有相邻两位判断,如果某两位可以被4整除,那么以这两位结尾的所有子串都是可行的。
     6     比如12344,44能被4整除,那么44,344,2344,12344都能被4整除。
     7     在单独考虑只有一个位的子串就好。
     8    */
     9 
    10 
    11    #include <iostream>
    12    #include <stdio.h>
    13    #include <string.h>
    14    using namespace std;
    15    const int N=300010;
    16    char s[N];
    17    int main(){
    18     long long ans=0;
    19     scanf("%s",s);
    20     int len=strlen(s);
    21     for(int i=0;i<len;i++)
    22         if((s[i]-'0')%4==0) ans++;
    23         for(int i=1;i<len;i++){
    24             int temp=(s[i-1]-'0')*10+s[i]-'0';
    25             if(temp%4==0) ans+=i;    ///以这两位结尾的子串
    26         }
    27         printf("%I64d
    ",ans);/// 输出呀,WA了三次  直接用cout<< ans<<endl;也行
    28     return 0;
    29    }
  • 相关阅读:
    程序员,如何从平庸走向理想?
    【Hadoop】HA 场景下访问 HDFS JAVA API Client
    hive 和Hbase的pom文件
    wxpython多线程通信的应用-实现边录音边绘制音谱图
    wxpython多线程间通信
    LeetCode 92. ReverseLinkedII
    pip换源安装
    wxpython绘制音频
    python读取wav文件并播放[pyaudio/wave]
    Python绘制wav文件音频图(静态)[matplotlib/wave]
  • 原文地址:https://www.cnblogs.com/z-712/p/7324347.html
Copyright © 2011-2022 走看看