Cod sursa(job #731829)
Utilizator | Data | 9 aprilie 2012 11:56:12 | |
---|---|---|---|
Problema | Sum | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
#define MAX 100005
#define ll long long
using namespace std;
ifstream F("sum.in");
ofstream G("sum.out");
ll n,i,j,x;
int v[MAX];
int main(void)
{
F>>n;
for( i=1;i<=MAX;i++ )
v[i]=i-1;
for( i=2;i<=MAX;i++ )
for( j=i+i;j<=MAX;j+=i )
v[j]-=v[i];
for(i=1;i<=n;i++)
F>>x,G<<(long long)2*v[x]*x<<"\n";
}