Cod sursa(job #1600919)
Utilizator | Data | 15 februarie 2016 15:35:00 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int main()
{
unsigned long long n,cif;
int t,nr=0;
f>>t;
for(int i=1;i<=t;i++)
{
f>>n;
nr=0;
cif=0;
for(int k=1;k<=n/2;k++)
{
if((n%k)==0)
{
nr++;
cif+=k;
}
}
g<<nr+1<<" "<<cif+n;
g<<'\n';
}
return 0;
}