Cod sursa(job #2352670)
| Utilizator | Data | 23 februarie 2019 16:12:33 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int n,nr;
long long sum_div(int n)
{
long long s = 0,d = 0;
int i;
for(i = 1; i * i < n; i++)
if(n % i == 0)
{
s+=i;
s+=(n/i);
d+=2;
s%=9973;
}
if(i * i == n)d++;;
g<<d<<" ";
return s;
}
int main()
{ f>>n;
for(int i=0;i<n;i++)
{
f>>nr;
g<<sum_div(nr)<<'\n';
}
return 0;
}
