Pagini recente » Cod sursa (job #3209234) | Cod sursa (job #2602181) | Cod sursa (job #1256794) | Cod sursa (job #2923126) | Cod sursa (job #2623921)
#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;
}