Cod sursa(job #1597659)
| Utilizator | Data | 12 februarie 2016 11:06:11 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
int t,i;
long long n;
void Divizori(int n){
long long nrD = 0, SD = 0, i;
for(i=1;i<=sqrt(n);i++){
if(n%i==0){
nrD+=2;
SD+=i + (n/i);
}
}
out<<nrD<<" "<<SD%9973<<endl;
}
int main()
{
in>>t;
for(i=0;i<t;i++){
in>>n;
Divizori(n);
}
}
