fork download
copy 
  1. case=int(input())
  2. for i in range(case):
  3.     n=int(input())
  4.     l=[]
  5.     r=[]
  6.     lm=[]
  7.     l=list(map(int,raw_input().split()))
  8.     r=list(map(int,raw_input().split()))
  9.  
  10.     for j in range(n):
  11.         lm.append(l[j]*r[j])
  12.         print lm
  13.  
  14.     if lm.count(max(lm))>1:
  15.     	if r.count(max(r))>1:
  16.     		print lm.index(lm[0])+1
  17.     	else:
  18.     		print r.index(max(r))+1
  19.     else:
  20.     	print lm.index(max(lm))+1
Success #stdin #stdout 0s 23352KB
comments (?)
stdin
copy 
1
3 
3 3 3
3 3 3
stdout
copy 
[9]
[9, 9]
[9, 9, 9]
1
https://ideone.com/zcX7lA
language:
Python (cpython 2.7.16)
created:
8 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!