Cod sursa(job #1785390)
| Utilizator | Data | 21 octombrie 2016 10:24:57 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g
ifstream f ("ssnd.in");
ofstream g ("ssnd.out");
long long n;
int t;
int main() {
in >> t;
for(int i = 1; i <= t; i++) {
in >> n;
int coun = 0;
long long sum = 0;
for(int j = 1; j <= sqrt(n); j++) {
if(n % j == 0) {
sum += (n / j);
sum += j;
coun += 2;
}
}
out << coun << " " << sum % 9973 << endl;
}
}
