Submission #1004677
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; } template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; } int main() { //1 + 2x <= N int X; while(~scanf("%d", &X)) { ll ans = 1; rep(i, X + 1) ans = ans * 2 + 1; printf("%lld\n", ans - 1); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Trichotomy |
User | anta |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 763 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt |
All | 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 | 3 ms | 256 KB |
subtask1_01.txt | AC | 3 ms | 256 KB |
subtask1_02.txt | AC | 3 ms | 256 KB |
subtask1_03.txt | AC | 3 ms | 256 KB |
subtask1_04.txt | AC | 3 ms | 256 KB |
subtask1_05.txt | AC | 3 ms | 256 KB |
subtask1_06.txt | AC | 3 ms | 256 KB |
subtask1_07.txt | AC | 3 ms | 256 KB |
subtask1_08.txt | AC | 3 ms | 256 KB |
subtask1_09.txt | AC | 3 ms | 256 KB |
subtask1_10.txt | AC | 3 ms | 256 KB |
subtask1_11.txt | AC | 3 ms | 256 KB |
subtask1_12.txt | AC | 3 ms | 256 KB |
subtask1_13.txt | AC | 3 ms | 256 KB |
subtask1_14.txt | AC | 3 ms | 256 KB |
subtask1_15.txt | AC | 3 ms | 256 KB |
subtask1_16.txt | AC | 3 ms | 256 KB |
subtask1_17.txt | AC | 3 ms | 256 KB |
subtask1_18.txt | AC | 3 ms | 256 KB |
subtask1_19.txt | AC | 3 ms | 256 KB |
subtask1_20.txt | AC | 2 ms | 256 KB |
subtask1_21.txt | AC | 2 ms | 256 KB |
subtask1_22.txt | AC | 3 ms | 256 KB |
subtask1_23.txt | AC | 3 ms | 256 KB |
subtask1_24.txt | AC | 3 ms | 256 KB |
subtask1_25.txt | AC | 3 ms | 256 KB |
subtask1_26.txt | AC | 3 ms | 256 KB |
subtask1_27.txt | AC | 3 ms | 256 KB |
subtask1_28.txt | AC | 3 ms | 256 KB |
subtask1_29.txt | AC | 3 ms | 256 KB |
subtask1_30.txt | AC | 3 ms | 256 KB |
subtask1_31.txt | AC | 3 ms | 256 KB |
subtask1_32.txt | AC | 3 ms | 256 KB |
subtask1_33.txt | AC | 3 ms | 256 KB |
subtask1_34.txt | AC | 3 ms | 256 KB |
subtask1_35.txt | AC | 3 ms | 256 KB |
subtask1_36.txt | AC | 3 ms | 256 KB |
subtask1_37.txt | AC | 3 ms | 256 KB |
subtask1_38.txt | AC | 3 ms | 256 KB |
subtask1_39.txt | AC | 3 ms | 256 KB |
subtask1_40.txt | AC | 3 ms | 256 KB |