Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<set>
- #include<vector>
- #include<iostream>
- #include<algorithm>
- #include<cmath>
- #include<queue>
- #include<random>
- #include<ctime>
- #define x first
- #define y second
- #define all(x) x.begin(), x.end()
- #define pb push_back
- #define mp make_pair
- using namespace std;
- #define int long long
- void mini(int n,int l,int r){
- int ans = 1;
- int cnt = 1;
- while(cnt < l){
- cnt++;
- ans += (1 << (cnt - 1));
- }
- // cout << ans << endl;
- cout << ans + (n - cnt) << ' ';
- }
- void maxi(int n,int l,int r){
- int cnt = 1;
- int ans = 1;
- while(cnt < r){
- if(cnt == n){
- break;
- }
- cnt++;
- ans += (1 << (cnt - 1));
- }
- ans += (n - cnt) * (1 << (cnt - 1));
- cout << ans;
- }
- signed main(){
- int n,l,r;
- cin >> n >> l >> r;
- mini(n,l,r);
- maxi(n,l,r);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement