Pagini recente » Cod sursa (job #1848308) | Cod sursa (job #2114050) | Cod sursa (job #1300873) | Cod sursa (job #2248571) | Cod sursa (job #349937)
Cod sursa(job #349937)
#include<fstream>
#define dmax 200003
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
int n,t;
bool tmp[dmax];
void solve()
{ int i,j;
long long s=0;
for(i=2;i<=n;i++)
if((n%i==0)&&(tmp[i]==0))
for(j=i;j<=2*n+1;j+=i)
tmp[j]=1;
for(i=1;i<=2*n;i++)
if(!tmp[i])
s+=i;
out<<s<<'\n';
for(i=2;i<=n;i++)
if((n%i==0)&&(tmp[i]==1))
for(j=i;j<=2*n+1;j+=i)
tmp[j]=0;
}
int main()
{ int i;
in>>t;
for(i=1;i<=t;i++)
{ in>>n;
solve();
}
in.close();
out.close();
return 0;
}