Cod sursa(job #732169)
Utilizator | Data | 9 aprilie 2012 20:05:34 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
long long n,i,j,x,h,y,k,s,a[30005];
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n;i++)
{
s=0;
k=2;
x=a[i];
for (j=2;j<=x/2;j++)
if (x %j==0)
{
s=s+j;
k++;
}
s=s+x+1;
g<<k<<" "<<s<<"\n";
}
f.close();
g.close();
return 0;
}