Problem:


Score : 100 points

Problem Statement

Given is an integer x that is greater than or equal to 0, and less than or equal to 1.
Output 1 if x is equal to 0, or 0 if x is equal to 1.

Constraints

0 \leq x \leq 1

x is an integer

Input

Input is given from Standard Input in the following format:

x

Output

Print 1 if x is equal to 0, or 0 if x is equal to 1.

Sample Input 1

1

Sample Output 1

0

Sample Input 2

0

Sample Output 2

1



Sample input:
1


Sample output:
0

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    print(1 if x == 0 else 0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    x = int(readline())

    print(1 - x)

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = 10**6#float('inf')
mod = 10 ** 9 + 7 
#mod = 998244353
#from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10

print(INT()^1)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a = inp()
print(a^1)

Submission status: Accepted

Solution code:
X=int(input())
if X==0:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
N = int(input())

print(1-N)

Submission status: Accepted

Solution code:
import sys
from sys import exit
from collections import deque
from copy import deepcopy
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import gcd, sin, cos, tan, asin, acos, atan, degrees, radians

sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7

def lcm(x,y):
    return x*y//gcd(x,y)
def lgcd(l):
    return reduce(gcd,l)
def llcm(l):
    return reduce(lcm,l)
def powmod(n,i,mod):
    return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod)
def div2(x):
    return x.bit_length()
def div10(x):
    return len(str(x))-(x==0)
def intput():
    return int(input())
def mint():
    return map(int,input().split())
def lint():
    return list(map(int,input().split()))
def ilint():
    return int(input()), list(map(int,input().split()))
def judge(x, l=['Yes', 'No']):
    print(l[0] if x else l[1])
def lprint(l, sep='\n'):
    for x in l:
        print(x, end=sep)
def ston(c, c0='a'):
    return ord(c)-ord(c0)
def ntos(x, c0='a'):
    return chr(x+ord(c0))
class counter(dict):
    def __init__(self, *args):
        super().__init__(args)
    def add(self,x,d=1):
        self.setdefault(x,0)
        self[x] += d
    def list(self):
        l = []
        for k in self:
            l.extend([k]*self[k])
        return l
