Cod sursa(job #808925)
Utilizator | Data | 7 noiembrie 2012 17:22:20 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long n , t, i , j , nr;
void div(long long n)
{
int i,nr=0;
int s=0;
for(i=1 ; i<=n ; i++)
{
if(n%i==0)
{
nr++;
s+=i;
}
}
g<<s<<" "<<nr<<"\n";
}
int main()
{
f>>t;
for(i=1 ; i<=t; i++)
{
f>>n;
div(n);
}
return 0;
}