Problem:


Score : 100 points

Problem Statement

We have five variables x_1, x_2, x_3, x_4, and x_5.

The variable x_i was initially assigned a value of i.

Snuke chose one of these variables and assigned it 0.

You are given the values of the five variables after this assignment.

Find out which variable Snuke assigned 0.

Constraints

The values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.

Input

Input is given from Standard Input in the following format:

x_1 x_2 x_3 x_4 x_5

Output

If the variable Snuke assigned 0 was x_i, print the integer i.

Sample Input 1

0 2 3 4 5

Sample Output 1

1

In this case, Snuke assigned 0 to x_1, so we should print 1.

Sample Input 2

1 2 0 4 5

Sample Output 2

3



Sample input:
0 2 3 4 5


Sample output:
1

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
import decimal


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

    @staticmethod
    def is_prime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True

    @staticmethod
    def fact(N):
        res = {}
        tmp = N
        for i in range(2, int(N ** 0.5 + 1) + 1):
            cnt = 0
            while tmp % i == 0:
                cnt += 1
                tmp //= i
            if cnt > 0:
                res[i] = cnt
        if tmp != 1:
            res[tmp] = 1
        if res == {}:
            res[N] = 1
        return res


def pop_count(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    return x & 0x0000007f


MOD = int(1e09) + 7
INF = int(1e15)


def solve():
    X = Scanner.map_int()
    print(X.index(0) + 1)


def main():
    # sys.stdin = open("sample.txt")
    # T = Scanner.int()
    # for _ in range(T):
    #     solve()
    #     print('YNeos'[not solve()::2])
    solve()


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
X = list(map(int,input().split()))
for i in range(5):
    if X[i]==0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a = list(map(int, input().split()))
print(a.index(0)+1)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    A = list(map(int,input().split()))
    for i in range(5):
        if A[i] == 0:
            ans = i + 1
            break
    print(ans)    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))

print(a_L.index(0)+1)

Submission status: Accepted

Solution code:
import math

li = list(map(int, input().split(" ")))

print(li.index(0) + 1)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

print(a.index(0)+1)

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))


print(x.index(0)+1)

Submission status: Accepted

Solution code:
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

    X = LMIIS()
    for i,x in enumerate(X):
        if x == 0:
            print(i+1)
            return
    
main()

Submission status: Accepted

Solution code:
# coding: utf-8
X = list(map(int, input().split()))
for i in range(5):
    if X[i] == 0:
        ans = i + 1
print(ans)

Submission status: Accepted

Solution code:
X = [int(hoge) for hoge in input().split()]
print(X.index(0)+1)

Submission status: Accepted

Solution code:
print(15-sum([int(x) for x in input().split()]))

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

li = list(map(int,stdin.readline().rstrip().split()))

print(li.index(0)+1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def main():
    x = [int(xi) for xi in input().split()]
    print(x.index(0) + 1)


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

a = na()
for i in range(5):
    if a[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
# import sys
# input = sys.stdin.readline

def mp(): return map(int, input().split())
def lmp(): return list(map(int, input().split()))


a = lmp()
print(a.index(0)+1)

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
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 ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np
#from decimal import *

x = LIST()

print(x.index(0)+1)

Submission status: Accepted

Solution code:
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    x = input_number_list()
    print(x.index(0)+1)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

X = iil()
print(X.index(0)+1)

Submission status: Accepted

Solution code:
def main():
     x = list(map(int,input().split()))
     print(int(x.index(0))+1)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

A = list(map(int, input().split()))

print(A.index(0) + 1)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline

def solve():
    X = list(map(int, readline().split()))
    print(X.index(0) + 1)

solve()

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy


if __name__ == "__main__":
    x = list(map(int,input().split()))
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
            sys.exit()

Submission status: Accepted

Solution code:
arr = list(map(int, input().split()))
# sm = sum(arr)
# m = max(arr)
# s = input()

print(arr.index(0)+1)

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]

print(A.index(0) + 1)

Submission status: Accepted

Solution code:
# n = int(input())
# a, b = map(int, input().split())
# s = input()

a = list(map(int, input().split()))
for i in range(1, 6):
    if a[i - 1] != i:
        print(i)

Submission status: Accepted

Solution code:
s = input().split()
ans = s.index("0") + 1
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a = list(map(int, input().split()))
for i in range(5):
  if a[i] == 0:
    print(i + 1)
    break

Submission status: Accepted

Solution code:
A = [int(_n) for _n in input().split()]
for i in range(len(A)):
    if(A[i] == 0):
        print(i+1)

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
for i in range(5):
    if X[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
print(15 - sum([int(a) for a in input().split()]))

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
for i in range(len(A)):
    if A[i] == 0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i in range(5):
   if x[i] == 0:
      print(i+1)
      exit()

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))

print(l.index(0)+1)

Submission status: Accepted

Solution code:
X = [int(i) for i in input().split()]
print(X.index(0) + 1)

