Pagini recente » Cod sursa (job #1610425) | Cod sursa (job #2685485) | Cod sursa (job #1824645) | Cod sursa (job #1728312) | Cod sursa (job #3255053)
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
void divizori(long x){
int putere=1;
int div=1;
int nr_div;
int v[1000];
int s = 0;
{
while(div<=x){
while(x%div){
v[div]=putere;
putere++;
}
s+=div;
div++;
}
nr_div = 1;
for(int i=1;i<=sqrt(x);i++)
if(v[i]!=0){
nr_div *= i+1;
}
g<<nr_div<<" "<<s%9973<<endl;
}
}
int main()
{
int t,i,x[1000];
f>>t;
for(i=1;i<=t;i++)
f>>x[i];
for(i=1;i<=t;i++)
divizori(x[i]);
return 0;
}