class comb():
    def __init__(self, n, mod=None):
        self.l = [1]
        self.n = n
        self.mod = mod
    def get(self,k):
        l,n,mod = self.l, self.n, self.mod
        k = n-k if k>n//2 else k
        while len(l)<=k:
            i = len(l)
            l.append(l[i-1]*(n+1-i)//i if mod==None else (l[i-1]*(n+1-i)*powmod(i,-1,mod))%mod)
        return l[k]
def pf(x,mode='counter'):
    C = counter()
    p = 2
    while x>1:
        k = 0
        while x%p==0:
            x //= p
            k += 1
        if k>0:
            C.add(p,k)
        p = p+2-(p==2) if p*p<x else x
    if mode=='counter':
        return C
    S = set([1])
    for k in C:
        T = deepcopy(S)
        for x in T:
            for i in range(1,C[k]+1):
                S.add(x*(k**i))
    if mode=='set':
        return S
    if mode=='list':
        return sorted(list(S))

x=intput()
if x==0:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


print(1-I())

Submission status: Accepted

Solution code:
i = input();print(0 if i=="1" else 1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
print(N ^ 1)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x = int(input())
    print(1 if x == 0 else 0)



if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from math import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
#mod = 998244353
INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
x = I()
print(0 if x else 1)

Submission status: Accepted

Solution code:
x=int(input())
print(1-x)

Submission status: Accepted

Solution code:
X = int(input())
print(1-X)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


def main():
    x = int(input())
    print(1 - x)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

print(1-II())

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for _ in range(n)]
def LIR(n):
    return [LI() for _ in range(n)]
def SR(n):
    return [S() for _ in range(n)]
def LSR(n):
    return [LS() for _ in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = I()
    print(1-x)
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

x=int(input())
print(int(not x))

Submission status: Accepted

Solution code:
# URL : https://atcoder.jp/contests/abc178/tasks/abc178_a

def Yes(f): print('Yes' if f else 'No')
def YES(f): print('YES' if f else 'NO')
def ispow(x): return int(x ** 0.5) ** 2 == x


res = 0
n = int(input())
# a, b = map(int, input().split())
# a, b, c = map(int, input().split())
# a, b, c, d = map(int, input().split())

print(n^1)
# print(res)_

Submission status: Runtime Error

Solution code:
x = int(input())
if x == 0:
  print(1)
elif x == 1:
  print(0)
else:
  break

Submission status: Runtime Error

Solution code:
import sys

a = sys.argv[1]

print(f'{1 - a}')

Submission status: Runtime Error

Solution code:
x = input()
if x == 0:
  print(1)
  else:
    print(0)

Submission status: Runtime Error

Solution code:
n = int(input())
 
x = []
y = []
distance = []
 
for i in range(n):
  x1, y1 = input().split()
  x1 = int(x1)
  y1 = int(y1)
  x.append(x1)
  y.append(y1)
 
for i in range(len(x)):
  for j in range(i+1,len(x)):
    temp = abs(x[i] - x[j]) + abs(y[i] - y[j])
    distance.append(temp)

 
for i in range(len(distance)-1):
  if distance[i] >= distance[i+1]:
    a = distance[i]
 
print(a)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin>>N;
  cout<<1-N;
}

Submission status: Runtime Error

Solution code:
s=input()

if s > 0:
    print(1)
else:
    print(0)

Submission status: Runtime Error

Solution code:
def fun(x):
    x = int(input())
    if x==0:
        return 1
    else:
        return 0

print(fun(x))

Submission status: Runtime Error

Solution code:
def fun(x):
    x = int(input())
    if x=0:
        return 1
    else:
        return 0

print(fun(x))

Submission status: Runtime Error

Solution code:
def fun(x)

x = int(input())

if x=0:
    return 1
else:
    return 0

print(fun(x))

Submission status: Runtime Error

Solution code:
x=int(input())
if x==!:
  print(0)
else:
  print(1)

Submission status: Runtime Error

Solution code:
a,b,c,d=list(map(int,input().split()))
if (b and d)<=0:
  print(a*c)
elif (b or d)<=0:
  print(a*c)
else:
  print(d*b)

Submission status: Runtime Error

Solution code:
a,b,c,d=list(map(int,input().split()))
if (b and d)<=0:
  print(a*c)
elif (b of d)<=0:
  print(a*c)
else:
  print(d*b)

Submission status: Runtime Error

Solution code:
import sys
x = int(sys.stdin.read().strip())
print int(not x)

Submission status: Runtime Error

Solution code:
x = int(input())

if x == 1:
  print(0)
  
if X == 0:
  print(1)

Submission status: Runtime Error

Solution code:
x = input()

if x == 1:
  print(0)
  
if X == 0:
  print(1)

Submission status: Runtime Error

Solution code:
a=input()
if a==0:
	print(1)
else if a==1:
  	print(0)

Submission status: Runtime Error

Solution code:
x = input()

if x = "1":
  print(0)
elif x = "0":
  print(1)

Submission status: Runtime Error

Solution code:
n = int(input())

if(n == 0):
    print(1)
else if(n == 1):
    print(0)

Submission status: Runtime Error

Solution code:
n = int(input())

if(n == 0):
    printf(1)
else if(n == 1):
    printf(0)

Submission status: Runtime Error

Solution code:
n = int(input())

if(n == 0):
    printf(1)
if(n == 1):
    printf(0)

Submission status: Runtime Error

Solution code:
n = int(input())

if(n == 0):
    printf(1)
if(n == 1):
    printf("0")

Submission status: Runtime Error

Solution code:

if x == 0:
 print(1)
else:
 print(0)

Submission status: Runtime Error

Solution code:
N=int(niput())
print(1 - N)

Submission status: Runtime Error

Solution code:
if x == 0:
 print(1)
else:
 print(0)

Submission status: Runtime Error

Solution code:
x = input()
x = input()
if x == 0:
    print(1)
elif x == 1:
    print(0)

Submission status: Runtime Error

Solution code:
print(1-int(input())

Submission status: Runtime Error

Solution code:
if x == 0:
  return 1
else:
  return 0

Submission status: Runtime Error

Solution code:
input = int(input())
if input == 0: return 1
return 0

Submission status: Runtime Error

Solution code:
if x == 0:
 print('1')
elif x == 1:
 print('0')

Submission status: Runtime Error

Solution code:
x = input()
x == 0
print 1
x == 1 
print 0

Submission status: Runtime Error

Solution code:


if x==0
print 1
if x == 1
ptint 0

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;
import java.lang.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int a = sc.nextInt();
        
        if (a==0)
            System.out.println("1");
        else
            System.out.println("0");


    }
}

