Cod sursa(job #1247285)
Utilizator | Data | 22 octombrie 2014 16:31:43 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int t, n, div[9900], i, p, s, nr;
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>t;
for (i=1; i<=t; i++)
{
nr=0;
s=0;
f>>n;
p=1;
while (p<=n)
{
if (n%p==0)
{
nr++;
s+=p;
}
p++;
}
g<<nr<<" "<<s<<"\n";
}
return 0;
}