Problem:

Vector

 

  For a dynamic array $A = \{a_0, a_1, ...\}$ of integers, perform a sequence of the following operations:

  
pushBack($x$): add element $x$ at the end of $A$

  
randomAccess($p$):print element $a_p$

  
popBack(): delete the last element of $A$

  
$A$ is a 0-origin array and it is empty in the initial state.

Input

  The input is given in the following format.

$q$
$query_1$
$query_2$
:
$query_q$

  Each query $query_i$ is given by

0 $x$

or

1 $p$

or

2

  where the first digits 0, 1 and 2 represent pushBack, randomAccess and popBack operations respectively.

  randomAccess and popBack operations will not be given for an empty array.

Output

  For each randomAccess, print $a_p$ in a line.

Constraints

  
$1 \leq q \leq 200,000$

  
$0 \leq p < $ the size of $A$

  
$-1,000,000,000 \leq x \leq 1,000,000,000$

Sample Input 1

8
0 1
0 2
0 3
2
0 4
1 0
1 1
1 2

Sample Output 1

1
2
4



Sample input:
8
0 1
0 2
0 3
2
0 4
1 0
1 1
1 2


Sample output:
1
2
4

Submission status: Accepted

Solution code:
q = int(input())
l = []
for i in range(q):
    s = input()
    if s == "2":
        l.pop()
        continue
    else:
        c, n = map(int, s.split())
    if c == 0:
        l.append(n)
    else:
        print(l[n])

Submission status: Accepted

Solution code:
n = int(input())
a = []
for _ in range(n):
  q = list(map(int, input().split()))
  if q[0]==0:
    a.append(q[1])
  elif q[0]==1:
    print(a[q[1]])
  elif q[0]==2:
    a.pop()

Submission status: Accepted

Solution code:
numberOfQuery=int(input())
count=0
listForStock=[]
listForPrint=[]

def popBack():
    lastIndex=len(listForStock)-1
    del listForStock[lastIndex]

def pushBack(x):
    listForStock.append(x)

def randomAccess(p):
    listForPrint.append(listForStock[p])

#-----------------main--------------------
while count<numberOfQuery:
    query=input()
    if query=="2":
        popBack()
    else:
        querys=query.split()
        if querys[0]=="0":
            pushBack(int(querys[1]))
        elif querys[0]=="1":
            randomAccess(int(querys[1]))
        else:
            print("入力が不正です")
            break
    count+=1

for chip in listForPrint:
    print(chip)
#-----------------main--------------------

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

from collections import deque

n = int(input())
word = deque()

for i in range(n):
    command, num = int(input().split())
    if command == 0:
        word.append(num)
    elif command == 1:
        print('{0}'.format(word[num]))
    elif command == 2:
        word.pop()

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

from collections import deque

n = int(input())
word = deque()

for i in range(n):
    command, num = map(int, input().split())
    if command == 0:
        word.append(num)
    elif command == 1:
        print('{0}'.format(word[num]))
    elif command == 2:
        word.pop()

Submission status: Runtime Error

Solution code:
cnt = int(input())
a = []
for i in range(cnt):
    op,n = map(int,input().split())
    if op == 0:
        a.append(n)
    elif op ==1:
        print(a[n])
    else:
        a.pop(-1)

Submission status: Runtime Error

Solution code:
cnt = int(input())
a = []
for i in range(cnt):
    li = list(map(int,input().split()))
    if li[0] == 0:
        a.append(n)
    elif li[0] ==1:
        print(a[n])
    else:
        a.pop(-1)

Submission status: Runtime Error

Solution code:
def pushBack(lists, x):
	return lists.insert(-1, x)

def randomAccess(lists, p):
	print(lists[p])

def popBack(lists):
	return lists.pop(-1)

if __name__ == '__main__':
	l = list()
	n = int(input())
	for i in range(n):
		j= input().split()

		if int(j[0]) == 0:
			pushBack(l, x)
		elif int(j[0]) == 1:
			randomAccess(l, x)
		else:
			popBack(l)