Cod sursa(job #1822470)
| Utilizator | Data | 4 decembrie 2016 22:33:09 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.78 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
bool* v;
long long i,j,t,k,nr,n;
int main()
{
f>>t;
while(t!=0)
{
f>>n;
v=new bool[n+5];
v[n]={0};
nr=0;
long long s=0;
for(i=2;i<=n;i++)
{
if(v[i]==0 && n%i==0)
{
nr++;
s=s+i;
for(j=i+i;j<=n;j=j+i)
{
if(n%j==0 && v[j]==0)
{
nr++;
s=s+j;
v[j]=1;
}
}
}
}
g<<nr+1<<" "<<s+1<<endl;
t--;
}
}
