Hugging Face's logo

Datasets:
slayone
/
uva_spoj_raw

Tasks:
Translation
Text Generation
Size:
1K<n<10K
Tags:
code
License:
Dataset card Files
xet
Community
uva_spoj_raw
File size: 1,147 Bytes 
c4b0eef
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
 
#include <cstdio>
#include <cmath>

int tc, n;

bool isPrime(int x)
{
    if( x==2 ) return (true);
    else if( !(x&1) ) return (false);
    else
    {
        int sqrtX = sqrt(x);
        for(int i=3 ; i<=sqrtX ; i+=2)
            if( !(x%i) ) return (false);
    }
    return (true);
}

int sumOfDigits(int x)
{
    int sum = 0;
    while( x )
    {
        sum += x%10;
        x /= 10;
    }
    return (sum);
}

int sumOfPrimeFactors(int x)
{
    int sum = 0;
    while( !(x&1) )
    {
        sum += 2;
        x /= 2;
    }
    int i = 3, sqrtX = sqrt(x);
    while( i<=sqrtX )
        if( !(x%i) )
        {
            sum += sumOfDigits(i);
            x /= i;
        }
        else i+=2;
    if( x>1 ) sum += sumOfDigits(x);
    return (sum);
}

bool smithNumber(int x)
{
    if( !isPrime(x) )
    {
        int sum1 = sumOfDigits(x), sum2 = sumOfPrimeFactors(x);
        if( sum1==sum2 ) return (true);
        else return (false);
    }
    return (false);
}

int main()
{
    scanf("%d", &tc);
    while( tc-- )
    {
        scanf("%d", &n);

        while( !smithNumber(++n) ) ;

        printf("%d\n", n);
    }
    return 0;
}