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;
    }
  • 相关阅读:
    Redis的使用
    linux面试题
    数据库面试题
    Xadmin控件的实现:〇六查询视图四——list视图search功能
    Xadmin控件的实现:〇五查询视图三——list视图封装
    Xadmin控件的实现:〇四查询视图二——分页效果的实现
    Xadmin控件的实现:〇三查询视图一——基础功能
    Xadmin控件的实现:〇项目介绍
    Xadmin控件的实现:〇二增、改视图
    离线电商数仓(十七)之用户行为数据仓库(三)高可用mysql (HA mysql,ubuntu)
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5203061.html
Copyright © 2011-2022 走看看