HDOJ 4473 Exam 暴力枚举
来源:互联网 发布:大数据系统架构师 编辑:程序博客网 时间:2024/04/29 13:09
所求的既 a*b*c<=n 的对数.....
暴力枚举a,b根据c计算结果
Exam
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1316 Accepted Submission(s): 559
Problem Description
Rikka is a high school girl suffering seriously from Chūnibyō (the age of fourteen would either act like a know-it-all adult, or thinks they have special powers no one else has. You might google it for detailed explanation) who, unfortunately, performs badly at math courses. After scoring so poorly on her maths test, she is faced with the situation that her club would be disband if her scores keeps low.
Believe it or not, in the next exam she faces a hard problem described as follows.
Let’s denote f(x) number of ordered pairs satisfying (a * b)|x (that is, x mod (a * b) = 0) where a and b are positive integers. Given a positive integer n, Rikka is required to solve for f(1) + f(2) + . . . + f(n).
According to story development we know that Rikka scores slightly higher than average, meaning she must have solved this problem. So, how does she manage to do so?
Believe it or not, in the next exam she faces a hard problem described as follows.
Let’s denote f(x) number of ordered pairs satisfying (a * b)|x (that is, x mod (a * b) = 0) where a and b are positive integers. Given a positive integer n, Rikka is required to solve for f(1) + f(2) + . . . + f(n).
According to story development we know that Rikka scores slightly higher than average, meaning she must have solved this problem. So, how does she manage to do so?
Input
There are several test cases.
For each test case, there is a single line containing only one integer n (1 ≤ n ≤ 1011).
Input is terminated by EOF.
For each test case, there is a single line containing only one integer n (1 ≤ n ≤ 1011).
Input is terminated by EOF.
Output
For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is the desired answer.
Sample Input
13610152128
Sample Output
Case 1: 1Case 2: 7Case 3: 25Case 4: 53Case 5: 95Case 6: 161Case 7: 246
Source
2012 Asia Chengdu Regional Contest
/* ***********************************************Author :CKbossCreated Time :2015年09月02日 星期三 12时42分31秒File Name :HDOJ4473.cpp************************************************ */#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <set>#include <map>using namespace std;typedef unsigned long long int LL;LL n;int main(){//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);int cas=1;while(scanf("%lld",&n)!=EOF){LL ans=0;for(LL a=1;a*a<=n;a++){for(LL b=a;b*b*a<=n;b++){LL c=n/(a*b);LL ret=0LL;if(a==b) ret+=1LL;else ret+=3LL;if(c>b) { if(a==b) ret+=3LL*(c-b); else ret+=6LL*(c-b); }ans+=ret;}}printf("Case %d: %lld\n",cas++,ans);} return 0;}
0 0
- HDOJ 4473 Exam 暴力枚举
- [暴力] HDU 4473 Exam
- HDU 4473 Exam 有点技巧的暴力枚举 (2012成都区域赛J题)
- HDOJ 5305 Friends 暴力枚举
- [暴力]HDU 4473——Exam
- HDOJ 4445 - Crazy Tank 暴力枚举角度...
- hdoj 4932 Miaomiao's Geometry 【暴力枚举】
- HDOJ 5400 Arithmetic Sequence 暴力枚举
- HDOJ/HDU 1015 Safecracker(枚举、暴力)
- HDOJ-----1005---Number Sequence暴力枚举
- HDOJ-----5339---Untitled暴力枚举+剪枝
- HDU/HDOJ 1015(dfs或暴力枚举)
- hdoj 5311 Hidden String (暴力枚举)
- hdoj 1015 safecracker(暴力枚举)
- HDU 4473 HDOJ Exam (推理,5级)
- 【暴力乱搞】HDU4473 Exam
- hdoj 5240 Exam 【模拟】
- hdoj--5240--Exam()
- (1)判断链表中是否有环
- linux/unix下对指定大小的文件进行批量压缩
- An Overview of RMI Applications
- Autoit3 脚本编写举例
- Dijkstra最短路径算法(针对加权有向图)
- HDOJ 4473 Exam 暴力枚举
- Deep Learning(深度学习)代码/课程/学习资料整理【持续更新】
- split的几个问题
- MFC窗口风格 WS_style 和 WS_EX_style
- Hadoop2+HA+YARN环境搭建
- Webvan之死----基于用户假设的产品开发与扩张
- opencv我的单通道阈值分割
- C++模板的申明和定义
- 怎样在ABBYY PDF Transformer+中进行图像增强