ZhenlongDai/ACPR huggingface dataset:
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


n = int(input())
h = list(map(int, input().split()))

mMax = 0
cnt = 0
for i in range(1, len(h)):
    if h[-(i + 1)] >= h[-i]:
        cnt += 1
    else:
        mMax = max(cnt, mMax)
        cnt = 0

print(mMax)

Failing test case input:
7
64 7 0 1 2 -2 2

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):


n = int(input())
h = list(map(int, input().split()))

mMax = 0
cnt = 0
for i in range(1, len(h)):
    if h[-(i + 1)] >= h[-i]:
        cnt += 1
    else:
        mMax = max(cnt, mMax)
        cnt = 0
mMax = max(cnt, mMax)

print(mMax)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

import sys

input = sys.stdin.readline

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

N=int(input())
H=LIST()

p=H[0]
cnt = 0
for h in H[1:]:
    if p >= h:
        cnt += 1
    else:
        cnt = 0
    p = h
print(cnt)

Failing test case input:
7
64 7 0 1 0 -2 2

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):

import sys

input = sys.stdin.readline

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

N=int(input())
H=LIST()

p=H[0]
cnt = 0
max_cnt = 0
for h in H[1:]:
    if p >= h:
        cnt += 1
        max_cnt = max(max_cnt, cnt)
    else:
        cnt = 0
    p = h

print(max_cnt)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h = [int(i) for i in range(n)]
ans = []
a = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    a += 1
  else:
    ans.append(a)
    a = 0
ans.append(a)
print(max(ans))

Failing test case input:
4
-1 -1 1 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
h = [int(i) for i in input().split()]
ans = []
a = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    a += 1
  else:
    ans.append(a)
    a = 0
ans.append(a)
print(max(ans))

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h = tuple(map(int,input().split()))

cnt = 0
mcnt = 0

for i in range(1,n):
  j = i + 1
  if mcnt < cnt:
        mcnt = cnt
  try:
    if h[j] <= h[i]:
      cnt += 1
    else:
      cnt = 0
  except IndexError:
    continue
      
print(mcnt)

Failing test case input:
7
64 7 0 1 2 -2 2

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
h = tuple(map(int,input().split()))

cnt = 0
mcnt = 0

for i in range(n):
  j = i + 1
  try:
    if h[j] <= h[i]:
      cnt += 1
    else:
      cnt = 0
    if mcnt < cnt:
        mcnt = cnt
  except IndexError:
    continue
      
print(mcnt)
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
H=[""]*N
H=list(map(int,input().split()))
count=0
countmax=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        count+=1
    else:
        countmax=count
        count=0

print(count)



Failing test case input:
7
20 7 0 1 3 -2 2

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
N=int(input())
H=[""]*N
H=list(map(int,input().split()))
count=0
countmax=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        count+=1
        if count>countmax and i==N-2:
            countmax=count
    elif count>countmax:
        countmax=count
        count=0
    else:
        count=0

        


print(countmax)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h = list(map(int,input().split()))
cnt = 0
ans = [0]
for i in range(n-1):
  if h[i] >= h[i+1]:
    cnt += 1
  else:
    ans.pop()
    ans.append(cnt)
    cnt = 0
ans.append(cnt)
print(max(ans))

Failing test case input:
7
20 7 3 0 3 -1 2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
h = list(map(int,input().split()))
cnt = 0
ans = [0]
for i in range(n-1):
  if h[i] >= h[i+1]:
    cnt += 1
  else:
    if ans[0] > cnt:
      cnt = 0
    else:
      ans.pop()
      ans.append(cnt)
      cnt = 0
ans.append(cnt)
print(max(ans))

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split()))
ans = 0
curr = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    curr += 1
  else:
    ans = curr
    curr = 0
else:
  ans = curr
  
print(ans)

Failing test case input:
4
-2 3 0 2

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))
ans = 0
curr = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    curr += 1
  else:
    ans = max(ans, curr)
    curr = 0
else:
  ans = max(ans, curr)
  
print(ans)

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
h = list(map(int, input().split()))
counter = 0
maximum = 0

for i in range(1, n):
  num = h[i]
  if num <= h[i-1]:
    counter += 1
    if maximum < counter or i == n-1:
      maximum = counter
  else:
    if maximum < counter or i == n-1:
      maximum = counter
    counter = 0

print(maximum)

Failing test case input:
7
10 4 3 0 6 5 2

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
h = list(map(int, input().split()))
counter = 0
maximum = 0

for i in range(1, n):
  num = h[i]
  if num <= h[i-1]:
    counter += 1
    if maximum <= counter:
      maximum = counter
  else:
    counter = 0


print(maximum)
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
H=list(map(int,input().split()))

flag=0
ans=0

