Cod sursa(job #459988)
Utilizator | Iuliana Ionescu julliard | Data | 31 mai 2010 21:27:59 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int Sir[10000];
int DivNumber[10000];
int s[10000];
int N, i, j;
int main()
{freopen("ssdm.in", "r", stdin);
freopen("ssdm.out", "w", stdout);
cin >> N;
for (i = 1; i <= N; i++)
{ cin >> Sir[i];
for (j = 1; j <= Sir[i]; j++)
if (Sir[i] % j == 0)
s[i]=s[i]+j;
for (j = 1; j <= Sir[i]; j++)
if (Sir[i] % j == 0)
DivNumber[i]++;
cout<<DivNumber[i]<<" "<<s[i]%9973;
}
return 0;
}