Pagini recente » Clasamentul arhivei de probleme | Cod sursa (job #1162086) | Cod sursa (job #2626012) | Cod sursa (job #2813515) | Cod sursa (job #459975)
Cod sursa(job #459975)
#include <iostream>
using namespace std;
int Sir[10000];
int DivNumber[10000];
int s[10000];
int N, i, j,;
int main() {
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;
}
system ("pause");
return 0;
}