Pagini recente » Cod sursa (job #2888637) | Cod sursa (job #2093644) | Cod sursa (job #383741) | Cod sursa (job #1810984) | Cod sursa (job #1715257)
#include <iostream>
#include <fstream>
#include <vector>
#define MAX 1000005
using namespace std;
int main (void) {
vector<bool> ciur(MAX);
for(int i = 2; i <= MAX; i++){
if(ciur[i] == false){
for(int j = i + i; j <= MAX; j += i)
ciur[j] = true;
}
}
ifstream in("ssnd.in");
ofstream out("ssnd.out");
int T, N, S, div, counter;
in >> T;
while(T--){
S = 0;
counter = 0;
in >> N;
if(N==1){
out << 1 << ' ' << 1 << '\n';
}
else{
div = 1;
counter = 0;
while(div * div < N){
if(N % div == 0){
counter += 2;
S += div + N / div;
}
div++;
}
if(div * div == N){
counter++;
S += div;
}
out << counter << ' ' << S << '\n';
}
}
}