Submission status: Runtime Error

Solution code:
if x==0:
  return 1
elif x==1:
  return 0
else:
  break

Submission status: Runtime Error

Solution code:
print(~input())

Submission status: Runtime Error

Solution code:
x=int(input())
if x==0:
  ans=1
else x==1:
  ans=0
  
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
print(!n)

Submission status: Runtime Error

Solution code:
x=int(input())
print(!x)

Submission status: Runtime Error

Solution code:
def(x)
 if x == 1
  return 0
return 1

Submission status: Runtime Error

Solution code:
x = input()
if x ==0:
  print(1)
else x == 1:
  print(0)

Submission status: Runtime Error

Solution code:
if x==1 :
  print(0)
else :
  print(1)

Submission status: Runtime Error

Solution code:
if x==1 :
  print(0)
else print(1)

Submission status: Runtime Error

Solution code:
x=int(input('Enter 0~1:'))
if x==0:
  print('1')
  elif x==1:
    print('0')
    else:
      print('')

Submission status: Runtime Error

Solution code:
x=int(input('x='))
if x=0:
  print('1')
  else:
    print('0')

Submission status: Runtime Error

Solution code:
x=int(input('x='))
if x==0:
  print('1')
  else x==1:
    print('0')

Submission status: Runtime Error

Solution code:
x=int(input)
if int(x)=0:
  print('1')
  elif int(x)=1:
    print('0')

Submission status: Runtime Error

Solution code:
x=input('Enter number:')
if int(x)==0:
  print('1')
  else:
    print('0')

Submission status: Runtime Error

Solution code:
x=input()
if x==1:
  print("0")
elif x==0:
  print("1")
else:
  break

Submission status: Runtime Error

Solution code:
if x = 0:
  print(1)

else:
  print(0)

Submission status: Runtime Error

Solution code:
input(a)
if a == '0':
  print('1')
elif a == '1':
  print('0')

Submission status: Runtime Error

Solution code:
x=include("xを入力してください")
if x==1:
  print("0")
else:
  print("1")

Submission status: Runtime Error

Solution code:
a=input()
if a=='1':
  print('0')
 else:
  print('1')

Submission status: Runtime Error

Solution code:
x=input(xを入力してください)
if x==1:
  print("0")
 elif x==0:
  print("1")

Submission status: Runtime Error

Solution code:
n=int(input())
import sys
a=list(map(int,input().split()))
b=list(map(int,input().split()))
d={}
if(n==1):
    if(a==b): print('No')
    else: print('Yes')
    sys.exit()
