Exponentiation Solution C++ : CSES Problem Set
CSES Problem Set Exponentiation TASK SUBMIT RESULTS STATISTICS HACKING Time limit: 1.00 s Memory limit: 512 MB Your task is to efficiently calculate values a^b modulo 10^9+7. Note that in this task we assume that 0^0=1. Input The first input line contains an integer n: the number of calculations. After this, there are n lines, each containing two integers a and b. Output Print each value a^b modulo 10^9+7. Constraints1 \le n \le 2 \cdot 10^5 0 \le a,b \le 10^9 Example Input:3 3 4 2 8 123 123 Output:81 256 921450052 Link to this code: https://cses.fi/paste/ced3e665267b063471beea/ #include <bits/stdc++.h> #include <iostream> #include <iomanip> #include <cmath> #include <string> #define MOD 1000000007 #define ell cout<<endl #define el endl #define pi 3.14159 #define forn(i, n) for (int i = 0; i < int(n); i++) #define ll long long #define ull unsigned long long #define ld long double #define vll vector<ll> #define pll pair<ll,ll> #de...