Cod sursa(job #125947)
| Utilizator | Data | 20 ianuarie 2008 22:05:07 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <stdio.h>
#define nmax 100001
int main()
{
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
int T, n, s[nmax], p[nmax];
for (int i = 1; i < nmax; ++i)
p[i] = i - 1;
for (int i = 2; i < nmax; ++i)
for (int j = 2 * i; j < nmax; j += i)
p[j] -= p[i];
scanf("%d", &T);
for (int t = 1; t <= T; ++t) {
scanf("%d", &n);
printf("%lld\n", (long long)2 * n * p[n]);
}
return 0;
}
