#practiceLinkDiv { display: none !important; }Dano naravno število n naloga je najti vsoto deliteljev vseh deliteljev števila n.
Primeri:
Input : n = 54 Output : 232 Divisors of 54 = 1 2 3 6 9 18 27 54. Sum of divisors of 1 2 3 6 9 18 27 54 are 1 3 4 12 13 39 40 120 respectively. Sum of divisors of all the divisors of 54 = 1 + 3 + 4 + 12 + 13 + 39 + 40 + 120 = 232. Input : n = 10 Output : 28 Divisors of 10 are 1 2 5 10 Sums of divisors of divisors are 1 3 6 18. Overall sum = 1 + 3 + 6 + 18 = 28Recommended Practice Poiščite vsoto deliteljev Poskusite!
Z uporabo dejstva, da je katero koli število n lahko izrazimo kot produkt prafaktorjev n = str1k1x str2k2x ... kjer je str1str2... so praštevila.
Vse delitelje števila n lahko izrazimo kot p1ax str2bx ... kjer je 0<= a <= k1 and 0 <= b <= k2.
Zdaj bo vsota deliteljev vsota vseh potenj p1- str1str11.... str1k1pomnoženo z vso potenco p2- str2str21.... str2k1
Vsota delitelja n
= (str1x str2) + (str11x str2) +.....+ (str1k1x str2) +....+ (str1x str21) + (str11x str21) +.....+ (str1k1x str21) +........+
(str1x str2k2) + (str11x str2k2) +......+ (str1k1x str2k2).
= (str1+ str11+...+ str1k1) x str2+ (str1+ str11+...+ str1k1) x str21+......+ (str1+ str11+...+ str1k1) x str2k2.
= (str1+ str11+...+ str1k1) x (str2+ str21+...+ str2k2).
Zdaj delilniki katerega koli paza p kot praštevilo so pstr1...... stra. In vsota deliteljev bo (str(a+1)- 1)/(p -1) naj določa f(p).
Torej bo vsota deliteljev vseh deliteljev
= (f(p1) + f(str11) +...+ f(str1k1)) x (f(str2) + f(str21) +...+ f(str2k2)).
Torej dano število n s prafaktorizacijo lahko najdemo vsoto deliteljev vseh deliteljev. Toda v tem problemu je podano, da je n produkt elementa matrike. Torej poiščite prafaktorizacijo vsakega elementa in z uporabo dejstva abx ac= ab+c.
Spodaj je izvedba tega pristopa:
string.format javaC++
// C++ program to find sum of divisors of all // the divisors of a natural number. #include
// Java program to find sum of divisors of all // the divisors of a natural number. import java.util.HashMap; class GFG { // Returns sum of divisors of all the divisors // of n public static int sumDivisorsOfDivisors(int n) { // Calculating powers of prime factors and // storing them in a map mp[]. HashMap<Integer Integer> mp = new HashMap<>(); for (int j = 2; j <= Math.sqrt(n); j++) { int count = 0; while (n % j == 0) { n /= j; count++; } if (count != 0) mp.put(j count); } // If n is a prime number if (n != 1) mp.put(n 1); // For each prime factor calculating (p^(a+1)-1)/(p-1) // and adding it to answer. int ans = 1; for (HashMap.Entry<Integer Integer> entry : mp.entrySet()) { int pw = 1; int sum = 0; for (int i = entry.getValue() + 1; i >= 1; i--) { sum += (i * pw); pw *= entry.getKey(); } ans *= sum; } return ans; } // Driver code public static void main(String[] args) { int n = 10; System.out.println(sumDivisorsOfDivisors(n)); } } // This code is contributed by // sanjeev2552
# Python3 program to find sum of divisors # of all the divisors of a natural number. import math as mt # Returns sum of divisors of all # the divisors of n def sumDivisorsOfDivisors(n): # Calculating powers of prime factors # and storing them in a map mp[]. mp = dict() for j in range(2 mt.ceil(mt.sqrt(n))): count = 0 while (n % j == 0): n //= j count += 1 if (count): mp[j] = count # If n is a prime number if (n != 1): mp[n] = 1 # For each prime factor calculating # (p^(a+1)-1)/(p-1) and adding it to answer. ans = 1 for it in mp: pw = 1 summ = 0 for i in range(mp[it] + 1 0 -1): summ += (i * pw) pw *= it ans *= summ return ans # Driver Code n = 10 print(sumDivisorsOfDivisors(n)) # This code is contributed # by mohit kumar 29
// C# program to find sum of divisors of all // the divisors of a natural number. using System; using System.Collections.Generic; class GFG { // Returns sum of divisors of // all the divisors of n public static int sumDivisorsOfDivisors(int n) { // Calculating powers of prime factors and // storing them in a map mp[]. Dictionary<int int> mp = new Dictionary<int int>(); for (int j = 2; j <= Math.Sqrt(n); j++) { int count = 0; while (n % j == 0) { n /= j; count++; } if (count != 0) mp.Add(j count); } // If n is a prime number if (n != 1) mp.Add(n 1); // For each prime factor // calculating (p^(a+1)-1)/(p-1) // and adding it to answer. int ans = 1; foreach(KeyValuePair<int int> entry in mp) { int pw = 1; int sum = 0; for (int i = entry.Value + 1; i >= 1; i--) { sum += (i * pw); pw = entry.Key; } ans *= sum; } return ans; } // Driver code public static void Main(String[] args) { int n = 10; Console.WriteLine(sumDivisorsOfDivisors(n)); } } // This code is contributed // by Princi Singh
<script> // Javascript program to find sum of divisors of all // the divisors of a natural number. // Returns sum of divisors of all the divisors // of n function sumDivisorsOfDivisors(n) { // Calculating powers of prime factors and // storing them in a map mp[]. let mp = new Map(); for (let j = 2; j <= Math.sqrt(n); j++) { let count = 0; while (n % j == 0) { n = Math.floor(n/j); count++; } if (count != 0) mp.set(j count); } // If n is a prime number if (n != 1) mp.set(n 1); // For each prime factor calculating (p^(a+1)-1)/(p-1) // and adding it to answer. let ans = 1; for (let [key value] of mp.entries()) { let pw = 1; let sum = 0; for (let i = value + 1; i >= 1; i--) { sum += (i * pw); pw = key; } ans *= sum; } return ans; } // Driver code let n = 10; document.write(sumDivisorsOfDivisors(n)); // This code is contributed by patel2127 </script>
Izhod:
28
Časovna zapletenost: O(?n log n)
Pomožni prostor: O(n)
Optimizacije:
Za primere, ko je več vnosov, za katere moramo najti vrednost, ki jo lahko uporabimo Eratostenovo sito kot je obravnavano v to post.