2016CCPC东北地区大学生程序设计竞赛-Minimum’s Revenge
来源:互联网 发布:uuu网络加速器下载 编辑:程序博客网 时间:2024/05/17 23:19
Minimum’s Revenge
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
There is a graph of n vertices which are indexed from 1 to n. For any pair of different vertices, the weight of the edge between them is the least common multiple of their indexes.
Mr. Frog is wondering about the total weight of the minimum spanning tree. Can you help him?
Mr. Frog is wondering about the total weight of the minimum spanning tree. Can you help him?
Input
The first line contains only one integer T (T≤100 ), which indicates the number of test cases.
For each test case, the first line contains only one integer n (2≤n≤109 ), indicating the number of vertices.
For each test case, the first line contains only one integer n (
Output
For each test case, output one line "Case #x:y",where x is the case number (starting from 1) and y is the total weight of the minimum spanning tree.
Sample Input
223
Sample Output
Case #1: 2Case #2: 5HintIn the second sample, the graph contains 3 edges which are (1, 2, 2), (1, 3, 3) and (2, 3, 6). Thus the answer is 5.解题思路:最小公倍数大于或等于两数中的任何一个。所以让2~n跟1相连就是最小生成树权值总和2+3+4+……+n开始差点想用Prim和gcd,too young too naive!#include<iostream>#include<cstdio>using namespace std;typedef long long LL;int main(){ ios::sync_with_stdio(false); cin.tie(0); int T; cin>>T; LL n; for(int i=1;i<=T;i++) { cin>>n; cout<<"Case #"<<i<<": "<<(n+2)*(n-1)/2<<endl; } return 0;}
0 0
- 2016CCPC东北地区大学生程序设计竞赛-Minimum’s Revenge
- HDU Minimum’s Revenge 2016CCPC东北地区大学生程序设计竞赛 - 重现赛
- [2016CCPC东北地区大学生程序设计竞赛] Minimum’s Revenge 贪心+水题
- 【HDU5922 2016CCPC东北地区大学生程序设计竞赛 - 重现赛 A】【水题】Minimum’s Revenge
- 2016CCPC东北地区大学生程序设计竞赛 - 重现赛 A - Minimum’s Revenge HDU 5922
- hdu5922 2016CCPC东北地区大学生程序设计竞赛 A题 Minimum’s Revenge(思维,水题)
- HDU 5922 Minimum’s Revenge 【模拟】(2016CCPC东北地区大学生程序设计竞赛)
- HDU 5922 Minimum’s Revenge(思维题)——2016CCPC东北地区大学生程序设计竞赛 - 重现赛
- (HDU 5922)Minimum’s Revenge 思维水题 <2016CCPC东北地区大学生程序设计竞赛 - 重现赛 >
- 2016CCPC东北地区大学生程序设计竞赛-Mr. Frog’s Problem
- 2016CCPC东北地区大学生程序设计竞赛-Mr. Frog’s Game
- 2016CCPC东北地区大学生程序设计竞赛
- 2016CCPC东北地区大学生程序设计竞赛
- [2016CCPC东北地区大学生程序设计竞赛]Mr. Frog’s Game 遍历
- HDU Mr. Frog’s Problem 2016CCPC东北地区大学生程序设计竞赛 - 重现赛
- [2016CCPC东北地区大学生程序设计竞赛]Mr. Frog’s Problem 规律+打表
- HDU Mr. Frog’s Game 2016CCPC东北地区大学生程序设计竞赛 - 重现赛
- 【HDU5924 2016CCPC东北地区大学生程序设计竞赛 - 重现赛 C】【水题】Mr. Frog’s Problem
- https协议相关
- Why do I choose to major in software engineering?
- 一个程序员的进化史-第十一章
- 单链表的基本操作
- DbUnit数据库测试之备份与还原
- 2016CCPC东北地区大学生程序设计竞赛-Minimum’s Revenge
- 洛克菲勒给儿子的38封信(前14封选摘)
- 3938-Ray, Pass me the dishes!
- POJ 1061 青蛙的约会 扩展欧几里德- 猪都懂啦 = =
- 数据库-关系型数据库
- GIT的Push和Pull,强制Pull覆盖本地命令
- Servlet案例四
- Ubuntu软件下载源
- Python3中Django使用pymysql自动建表