Submission #999060


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int X;

int ng(ll v) {
	int i;
	FOR(i,X) {
		if(v%2) v=v/2;
		else v=(v-1)/2;
	}
	if(v>2) return 1;
	return 0;
}

void solve() {
	int i,j,k,l,r,x,y,z; string s;
	
	cin>>X;
	ll A=(1LL<<60)-1;
	for(i=59;i>=0;i--) if(ng(A-(1LL<<i))) A-=1LL<<i;
	cout<<(A-1)<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}

Submission Info

Submission Time
Task F - Trichotomy
User kmjp
Language C++14 (GCC 5.4.1)
Score 100
Code Size 969 Byte
Status AC
Exec Time 3 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 1
AC × 41
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 384 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 3 ms 256 KB
subtask1_21.txt AC 3 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 2 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