Submission #72164216


Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
using ll  = long long;
using ull = unsigned long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
constexpr ll INF = ((1LL << 61) + (1LL << 30) - 1);

int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);

  ll n;
  cin >> n;
  cout << (1LL << n) - 2 * n << "\n";

  return 0;
}

Submission Info

Submission Time
Task A - 2^n - 2*n
User through
Language C++23 (GCC 15.2.0)
Score 100
Code Size 475 Byte
Status AC
Exec Time 1 ms
Memory 3628 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 11
Set Name Test Cases
Sample 01.txt, 02.txt, 11.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 3484 KiB
02.txt AC 1 ms 3544 KiB
03.txt AC 1 ms 3504 KiB
04.txt AC 1 ms 3628 KiB
05.txt AC 1 ms 3444 KiB
06.txt AC 1 ms 3404 KiB
07.txt AC 1 ms 3476 KiB
08.txt AC 1 ms 3612 KiB
09.txt AC 1 ms 3532 KiB
10.txt AC 1 ms 3484 KiB
11.txt AC 1 ms 3628 KiB