Cod sursa(job #2064557)
| Utilizator | Data | 12 noiembrie 2017 15:12:16 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
const int MOD=9973;
int T,Card,i ,Sum;
long long N;
int main()
{
fin>>T;
while(T--)
{
fin>>N;
Card=0;
Sum=0;
for(int i=1;i<sqrt(N);++i)
{
if(N%i==0)
{
Sum=(Sum+i+N/i)%MOD;
Card+=2;
if(i*i==N)
{
Card--;
Sum-=i;
}
}
}
fout<<Card<<" "<<Sum<<"\n";
}
return 0;
}
