Submission #1520220


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;
const bool debug = 0;
//----------------------//

int main() {
	int x; cin >> x;
	
	ll ans = 2;
	REP(i, x) ans = ans * 2 + ans - 1;
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task F - Trichotomy
User tkmst201
Language C++14 (GCC 5.4.1)
Score 0
Code Size 774 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
AC × 3
WA × 39
Set Name Test Cases
Sample sample_01.txt
All sample_01.txt, sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt WA 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt WA 1 ms 256 KB
subtask1_06.txt WA 1 ms 256 KB
subtask1_07.txt WA 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt WA 1 ms 256 KB
subtask1_10.txt WA 1 ms 256 KB
subtask1_11.txt WA 1 ms 256 KB
subtask1_12.txt WA 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask1_14.txt WA 1 ms 256 KB
subtask1_15.txt WA 1 ms 256 KB
subtask1_16.txt WA 1 ms 256 KB
subtask1_17.txt WA 1 ms 256 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt WA 1 ms 256 KB
subtask1_20.txt WA 1 ms 256 KB
subtask1_21.txt WA 1 ms 256 KB
subtask1_22.txt WA 1 ms 256 KB
subtask1_23.txt WA 1 ms 256 KB
subtask1_24.txt WA 1 ms 256 KB
subtask1_25.txt WA 1 ms 256 KB
subtask1_26.txt WA 1 ms 256 KB
subtask1_27.txt WA 1 ms 256 KB
subtask1_28.txt WA 1 ms 256 KB
subtask1_29.txt WA 1 ms 256 KB
subtask1_30.txt WA 1 ms 256 KB
subtask1_31.txt WA 1 ms 256 KB
subtask1_32.txt WA 1 ms 256 KB
subtask1_33.txt WA 1 ms 256 KB
subtask1_34.txt WA 1 ms 256 KB
subtask1_35.txt WA 1 ms 256 KB
subtask1_36.txt WA 1 ms 256 KB
subtask1_37.txt WA 1 ms 256 KB
subtask1_38.txt WA 1 ms 256 KB
subtask1_39.txt WA 1 ms 256 KB
subtask1_40.txt WA 1 ms 256 KB