Submission status: Accepted

Solution code:
def main():
    *x, = map(int, input().split())
    print(x.index(0) + 1)


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return x if y == 0 else gcd(y, x%y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")

X = LI()
print(X.index(0)+1)

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
for i in range(5):
    if A[i] != i+1:
        print(i+1)

Submission status: Accepted

Solution code:

x= list(map(int,input().split()))

print(x.index(0)+1)

Submission status: Accepted

Solution code:
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
#n = int(input())
#a, v = map(int, sys.stdin.readline().split())
#s = input()
x = list(map(int, sys.stdin.readline().split()))
     

for i in range(5):
    if x[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict

# import fractions

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X = il()
    print(X.index(0) + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
q = [int(i) for i in input().split()]
print(q.index(0)+1)

Submission status: Accepted

Solution code:
import sys

aaa = list(map(int, sys.stdin.buffer.read().split()))
for i in range(1, 6):
    if i not in aaa:
        print(i)
        break

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

def main():
    x = list(map(int, input().split()))
    print(x.index(0)+1)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = [int(num) for num in input().split()]
print(15-sum(a))

Submission status: Accepted

Solution code:
xs = list(map(int, input().split()))

for i in range(5):
    if xs[i] == 0:
        print(i + 1)
        exit(0)

Submission status: Accepted

Solution code:
MOD = 10**9+7

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    x = list(mi())
    print(x.index(0)+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L = [c for c in map(int,input().split())]
print(L.index(0)+1)

Submission status: Accepted

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys
input = sys.stdin.readline
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

x = ip()
print(x.index(0)+1)

Submission status: Accepted

Solution code:
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)

def main():
    x = list(map(int,ipt().split()))
    print(x.index(0)+1)


    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
for i in range(5):
  if l[i]==0:
    print(i+1)

Submission status: Accepted

Solution code:
arr = list(map(int,input().split()))
x = arr.index(0)
print(x+1)

Submission status: Accepted

Solution code:
xl = list(map(int,input().split()))

for i in range(5):
    if xl[i] == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
import sys

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


def resolve():
    x = list(map(int, input().split()))
    print(x.index(0) + 1)


if __name__ == '__main__':
    resolve()

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 i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = LI()
    for i in range(5):
        if x[i] == 0:
            print(i+1)
            return
    return

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

Submission status: Accepted

Solution code:
X = [int(x) for x in input().split()]
zero = X.index(0)
print(zero + 1)

Submission status: Accepted

Solution code:
ns = list(map(int, input().split()))
print(ns.index(0)+1)

Submission status: Accepted

Solution code:
X=list(map(int, input().split()))
for i in range(5):
    if X[i]==0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))

for i in range(5):
    if a[i] == 0:
        print(i+1)
        exit()

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 fractions import gcd
#from itertools import combinations # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
A = readInts()
for i in range(5):
    if A[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
ls = list(map(int, input().split()))
print(ls.index(0) + 1)

Submission status: Accepted

Solution code:
def main():
    x = list(map(int, input().split()))
    for i in range(5):
        if x[i] == 0:
            print(i + 1)
            break


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
As = list(map(int, input().split()))

print(As.index(0) + 1)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
from decimal import *
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

x = LIST()
print(x.index(0) + 1)

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)

x=[int(i) for i in input().split()]
print(x.index(0)+1)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    x = list(map(int, input().split()))

    ans = x.index(0) + 1

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    A = list(map(int, input().split()))
    print(A.index(0) + 1)

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, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
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 ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = LIST()
print(x.index(0)+1)

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
print(A.index(0)+1)

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=list(map(int,input().split()))

print(x.index(0)+1)

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353



X = list(map(int, sys.stdin.buffer.readline().split()))
print(X.index(0)+1)

Submission status: Accepted

Solution code:
a,b,c,d,e = list(map(int,input().split()))
print(15-a-b-c-d-e)

Submission status: Runtime Error

Solution code:
x = list[map(int,input().split())]
print(x.index(0) + 1)

Submission status: Runtime Error

Solution code:
1 print(15 - sum(list(map(int, input().split()))))

Submission status: Runtime Error

Solution code:
print(list(map(int,input().split()).index(0) + 1)

Submission status: Runtime Error

Solution code:
print(list(map(int,input().split()).index(0))

Submission status: Runtime Error

Solution code:
def main():
  for i,n in enumerate(list(map(int,input().split()))):
  	if n == 0:
    	return i + 1

if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
def main():
  for i,n in enumerate(map(int,input().split())):
  	if n == 0:
    	return i

if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
a,b,c,d,e = (int(x) for i in input().split())
if a == 0:
  print(1)
if b == 0:
  print(2)
if c == 0:
  print(3)
if d == 0:
  print(4)
if e == 0:
  print(5)

Submission status: Runtime Error

Solution code:
a,s,d,f,g=int(input())

if a==0:
  print(1)
elif s==0:
  print(2)
elif d==0:
  print(3)
elif f==0:
  print(4)
elif g==0:
  print(5)

Submission status: Runtime Error

Solution code:
a,s,d,f,g=int(input())

if a==0:
  print(1)
if s==0:
  print(2)
if d==0:
  print(3)
if f==0:
  print(4)
if g==0:
  print(5)

Submission status: Runtime Error

Solution code:
x = int(input())
x = list(x)

for idx in range(len(x)):
  if x[idx] == 0:
    print(idx + 1)
    break

Submission status: Runtime Error

Solution code:
x = int(input())

x = tuple(x)

for idx in range(5):
  if x[idx] == 0:
    print(idx + 1)
    break

Submission status: Runtime Error

Solution code:
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;

long long  fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

// 二項係数計算
long long COM(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
	return(x + y - 1) / y;

}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
	long long int m = number1;
	long long int n = number2;

	if (number2 > number1) {
		m = number2;
		n = number1;
	}
	long long int s = -1;
	while (s != 0) {
		s = m % n;
		m = n;
		n = s;
	}
	return m;
}
/*最大公倍数*/
long long int gcd(long long int number1, long long int number2) {
	long long int m = number1;
	long long int n = number2;
	return m / lcm(m, n) * n;
}
/*逆元計算*/
long long int  modinv(long long a, long long m) {
	long long int b = m, u = 1, v = 0;
	while (b) {
		long long int t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= m;
	if (u < 0) u += m;
	return u;
}
// index が条件を満たすかどうか
vector<long long int >meguru;
bool isOK(int index, int key) {
	if (meguru[index] <= key) return true;
	else return false;
}
// 汎用的な二分探索のテンプレ
int binary_search(int key) {
	int left = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
	int right = (int)meguru.size(); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()
	/* どんな二分探索でもここの書き方を変えずにできる！ */
	while (right - left > 1) {
		int mid = left + (right - left) / 2;

		if (isOK(mid, key)) left = mid;
		else right = mid;
	}
	/* left は条件を満たす最大の値、right は条件を満たさない最小の値になっている */
	return left;
}
long long modpow(long long a, long long n, long long mod) {
	long long res = 1;
	while (n > 0) {
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}
int main() {
	int x1, x2, x3, x4, x5;
	cin >> x1 >> x2 >> x3 >> x4 >> x5;
	if (x1 == 0) {
		cout << 1;
	}
	else if (x2 == 0) {
		cout << 2;
	}
	else if (x3 == 0) {
		cout << 3;
	}
	else if (x4 == 0) {
		cout << 4;
	}
	else if (x5 == 0) {
		cout << 5;
	}
}

Submission status: Runtime Error

Solution code:
n = int(input())
lst = list(map(int,input().split()))

lst = sorted(lst)
bol = [True]*n
s=0
for i in range(n-1):
  if bol[i] == True:
    bol[i] = False
    if lst[i] != lst[i+1]:
      s += 1
    
    for j in range(i+1,n):
      if bol[j] == True and lst[j] % lst[i] == 0:
        bol[j] = False

if bol[n-1] == True:
  s += 1
  
print(s)

Submission status: Runtime Error

Solution code:
x = map(int,input().split())
i = 0
while (x[i] != 0):
  i+=1
print(i)

Submission status: Runtime Error

Solution code:
num = list(input().split())
for i in range(6):
  if num[i] == "0":
    print(int(str(i + 1)))

Submission status: Runtime Error

Solution code:
num = int(input().split())
for i in range(6):
  if num[i] == 0:
    print(int(str(i)))

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())

if y%2 == 0 and x*2<=y<=x*4:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
x = list(map(int, input().split()))

for i in range(len(x)):
    if x[i] == 0:

Submission status: Runtime Error

Solution code:
x= list(map(int,input().split()))

for i in range(%):
  if x[i] == 0:
    print(i+1)

Submission status: Runtime Error

Solution code:
x= list(map(int,input().split()))
for i in x:
  if x[i] == 0:
    print(i+1)

Submission status: Runtime Error

Solution code:
num_list = input().split()

i = 0
while True:
    if num_list[i] == 0:
        print(i + 1)
        break
    i += 1

Submission status: Runtime Error

Solution code:
x = list(map(int, input().split()))

for i in range(x):
    if x[i] == 0:
        print(i+1)
        break

Submission status: Runtime Error

Solution code:
using namespace std;
#include <iostream>

int main(){
  int n;
  int count = 1;
  while (cin >> n){
    if (n == 0) {
      cout << count;
      return 0;
    }
    count++;
  }
}

Submission status: Runtime Error

Solution code:
using namespace std;
#include <iostream>

int main(){
  int n;
  int count = 1;
  while (cin >> n){
    if (n == 0) {
      cout << count;
      return 0;
    }
    count++;
}

Submission status: Runtime Error

Solution code:
n = list(map(int,input().split()))
for i in range(n):
  if n[i] == 0:
    print(i)
    break