Cod sursa(job #932148)
| Utilizator | Data | 28 martie 2013 18:46:18 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int main ()
{
int t, n, i, j, k, a;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
fin >> t;
for ( i = 1; i <= t; i++ )
{
a = 0;
k = 0;
fin >> n;
for ( j = 1; j <= n; j++ )
{
if ( n % j == 0 )
{
a++;
k = j + k;
}
}
fout << a << " " << k << endl;
}
fin.close();
fout.close();
return 0;
}
