Graph Theory 1 [Programming Competition Problems]

Показать описание

Рекомендации по теме

Комментарии

A simple Implementation Using Python

for i in range(0, input()):
x, y = [int(x) for x in raw_input().split()]
already = []
todo = []
for k in range(0, x):
curr = raw_input().split("/")
for dirs in range(2, len(curr) +1):

for k in range(0, y):
curr = raw_input().split("/")
for dirs in range(2, len(curr)+1):

already = list(set(already))
todo = list(set(todo))
ans = 0
for dirs in todo:
if dirs not in already:
ans = ans + 1
sta = "Case #"+str(i+1)+": " + str(ans)
print sta

vigneshhariakavichu

I am really liking your problem solving videos, it might just help me in learning :)
Kepp up the good work

AnshulChauhan

Do be honest I got bit confused somewhere in the middle and the mistakes in the code played some role on that, (i find my way back in the debugging), but nevertheless the effort and the video were great and a huge help. :-)

ExarchiasGhost