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 }
  • 相关阅读:
    【Feature】使用Feature导入WebPart
    千万别动SharePoint数据库
    【PS】使用PowerShell创建WinForm程序(转载)
    【WebServices】调用 SharePoint WebServices 注意事项
    【转载】十一种Web网站程序性能测试工具介绍
    【List Event Receivers】区分自定义“事件处理”功能的两种部署方式
    [转] SharePoint Server 2007 页面模型
    第一天 从此在这记录学习C++的点点滴滴
    《C++ Primer》第7章 函数
    Emacs 自动填充头文件
  • 原文地址:https://www.cnblogs.com/jj81/p/7853523.html
Copyright © 2011-2022 走看看