Cod sursa(job #1597503)
| Utilizator | Data | 12 februarie 2016 00:54:59 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <cmath>
#define MOD 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int t;
int nr_Div(int n)
{
int nr=0,i;
int x=(int)sqrt(n);
for(i=1;i<=x;++i)
if(n%i==0) nr+=2;
if((int)sqrt(n)==(double)sqrt(n)) nr--;
return nr;
}
int sum(int n)
{
int s=0,i;
for(i=1;i<=n;++i)
if(n%i==0) s+=i;
return s;
}
int main()
{
int i,n;
f>>t;
for(i=1;i<=t;++i){
f>>n;
g<<nr_Div(n)<<" ";
g<<sum(n)%MOD<<"\n";
}
f.close();
g.close();
return 0;
}
