Cod sursa(job #1410511)
Utilizator | Data | 31 martie 2015 09:04:01 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <cmath>
#define mod 9973
using namespace std;
ifstream fin("ssnd.in");ofstream fout("ssnd.out");
int i,n,d,x,cati,s;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;s=0;cati=0;
for(d=2;d<=x/2;d++) if(x%d==0) {s+=d;cati++;}
fout<<cati+2<<' '<<(s+1+x)%mod<<'\n';
}
return 0;
}