for i in range(0,N-1):
    if H[i+1]-H[i]<=0:
        flag+=1
        ans=flag
    elif H[i+1]-H[i]>0:
        flag=0
        
print(ans)

Failing test case input:
7
10 7 3 0 3 0 2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
N=int(input())
H=list(map(int,input().split()))

flag=0
ans=0

for i in range(0,N-1):
    if H[i+1]-H[i]<=0:
        flag+=1
    else:
        ans=max(ans,flag)
        flag=0
        
ans=max(ans,flag)
        
print(ans)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N = int(input())
H = list(map(int, input().split()))

act = 0
for i in range(1, len(H)):
    if H[i-1] >= H[i]:
        act += 1
    else:
        act = 0

print(act)

Failing test case input:
7
7 4 3 0 6 5 2

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):

N = int(input())
H = list(map(int, input().split()))

act = 0
max_act = 0
for i in range(1, len(H)):
    if H[i-1] >= H[i]:
        act += 1
    else:
        act = 0
    if max_act < act:
        max_act = act

print(max_act)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input()
h = input().split(' ')

terminal_flg = False
step_num = 0
max_step_num = 0
for idx in range(len(h)-1):
  step_num = 0
  if terminal_flg or max_step_num >= (len(h) - idx -1):
    break
  for jdx in range(idx+1, len(h)-1):
    if int(h[jdx]) < int(h[jdx+1]):
      break
    step_num += 1
  else:
    terminal_flg = True
    
  if max_step_num < step_num:
    max_step_num = step_num
    
    
print(max_step_num)

Failing test case input:
4
-1 -1 2 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n = input()
h = input().split(' ')

terminal_flg = False
max_step_num = 0

step_num = 0
current_step = 0
ori_step_num = 0
while current_step < len(h) -1:
  if int(h[current_step]) < int(h[current_step+1]):
    if max_step_num < step_num:
      max_step_num = step_num
    step_num = 0
    if len(h) - current_step -1 < max_step_num:
      break
  else:
    step_num +=1
  current_step += 1
else:
  if max_step_num < step_num:
      max_step_num = step_num

    
print(max_step_num)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h = list(map(int,input().split()))
result = 1
for x in range(0,n-1):
    if h[x] >= h[x+1]:
        result += 1
    else:
        result = 0
print(result)

Failing test case input:
4
-1 -1 2 18

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
h = list(map(int,input().split()))
result = []
count = 0
for x in range(0,n-1):
    if h[x] >= h[x+1]:
        count += 1
    else:
        result.append(count)
        count = 0
result.append(count)
print(max(result))
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int,input().split()))
cnt = 0
old_cnt = 0
for i in range(N-1):
    if H[i] > H[i+1]:
        cnt +=1
    else:
        cnt = 0
    if old_cnt < cnt:
        old_cnt = cnt
print(old_cnt)

Failing test case input:
7
7 4 3 6 6 5 5

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int,input().split()))
cnt = 0
old_cnt = 0
ls = []
for i in range(N-1):
    if H[i] >= H[i+1]:
        cnt +=1
    else:
        ls.append(cnt)
        cnt = 0
ls.append(cnt)
print(max(ls))

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h = list(map(int, input().split()))
id = []
for i in range(n-1):
    id.append(h[i]-h[i+1])
cnt = 0
for j in range(n-2):
    if id[j+1] >= 0:
        cnt += 1
print(cnt)


Failing test case input:
5
10 7 7 1 3

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
h = list(map(int, input().split()))
id = []
ans = 0
cnt = 0
for i in range(n-1):
    if h[i]>=h[i+1]:
        cnt += 1
    else:
        ans = max(ans,cnt)
        cnt = 0
ans = max(ans,cnt)
print(max(ans,cnt))

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split()))

result = 0
tempres= 0
for i in range(0, N):
    tempres -= 1
    if tempres != 0:

        break
    for j in range(i, N - 1):
        if H[j] >= H[j + 1]:
            tempres += 1
        else:
            break
    result = max(result, tempres)
    if result >= N - i - 1:
        break
print(result)


Failing test case input:
5
4 17 7 8 6

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))

result = 0
tempres = 0
for i in range(0, N):
    if tempres != 0:
        tempres -= 1
        continue
    for j in range(i, N - 1):
        if H[j] >= H[j + 1]:
            tempres += 1
        else:
            break
    result = max(result, tempres)
    if result >= N - i - 1:
        break
print(result)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
tmp = input()
h = tmp.split(" ")
for i in range(len(h)):
    h[i] = int(h[i])
mh = h[0]
i = 0
c = 0
ans = 0
while(i < n-1 and ans < (n-i)):
    i += 1
    if(mh >= h[i]):
        mh = h[i]
        c += 1
    else:
        if(ans < c):
            ans = c
        c = 0
        mh = h[i]
if(ans < c):
    ans = c
print(ans)


