Cod sursa(job #1373900)
Utilizator | Data | 4 martie 2015 21:18:12 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
unsigned long long int n,a[10000],i,u,s,S;
int main()
{
f>>n;
for (i=1;i<=n;i++)
{f>>a[i];
for (u=1;u<=a[i];u++)
if (a[i]%u==0) {s++; S=S+u;}
g<<s<<" "<<S<<"\n";
s=0; S=0;
}
return 0;
}