Pagini recente » Istoria paginii runda/ziua_recursivitatii/clasament | Cod sursa (job #2669592) | Cod sursa (job #1026363) | Cod sursa (job #2200754) | Cod sursa (job #1266682)
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
int f,n,p,nrdiv,sdiv,n2,numar,k;
nrdiv=1;
cin>>n;
f=2;
for(k=1;k<=n;k++)
{
cin>>numar;
n2=numar;
sdiv=1+numar;
while(numar!=1)
{
p=0;
while(numar%f==0)
{
p++;
numar=numar/f;
}
if(n2%f==0)
sdiv=sdiv+f;
nrdiv=nrdiv*(p+1);
f++;
}
cout<<nrdiv<<" "<<sdiv%9973<<endl;
}
return 0;
}