Cod sursa(job #2623921)
| Utilizator | Data | 4 iunie 2020 10:04:23 | |
|---|---|---|---|
| Problema | Ridicare la putere in timp logaritmic | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 100019,
NMAX = 10001;
ifstream f("puteri2.in");
ofstream g("puteri2.out");
int A[NMAX];
int powlg(int a, int p)
{
long long x = a;
int val = 1;
while(p > 0)
{
if(p & 1)
val = val * x % MOD;
x = x * x % MOD;
p >>= 1;
}
return val;
}
int main()
{
int n, b, i;
long long sum = 0;
f >> n;
for(i = 1; i <= n; i++)
f >> A[i];
for(i = 1; i <= n; i++)
{
f >> b;
sum += powlg(A[i], b);
}
g << sum % MOD;
return 0;
}
