Cod sursa(job #1766628)
| Utilizator | Data | 28 septembrie 2016 10:48:22 | |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <cstdio>
#define MOD 9901
using namespace std;
int rise(int x, int p)
{
int nr = 1;
for (int i = 0; p>>i; i++) {
if ((p>>i) & 1) {
nr = (1LL * nr * x) % MOD;
}
x = (1LL*x*x) % MOD;
}
return nr;
}
int invers(int x)
{
return rise(x, MOD-2);
}
int main()
{
freopen("sumdiv.in", "r", stdin);
freopen("sumdiv.out", "w", stdout);
for (int i = 2; i <= 100; i++)
{
cout << i * invers(i) % MOD << "\n";
}
return 0;
}
