Pagini recente » Cod sursa (job #1429241) | Cod sursa (job #312526) | Cod sursa (job #1567617) | Cod sursa (job #2722736) | Cod sursa (job #581427)
Cod sursa(job #581427)
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int prim(long long numar)
{long long d; int ok;
ok=1;
for(d=2;d<=sqrt(numar);d++)
if(numar%d==0) ok=0;
return ok;
}
long long powA(long long baza, long long exponent)
{long long k,putere;
putere=1;
for(k=1;k<=exponent+1;k++)
putere*=baza;
return putere;
}
int main()
{ long long n,nrdiv,sumadiv,j,fm,i; int t;
f>>t;
for(j=1;j<=t;j++)
{
f>>n; nrdiv=sumadiv=1; if(prim(n)) {nrdiv*=2; sumadiv*=(1+n);}
else {i=2;
do{fm=0;
while(n%i==0)
{fm++;
n/=i;}
nrdiv*=(fm+1);
sumadiv*=(powA(i,fm)-1)/(i-1);
i++;
}while(n!=1);
}g<<nrdiv<<" "<<sumadiv%9973<<'\n';}
}