Failing test case input:
7
7 5 3 6 6 5 5

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
tmp = input()
h = tmp.split(" ")
for i in range(len(h)):
    h[i] = int(h[i])
mh = h[0]
i = 0
c = 0
ans = 0
while(i < n-1):
    i += 1
    if(mh >= h[i]):
        mh = h[i]
        c += 1
    else:
        if(ans < c):
            ans = c
        c = 0
        mh = h[i]
if(ans < c):
    ans = c
print(ans)
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int,input().split()))
ans = []
k = 0
for i in range(N-1):
    if H[i]>=H[i+1]:
        k += 1
    else:
        ans.append(k)
        k = 0
print(k)

Failing test case input:
4
-2 3 0 4

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int,input().split()))
k = 0
ans = []
for i in range(N-1):
    if H[i]>H[i+1] or H[i] == H[i+1]:
        k = k+1
    else:
        ans.append(k)
        k = 0
ans.append(k)
print(max(ans))

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
h_list = list(map(int, input().split()))

max_count = 0
count = 0
for i in range(N - 1):
    if h_list[i] >= h_list[i + 1]:
        count += 1
    else:
        max_count = max(count, max_count)
        count = 1
max_count = max(count, max_count)
print(max_count- 1)

Failing test case input:
7
20 7 -1 1 3 -2 2

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
h_list = list(map(int, input().split()))

max_count = 0
count = 1
for i in range(N - 1):
    if h_list[i] >= h_list[i + 1]:
        count += 1
    else:
        max_count = max(count, max_count)
        count = 1
max_count = max(count, max_count)
print(max_count- 1)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
H=list(map(int, input().split()))
cnt=0
mcnt=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        cnt+=1
        if mcnt<cnt:
            mcnt=cnt
    else:
        cnt=0
print(cnt)

Failing test case input:
4
0 4 0 7

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N=int(input())
H=list(map(int, input().split()))
cnt=0
mcnt=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        cnt+=1
        if mcnt<cnt:
            mcnt=cnt
    else:
        cnt=0
print(mcnt)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

arr = list(map(int,input().split()))
ans = 0
tmp = 0
for i in range(n-1):
    for j in range(n-i-1):
        if arr[i+j] >= arr[i+j+1]:
            tmp += 1

    ans = max(ans, tmp-1)
    tmp = 0

print(ans)

Failing test case input:
5
2 7 26 4 6

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())

arr = list(map(int,input().split()))
ans = 0
tmp = 0
for i in range(n-1):
    if arr[i] >= arr[i+1]:
        tmp += 1
    else:
        ans = max(ans,tmp)
        tmp = 0

print(max(ans,tmp))
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = list(map(int,input().split()))

count = 0
now = 0
for i in range(a-1):

    if b[i] >= b[i+1]:
        now += 1
    else:
        count = max(count, now)
        now = 0
    print(now)
print(max(count,now))

Failing test case input:
7
64 3 0 4 0 -2 5

Expected output:
2


Actual output:
1
2
0
1
2
0
2


Fixed submission (verdict: Accepted):
a = int(input())
b = list(map(int,input().split()))

count = 0
now = 0
for i in range(a-1):

    if b[i] >= b[i+1]:
        now += 1
    else:
        count = max(count, now)
        now = 0

print(max(count,now))

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
hl = list(map(int, input().split()))
for i in range(n-1):
    if hl[i] < hl[i + 1]:
        hl[i] = 0
maximum = 0
count = 0
for i in range(n):
    if hl[i] != 0:
        count += 1
    else:
        if count > maximum:
            maximum = count
        count = 0
    if i == n - 1 and count > maximum:
        maximum = count
print(maximum - 1)

Failing test case input:
7
20 7 0 0 3 -2 2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
hl = list(map(int, input().split()))
maximum = 0
count = 0
for i in range(n-1):
    if hl[i] >= hl[i + 1]:
        count += 1
    else:
        if count > maximum:
            maximum = count
        count = 0
    if i == n-2 and count > maximum:
        maximum = count
print(maximum)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = input().split()

max = 0
count = 0
prev = H[0]
H.pop(0)
for h in H:
    if (prev > h):
        count += 1
    else:
        if (max < count):
            max = count
        count = 0
    prev = h

print(max)

Failing test case input:
5
2 7 46 4 6

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))

max = 0
count = 0
prev = H[0]
H.pop(0)
for h in H:
    if (prev >= h):
        count += 1
    else:
        if (max < count):
            max = count
        count = 0
    prev = h

if (max < count):
    max = count
print(max)
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

stdin = sys.stdin
na = lambda: map(int, stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())

MAX = int(1e9+7)

