codeforces 682 a 解题报告 Alyona and Numbers 数论基础
来源:互联网 发布:欧洲30年战争知乎 编辑:程序博客网 时间:2024/06/09 02:29
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 by 5.
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.
思路:
暴力两重循环超时了......
自己没想到优化的方法......
后来参考了juju的方法才A掉.......
附链接:http://www.cnblogs.com/Sunshine-tcf/p/5690183.html
代码:
#include<stdio.h>#include<iostream>#include<math.h>#include<algorithm>#include<limits.h>#include<string.h>using namespace std;int main(){int n,m,a[6],b[6];__int64 sum;while(~scanf("%d%d",&n,&m)){memset(a,0,sizeof(a));memset(b,0,sizeof(b));for(int i=1;i<=n;++i) ++a[i%5];for(int i=1;i<=m;++i) ++b[i%5];sum=(__int64)a[0]*(__int64)b[0];//int 和 __int64 之间需要显示类型转换 也可以直接把a b 数组开成 __int64 型 for(int i=1;i<5;++i){sum+=(__int64)a[i]*(__int64)b[5-i];}printf("%I64d\n",sum);}return 0;}
- codeforces 682 a 解题报告 Alyona and Numbers 数论基础
- CodeForces 682A Alyona and Numbers
- CodeForces 682A Alyona and Numbers
- Codeforces-682A:Alyona and Numbers(水题)
- 解题报告:Codeforces Round #381 (Div. 1)B. Alyona and a tree
- 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 Round #358 (Div. 2) A. Alyona and Numbers
- Codeforces Round #358 (Div. 2)(A) Alyona and Numbers
- CodeForces 682A Alyona and Numbers(被整除的个数)
- codeforce A. Alyona and Numbers
- 解题报告:Codeforces Round #432 (Div. 2) D. Arpa and a list of numbers 暴力
- Codeforces Round #358 (Div. 2) A Alyona and Numbers(水题)
- Codeforces Round #358 (Div. 2) -- A. Alyona and Numbers(暴力水题)
- Codeforces 739A Alyona and mex(构造)
- 【20.23%】【codeforces 740A】Alyona and copybooks
- 面向对象的三个基本特征 和 五种设计原则
- Java中反射(Reflection)的应用
- 利用C++ Boost编写扩展Python模块
- 文章标题
- Dual Palindromes(USACO)
- codeforces 682 a 解题报告 Alyona and Numbers 数论基础
- [Leetcode] Best Time to Buy and Sell Stock
- Genymotion添加模拟器时报Unable to create virtual device,Server returned HTTP status code xxx
- 部分复杂度问题
- 矩阵乘法
- TTL(time to live)生存时间
- Linux发行版的基础目录名称、命名法则及功能规定
- 子查询
- Linux的发行版以及不同发行版之间的联系和不同