Cod sursa(job #2032545)
Utilizator | Data | 5 octombrie 2017 11:42:10 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int k=0;
int szama(int n)
{
int s=2,i=2;
k=1+n;
for(i=2;i<=n/2;i++){
if(n%i==0){s++;k=k+i;}
}
return s;
}
int main()
{
int i,n,t[1000]={0};
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>n;
for(i=0;i<n;i++)f>>t[i];
for(i=0;i<n;i++){
g<<szama(t[i]);
g<<" "<<k<<endl;
}
}