A. Alyona and Numbers
来源:互联网 发布:全景照片合成软件 编辑:程序博客网 时间:2024/05/14 19:56
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 ≤ n, 1 ≤ y ≤ m and equals 0.
As usual, Alyona has some troubles and asks you to help.
The only line of the input contains two integers n and m (1 ≤ n, m ≤ 1 000 000).
Print the only integer — the number of pairs of integers (x, y) such that 1 ≤ x ≤ n, 1 ≤ y ≤ m and (x + y) is divisible by5.
6 12
14
11 14
31
1 5
1
3 8
5
5 7
7
21 21
88
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.
解题说明:此题只需要遍历统计即可。
#include<cstdio>#include <cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>#include <map>using namespace std;int main(){ int n,m, i; long long count=0; scanf("%d %d",&n,&m); for(i=1;i<=n;i++) {count+=((m+i)/5-i/5);}printf("%lld\n",count); return 0;}
- A. Alyona and Numbers
- codeforce A. Alyona and Numbers
- CodeForces 682A Alyona and Numbers
- CodeForces 682A Alyona and Numbers
- Alyona and Numbers
- Codeforces Round #358 (Div. 2) A. Alyona and Numbers
- Codeforces Round #358 (Div. 2) A. Alyona and Numbers
- Codeforces Round #358 (Div. 2) A. Alyona and Numbers
- Codeforces Round #358 (Div. 2) A. Alyona and Numbers
- codeforces 682 a 解题报告 Alyona and Numbers 数论基础
- Codeforces Round #358 (Div. 2)(A) Alyona and Numbers
- Codeforces-682A:Alyona and Numbers(水题)
- CF682A B - Alyona and Numbers
- A.Alyona and copybooks
- A. Alyona and copybooks
- Codeforces Round #358 (Div. 2) A Alyona and Numbers(水题)
- Codeforces Round #358 (Div. 2) -- A. Alyona and Numbers(暴力水题)
- CodeForces 682A Alyona and Numbers(被整除的个数)
- SpringMVC实现RESTful风格
- 使用Xcode7的Instruments检测解决iOS内存泄露
- Android 进程常驻(3)----native保活5.0以下方案推演过程以及代码详述
- 菜单栏的制作
- iOS9URLScheme适配(白名单配置)
- A. Alyona and Numbers
- 分布式服务框架 Zookeeper -- 管理分布式环境中的数据
- Android 进程常驻(4)----native保活5.0以上方案推演过程以及代码详述
- FlexSlider插件的详情设置参数
- spring中的Log4jConfigListener作用和webapp.root的设置
- 将图片打包成文件上传服务器 POST请求 AFNetWorking网络请求
- Eclipse 安装FindBugs插件
- MySQL数据库,将一列数据组合成一行,并以逗号分割,GROUP_CONCAT
- 【OpenGL/ES】 第06讲 3D数学-四元数与矩阵