Learn practical skills, build real-world projects, and advance your career
Created 3 years ago
#Marathon winner problem
t=int(input())
time=int(input())
steps=[]
winner_list=[0]*t
for _ in range(t):
steps_list=(list(map(int,input().split())))
steps.append(steps_list)
sum_list=[0]*t
for second in range(2,time+1,2):
for pn in range(t):
sum_list[pn]+=(steps[pn][second-2]+steps[pn][second-1])*steps[pn][time]
maximum=max(sum_list)
if (sum_list.count(maximum)>1):
for x in range(t):
if (sum_list[x]==maximum):
winner_list[x]+=1
else:
idx=sum_list.index(maximum)
winner_list[idx]+=1
winner=max(winner_list)
print(winner_list.index(winner)+1,end='')
3
8
2 2 4 3 5 2 6 2 3
3 5 7 4 3 9 3 2 2
1 2 4 2 7 5 3 2 4
2
#lexographical analysis
t=int(input())
while (t!=0):
p=input()
s=input()
count=[0]*26
for i in s:
x=ord(i)
count[x-97]+=1
for i in range(26):
y=ord(p[i])
if(count[y-97]!=0):
print(p[i]*count[y-97],end='')
t-=1
if(t!=0):
print()
1
polikujmnhytgbvfredcxswqaz
abcd
bdca
#lexi analysis part 2
test=int(input())
while test>0:
p=input()
s=input()
list1=[]
for i in s:
list1.append(p.find(i))
list1.sort()
for i in list1:
print(p[i],end='')
if test>1:
print()
test-=1
1
polikujmnhytgbvfredcxswqaz
abcd
bdca
#dancing monkeys
t=int(input())
#x=[]
while(t!=0):
count=0
n=int(input())
x=list(map(int,input().split()))
x.insert(0,0)
y=list(range(n+1))
ori_pos=y
while True:
z=[0]*(n+1)
for i in range(1,n+1):
z[x[i]]=y[i]
count+=1
if z==ori_pos:
print(count)
break
else:
y=z
t-=1
1
6
3 6 5 4 1 2
6
#road crash
import math
total_cars=int(input())
freq={}
total_collisions=0
for i in range(total_cars):
curr_x,curr_y,curr_speed=list(map(int,input().split()))
distance=math.sqrt(curr_x**2+curr_y**2)
curr_time=distance/curr_speed
if curr_time in freq:
freq[curr_time]+=1
else:
freq[curr_time]=1
total_collisions=total_collisions+freq[curr_time]-1
print(total_collisions)
5
5 12 1
16 63 5
-10 24 2
7 24 2
-24 7 2
4