Submission #999081
Source Code Expand
#include <cstdio> #include <algorithm> #include <cmath> #include <queue> #include <vector> #include <map> #include <set> using namespace std; typedef pair<int , int> P2; typedef pair<pair<int , int> , int> P3; typedef pair<pair<int , int> , pair<int , int> > P4; #define Fst first #define Snd second #define PB(a) push_back(a) #define MP(a , b) make_pair((a) , (b)) #define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c)) #define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d))) #define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i) #define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i) #define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it) typedef long long LL; int x; LL a; int main(){ scanf("%d" , &x); a = 3; repp(i,0,x){ a = a * 2 + 1; } printf("%lld\n" , a-1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Trichotomy |
User | PIandS |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 907 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:30:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d" , &x); ^
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 | 1 ms | 128 KB |
subtask1_01.txt | AC | 1 ms | 128 KB |
subtask1_02.txt | AC | 1 ms | 128 KB |
subtask1_03.txt | AC | 1 ms | 128 KB |
subtask1_04.txt | AC | 1 ms | 128 KB |
subtask1_05.txt | AC | 1 ms | 128 KB |
subtask1_06.txt | AC | 1 ms | 128 KB |
subtask1_07.txt | AC | 1 ms | 128 KB |
subtask1_08.txt | AC | 1 ms | 128 KB |
subtask1_09.txt | AC | 1 ms | 128 KB |
subtask1_10.txt | AC | 1 ms | 128 KB |
subtask1_11.txt | AC | 1 ms | 128 KB |
subtask1_12.txt | AC | 1 ms | 128 KB |
subtask1_13.txt | AC | 1 ms | 128 KB |
subtask1_14.txt | AC | 1 ms | 128 KB |
subtask1_15.txt | AC | 1 ms | 128 KB |
subtask1_16.txt | AC | 1 ms | 128 KB |
subtask1_17.txt | AC | 1 ms | 128 KB |
subtask1_18.txt | AC | 1 ms | 128 KB |
subtask1_19.txt | AC | 1 ms | 128 KB |
subtask1_20.txt | AC | 1 ms | 128 KB |
subtask1_21.txt | AC | 1 ms | 128 KB |
subtask1_22.txt | AC | 1 ms | 128 KB |
subtask1_23.txt | AC | 1 ms | 128 KB |
subtask1_24.txt | AC | 1 ms | 128 KB |
subtask1_25.txt | AC | 1 ms | 128 KB |
subtask1_26.txt | AC | 1 ms | 128 KB |
subtask1_27.txt | AC | 1 ms | 128 KB |
subtask1_28.txt | AC | 1 ms | 128 KB |
subtask1_29.txt | AC | 1 ms | 128 KB |
subtask1_30.txt | AC | 1 ms | 128 KB |
subtask1_31.txt | AC | 1 ms | 128 KB |
subtask1_32.txt | AC | 1 ms | 128 KB |
subtask1_33.txt | AC | 1 ms | 128 KB |
subtask1_34.txt | AC | 1 ms | 128 KB |
subtask1_35.txt | AC | 1 ms | 128 KB |
subtask1_36.txt | AC | 1 ms | 128 KB |
subtask1_37.txt | AC | 1 ms | 128 KB |
subtask1_38.txt | AC | 1 ms | 128 KB |
subtask1_39.txt | AC | 1 ms | 128 KB |
subtask1_40.txt | AC | 1 ms | 128 KB |