Hello Cf,
Me and my team (Enjiro,GabrielTaets) were having trouble on virtual participating at 2015 PSUT Coding Marathon, we couldnt figure out how to solve problem B:
http://codeforces.com/gym/100687/problem/B
Our approach was:
- Look for the Student ID on the table of IDs, if there it is, we print;
- If any substring "?XX" repeat 10 times, the answer will be the max value of them
- If any substring "?XX" repeats X times and the others "YXX" exists, (since none of them are equal, in the given range), the answer will be the max value of "?XX"
- Then we take the max of steps 2 and 3.
Would be really really helpfull any hint ^-^
Sorry for my bad english =/