Cod sursa(job #1240014)
| Utilizator | Data | 10 octombrie 2014 10:21:31 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
long long mare=1000000,i,j
int main()
{
fin>>t;
for(i=2;i<=mare;i++)
{
if(viz[i]==0)
{
for(j=2;i*j<=mare*1000000;j++)
viz[i*j]=1;
}
}
for(i=1;i<=t;i++)
{
fin>>n;
numar=1;
x=n;
while(n)
{
for(j=2;j*j<=n;j++)
{
p=0;
while(n%j==0)
{
n=n/j;
p++;
}
v[j]=p;
numar=numar*(p+1);
for(m=1;m<=p+1;m++)
p1=p1*j;
}
}
