Cod sursa(job #848010)
| Utilizator | Data | 4 ianuarie 2013 18:36:09 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream is("ssnd.in");
ofstream os("ssnd.out");
int divprop(long int n)
{
int d=0;
for(int i=1;i<=n;i++)
if(n%i==0)
d=d+1;
return d;
}
long int sumadivprop(long int n)
{
int s=0;
for(int i=1;i<=n;i++)
if(n%i==0)
s=s+i;
return s;
}
int main()
{
long int a,n,s=0;
is>>n;
for(int i=0;i<n;i++)
{
is>>a;
os<<divprop(a)<<" "<<sumadivprop(a)%9973<<endl;
}
is.close();
os.close();
return 0;
}
