結果

問題 No.598 オーバーフローファンタジー
ユーザー my316g
提出日時 2018-02-12 06:50:28
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 3 ms
コード長 3,192 Byte
コンパイル時間 1,072 ms
使用メモリ 1,516 KB
最終ジャッジ日時 2019-10-11 05:51:35

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_0_sample_1.txt AC 3 ms
1,516 KB
0_1_sample_2.txt AC 2 ms
1,512 KB
0_2_sample_3.txt AC 3 ms
1,512 KB
1_0.txt AC 2 ms
1,512 KB
1_1.txt AC 3 ms
1,512 KB
1_2.txt AC 3 ms
1,512 KB
1_3.txt AC 3 ms
1,512 KB
1_4.txt AC 2 ms
1,512 KB
1_5.txt AC 3 ms
1,512 KB
1_8.txt AC 3 ms
1,512 KB
1_9.txt AC 2 ms
1,516 KB
1_10.txt AC 2 ms
1,512 KB
2_0.txt AC 3 ms
1,512 KB
2_1.txt AC 3 ms
1,512 KB
2_2.txt AC 3 ms
1,516 KB
2_3.txt AC 3 ms
1,512 KB
2_4.txt AC 2 ms
1,516 KB
3_0.txt AC 3 ms
1,512 KB
3_1.txt AC 3 ms
1,512 KB
3_2.txt AC 3 ms
1,512 KB
3_3.txt AC 3 ms
1,512 KB
3_4.txt AC 3 ms
1,516 KB
4_1.txt AC 3 ms
1,516 KB
4_2.txt AC 3 ms
1,512 KB
4_3.txt AC 3 ms
1,516 KB
5_0.txt AC 3 ms
1,516 KB
5_1.txt AC 3 ms
1,516 KB
99_system_test1.txt AC 3 ms
1,512 KB
99_system_test2.txt AC 3 ms
1,516 KB
99_system_test3.txt AC 2 ms
1,512 KB
99_system_test4.txt AC 2 ms
1,512 KB
テストケース一括ダウンロード

ソースコード

diff #
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



int main()
{
	//clock_t start, end;
	//start = clock();

	//cin.tie(0);
	//ios::sync_with_stdio(false);

	int N;
	cin >> N;
	
	ll X, A, B;
	cin >> X >> A >> B;

	cout << min((X + A - 1) / A, ((1LL << (N - 1)) - X + B - 1) / B) << endl;

	//end = clock();
	//printf("%d msec.\k", end - start);

	return 0;
}
0