Cod sursa(job #1035471)
| Utilizator | Data | 18 noiembrie 2013 16:46:03 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
long t[1000][3],m,n,i,j,maxx,smax;
int main()
{
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
cin>>m;
for(i=1;i<=m;i++)
{
cin>>t[i][0];
t[i][1]=1;
t[i][2]=1;
if(t[i][0]>maxx)
maxx=t[i][0];
}
smax=sqrt(maxx);
for(j=2;j<=maxx;j++)
{
for(i=1;i<=m;i++)
if(t[i][0]%j==0)
{
t[i][1]++;
t[i][2]+=j;
}
}
for(i=1;i<=m;i++)
cout<<t[i][1]<<" "<<t[i][2]<<endl;
//cout << "Hello world!" << endl;
return 0;
}
