Cod sursa(job #1908453)
Utilizator | Data | 7 martie 2017 08:32:20 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
int t,n,i,S[1000],c[1000],x,j;
int main()
{
in>>t;
for(i=1;i<=t;i++)
{
in>>n;
for(j=1;j<=sqrt(n);j++)
{
if(n%j==0)
{
x=n/j;
S[i]=S[i]+j+x;
c[i]=c[i]+2;
}
}
}
for(i=1;i<=t;i++)
{
out<<c[i]<<" "<<S[i]<<endl;
}
return 0;
}