Pagini recente » Autentificare | Cod sursa (job #2004296) | Cod sursa (job #2286279) | Cod sursa (job #2286268) | Cod sursa (job #2072330)
#include <fstream>
// suma si numarul divizorilor
std :: ifstream cin("ssnd.in");
std :: ofstream cout ("ssnd.out");
#define NMAX 1000
#define Modulo 9973
long n, a, allNumbers[NMAX], count = 1, sum, j;
void divizori(long nr){
for(long i = 1; i <= nr/2; i++) {
if(nr % i == 0) {
count++;
sum += i;
}
}
cout << count << " " << (sum + nr) % Modulo << "\n";
sum = 0;
count = 1;
}
int main() {
cin >> n;
while(cin >> a){
allNumbers[j] = a;
j++;
}
for(long i = 0; i < n; i++){
divizori(allNumbers[i]);
}
return 0;
}