Cod sursa(job #660145)
Utilizator | Data | 11 ianuarie 2012 19:46:34 | |
---|---|---|---|
Problema | Sum | Scor | 45 |
Compilator | cpp | Status | done |
Runda | winners12 | Marime | 1.17 kb |
#include<fstream>
using namespace std;
ifstream cin("sum.in");
ofstream cout("sum.out");
int N,a[100001],j,i,p, s,final[100];
int cememedece(long long x, long long y)
{ int r;
while(x%y!=0)
{
r=x%y;
x=y;
y=r;
}
return y;
}
int main()
{
cin>>N;
for(j=1;j<=N;j++)
{ cin>>a[j];
p=a[j]; s=0;
if(a[j]%2==0)
{ for(i=1;i<=2*a[j];i++)
if(cememedece(i,p)==1)
s+=i;}
else{
for(i=1;i<=2*a[j];i++)
{
if(cememedece(i,p)==1)
s+=i;
}}cout<<s<<"\n";}
return 0;
}