Cod sursa(job #2131750)
| Utilizator | Data | 14 februarie 2018 22:09:29 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int long long y,Y;
void desc(int n)
{int long long d,k,x,i;
d=2;
y=1;Y=1;
while(n!=1)
{k=0;
while(n%d==0)
{n=n/d;
k=k+1;}
if(k>0)
{y=(y*(k+1))%9973;
x=1;
for(i=1;i<=k+1;i++) x=(x*d)%9973;
Y=(Y*((x-1)/(d-1)))%9973;}
if(d==2) d=3;
else d=d+2;
if(d*d>n) d=n;}
}
int main()
{int long long n,i,x;
f>>n;
for(i=1;i<=n;i++)
{f>>x;
desc(x);
g<<y<<" "<<Y<<endl;}
}