possible=True
for x in b:
    if(d.get(x)==None):
        d[x]=1
    else:
        d[x]+=1
    if(d[x]>(n)//2):
        possible=False
        break
if(not possible):
    print('No')
else:
    b.sort(reverse=True)
    k=0
    j=n-1
    turn=True
    for i in range(0,n):
        # print(turn)
        if(b[i]==a[i]):
            if(turn):
                # swap(a[k],a[i])
                b[k],b[i]=b[i],b[k]
                k+=1
            else:
                # swap(a[j],a[i])
                b[j], b[i] = b[i], b[j]
                j-=1
            turn=not turn
    print(b)

Submission status: Runtime Error

Solution code:
i = int(input())
if i = 0:
  print(1)
elif i = 1:
  print(0)
  
else:
  pass

Submission status: Runtime Error

Solution code:

n = int(input())
if n == 1:
	print(0)
elif: n == 0
	print(1)

Submission status: Runtime Error

Solution code:
t=int(input())
if(t==1):
  print(0)
else:
  print(1)/

Submission status: Runtime Error

Solution code:
x=input().rstrip.split(" ")
z=[]
for i in range(2):
	z.append(x[i-2]*x[0])
    z.append(x[i-2]*x[1])
print(max(z))

Submission status: Runtime Error

Solution code:
x=int(input())
if x==1:
  print("0")
else:
  print("1!)

Submission status: Runtime Error

Solution code:
x=int(input())
if x.=0:
    print(0)
else:
    print(1)

Submission status: Runtime Error

Solution code:
print("1") if input() == 0; else("0")

Submission status: Runtime Error

Solution code:
x=input()
if x==0:
  print(1)
else if x==1:
  print(0)

Submission status: Runtime Error

Solution code:
n = int(input())
return 0 if n == 1 else n

Submission status: Runtime Error

Solution code:
0 <= x <= 1
print(1-x)

Submission status: Runtime Error

Solution code:
if x == 0:
  print(1)
elif x == 1:
  print(0)

Submission status: Runtime Error

Solution code:
x = int(input())
y = !x
print(y)

Submission status: Runtime Error

Solution code:
x = int(input())
print(!x)

Submission status: Runtime Error

Solution code:
import sys
x=int(sys.argv)

print ([0 if i==1 else 1 for i in x])

Submission status: Runtime Error

Solution code:
!

Submission status: Runtime Error

Solution code:
def conj(n):
  if n==0:return 1
  return 0

print(conj(int(input()))

Submission status: Runtime Error

Solution code:
if x==1
	print(0)
elif x==0
	print(1)

Submission status: Runtime Error

Solution code:
if x===1 
	print(0)
elif x===0
	print(1)

Submission status: Runtime Error

Solution code:
if x == 0:
  print(1)
  
else:
  print(0)

Submission status: Runtime Error

Solution code:
if x==0:
    print('1')
else:
    print('0')

Submission status: Runtime Error

Solution code:
if x=1:
  print(0)
if x=0:
  print(1)

Submission status: Runtime Error

Solution code:
x = input()

if x = 0 :
  print(1)
else :
  print(0)

Submission status: Runtime Error

Solution code:
x = int(input())
if x == 1:
  print(0)
else if x == 0:
  print(1)

Submission status: Runtime Error

Solution code:
x = int(input())

if x = 0:
  print(1)
elif x = 1:
  print(0)

Submission status: Runtime Error

Solution code:
if x == 0:
    print(1)
else:
    print(0)

Submission status: Runtime Error

Solution code:
def main(x):
    if x =1:
        return 0
    else:
        return 1

main(x)

Submission status: Runtime Error

Solution code:
def main():
    if x =1:
        return 0
    else:
        return 1

main()

Submission status: Runtime Error

Solution code:
def main():
    if x =1:
        return 0
    elif x !=1:
        return 1

main()

Submission status: Runtime Error

Solution code:
！

Submission status: Runtime Error

Solution code:
if x = 0:
  print(1)
else:
  print(0)

Submission status: Runtime Error

Solution code:
n = int(input())
if n == 0 {
	print(1)
} else n == 1 {
	print(0)
}

Submission status: Runtime Error

Solution code:
 n = int(input())
  
print(1-n)

Submission status: Runtime Error

Solution code:
a = input().split(" ")

x = [int(a[0]),int(a[1])]
y = [int(a[2]),int(a[3])]

ans = []

for i in x:
  for j in y:
    s = i*j
    
    ans.append(s)
ans.sort(reverse = True)  
print(ans[0])

Submission status: Runtime Error

Solution code:
x = int(input())

if x == 1:
  print(0)
elif X == 0:
  print(1)

Submission status: Runtime Error

Solution code:
def _print():
  a = int(input())
  print(1 if a == 0 else 0)

if __name__ = '__main__':
  _print()

Submission status: Runtime Error

Solution code:
x = int(input)
if x == 0:
	print(1)
else:
  print(0)

Submission status: Runtime Error

Solution code:
num = int(input())
if num == 1:
  print(0)
 else:
  print(1)

Submission status: Runtime Error

Solution code:
num = int(input())
if num == 1:
  print(1)
 else:
  print(0)

Submission status: Runtime Error

Solution code:
num = input()
if num == 1:
  print(1)
 else:
  print(0)

Submission status: Runtime Error

Solution code:
x = input()
print(1 - x)

Submission status: Runtime Error

Solution code:
d,t,s=map(int,input().split())
if s*t >= d:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N = int(input())

print((10 ** N - 2 * 9 ** N + 8 ** N % (10 ** 9 + 7))

Submission status: Runtime Error

Solution code:
print((10 ** int(input()) - 2 * 9 ** int(input()) + 8 ** int(input())) % (10 ** 9 + 7))

Submission status: Runtime Error

Solution code:
while True:
  	try:
		x = input()
		if x == 1:
  			print(0)
   			break
        elif x ==0:
            print(1)
            break
        else:
            continue
	except:
      	print('invalid input')
        continue

Submission status: Runtime Error

Solution code:
while True:
	x = input()
	if x == 1:
  		print(0)
   		break
	elif x ==0:
  		print(1)
        break
    else:
      continue

Submission status: Runtime Error

Solution code:
bool a = input()
print(!a)

Submission status: Runtime Error

Solution code:
print(!(int)(input()))

Submission status: Runtime Error

Solution code:
print(!input())

Submission status: Runtime Error

Solution code:
N=int(input())
p=[]
for i in range(N):
    p.append(list(map(int, input().split())))
q=[]
for i in range(N):
    for j in range(N-i):
        q.append(abs(p[i][0]-p[i+j][0])+abs(p[i][1]-p[i+j][1]))
print(max(q))

Submission status: Runtime Error

Solution code:
a = int(input())
if a==1
 print(0);
else
 print(1);

Submission status: Runtime Error

Solution code:
tmp = input()
if tmp = "0":
  print("1")
else:
  print("0")

Submission status: Runtime Error

Solution code:
for i in range(2):
    print(" " * 100000000)

Submission status: Runtime Error

Solution code:
print(" " * 200000000)

Submission status: Runtime Error

Solution code:
x=int(input())
if x==0:
  print 1
elif x==1:
  print 0

Submission status: Runtime Error

Solution code:
s = int(input())
#最後に切った場所がiであるようなパターンの数をdp[i]とする
dp=[0]*(s+1)
dp[0]=1
if s<3:
  print("0")
for i in range(3,s+1):
  dp[i]=dp[i-1]+dp[i-3]
  dp.append(dp[i])
  score=dp[s]%(10**9+7)
print(score)

Submission status: Runtime Error

Solution code:
x = intZ(input())

print(0 if x else 1)

Submission status: Runtime Error

Solution code:
N=int(input())
if N == 1:
    print(0)
elif N==o:
    print(1)

Submission status: Runtime Error

Solution code:
import math
n=int(input())
print(mod(pow(2,n)-2,1000000007))

Submission status: Runtime Error

Solution code:
import math
n=input()
print(mod(pow(2,n)-2,1000000007))

Submission status: Runtime Error

Solution code:
x = input()

if x == 1:
  y = 0
elif x == 0:
  y = 1
print(y)

Submission status: Runtime Error

Solution code:
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const int NINF = -1*INF;
const long long LLINF = 1ll << 60;
const long long LLNINF = -1*LLINF;

template <class Ch, class Tr, class Container>
basic_ostream <Ch, Tr> & operator << (basic_ostream <Ch, Tr> & os, Container const& x) {
    os << "{ ";
    for(auto& y : x) os << y << " ";
    return os << "}";
}

template <class X, class Y>
ostream & operator << (ostream & os, pair <X, Y> const& p) {
	return os << "[ " << p.first << ", " << p.second << "]" ;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef vector<vector<int>> vvi;
typedef vector<vll> vvll;
typedef vector<vd> vvd;
typedef vector<vld> vvld;
 
#define mp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define revAll(x) x.rbegin(), x.rend()
#define gcd(a, b) __gcd(a, b)
#define popcount(x) __builtin_popcount(x)
#define isize(x) (int)(x.size())
#define rep(i,n) for(int i = 0; i < n; i++)
#define umap unordered_map
#define uset unordered_set
#define pq priority_queue

const ll MOD = 1e9 + 7;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
	int x; cin >> x;
	cout << (x == 1 ? "0" : "1");
}

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
print(max(a*c, a*d, b*c, b*d))

Submission status: Runtime Error

Solution code:
 tmp = 10 ** 9 + 7
def div(n,T):
    _ = 1
    for t in range(T):
        _ *= n
        _ %= tmp
    return _
    
N = int(input())
a = div(10,N)
b = div(9,N)
c = div(8,N)

print((a + c - 2 * b) % tmp)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
A=max(a,b)
B=max(c,d)

if (A>0 and B>0):
  print(A*B)
elif A<0 and B>0:
  print(A*min(c,d))
elif A>0 and B<0:
  print(min(a,b)*B)
elif A<=0 and B<=0:
  print(min(a,b)*min(c,d))

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
A=max(a,b)
B=max(c,d)

if (A<=0 and B<=0) or (A>0 and B>0):
  print(A*B)
elif A<0 and B>0:
  print(A*min(c,d))
elif A>0 and B<0:
  print(min(a,b)*B)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
A=max(a,b)
B=max(c,d)

if (A<=0 and B<=0) or (A>0 and B>0):
  print(A*B)
elif A<0 and B>0:
  print(A*min(c,d))
else:
  print(min(a,b)*B)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
A=max(a,b)
B=max(c,d)

if (A<=0 and B<=0) or (A>0 and B>0):
  print(A*B)
elif A<0 and B>0:
  print(min(a,b)*B)
else:
  print(A*min(c,d))

Submission status: Runtime Error

Solution code:
x=int(input())

if X==0:
  print(1)
elif x==1:
  print(0)

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input().split())
ans = -float("INF")

x = for x in (a,b):
  for y in (c,d):
    ans = max(ans,X*y)
print(ans)

Submission status: Runtime Error

Solution code:
x = int(input())
if x == 0:
  pirnt("1")
else:
  print("0")

Submission status: Runtime Error

Solution code:
x = int(input())
print(int(not(x))

Submission status: Runtime Error

Solution code:
print(int(not(input()))

Submission status: Runtime Error

Solution code:
print(1) if x == 1 else print(0)

Submission status: Runtime Error

Solution code:
print(1-input())

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())

print(max([(a*c), (a*d), (b*c), (b*d)]))

Submission status: Runtime Error

Solution code:
print(int(not(bool(x))))

Submission status: Runtime Error

Solution code:
if int(input()) == 1:
	print(0)
elif int(input()) == 0:
    print(1)

Submission status: Runtime Error

Solution code:
x = int(x)
# OUTPUTS
# Print 1 if input is equal to 0
if x == 0:
    print(1)
    exit()

# Print 0 if input is equal to 1
if x == 1:
    print(0)
    exit()

Submission status: Runtime Error

Solution code:
import sys

# User input
var = input("Please enter an integer: ")

# Error check 1: Is the input an integer?
try:
    val = int(var)
except ValueError:
    sys.exit('Input is not an integer') 

# Convert input to integer
var = int(var)

# Error check 2: Is the input within bounds?
if var > 1 or var < 0:
    sys.exit('Input is not within accepted bounds')

# OUTPUTS 
# Print 1 if input is equal to 0 
if var == 0:
    sys.exit('1') 
    
# Print 0 if input is equal to 1
if var == 1:
    sys.exit('0')

Submission status: Runtime Error

Solution code:
x = int(input())
if x = 1:
    print(0)
elif x = 0:
    print(1)

Submission status: Runtime Error

Solution code:
x = int(input())
if x != 1:
  return 0
elif x != 0:
  return 1

Submission status: Runtime Error

Solution code:
a=int(input())
if a==1:
  print(0)
if a==0
  print(1)

Submission status: Runtime Error

Solution code:
# cook your dish here
import sys,math
try:sys.stdin,sys.stdout=open('input.txt','r'),open('out.txt','w')
except:pass
from sys import stdin,stdout;mod=int(1e9 + 7);from statistics import mode
from collections import *;from math import ceil,floor,inf,factorial,gcd,log2,sqrt,log
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
# print('{:.3f}'.format(1),round(1.123456789,4))
# sys.setrecursionlimit(500000)
def lcm(a,b): return (a*b)//gcd(a,b)
def setbits(n):return bin(n).count('1')
def resetbits(n):return bin(n).count('0')
def modinv(n,p):return pow(n,p-2,p)
def ncr(n,r):
    num,den=1,1;r=min(n,n-r)
    for i in range(r):num*=(n-i);den*=(i+1)
    return num//den
def ncr_p(n, r, p):
    num,den=1,1;r=min(r,n-r)
    for i in range(r):num = (num * (n - i)) % p ;den = (den * (i + 1)) % p
    return (num * modinv(den,p)) % p
def isPrime(num) :
    if num<=1:return False
    if num==2 or n==3:return True
    if (num % 2 == 0 or num % 3 == 0) :return False
    m = int(num**0.5)+1
    for i in range(5,m,6):
        if (num % i == 0 or num % (i + 2) == 0) :return False
    return True
def bin_search(s, low, high, val):
    while low <= high:
        mid = low + (high - low) // 2;
        if s[mid] == val:return mid
        elif s[mid] < val:low = mid + 1
        else:high = mid - 1
    return -1
def sumofdigit(num):
    count=0;
    while num : count+=num % 10;num //= 10;
    return count;
def inputmatrix():
    r,c=iia();mat=[0]*r;
    for i in range(r):mat[i]=iia();
    return r,c,mat;
def prefix_sum(n,s):
    for i in range(1,n):s[i]+=s[i-1]
    return s;
def binomial(n, k):
    if 0 <= k <= n:
        ntok = 1;ktok = 1
        for t in range(1, min(k, n - k) + 1):ntok *= n;ktok *= t;n -= 1
        return ntok // ktok
    else:return 0
def divisors(n):
    res = [];
    for i in range(1,ceil(sqrt(n))+1):
        if n%i == 0:
            if i==n//i:res.append(i)
            else:res.append(i);res.append(n//i)
    return res;
code here
n = ii1()
if n==1:print(0)
else:
    print(1)

Submission status: Runtime Error

Solution code:
print(int(not(int(input())))

Submission status: Runtime Error

Solution code:
print(int(not(int(input())))

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input().split())
print(max(a,b)*max(c,d))

Submission status: Runtime Error

Solution code:
print(1 - input())

Submission status: Runtime Error

Solution code:
input_number = input()
if input_number = 0:
  print(1)
else:
  print(0)

Submission status: Runtime Error

Solution code:
x=int(input)
print(abs(1-x))

Submission status: Runtime Error

Solution code:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

n, = map(int,readline().split())
*a, = map(int,readline().split())
*b, = map(int,readline().split())
b = b[::-1]

from collections import Counter
d = Counter(a+b)
if max(d.values()) > n:
    print("No")
    exit()

same = set(i for i in range(n) if a[i]==b[i])
from random import randrange
while same:
    i = same.pop()
    while True:
        j = randrange(0,n)
        if a[j] != b[i] and a[i] != b[j]:
            b[i],b[j] = b[j],b[i]
            same.discard(j)
            break

print("Yes")
print(*b)

Submission status: Runtime Error

Solution code:
if __name__ == "__main__":
    main()


def main():
    x = int(input())
    if x:
        print(0)
    else:
        print(1)

Submission status: Runtime Error

Solution code:
x = int(input())
if x:
  print(0)
 else:
  print(1)