def main():
  n = ni()
  h = list(na()) + [MAX, MAX]

  cnt = 0
  check = 0
  tmp = []
  for i in range(n+1):
    hh = h[i]
    if not check:
      check = hh
    if check >= h[i+1]:
      cnt += 1
      check = hh
    else:
      tmp.append(cnt)
      check = 0
      cnt = 0
  print(max(tmp))

main()

Failing test case input:
5
12 7 8 4 3

Expected output:
2


Actual output:
4


Fixed submission (verdict: Accepted):
import sys

stdin = sys.stdin
na = lambda: map(int, stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())

MAX = int(1e9+7)

def main():
  n = ni()
  h = list(na()) + [MAX]

  cnt = 0
  check = 0
  tmp = []
  for i in range(n):
    hh = h[i]
    if not check:
      check = hh
    if check >= h[i+1]:
      cnt += 1
      check = h[i+1]
    else:
      tmp.append(cnt)
      check = 0
      cnt = 0

  print(max(tmp))

main()

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n=int(input())
a=list(map(int,input().split()))
dp=[1 for i in range(n)]
cnt=0
res=0
my_bool=True
for i in range(1,n):
    if a[i]<=a[i-1]:
        dp[i]=dp[i-1]+1
        if dp[i]>res:
            cnt=i
            res=dp[i]
            my_bool=False

if my_bool:
    print(0)
else:
    print(cnt-res+1)

Failing test case input:
4
-1 -1 2 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n=int(input())
a=list(map(int,input().split()))
dp=[1 for i in range(n)]
cnt=0
res=0
my_bool=True
for i in range(1,n):
    if a[i]<=a[i-1]:
        dp[i]=dp[i-1]+1
        if dp[i]>res:
            cnt=i
            res=dp[i]
            my_bool=False


if my_bool:
    print(0)
else:
    print(res-1)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h = input().split()
ans = 0
ls = []
for i in range(0,n-1):
    if h[i] >= h[i+1]:
        ans += 1
    else:
        ls.append(ans)
        ans = 0
ls.append(ans)
print(max(ls))


Failing test case input:
7
64 7 0 1 3 -2 2

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
h = list(map(int,input().split()))
ans = 0
ls = []
for i in range(n-1):
    if h[i] >= h[i+1]:
        ans += 1
    else:
        ls.append(ans)
        ans = 0
ls.append(ans)
print(max(ls))

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  elif cnt > max:
    max = cnt
    cnt = 0
print(max)

Failing test case input:
5
10 7 7 1 3

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
H = list(map(int, input().split())) 

count=[0]
count_index=0
index=0

while index < N-1:        
    if(H[index] >= H[index+1]):
        count[count_index]+=1
        index+=1

    else:       
        count_index=0
        count.append(0)
        index+=1

ans=0
for i in range(len(count)):
    if(ans<count[i]):
        ans=count[i]

if ans!=0:
  ans-=1
        
print(ans)

Failing test case input:
7
64 3 1 4 -1 -2 5

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
N=int(input())
H = list(map(int, input().split())) 

count=[0]
count_index=0
index=0

while index < N-1:        
    if(H[index] >= H[index+1]):
        count[count_index]+=1
        index+=1

    else:       
        count_index+=1
        count.append(0)
        index+=1

        
ans=0
for i in range(len(count)):
    if(ans<count[i]):
        ans=count[i]

        
print(ans)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=list(map(int,input().split()))
ans=0
x=0
for i in range(1,n):
  if a[i]<=a[i-1]:
    x+=1
  else:
    ans=max(ans,x)
    x=0
print(ans)

Failing test case input:
7
7 5 3 6 6 5 5

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n=int(input())
a=list(map(int,input().split()))
ans=0
x=0
for i in range(1,n):
  if a[i]<=a[i-1]:
    x+=1
  else:
    ans=max(ans,x)
    x=0
else:
  ans=max(ans,x)
print(ans)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split()))

best = 0
for i in range(0, N-1):
  count = 0
  for j in range(i+1 , N):
    if H[i] >= H[j]:
      count += 1

  if count >= best:
    best = count
print(best)

Failing test case input:
5
2 8 46 4 6

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))

best = []
a = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    a += 1
  else : 
    best.append(a)
    a = 0
best.append(a)
print(max(best))

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
h = list(map(int, input().split()))
counter = 0
maximum = 0

for i in range(1, n):
  num = h[i]
  if num <= h[i-1]:
    counter += 1
    if maximum <= counter or i == n-1:
      maximum = counter
  else:
    counter = 0

print(maximum)

Failing test case input:
7
7 4 3 0 6 5 5

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
h = list(map(int, input().split()))
counter = 0
maximum = 0

for i in range(1, n):
  num = h[i]
  if num <= h[i-1]:
    counter += 1
    if maximum <= counter:
      maximum = counter
  else:
    counter = 0


print(maximum)
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
H=list(map(int,input().split()))
C=0
for i in range(len(H)-1):
  if H[i]>H[i+1]:
    C+=1
  else:
    print(C)
    exit()
print(C)

Failing test case input:
7
7 3 8 6 6 5 7

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
N=int(input())
H=list(map(int,input().split()))
A,a=0,0
C=[0]*N
H=H[::-1]
for i in range(N-1):
  if H[i]<=H[i+1]:
    A+=1
  else:
    C[a]=A
    a+=1
    A=0
C[a]=A
print(max(C))

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
hs=list(map(int,input().split()))
temp=0
ans=0

for i in range(n-1):
  if hs[i+1] >= hs[i]:
    temp+=1
    ans=max(ans,temp)
  else:
    temp=0
    
print(ans)

Failing test case input:
7
7 5 8 6 6 5 5

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
n=int(input())
hs=list(map(int,input().split()))
temp=0
ans=0

for i in range(n-1):
  if hs[i+1] <= hs[i]:
    temp+=1
    ans=max(ans,temp)
  else:
    temp=0
    
print(ans)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
HS = list(map(int, input().split()))

if N == 1:
    print(1)
    exit()

c = 0
max_c = 0
for i in range(N - 1):
    if HS[i] >= HS[i + 1]:
        c += 1
    else:
        max_c = max(max_c, c)
        c = 0

print(c)


Failing test case input:
7
20 7 0 0 3 -2 2

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
HS = list(map(int, input().split()))

if N == 1:
    print(0)
    exit()

c = 0
max_c = 0
for i in range(N - 1):
    if HS[i] >= HS[i + 1]:
        c += 1
        max_c = max(max_c, c)
    else:
        c = 0

print(max_c)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



N = int(input())
H = list(map(int, input().split()))
record = 0
count = 0

for i in range(0,N-1):
    if H[i] >= H[i+1]:
        count += 1
    else:
        record = count
        count = 0

ans = max(record,count)

print(ans)

Failing test case input:
4
0 -1 2 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):



N = int(input())
H = list(map(int, input().split()))
ans = 0
count = 0

for i in range(0,N-1):
    if H[i] >= H[i+1]:
        count += 1
        ans = max(ans,count)
    else:
        count = 0

print(ans)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split()))
max_n = 0
tmp = 0
for i in (reversed(range(N))):
  if H[i] <= H[i-1]:
    tmp += 1
  else:
    if tmp > max_n:
      max_n = tmp
    tmp = 0

print(max_n)

Failing test case input:
4
0 -1 1 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))
max_n = 0
tmp = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
  else:
    max_n = max(max_n, tmp)
    tmp = 0
    
print(max(max_n, tmp))
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
x=[i for i in map(int,input().split())]
y=0
z=0
i=0
while y<N:
    try:
        if x[y]>=x[y+1]:
            i+=1
        else:
            if z<i:
                z=i
            i=0
    except:
        z=i
    y+=1

print(z)

Failing test case input:
5
2 7 8 4 6

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N=int(input())
x=[i for i in map(int,input().split())]
y=0
z=0
i=0
while y<N:
    if y<N-1:
        if x[y]>=x[y+1]:
            i+=1
        else:
            if z<i:
                z=i
            i=0
    elif y==N-1:
        if z<i:
            z=i
    y+=1

print(z)

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split()))

current = H.pop(0)
count = 0
count_max = 0

for h in H:
    if current >= h:
        count += 1
    else:
        count_max = max(count, count_max)
        count = 0
    current = h

print(count)


Failing test case input:
7
64 7 0 1 0 -2 3

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split()))

current = H.pop(0)
count = 0
count_max = 0

for h in H:
    if current >= h:
        count += 1
    else:
        count_max = max(count, count_max)
        count = 0
    current = h

count_max = max(count, count_max)
print(count_max)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N = int(input())
H = list(map(int,input().split()))
HR = H[::-1]
cnt = 0
max_cnt = 0
for i in range(N - 1):
    if HR[i] <= HR[i+1] :
       cnt += 1
    else :
        if max_cnt < cnt :
            max_cnt = cnt
        cnt = 0
print(max_cnt)

Failing test case input:
7
64 7 0 1 2 -2 2

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):

N = int(input())
H = list(map(int,input().split()))
cnt = 0
max_cnt = 0
for i in range(N - 1):
    if H[i] >= H[i+1] :
        cnt += 1
    else :
        if max_cnt < cnt :
            max_cnt = cnt
        cnt = 0
if max_cnt <= cnt :
    max_cnt = cnt
print(max_cnt)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
H=list(map(int,input().split()))
A,a=0,0
C=[0]*N
H=H[::-1]
for i in range(N-1):
  if H[i]<=H[i+1]:
    A+=1
  else:
    C[a]=A
    a+=1
    A=0
print(max(C))

Failing test case input:
4
0 -1 2 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N=int(input())
H=list(map(int,input().split()))
A,a=0,0
C=[0]*N
H=H[::-1]
for i in range(N-1):
  if H[i]<=H[i+1]:
    A+=1
  else:
    C[a]=A
    a+=1
    A=0
C[a]=A
print(max(C))
Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l=list(map(int,input().split()))

ans=0
a=0
for i in range(n-1):
  if l[i]>=l[i+1]:
    a+=1
  else:
    ans=max(ans,a)
    a=0
print(ans)

Failing test case input:
4
-1 2 4 0

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n=int(input())
l=list(map(int,input().split()))

ans=0
a=0
for i in range(n-1):
  if l[i]>=l[i+1]:
    a+=1
  else:
    ans=max(ans,a)
    a=0
ans=max(ans,a)
print(ans)

Problem: p02923
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def c():
    n = int(input())
    hs = list(map(int, input().split()))

    if n <= 1:
        print(0)
        return

    count = 0
    for i in range(2, n):
        if hs[i] <= hs[i-1]:
            count += 1
        else:
            count = 0

    print(count)


if __name__ == '__main__':
    c()


Failing test case input:
4
0 -1 1 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
def c():
    n = int(input())
    hs = list(map(int, input().split()))

    if n <= 1:
        print(0)
        return

    max_count, count = 0, 0
    for i in range(1, n):
        if hs[i] <= hs[i-1]:
            count += 1
        else:
            max_count = max(max_count, count)
            count = 0

    max_count = max(max_count, count)
    print(max_count)


if __name__ == '__main__':
    c()

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
H = list(map(int, input().split())) 
H.reverse()

ans = 0
arr = [0]

for i in range(N-1):
    if H[i+1] >= H[i]:
        ans += 1
    else:
        arr.append(ans)
        ans = 0

print(max(arr))

Failing test case input:
7
10 4 3 0 3 5 2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
H = list(map(int, input().split())) 

ans = 0
cnt = 0

for i in range(N-1):
    if H[i] < H[i+1]:
        cnt = 0
    else:
        cnt += 1
    ans = max(cnt, ans)

print(ans)

Problem: p02923
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
h_array = [int(x) for x in input().split()]
ans = []
res = 0
now_h = h_array[-1]
for h in h_array[::-1]:
    if now_h <= h:
        res += 1
        ans.append(res)
    else:
        res = 0
        ans.append(res)
    now_h = h
print(max(ans)-1)

Failing test case input:
7
36 7 0 1 3 -2 2

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
h_array = [int(x) for x in input().split()]
ans = []
res = 0
all_res = 0
now = h_array[0]
for h in h_array[1:]:
    if h <= now:
        res += 1
    else:
        res = 0
    all_res = max(all_res, res)
    now = h
print(all_res)
Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
print(3*a^2)

Failing test case input:
-140

Expected output:
58800


Actual output:
-418


Fixed submission (verdict: Accepted):
a = int(input())
print(3*a*a)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(3 * int(input())**3)

Failing test case input:
-140

Expected output:
58800


Actual output:
-8232000


Fixed submission (verdict: Accepted):
print(3 * (int(input())**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()

S = int(S)

S = 3 * S**2

Failing test case input:
-140

Expected output:
58800


Actual output:

Fixed submission (verdict: Accepted):
S = input()

S = int(S)

S = 3 * S**2

print(S)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())

b = 3 * (a^2)

print(b)

Failing test case input:
342

Expected output:
350892


Actual output:
1020


Fixed submission (verdict: Accepted):
a = int(input())
b = 3 * (a ** 2)
print(b)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = float(input())
print(3*r*r)

Failing test case input:
397

Expected output:
472827


Actual output:
472827.0


Fixed submission (verdict: Accepted):
r = int(input())
print(3*r*r)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(3**int(input()))

Failing test case input:
397

Expected output:
472827


Actual output:
2612992262464937989350528576886473933944738874547678361587823081824521687095664228021455501090634598450183419808346515254330733076734243210894262387205009519554084641620752340460862345706963


Fixed submission (verdict: Accepted):
print(3*int(input())**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r=input()
r=int(r)
print(r**3)

Failing test case input:
397

Expected output:
472827


Actual output:
62570773


Fixed submission (verdict: Accepted):
r=input()
r=int(r)
print(3*(r**2))
Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r=int(input())
print(3*(r**r))

Failing test case input:
397

Expected output:
472827


Actual output:
1573810504377023816424812852614046552009796335131593640090223513963515568842476207597323146328776529147435194253231611129024675158329163871304299990232681980396905636133870467440976529095131821454130125166349628979488395980149769941977392547355404144611691025789071212218910523482599563968195609428986987090382985390952098191707487476125333385744739440654776248744974999775636819035017877335445450114669937794758770451218764119286978627693023314096764536764754806342547074529511994075921380299886116652790788636270362741641311428007814310788034133903390681389797065249562214838188706747065134798384382095899724680963513826254199293683135251144626967728167958938529916765270112880248324499884163633352694301492943577285442185356267549331342743868520913100007853868311400654580762654266120839937046159246042573207141925318013865854492366478813052990461463836048635451400090840143448413788356866345350429685885608314427558201406938557279994065114383539586580026915650919273487427304138984272646429275204823331716138260956708562024443511


Fixed submission (verdict: Accepted):
r=int(input())
print(3*r**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(int(input())**3)

Failing test case input:
-91

Expected output:
24843


Actual output:
-753571


Fixed submission (verdict: Accepted):
print(3*(int(input()))**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(int(input())^2*3)

Failing test case input:
397

Expected output:
472827


Actual output:
395


Fixed submission (verdict: Accepted):
print(int(input())**2*3)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(3*(r^2))

Failing test case input:
342

Expected output:
350892


Actual output:
1020


Fixed submission (verdict: Accepted):
r = int(input())
print(3*(r**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

print(3*r*r*r)

Failing test case input:
-140

Expected output:
58800


Actual output:
-8232000


Fixed submission (verdict: Accepted):
r = int(input())

print(3*r*r)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r=int(input())
print(3**r)

Failing test case input:
-140

Expected output:
58800


Actual output:
1.595968587897914e-67


Fixed submission (verdict: Accepted):
r=int(input())
print(3*r**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(3*(r**3))

Failing test case input:
397

Expected output:
472827


Actual output:
187712319


Fixed submission (verdict: Accepted):
r = int(input())
print(3*(r**2))

Problem: p02969
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
r = int(input())
print(4*r**2)

Failing test case input:
397

Expected output:
472827


Actual output:
630436


Fixed submission (verdict: Accepted):
r = int(input())
print(3*r**2)
Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(2*r**2)

Failing test case input:
397

Expected output:
472827


Actual output:
315218


Fixed submission (verdict: Accepted):
r = int(input())
print(3*r**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = float(input())
print(3*r**2)

Failing test case input:
-140

Expected output:
58800


Actual output:
58800.0


Fixed submission (verdict: Accepted):
r = int(input())
print(3*r**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(pow(2,int(input()))*3)

Failing test case input:
342

Expected output:
350892


Actual output:
26876936906133650526689307366821331337459745966815794418799869211565502454161931344570529919259285389312


Fixed submission (verdict: Accepted):
print(int(input())**2*3)

Problem: p02969
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
r = int(input())

print(3*(r**3))


Failing test case input:
-140

Expected output:
58800


Actual output:
-8232000


Fixed submission (verdict: Accepted):
r = int(input())

print(3*(r**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(4*r*r)

Failing test case input:
342

Expected output:
350892


Actual output:
467856


Fixed submission (verdict: Accepted):
r = int(input())
print(3 * r * r)

Problem: p02969
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
r = int(input())
print(4 * r * r)

Failing test case input:
397

Expected output:
472827


Actual output:
630436


Fixed submission (verdict: Accepted):
r = int(input())
print(3 * r * r)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
print(3*(a^2))

Failing test case input:
397

Expected output:
472827


Actual output:
1197


Fixed submission (verdict: Accepted):
a = int(input())
print(3*a**2)
Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
print(3*a**a)

Failing test case input:
480

Expected output:
691200


Actual output:
2971085809008774535951030658704705851379365934133720234750556234339015145038749354056705287318964306488398209064150707554297739795690346056090031350978880257702125248359833286385220362068054284308927019229850200588418370763099720479170418789170105859743303994811210496037199313299573001618049013771358131377453801465196163439625670791829239805269474812857643347951855627976570588855665880138878858575195125795966219500307714731415852517666970677861165752737735557660379123022391478240020597560361873982366884626458799636097817267969043634001866771360028205932646289944015478684670224300342155003775365154307326953774682467781971753934773810571744090391453696221599173592985479230106530460831782344738171547213396983546203555134741180047603358555281405119827021573304776116139942910893094144829983090989334528000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000


Fixed submission (verdict: Accepted):
a=int(input())
print(3*a*a)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r=int(input())
print(3*r^2)

Failing test case input:
397

Expected output:
472827


Actual output:
1189


Fixed submission (verdict: Accepted):
r=int(input())
print(3*r*r)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(3*(int(input())**3))


Failing test case input:
-140

Expected output:
58800


Actual output:
-8232000


Fixed submission (verdict: Accepted):
print(3*(int(input())**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main10():
    num = int(input())
    result = num * num * 3
    print(num)

if __name__ == "__main__":
    main10()

Failing test case input:
480

Expected output:
691200


Actual output:
480


Fixed submission (verdict: Accepted):
def main10():
    num = int(input())
    result = num * num * 3
    print(result)

if __name__ == "__main__":
    main10()

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(3*int(input())**3)

Failing test case input:
-91

Expected output:
24843


Actual output:
-2260713


Fixed submission (verdict: Accepted):
print(3*(int(input())**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r=int(input())
print(8*r**2)

Failing test case input:
397

Expected output:
472827


Actual output:
1260872


Fixed submission (verdict: Accepted):
r=int(input())
print(3*r**2)
Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

def cal_S(r):
    return r**2

print(cal_S(r))


Failing test case input:
480

Expected output:
691200


Actual output:
230400


Fixed submission (verdict: Accepted):
r = int(input())

def cal_S(r):
    return 3*r**2

print(cal_S(r))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(3 * (3 ** 2))

Failing test case input:
397

Expected output:
472827


Actual output:
27


Fixed submission (verdict: Accepted):
r = int(input())
print(3 * (r ** 2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

print(3*r^2)

Failing test case input:
-140

Expected output:
58800


Actual output:
-418


Fixed submission (verdict: Accepted):
r = int(input())

print(3*r**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=float(input())
print(3*a*a)

Failing test case input:
397

Expected output:
472827


Actual output:
472827.0


Fixed submission (verdict: Accepted):
a=float(input())
print(int(3*a*a))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print( 2 * r ^ 2 )

Failing test case input:
342

Expected output:
350892


Actual output:
686


Fixed submission (verdict: Accepted):
r = int(input())
print( 3 * r ** 2 )

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(4*(r**2))

Failing test case input:
-91

Expected output:
24843


Actual output:
33124


Fixed submission (verdict: Accepted):
r = int(input())
print(3*(r**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
a = int(a)
print("{}".format(3*a*a*a))

Failing test case input:
342

Expected output:
350892


Actual output:
120005064


Fixed submission (verdict: Accepted):
a = input()
a = int(a)
print("{}".format(3*a*a))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
print(3 * a**3)

Failing test case input:
397

Expected output:
472827


Actual output:
187712319


Fixed submission (verdict: Accepted):
a = int(input())
print(3 * a**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
kotae = 3*r**2

Failing test case input:
480

Expected output:
691200


Actual output:

Fixed submission (verdict: Accepted):
r = int(input())
kotae = 3*r**2
print(kotae)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(3 * r * r * r)

Failing test case input:
397

Expected output:
472827


Actual output:
187712319


Fixed submission (verdict: Accepted):
r = int(input())
print(3 * r**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
s = 2*r*r
print(s)


Failing test case input:
-140

Expected output:
58800


Actual output:
39200


Fixed submission (verdict: Accepted):
r = int(input())
s = 3*r*r
print(s)
Problem: p02969
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
r = int(input())
print(r)
ans = 3*r*r
print(ans)

Failing test case input:
397

Expected output:
472827


Actual output:
397
472827


Fixed submission (verdict: Accepted):
r = int(input())
ans = 3*r*r
print(ans)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r  = int(input())

print(4 * r * r)

Failing test case input:
-91

Expected output:
24843


Actual output:
33124


Fixed submission (verdict: Accepted):
r  = int(input())

print(3 * r * r)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(3*(r)*2)

Failing test case input:
-140

Expected output:
58800


Actual output:
-840


Fixed submission (verdict: Accepted):
r = int(input())
print(3*(r)**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
print(3*(r**3))

Failing test case input:
342

Expected output:
350892


Actual output:
120005064


Fixed submission (verdict: Accepted):
r = int(input())
print(3*(r**2))

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

print(3 * r ** r)

Failing test case input:
480

Expected output:
691200


Actual output:
2971085809008774535951030658704705851379365934133720234750556234339015145038749354056705287318964306488398209064150707554297739795690346056090031350978880257702125248359833286385220362068054284308927019229850200588418370763099720479170418789170105859743303994811210496037199313299573001618049013771358131377453801465196163439625670791829239805269474812857643347951855627976570588855665880138878858575195125795966219500307714731415852517666970677861165752737735557660379123022391478240020597560361873982366884626458799636097817267969043634001866771360028205932646289944015478684670224300342155003775365154307326953774682467781971753934773810571744090391453696221599173592985479230106530460831782344738171547213396983546203555134741180047603358555281405119827021573304776116139942910893094144829983090989334528000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000


Fixed submission (verdict: Accepted):
r = int(input())


print(3 * r ** 2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
print(3*a^2)

Failing test case input:
397

Expected output:
472827


Actual output:
1189


Fixed submission (verdict: Accepted):
a = int(input())
print(3*a**2)

Problem: p02969
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input());
print(3*a**3);

Failing test case input:
397

Expected output:
472827


Actual output:
187712319


Fixed submission (verdict: Accepted):
a=int(input());
print(3*a**2);