Cod sursa(job #3295978)
| Utilizator | Data | 10 mai 2025 12:22:49 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <iostream>
using namespace std;
#define MOD 1999999973
long long exponentiation_by_sq(long long n, long long p) {
if (p == 0)
return 1;
if (p % 2 == 0)
return exponentiation_by_sq(n * n % MOD, p / 2) % MOD ;
if (p % 2 == 1) {
return n * exponentiation_by_sq(n * n % MOD, (p - 1) / 2) % MOD;
}
return 1;
}
int main() {
ifstream fin("lgput.in");
ofstream fout("lgput.out");
unsigned int n, p;
fin >> n >> p;
fout << exponentiation_by_sq(n, p);
return 0;
}