Submission #19326

#TimeUsernameProblemLanguageResultExecution timeMemory
19326xdojuΣ (kriii4_P2)C++14
0 / 100
5 ms1120 KiB
#include <cstdio> using namespace std; const long long MOD = 1000000007ll; int m; int face[10000]; long modpow(long long r, long long n) { long long ret = 1; while (n > 0) { if (n % 2 > 0) { ret = (ret * r) % MOD; } r = (r * r) % MOD; n /= 2; } return ret; } long long modinv(int n) { return modpow(n, MOD - 2); } void proc() { int m; scanf("%d", &m); long long res = 1; for (int i = 0; i < m; ++i) { int face, sum; scanf("%d %d", &face, &sum); res = (res * sum) % MOD; res = (res * modinv(face)) % MOD; } printf("%lld", res); } int main() { proc(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...