Pagini recente » Cod sursa (job #1932037) | Cod sursa (job #1936193) | Cod sursa (job #470701) | Cod sursa (job #2406405) | Cod sursa (job #2691775)
#include <fstream>
#define ll long long
#define nmax 1000000
using namespace std;
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");
ll nrdiv[nmax + 1], sumdiv[nmax + 1];
inline void solve(){
ll n;
cin >> n;
for(int i = 1; i <= nmax; ++i){
nrdiv[i] = 0;
}
for(int i = 1; i <= nmax; ++i){
for(int j = 1; i * j <= nmax; ++j){
nrdiv[i * j]++;
}
}
for(int i = 1; i <= nmax; ++i){
sumdiv[i] = 0;
}
for(int i = 1; i <= nmax; ++i){
for(int j = 1; i * j <= nmax; ++j){
sumdiv[i * j] += i;
}
}
cout << nrdiv[n] << " " << sumdiv[n] << "\n";
}
int main(){
int n;
cin >> n;
for(int i = 1; i <= n; ++i)
solve();
return 0;
}