[Solution] A Battle Against a Dragon solution codeforces | Kotlin Heroes: Episode 8

A Battle Against a Dragon solution codeforces A squad of nn warriors is defending a castle from a dragon attack. There are mm barricades between the castle and the dragon. The warriors are numbered from 11 to nn. The ii-th warrior knows kiki attacks: the jj-th of them deals ai,jai,j damage to the dragon and can only be applied if there are exactly bi,jbi,j barricades between the castle and the …

[Solution] A Battle Against a Dragon solution codeforces | Kotlin Heroes: Episode 8 Read More »