Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define MOD 1000000007
- using namespace std;
- long long int powermod(long long int base, long long int power) {
- if (power == 0) {
- return 1;
- }
- else {
- long long int cur = powermod(base, power / 2);
- cur = cur * cur;
- cur = cur % MOD;
- if (power % 2 == 1)
- cur = cur * base;
- cur = cur % MOD;
- return cur;
- }
- }
- int main()
- {
- long long int n, x, maxi = -1000000007, premaxi = -1000000007, curr, prev;
- cin >> n >> x;
- n %= MOD;
- premaxi = (x * powermod(5, 1)) % MOD;
- maxi = premaxi * 5 % MOD;
- if(maxi < premaxi) {
- swap(maxi, premaxi);
- }
- prev = x * powermod(5, 2);
- for(int i = 3; i <= n; i++) {
- curr = prev * 5 % MOD;
- if(curr > maxi) {
- swap(maxi, premaxi);
- maxi = curr;
- }
- else {
- if(curr > premaxi) {
- premaxi = curr;
- }
- }
- prev = curr;
- }
- cout << premaxi << " " << maxi;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement