Problem:


Score : 100 points

Problem Statement

It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.

Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Constraints

1 \leq r \leq 100

r is an integer.

Input

Input is given from Standard Input in the following format:

r

Output

Print an integer representing the area of the regular dodecagon.

Sample Input 1

4

Sample Output 1

48

The area of the regular dodecagon is 3 \times 4^2 = 48.

Sample Input 2

15

Sample Output 2

675

Sample Input 3

80

Sample Output 3

19200



Sample input:
4


Sample output:
48

Submission status: Runtime Error

Solution code:
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
    int r;
    cin >> r;

    cout << 3*r*r << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
N = int(input())
A = []
 
for _ in range(N):
    A.append(int(input()))
    
a = b = 0
    
for i in range(N):
    if A[i] >= a:
        b = a
        a = A[i]
    elif A[i] > b:
        b = A[i]
 
for i in range(N):
    if A[i] < a:
        print(a)
    else:
        print(b)

Submission status: Runtime Error

Solution code:
N,D = map(int,input().split())

x = 2*D+1
y = N/x
z = N//x
if z==0:
    print(y)
else:
    print(z+1)

Submission status: Runtime Error

Solution code:
n,d=input().split()
n=int(n)
d=int(d)
a=d*2+1
if n%a==0:
    print(n//a)
else:
    print(n//a+1)

Submission status: Runtime Error

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
b=sorted(a,reverse=True)
x,y=b[0],b[1]
z=a.index(x)
for i in range(n):
	if i==z:
		print(y)
	else:
		print(x)

Submission status: Runtime Error

Solution code:
print(r*r*3)

Submission status: Runtime Error

Solution code:
N = input()
D = input()
n = int(N)
d = int(D)
k = (n+2*d)/(2*d+1)
print(k)

Submission status: Runtime Error

Solution code:
import math
 
N, D = list(map(int, input().strip().split(" ")))

if D == 0:
    print(N)
elif N == 0:
    print("0")
else:
	print( int(math.ceil(N / (2 * D))))

Submission status: Runtime Error

Solution code:
r = input()
r = int(a)
print(3*r*r)

Submission status: Runtime Error

Solution code:
import math

N, D = list(map(int, input().strip().split(" ")))

print( int(math.ceil(N // (2 * D)))

Submission status: Runtime Error

Solution code:
n = int(input())
a = []
for _ in range(0, n):
    a.append(int(input()))
first = max(a)
second_1 = sorted(a)
second = second_1[-2]
for i in range(0, n):
    if a[i] == first:
        print(second)
    else:
        print(first)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
l = []

for i in range(n, 0, -1):
    if a[i-1] == 1:
        if n//i < 2:
            b[i-1] = 1
        else:
            c = n//i
            asums = 0
            for j in range(1, c+1):
                asums += a[j*i-1]
            if asums%2 == 1:
                b[i-1] = 1
    else:
        if n//i < 2:
            b[i-1] = 0
        else:
            c = n//i
            asums = 0
            for j in range(1, c+1):
                asums += a[j*i-1]
            if asums%2 == 1:
                b[i-1] = 1

for k in range(0, n):
    if b[k] == 1:
        l.append(k+1)

print(len(l))
print(" ".join(map(str, l)))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
ball = [0 for i in range(n)]
count = 0
index = []

for i in range(n-1, n//2 - 1, -1):
    if a[i] == 1:
        ball[i] = 1
        count += 1
        index.append(i+1)
for i in range(n//2 - 1, -1, -1):
    if ball[i + (i+1)] % 2 != a[i]:
        ball[i] = ball[i + (i+1)] + 1
        count += 1
        index.append(i+1)
    else:
        ball[i] = ball[i + (i+1)]
        
ans = ""
for i in range(len(index)):
    if i < len(index)-1:
        ans += str(index[i]) + " "
    else:
        ans += str(index[i])
print(count)
print(ans)

Submission status: Runtime Error

Solution code:
S=int(input())

for i in range(10**6):
  if int((S+i**2)**(1/2))==(S+i**2)**(1/2):
    y=i
    x=int((S+i**2)**(1/2))
    
print("{} {} {} {} {} {}".format(0,0,x,y,y,x))

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(s) for s in input().split()]
tmpa = a 
tmpa.sort()
for x in a:
  if x == tmpa[n-1]:
    print(tmpa[n-2])
  else:
    print(tmpa[n-1])
"""
if a[0] > a[1]:
  m,m2 = a[0],a[1]
else:
  m,m2 = a[1],a[0]

for x in a[2:]:
  if x > m2:
    if x>m:
      m2,m = 

"""
"""
for i in range(n):
  if i == 0:
    p
    rint(max(a[i+1:]))
    continue
  if i == n-1:
    print(max(a[0:n-1]))
    break
  ans = max(max(a[0:i]),max(a[i+1:n]))
  print(ans)
  """

Submission status: Runtime Error

Solution code:
import sys
input = sys.stfin.readline
n=int(input())
a=[int(input())for _ in range(n)]
b=sorted(a)
for a in a:print(b[(a<b[-1])-2])

Submission status: Runtime Error

Solution code:
n,d = map(int,input().split())
sight = 2*d+1
print((n//sight) + (n%sight != 0))

Submission status: Runtime Error

Solution code:
r=map(int,input().split())
print(3r**2)

Submission status: Runtime Error

Solution code:
r=map(int,input().split)
print(3r**2)

Submission status: Runtime Error

Solution code:
N,D=map(int,input().split())
print(N//(2*D+2) +1)

Submission status: Runtime Error

Solution code:
N,D=map(int,input().split())
print(N//(2*D) +1)

Submission status: Runtime Error

Solution code:
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
a = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(0,N):
    if L[s] == M:
        a += 1
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M and a < 2:
        print(M2)
    else:
        print(M)

Submission status: Runtime Error

Solution code:
n = int(input())

a = [int(input()) for i in range(n)]

x = int(0)
y = int(0)

for i in range(n):
    x = max(a[:i])
    y = max(a[i + 1:])
    print(max(x,y))

Submission status: Runtime Error

Solution code:
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
a = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(1,N):
    if L[s] == M:
        a += 1
        continue
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M and a != 1:
        print(M2)
    else:
        print(M)

Submission status: Runtime Error

Solution code:
n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(n // 2, 0, -1):
    a[i] = sum(a[i::i]) % 2
print(sum(a))
print(*(i for i, b in enumerate(a) if b))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans = []

for i in range(n):
	j = n - 1 - i
	k = (j + 1) + (j + 1)
	if k > n:
		if a[j] == 1:
			ans.append(j+1)
	else:
		count = 0
		while k <= n:
			if k in ans:
				count = count + 1
			k = k + (j + 1)
		count_01 = count % 2
		if a[j] == 0:
			if count_01 == 1:
				ans.append(j+1)
		elif a[j] == 1:
			if count_01 == 0:
				ans.append(j+1)
if not ans:
	print(0)
else:
	print(str(len(ans))+"\n" + " ".join(list(map(str,ans))))

Submission status: Runtime Error

Solution code:
import bisect
n = int(input())
a = int(input())

color = [a]
color_min = a

for i in range(1, n):
    a = int(input())
    if color_min >= a:
        bisect.insort_left(color, a)
        color_min = a
    else:
        j = bisect.bisect_left(color, a)
        color.pop(j-1)
        bisect.insort_left(color, a)
        color_min = color[0]

print(len(color))

Submission status: Runtime Error

Solution code:
N = int(input())
memo = 1
ans = []
tmp = int(input())
for i in range(1,N):
    A = int(input())
    if A <= tmp:
        memo += 1
    else:
        ans.append(memo)
        memo = 1
    tmp = A
ans.append(memo)
print(max(ans))

Submission status: Runtime Error

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

def sol(i,want):
    num=int(N/(i+1))
    wa=-A[0]
    for j in range(num):
        wa+=A[i+j*i]
    wa=wa%2
    if wa==want:
        x=0
    else:
        x=1
#     print(num)
    return x 

B=A[:]
half=int(N/2)
for i in range(half):
    j=half-1-i
#     print(j)
    B[j]=sol(j,A[j])
    
C=[]
for i in range(N):
    if B[i]==1:
        C.append(i+1)
m=sum(B)
print(m)
print(*C)

Submission status: Runtime Error

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

def sol(i,want):
    num=int(N/(i+1))
    wa=-A[0]
    for j in range(num):
        wa+=A[i+j*i]
    wa=wa%2
    if wa==want:
        x=0
    else:
        x=1
#     print(num)
    return x 

B=A[:]
for i in range(half):
    j=half-1-i
#     print(j)
    B[j]=sol(j,A[j])
    
C=[]
for i in range(N):
    if B[i]==1:
        C.append(i+1)
m=sum(B)
print(m)
print(*C)

Submission status: Runtime Error

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

def sol(i,want):
    num=int(N/(i+1))
    wa=-A[0]
    for j in range(num):
        wa+=A[i+j*i]
    wa=wa%2
    if wa==want:
        x=0
    else:
        x=1
#     print(num)
    return x 

B=A[:]
for i in range(half):
    j=half-1-i
#     print(j)
    B[j]=sol(j,A[j])
    
C=[]
for i in range(N):
    if B[i]==1:
        C.append(i+1)
m=sum(B)
print(m)
for i in range(m):
    print(C[i])

Submission status: Runtime Error

Solution code:
def add(n):
    return n + 1

if __name__ == "__main__":
    n = int(input())
    buf = input().split()
    a = [int(s) for s in buf]
    
    boxes = [0] * n

    for i in reversed(range(n)):
        pick_boxes = boxes[i::i+1]
        pick_boxes.pop(0)
        if pick_boxes:
            if (sum(pick_boxes) % 2) == a[i]:
                boxes[i] = 0
            else:
                boxes[i] = 1
        else:
            boxes[i] = a[i]

    box_name = [i for i, x in enumerate(boxes) if x == 1]
    box_name = list(map(add, box_name))
    print(len(box_name))
    if len(box_name) != 0:
        box_name = ' '.join(map(str,box_name))
        print(box_name)

Submission status: Runtime Error

Solution code:
def add(n):
    return n + 1

if __name__ == "__main__":
    n = int(input())
    buf = input().split()
    a = [int(s) for s in buf]
    
    boxes = [0] * n

    for i in reversed(range(n)):
        print(i)
        pick_boxes = boxes[i::i+1]
        pick_boxes.pop(0)
        print(pick_boxes)
        if pick_boxes:
            if (sum(pick_boxes) % 2) == a[i]:
                boxes[i] = 0
            else:
                boxes[i] = 1
        else:
            boxes[i] = a[i]

    box_name = [i for i, x in enumerate(boxes) if x == 1]
    box_name = list(map(add, box_name))
    print(len(box_name))
    if len(box_name) != 0:
        box_name = ' '.join(map(str,box_name))
        print(box_name)

Submission status: Runtime Error

Solution code:
n = int(input())
a_list = list(map(int,input().split()))
b_list = [0]*(n-n//2)+a_list[(n-n//2):]

for i in range(n//2+1):
    k = int(n//2-i-1)
    if a_list[k] != sum(b_list[k::k+1])%2:
        b_list[k] = 1

b_list = [i+1 for i,x in enumerate(b_list) if x ==1]
x = len(b_list)
print(x)
if x != 0:
    print(*b_list)

Submission status: Runtime Error

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

import math

if __name__ == '__main__':
    N = int(input())
    colors = [
        10000000000
    ]
    # R = [0 for i in range(N)]
    # M = 0

    for i in range(N-1, -1, -1):
        # print('i={}'.format(i))
        a = int(input())
        for j in range(len(colors)):
            if a < colors[j]:
                colors[j] = a
                break
        else:
            colors.append(
                a
            )

    print(len(colors))

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
B = sorted(A, reverse = True)

for i in range(N):
    if A[i] == B[0]:
        print(B[1])
    else:
        print(B[0])

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
A = [int(input()) for _ in range(N)]
B = sorted(A, reverse = True)

for i in range(N):
    if A[i] == B[0]:
        print(B[1])
    else:
        print(B[0])

Submission status: Runtime Error

Solution code:
from bisect import bisect_left
n = int(input())
A=[int(input()) for _ in range(n)]
row = [A[0]]
for a in A[1:]:
    if a<=row[-1]:
        row.append(a)
    else:
        row[len(row) - bisect_left(row[::-1],a)] = a
print(len(row))

Submission status: Runtime Error

Solution code:
# Python3 program to insert 
# an element into sorted list 
import bisect 

def insert(list, n): 
	bisect.insort(list, n) 
	return list



n=int(input())
l=[]
q=[]
w=[]
S=[]
D=[]
for i in range(0,n):
    o=int(input())
    l.append(o)
G=0;
for i in range(0,len(l)-1):
    if l[i] <= l[i+1]:
        G=1;
        break;
if G==0:
    print(len(l))
else:
    for i in range(0,len(l)):
        o=l[i]
        if i==0:
            q.append(o)
        else:
            V=-1;
            G=0;
            I=0;
            J=len(q)-1;
            while(I<=J):
                m=(I+J)//2;
                if q[m] < o:
                    V=m;
                    I=m+1;
                else:
                    if q[m]>=o:
                        J=m-1;
            if V==-1:
                q=insert(q,o);
            else:
                q[V]=o;
    print(len(q))

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
 
def main():
  n = int(input())
  numList  = [int(input()) for _ in range(n)]
  maxVal = max(numList)
  workList = numList[:]
  workList.remove(maxVal)
  secondVal = max(workList)
  for num in numList:
    if num != maxVal:
      print(maxVal)
    else:
      print(secondVal)
      
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
AA = sorted(A)
maxAA = max(AA)
for i in A:
    if maxAA == i:
        print(AA[-2])
    else:
        print(maxAA)

Submission status: Runtime Error

Solution code:
N = int(input())
A = []
 
for _ in range(N):
    A.append(int(input())
    
for i in range(N):
    if A[i] >= a:
        b = a
        a = A[i]
    elif A[i] > b:
        b = A[i]
 
for i in range(N):
    if A[i] < a:
        print(a)
    else:
        print(b)

Submission status: Runtime Error

Solution code:

n = int(input())
a = []
for i in range(n):
  a.append(int(input()))

import bisect

color = []
color.append(a.pop(0))
color_count =0 
for i, ai in enumerate(a): 
    index = bisect.bisect_left(color, ai)
    if index > 0:
        color[index -1] = ai
    else:
        color.insert(0, ai)
print(len(color))

Submission status: Runtime Error

Solution code:
n = int(input())
numList  = [input() for i in range(n)]
maxVal = max(numList)
workList = numList[:]
workList.remove(maxVal)
secondVal = max(workList)
for num in numList:
  if num != maxVal:
    print(maxVal)
  else:
    print(secondVal)

Submission status: Runtime Error

Solution code:
N = int(input())
A = []

for _ in range(N):
    A.append(int(input()))
    
a = max(A)
b =  sorted(A)[-2]

for i in range(N):
    if A[i] < a:
        print(a)
    else:
        print(b)

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
A = []

for _ in range(N):
    A.append(int(input()))
    
a = max(A)
b =  sorted(set(A))[-2]
    
'''
for i in range(N):
    if A[i] > a:
        b = a
        a = A[i]
    elif A[i] < a and A[i] > b:
        b = A[i]
'''

for i in range(N):
    if A[i] < a:
        print(a)
    else:
        print(b)

Submission status: Runtime Error

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

ans=[]
for i in range(n-1,n//2-1,-1):
  if li[i]==1:
    ans.append(i+1)

for i in range(n//2,0,-1):
  count=0
  for j in ans:
    if j%i==0:
      count+=1
  if count%2==0:
    ans.append(i)
ans.reverse()
print(len(ans))
L=[str(a) for a in ans]
L=" ".join(L)
if len(L)!=0:
  print(L)

Submission status: Runtime Error

Solution code:
N = int(input())
ans = 0
lst = list(map(int, input().split()))
slice_lst = lst[:int(N / 2)]
for i,k in enumerate(reversed(slice_lst)):
  sub_lst = lst[len(slice_lst)-i-1:len(lst):len(slice_lst)-i]
  if (k != sum(sub_lst) % 2):
    if (k == 0):
      lst[len(slice_lst)-i-1] = 1
    else:
      ans = -1
      break

if (ans == -1):
  print(ans)
else:
  ans_lst = []
  for i,k in enumerate(lst):
    if (k == 1):
      ans_lst.append(str(i+1))
  print(len(ans_lst))
  result = ' '.join(ans_lst)
  print(result)

Submission status: Runtime Error

Solution code:
# coding: utf-8
# Your code here!
N = int(input())
a = []
b = []
n = 0
a = list(map(int,input().split()))

if a[0] == 0:
    print(0)
    exit(0)

for i in range(0, N):
    if a[i] == 1:
        b.append(set((range(0, N+1, i+1))))
        n = n + 1
        
b[n-1].pop()
for i in range(0, n-1):
    b[i+1] = b[i] & b[i+1] 
    
print(len(b[n-1]))
s = "" + str(b[n-1].pop())
for i in range(len(b[n-1])):
    s += " " + str(b[n-1].pop())

print(s)

Submission status: Runtime Error

Solution code:
n = int(input())
A = [int(i) for i in input().split()]
A.insert(0, 0)

balls = list()
sums = dict()
# for i, a in enumerate(reversed(A)):
for bn in range(n, 0, -1):
    a = A[bn]
    if 2*bn > n:
        sums[bn] = a
        if a == 1:
            balls.append(str(bn))
    else:
        a2_sum = sums[2*bn]
        if a2_sum % 2 == a:
            # not
            sums[bn] = a2_sum
        else:
            # in
            sums[bn] = a2_sum + 1
            balls.append(str(bn))

all_balls = len(balls)
if all_balls % 2 != A[1]:
    print(-1)
else:
    print(all_balls)
    print(' '.join(balls))

Submission status: Runtime Error

Solution code:
N = int(input())    
color_list =  [int(input())]
for i in range(N-1):
    new_value = int(input())
    if(new_value > color_list[0]):
        color_list[0] = new_value
    elif(new_value <= color_list[-1]):
        color_list.append(new_value)
    else:
        for i in range(len(color_list)):
          break
print(len(color_list))

Submission status: Runtime Error

Solution code:
from collections import deque 

N = int(input())
A = deque([int(input()) for _ in range(N)])

for i in range(N):
    remA=A.popleft()
    print(max(A))
    A.append(remA)

Submission status: Runtime Error

Solution code:
import numpy as np
n = int(input())
an = np.array(input().split(" ")).astype("int64")
if an[0] == 0:
    if n % 2 == 0:
        print("0")
    elif n % 2 == 1:
        print("1")
        print("1")
elif an[0] == 1:
    if n % 2 == 0:
        print("1")
        print("1")
    elif n % 2 == 1:
        print("0")

Submission status: Runtime Error

Solution code:
#全探索でO(N^2)
N = int(input())
A = [int(input()) for _ in range(N)]

count = 0
tmp = - 10 ** 10
for i in range(N):
    # print ('i', i)
    if A[i] == -10 ** 11:
        continue
    else:
        tmp = A[i]
        count += 1
        for j in range(i + 1, N):
            if tmp < A[j]:
                tmp = A[j]
                A[j] = - 10  ** 11
            if j == N - 1:
                tmp = - 10 ** 10
# print (A)
print (count)

Submission status: Runtime Error

Solution code:

N = int(input())
A = []

for _ in range(N):
    A.append(int(input()))
    
a = b = A[0]
    
for i in range(N):
    if A[i] > a:
        b = a
        a = A[i]
    elif A[i] < a and A[i] > b:
        b = A[i]

for i in range(N):
    if A[i] <= a:
        print(a)
    else:
        print(b)

Submission status: Runtime Error

Solution code:
import numpy as np
n = int(input())
an = np.array(input().split(" ")).astype("int64")


if an[0] == 0:
    if n % 2 == 0:
        print("0")
    elif n % 2 == 1:
        print("1")
        print("1")
elif an[0] == 1:
    if n % 2 == 0:
        print("1")
        print("1")
    elif n % 2 == 1:
        print("0")

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
def sol():
    n=int(input())
    new=[int(input()) for _ in [0]*n]
    a=[new[0]]
    for i in range(1,n):
        if a[-1]>=new[i]:a.append(new[i])
        else:
            for j in range(len(a)):
                if a[j]<new[i]:a[j]=new[i];break
    print(len(a))
sol()

Submission status: Runtime Error

Solution code:
N = int(input())
As = [int(input()) for _ in range(N)]

def chop(As):
    res = []
    minibatch=[As[0]]
    for i in range(len(As)-1):
        if As[i]<As[i+1]:
            minibatch.append(As[i+1])
        else:
            res.append(minibatch)
            minibatch=[As[i+1]]
    if minibatch:
        res.append(minibatch)
    return res

def kakutei(remains):
    deletes = []
    for i in range (1,len(remains)):
        if remains[0][-1]<remains[i][0]:
            remains[0].extend(remains[i])
            deletes.append(i)
    x = remains[0].copy()
    for d in deletes[::-1]:
        del remains[d]
    del remains[0]
    return (x,remains)

chopped = chop(As)
remains = chopped
res = []
while remains:
    x, remains = kakutei(remains)
    res.append(x)
print(len(res))

Submission status: Runtime Error

Solution code:
import bisect

N = int(input())
A = []
for i in range(N):
    A.append(int(input()))

ans = [A[0]]
for i in range(1, N):
    index = bisect.bisect_left(ans, A[i])
    if index > 0:
        ans[index - 1] = A[i]
    else:
        ans = [A[i]] + ans

print(len(ans))

Submission status: Runtime Error

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

import sys
input = sys.stdin.readline

N = int(input())
A = [None] * N
for i in range(N):
    A[i] = int(input())

max_list = [-1]

for i in range(N):
    ok_list = [i for i, x in enumerate(max_list) if x < A[i]]
    if ok_list:
        max_list[ok_list[0]] = A[i]
    else:
        max_list.append(A[i])

ans = len(max_list)
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
print(r ** 2 * 3)

Submission status: Runtime Error

Solution code:
a = input
a = int(a)
print(a **2 * 3)

Submission status: Runtime Error

Solution code:
n = int(input())
a = [0 for n in range(n)]
for i in range(n):
  a[i] = int(input())
a_max = max(a)
for j in range(n):
  if a[j] != a_max:
    print(a_max)
  else:
    a.sort()
    a.reverse()
    print(a[1])

Submission status: Runtime Error

Solution code:
import copy
n=int(input())
num_list=[int(input()) for i in range(n)]

buf = []

for i in range(n):
  buf = copy.copy(num_list)
  buf.pop(i)
  print(max(buf))

Submission status: Runtime Error

Solution code:
n = int(input())
data = [int(input()) for k in range(n)]
for i in range(n):
	s = [data[t] for t in range(n)]
	s[i] = 0
	s.sort()
	print(s[-1])

Submission status: Runtime Error

Solution code:
N = int(input())
mylist = []
for i in range (N):
  A = int(input())
  mylist.append(int(A))
my = sorted(mylist,reverse=True)
del my[2:]
for j in range (N):
  if mylist[j] == my[0]:
    print(my[1])
  else:
    print(my[0])

Submission status: Runtime Error

Solution code:
N = int(input())
A =[]
for i in range(N):
  A.append(int(input()))
m = max(A)
j = A.index(m)
for k in range(N):
  if k != j:
    print(m)
  else:
    B = A[:]
    del B[j]
    print(max(B))

Submission status: Runtime Error

Solution code:
import sys
import math
import copy
a = int(input());
b = [int(input()) for i in range(a)];
c = 0;
f = max(b);
for i in range(a):
    if max(b) > b[i]:
        print(f);
    elif max(b) == b[i]:
        d = copy.copy(b);
        del d[i]
        e = max(d);
        print(e);

Submission status: Runtime Error

Solution code:
n=int(input())
a=[]
b=[]
for i in range(n):
    num=int(input())
    a.append(num)
    b.append(num)
b.sort(reverse=True)
x=a.count(b[0])
for i in range(n):
    if(a[i]==b[0]):
        if(x==1):
            print(b[1])
        else:
            print(b[0])
    else:
        print(b[0])

Submission status: Runtime Error

Solution code:
n=int(input())
x=[]
for i in range(n):
  x.append(int(input()))
cnt = [0] * n
for i in range(n):
  for j in range(n):
    if i is not j and cnt[i] < x[j]:
      cnt[i]=x[j]
for i in range(n):
  print(cnt[i])

Submission status: Runtime Error

Solution code:
N=int(input())
A=[]
for i in range(N):
    A.append(-int(input()))
for i in range(N):
    Ai=A[i]
    A[i]=0
    print(-min(A))
    A[i]=Ai

Submission status: Runtime Error

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

b=[-1]*N
b[N-1]=a[N-1]
for i in range(N-1)[::-1]: #N=4なら 2,1,0
    sum_count = N // (i+1)
    if sum_count==1:
        b[i]=a[i]
    else:
        sum1=0
        for j in range(sum_count-1):
            sum1 = sum1 + b[(i+1)*(j+1)]
        sum1 = sum1 % 2
        b[i]=(a[i]+ sum1)%2

print(sum(b))
for i in range(N):
    if b[i]==1:
        print(i+1,end=" ")

Submission status: Runtime Error

Solution code:
from collections import deque

def main():
    n = int(input())
    A = list(map(int, input().split()))
    ans = 0
    B = [0] * n
    # ansList = []
    ansList = deque()

    def makeList(num):
        start = num + 1
        mul = n // start
        return [start * j - 1 for j in range(1, mul+1)]


    def makeRes(indices):
        flag = 0
        for elm in indices:
            if B[elm] == 1:
                flag = (flag + 1) % 2
        return flag


    for i in range(n-1, -1, -1):
        if i + 1 >  n / 2:
            if A[i] == 1:
                B[i] = 1
                ans += 1
                ansList.appendleft(i+1)
        else:
            indices = makeList(i)
            # print(indices)
            res = makeRes(indices)
            # print(res)
            if A[i] != res:
                B[i] = 1
                ans += 1
                ansList.appendleft(i+1)

    print(ans)

    if ans != 0:
        print(*(list(ansList)))


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import numpy as np
import math

N = int(input())
A = input().split(' ')

an = np.array(A, dtype=np.int64)

M = 0
b = []

for i in range(1,N):
   chk_num = int(N/(i))

   if(chk_num<2):
      continue

   ball = 0
   for j in range(1,chk_num):
      c = i * j
      ball += an[j]
   M += 1
   b.append((ball+1)%2)


print(M)
print(*b)

Submission status: Runtime Error

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

max = (n - d) - d
count = 1

for i in range(1000):
  if max <= 1:
    break
  max = (max - (d*2) -1) 
  count += 1

print(count)

Submission status: Runtime Error

Solution code:
x = input()
print(3 * x ** 2)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
A_m = str(max(A))
a = A.index(int(A_m))
A = sorted(A)
if A.count(int(A_m)) >= 2:
    print((A_m + '\n')*(N-1) + A_m)
else:
    print(a)
    print((A_m + '\n')*a + str(A[-2]))
    print((A_m + '\n')*(N-(a+2)) + A_m)

Submission status: Runtime Error

Solution code:
3*(r**2)

Submission status: Runtime Error

Solution code:
3(r**2)

Submission status: Runtime Error

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n = readi()
d = []
for i in range(n):
    k = readi()
    d.append(k)
p = []
g = -1
for i in range(n - 1):
    t = d[i]
    k = max(d[i+1:n])
    print(max(k, g))
    g = max(t, g)
print(max(d[0],g))

Submission status: Runtime Error

Solution code:
r = input()
print(3 * r * r)

Submission status: Runtime Error

Solution code:
from sys import stdin


def calc_area_size(a):
    return int(3 * (int(a) ** 2))


if __name__ == '__main__':
    r = stdin.readline().rstrip()
    print(calc_area_size(r)

Submission status: Runtime Error

Solution code:
n = int(input())
nums = []
for i in range(n):
    nums.insert(i,int(input()))
for i in range(n):
    print(max(max(nums[0:i],nums[i+1:n+1])))

Submission status: Runtime Error

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

import math

if __name__ == '__main__':
    N = int(input())
    A = []
    current_max = -1
    for i in range(N):
        A.append(int(input()))

    index = sorted(range(len(A)), key=lambda k: A[k])
    value = sorted(A)

    # print(A)

    for i in range(N):
        if index[i] < N-1:
            print(value[N-1])
        else:
            print(value[N-2])

Submission status: Runtime Error

Solution code:
from sys import stdin


def calc_area_size(a):
    return int(3 * (a ** 2))


if __name__ == '__main__':
    r = stdin.readline().rstrip()
    print(calc_area_size(r))

Submission status: Runtime Error

Solution code:
a=int(input)
def area(int x):
  area=3*(x^2)
  return area
x=area(a)
print (x)

Submission status: Runtime Error

Solution code:
# input
N = int(input())
A = []

#list
for i in range(N):
    n = int(input())
    A.append(n)

#max
for i in range(N):
    A_=A[:i]
    A__=A[i+1:]
    print(max(A_+A__))

Submission status: Runtime Error

Solution code:
import sys


def calc_area_size(a):
    return int(3 * (a ** 2))


if __name__ == '__main__':
    r = sys.argv[1]
    print(calc_area_size(r))

Submission status: Runtime Error

Solution code:
N = int(input())

A = [int(input()) for _ in range(N)]
allA=[]

for i in range(N):
    remA=A.pop(i)
    allA.append(max(A))
    A.insert(i, remA)

for i in range(N):
    print(allA[i])

Submission status: Runtime Error

Solution code:
N = int(input())
As = list(map(int, input().split()))
As.insert(0, 0)
Ans = [0 for _ in range(N + 1)]
Ans[N] = As[N]
for i in range(N - 1, 0, -1):
    p = i * 2
    s = 0
    while p <= N:
        s += Ans[p]
        p += i
    Ans[i] = 0 if s % 2 == As[i] else 1
M = sum(Ans)
print(M)
if M > 0:
    bs = ""
    for i in range(1, N + 1):
        if Ans[i] != 0:
            bs += "%d " % i
    bs = bs.rstrip(" ")
    print(bs)