Pagini recente » Cod sursa (job #3173014) | Cod sursa (job #1645496) | Cod sursa (job #665007) | Cod sursa (job #1501032) | Cod sursa (job #1006793)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
#include <queue>
#include <deque>
#include <iomanip>
#include <stack>
#include <cstdio>
using namespace std;
ofstream fout("sum.out");
#define baza 10
#define MAX 100000
typedef long long int lli;
int i, nr, a[MAX+5], j, t, ki;
lli n,sum;
void ciur()
{
for(i=1;i<=MAX;i++)
{
a[i]=i-1;
}
for(i=2;i<=MAX;i++)
{
for(j=i+i;j<=MAX;j+=i)
{
a[j]-=a[i];
}
}
}
int main()
{
FILE *pFile, *g;
pFile=fopen ("sum.in","r");
g=fopen("sum.out", "w");
ciur();
fscanf(pFile,"%d", &t);
for(ki=1;ki<=t;ki++)
{
fscanf(pFile,"%lld", &n);
sum=2*n*a[n];
fprintf(g,"%lld\n", sum);
// fout<<sum<<"\n";
}
return 0;
}