zoukankan      html  css  js  c++  java
  • hdu5922Minimum’s Revenge

    Minimum’s Revenge

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 1409    Accepted Submission(s): 749


    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?
     

    Input
    The first line contains only one integer T (T100), which indicates the number of test cases.

    For each test case, the first line contains only one integer n (2n109), indicating the number of vertices.
     

    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
    2 2 3
     

    Sample Output
    Case #1: 2 Case #2: 5
    Hint
    In 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.
     

    Source




    思路:水题,注意变量类型设为long long 

    #include <iostream>
    #include<stdio.h>
    using namespace std;
    
    int main()
    {
        int t;
        scanf("%d",&t);
        long long n;
        int path=1;
        while(t--)
        {
            scanf("%lld",&n);
            long long  sum=0;
                sum=((2+n)*(n-1))/2;
                printf("Case #%d: %lld
    ",path++,sum);
        }
        return 0;
    }
    


  • 相关阅读:
    冲刺1
    第九周
    课堂作业
    团队项目典型用户与用户场景分析
    第八周
    梦断代码阅读笔记03
    tab页的使用方法
    校园服务nabcd需求分析
    第七周
    mysql下载以及安装
  • 原文地址:https://www.cnblogs.com/bryce1010/p/9387404.html
Copyright © 2011-2022 走看看