zoukankan      html  css  js  c++  java
  • uva12546. LCM Pair Sum

    uva12546. LCM Pair Sum

    One of your friends desperately needs your help. He is working with a secret agency and doing some encoding stuffs. As the mission is confidential he does not tell you much about that, he just want you to help him with a special property of a number. This property can be expressed as a function f (n) for a positive integer n. It is defined as: 
    f (n) = $displaystyle sum_{{egin{array}{c}{1 le p le q le n} \  {lcm(p,q)=n}end{array}}}^{}$(p + q)

     In other words, he needs the sum of all possible pairs whose least common multiple is n. (The least common multiple (LCM) of two numbers p and q is the lowest positive integer which can be perfectly divided by both p and q). For example, there are 5 different pairs having their LCM equal to 6 as (1, 6), (2, 6), (2, 3), (3, 6), (6, 6). So f (6) is calculated as f (6) = (1 + 6) + (2 + 6) + (2 + 3) + (3 + 6) + (6 + 6) = 7 + 8 + 5 + 9 + 12 = 41.

    Your friend knows you are good at solving this kind of problems, so he asked you to lend a hand. He also does not want to disturb you much, so to assist you he has factorized the number. He thinks it may help you.

     Input 

    The first line of input will contain the number of test cases T (T$ le$500). After that there will be T test cases. Each of the test cases will start with a positive number C (C$ le$15) denoting the number of prime factors of n. Then there will be C lines each containing two numbers Pi and ai denoting the prime factor and its power (Pi is a prime between 2 and 1000) and ( 1$ le$ai$ le$50). All the primes for an input case will be distinct.

     Output 

    For each of the test cases produce one line of output denoting the case number and f (n) modulo 1000000007. See the output for sample input forexact formatting.

     Sample Input 

    3
    2
    2 1
    3 1
    2
    2 2
    3 1
    1
    5 1
    

     Sample Output 

    Case 1: 41
    Case 2: 117
    Case 3: 16

    这道题目也也搞了很长时间,算是初识母函数吧,这道题目用到了这种思想。做完了,感觉还是不太明白怎么就能用

    (1+a1+a1^2...(c1+1)*a1^c1)*(1+a2+a2^2...(c2+1)*a2^c2)*.....*(1+am+am^2...(cm+1)*am^cm)+n 这个公式。

    #include <cstdio>
    #include <iostream>
    #include <algorithm>
    #include <cstring>
    using namespace std;
    const int MOD = 1000000007;
    
    int main() {
          int TCase;
          cin >> TCase;
          for(int t = 1; t <= TCase; ++t) {
                long long n, p, c;
                long long ans = 1, flag = 1;
                cin >> n;
                for(int i = 0; i != n; ++i) {
                      long long tmp = 1, fac = 1;
                      cin >> p >> c;
                      for(int j = 0; j != c; ++j) {
                            fac = (fac * p) % MOD;
                            tmp = (tmp + fac) % MOD;
                      }
                      tmp = (tmp + (fac * c) % MOD) % MOD;
                      flag = (fac * flag) % MOD;
                      ans = (ans * tmp) % MOD;
                }
                ans = (ans + flag) % MOD;
                cout << "Case " << t << ": " << ans << endl;
          }
          return 0;
    }
  • 相关阅读:
    SpringCloud项目中使用Nacos作为配置中心
    SpringCloud项目中使用Nacos作为注册中心
    idea创建maven多模块Spring Boot项目
    Java代码中对IP进行白名单验证
    idea配置jdk
    win10配置jdk1.8环境变量
    shell 提示符样式设置
    整数转换成中文读法的字符串
    比较三段式软件版本号大小
    Windows7安装 nginx+php 后访问.php文件出现 “No input file specified.” 的解决办法
  • 原文地址:https://www.cnblogs.com/ya-cpp/p/4675395.html
Copyright © 2011-2022 走看看