Submission #32541785

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;

int main() {

  ll n;
  cin >> n;
  ll x;
  x = pow(2,n);

  cout << x << endl;
  
}

Submission Info

Submission Time
Task A - 2^N
User takkey
Language C++ (GCC 9.2.1)
Score 100
Code Size 591 Byte
Status AC
Exec Time 8 ms
Memory 3972 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
random_01.txt AC 8 ms 3664 KiB
random_02.txt AC 2 ms 3660 KiB
random_03.txt AC 2 ms 3552 KiB
random_04.txt AC 2 ms 3864 KiB
random_05.txt AC 2 ms 3808 KiB
random_06.txt AC 2 ms 3972 KiB
random_07.txt AC 2 ms 3972 KiB
random_08.txt AC 2 ms 3816 KiB
sample_01.txt AC 2 ms 3816 KiB
sample_02.txt AC 2 ms 3704 KiB