zoukankan      html  css  js  c++  java
  • codeforces 628B B. New Skateboard (数论)

    B. 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 usegets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/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 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的倍数,所以只用判断个位和十位就好;

    AC代码:

    #include <bits/stdc++.h>
    using namespace std;
    const int N=1e5+4;
    char str[3*N];
    int a,b;
    int main()
    {
        scanf("%s",str);
        int len=strlen(str);
        long long ans=0;
        a=str[0]-'0';
        if(a%4==0)ans++;
        for(int i=1;i<len;i++)
        {
            a=str[i]-'0';
            if(a%2==0)
            {
                if(a%4==0)
                    ans++;
                b=str[i-1]-'0';
                if((b*10+a)%4==0)
                {
                    ans+=i;
                }
            }
        }
        cout<<ans<<"
    ";
        return 0;
    }
  • 相关阅读:
    atitit.TokenService v3 qb1 token服务模块的设计 新特性.docx
    Atitit attilax在自然语言处理领域的成果
    Atitit 图像清晰度 模糊度 检测 识别 评价算法 原理
    Atitit (Sketch Filter)素描滤镜的实现  图像处理  attilax总结
    atitit。企业的价值观 员工第一 vs 客户第一.docx
    Atitit 实现java的linq 以及与stream api的比较
    Atitit dsl exer v3 qb3 新特性
    Atititi tesseract使用总结
    Atitit 修改密码的功能流程设计 attilax总结
    atitit.TokenService v3 qb1  token服务模块的设计 新特性.docx
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5203061.html
Copyright © 2011-2022 走看看