zoukankan      html  css  js  c++  java
  • CF | Alyona and Numbers

    After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first column containing integers from 1 to n and the second containing integers from 1 to m. Now the girl wants to count how many pairs of integers she can choose, one from the first column and the other from the second column, such that their sum is divisible by 5.

    Formally, Alyona wants to count the number of pairs of integers (x, y) such that 1 ≤ x ≤ n1 ≤ y ≤ m and  equals 0.

    As usual, Alyona has some troubles and asks you to help.

    Input

    The only line of the input contains two integers n and m (1 ≤ n, m ≤ 1 000 000).

    Output

    Print the only integer — the number of pairs of integers (x, y) such that 1 ≤ x ≤ n1 ≤ y ≤ m and (x + y) is divisible by 5.

    Example

    Input
    6 12
    Output
    14
    Input
    11 14
    Output
    31
    Input
    1 5
    Output
    1
    Input
    3 8
    Output
    5
    Input
    5 7
    Output
    7
    Input
    21 21
    Output
    88

    Note

    Following pairs are suitable in the first sample case:

    • for x = 1 fits y equal to 4 or 9;
    • for x = 2 fits y equal to 3 or 8;
    • for x = 3 fits y equal to 2, 7 or 12;
    • for x = 4 fits y equal to 1, 6 or 11;
    • for x = 5 fits y equal to 5 or 10;
    • for x = 6 fits y equal to 4 or 9.

    Only the pair (1, 4) is suitable in the third sample case.

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 int main()
     5 {
     6     int n,m,t,count1,count2,temp;
     7     while(cin>>n>>m) {
     8         long long int ans = 0;
     9         if(n > m) {   
    10             t = n;
    11             n = m;
    12             m = t;    
    13         } 
    14         count1 = m / 5; // 求出有多少组 (1 2 3 4 5) 
    15         count2 = m % 5; // 求出剩余多少个数 
    16         
    17         for(int i = 1; i <= n; i++)
    18         {
    19             ans += count1; //每一个数在一个循环组有能够找到一个相加模5等于0的数 
    20             temp = i % 5;  //temp i 在 循环组的位置 
    21             if((5-temp )<= count2 && count2 != 0 )  //根据循环组的内规律进行匹配  1--4 2--3 
    22             {
    23                 ans++;    
    24             }    
    25         }
    26         
    27         cout<<ans<<endl;
    28     }
    29 
    30     return 0;
    31 }
  • 相关阅读:
    6、linux中同步、互斥、阻塞(原子操作、信号量、阻塞)
    lightOJ-1199 Partitioning Game (SG函数)
    HDU-1013 Digital Roots
    HDU-1004 Let the Balloon Rise (STL map)
    HDU-1020 Encoding (字符串)
    POJ-2524 Ubiquitous Religions (并查集)
    POJ-1988 Cube Stacking (带权并查集)
    POJ-2236 Wireless Network (并查集)
    HDU-1002 A + B Problem II (模拟大数相加)
    HDU-1829 A Bug's Life (种类并查集)
  • 原文地址:https://www.cnblogs.com/jj81/p/7853523.html
Copyright © 2011-2022 走看看