zoukankan      html  css  js  c++  java
  • Petrozavodsk Summer Training Camp 2015 Day 2: Xudyh (TooSimple) Contest, Saturday, August 22, 2015 C题

    Problem C. GCD Tree Input file: standard input Output file: standard output Time limit: 3 seconds Memory limit: 64 mebibytes Teacher Mai has a graph with n vertices numbered from 1 to n. For every edge(u, v), the weight is gcd(u, v). (gcd(u, v) means the greatest common divisor of number u and v). You need to find a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is maximized. Print the total weight of these edges. Input First line of the input contains one integer T (1 ≤ T ≤ 105 ) — numbef of test cases For each test case, there is only one line containing one integer n (1 ≤ n ≤ 105 ). Output For each test case, print one integer — the answer. Examples standard input standard output 5 1 2 3 4 5 0 1 2 4 5

    暴力打表。

    优化的暴力,待填。

  • 相关阅读:
    用CSS开启硬件加速来提高网站性能
    vim中替换内容
    alias vi=vim
    PHP 多进程初识
    端口的查看
    PHP三种终止脚本执行:return,die,exit
    2021.3.14(每周总结)
    2021.3.13
    2021.3.12
    2021.3.11
  • 原文地址:https://www.cnblogs.com/poler/p/7359648.html
Copyright © 2011-2022 走看看