Tutte le sfide
Media 0 risolte 0% di accettazione

Amicable Pair

List every amicable pair whose two numbers are both at most a limit.

Cosa imparerai

  • Build a table of proper-divisor sums for every number up to a limit
  • Check a pair condition in both directions
  • Avoid listing a pair twice or listing perfect numbers

Problema

Mostra traduzione

Let s(n) be the sum of the proper divisors of n (its divisors other than n itself). Two different numbers a and b form an amicable pair when s(a) = b and s(b) = a. The smallest pair is 220 and 284: s(220) = 1 + 2 + 4 + 5 + 10 + 11 + 20 + 22 + 44 + 55 + 110 = 284 and s(284) = 1 + 2 + 4 + 71 + 142 = 220.

Implement amicable_pair(limit).

Computing s(n) for every n up to limit one at a time is slow. A sieve works better: for every d, add d to each multiple of d above d.

Input

limit: The largest number either member of a pair may have.

Output

Return a list of pairs [a, b] with a < b ≤ limit, sorted by a in ascending order. A pair is included only if both numbers are at most limit. Perfect numbers (where s(n) = n) are not pairs. If there are none, return an empty list.

Vincoli

1 ≤ limit ≤ 200,000

Esempi

Esempio 1
Input:
limit = 1500

Output atteso:
expected = [
    [220, 284],
    [1184, 1210]
]
Input:
long long limit = 1500;

Output atteso:
std::vector<std::vector<long long>> expected = {
    {220, 284},
    {1184, 1210}
};
Input:
long limit = 1500;

Output atteso:
long[][] expected = new long[][] {
    new long[] {220, 284},
    new long[] {1184, 1210}
};

Spiegazione

s(220) = 284 and s(284) = 220, and s(1184) = 1210 and s(1210) = 1184. Both pairs fit under 1500: [[220, 284], [1184, 1210]].

Esempio 2
Input:
limit = 250

Output atteso:
expected = []
Input:
long long limit = 250;

Output atteso:
std::vector<std::vector<long long>> expected = {};
Input:
long limit = 250;

Output atteso:
long[][] expected = new long[][] {};

Spiegazione

220 is at most 250, but its partner 284 is not, so no pair fits: [].

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

For every d from 1 to limit / 2, add d to the sums of 2d, 3d, 4d, and so on.

Suggerimento 2

For each a, let b be its divisor sum and check that b is in range and that b's divisor sum is a.

Suggerimento 3

Requiring a < b lists each pair once and skips perfect numbers.

Complessità attesa

O(limit log limit) time, O(limit) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.