Submission #72185026

Source Code Expand

from sys import stdin,stdout
# from os import _exit
# from bisect import bisect_left,bisect
# from heapq import heapify,heappop,heappush
# from sys import setrecursionlimit
# from collections import defaultdict,Counter,deque
# from itertools import permutations
# from math import gcd,ceil,sqrt,factorial
# setrecursionlimit(int(1e5))
input,print = stdin.readline,stdout.write

n = int(input())
ans = pow(2,n)-n-n
print(f"{ans}\n")

Submission Info

Submission Time
Task A - 2^n - 2*n
User aviral
Language Python (PyPy 3.11-v7.3.20)
Score 100
Code Size 446 Byte
Status AC
Exec Time 57 ms
Memory 79924 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 56 ms 79660 KiB
02.txt AC 56 ms 79700 KiB
03.txt AC 56 ms 79924 KiB
04.txt AC 57 ms 79416 KiB
05.txt AC 57 ms 79748 KiB
06.txt AC 57 ms 79716 KiB
07.txt AC 56 ms 79716 KiB
08.txt AC 56 ms 79748 KiB
09.txt AC 56 ms 79660 KiB
10.txt AC 57 ms 79716 KiB
11.txt AC 57 ms 79536 KiB