Submission #1532775


Source Code Expand

    #include<iostream>
    #include<cstdio>
    #include<cmath>
    #include<cstring>
    #include<string>
    #include<stack>
    #include<queue>
    #include<vector>
    #include<algorithm>
    #include<iomanip>
    typedef long long int ll;
    using namespace std;
    #define FOR(i,a,b) for (int i=(a);i<(b);i++)
    #define REP(i,n) for (int i=0;i<(n);i++)
    #define EREP(i,n) for (int i=1;i<=(n);i++)
    #define ALL(a) (a).begin(),(a).end()
    //#define EVEL 1
     
    #ifdef EVEL
    #define DEB(X) cout << #X << ":" <<X<<" " ;
    #define TF(f) f ? cout<<"true  " : cout<<"false ";
    #define END cout<<"\n";
    #else
    #define DEB(X) {}
    #define TF(f) {}
    #define END {}
    #endif
    const int MOD = 1000000007;
    const int INF = 2000000000;
        ll ans=0,id;
        int N,M;
        ll A,B,C,W;
        int a[100010];
        bool f=false;
        ll sum=0;
        string S;
     
    int main(){
        ios_base::sync_with_stdio(false);
        cin>>N;
        A=1;
        while(A*2<=N){
            A*=2;
        }
        cout<<A;
        return 0;
    }

Submission Info

Submission Time
Task B - Break Number
User Nafmo2
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1141 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 17
Set Name Test Cases
Sample example0, example1, example2, example3
All example0, example1, example2, example3, handmade0, handmade1, handmade2, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9
Case Name Status Exec Time Memory
example0 AC 1 ms 256 KB
example1 AC 1 ms 256 KB
example2 AC 1 ms 256 KB
example3 AC 1 ms 256 KB
handmade0 AC 1 ms 256 KB
handmade1 AC 1 ms 256 KB
handmade2 AC 1 ms 256 KB
rand0 AC 1 ms 256 KB
rand1 AC 1 ms 256 KB
rand2 AC 1 ms 256 KB
rand3 AC 1 ms 256 KB
rand4 AC 1 ms 256 KB
rand5 AC 1 ms 256 KB
rand6 AC 1 ms 256 KB
rand7 AC 1 ms 256 KB
rand8 AC 1 ms 256 KB
rand9 AC 1 ms 256 KB