Pagini recente » Cod sursa (job #2311425) | Cod sursa (job #2863064) | Cod sursa (job #877024) | Cod sursa (job #1494544) | Cod sursa (job #378918)
Cod sursa(job #378918)
#include <stdio.h>
#define MAX 100007
long long x;
int i, j, k, n;
long long sum;
int cmmdc (int a, int b)
{
int r;
while (b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
FILE *f = fopen ("sum.in","r");
FILE *g = fopen ("sum.out","w");
fscanf (f,"%d", &n);
/*for (i=1; i<=MAX; ++i)
ciur[i] = 1;
for (i=2; i*i<=MAX; ++i)
if (ciur[i])
for (j=2; i * j < MAX; ++j)
ciur[i*j] = 0;*/
for (i=0; i<n; ++i)
{
sum = 0;
fscanf (f,"%d", &x);
j = 1;
while (j >= 0 && j <= 2 * x)
{
if (cmmdc(x, j) == 1)
sum += j;
j ++;
}
fprintf (g,"%d\n", sum);
}
fclose(g);
fclose(f);
return 0;
}