Cod sursa(job #2413604)
| Utilizator | Data | 23 aprilie 2019 16:03:12 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define Dim 1004
#define MOD 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int T;
typedef long long ll;
ll X;
int main()
{
f>>T;
for(int i=1;i<=T;i++)
{
f>>X;
ll sum=0,cnt=0;;
for(int j=1;j*j<=X;j++)
if(X%j==0)
{
if(j!=(X/j))
{
cnt+=2;
sum=(sum+(j+(X/j))%MOD)%MOD;
}
else
{
cnt++;
sum=(sum+j%MOD)%MOD;
}
}
g<<cnt<<" "<<sum<<'\n';
}
return 0;
}
