I was interested in practising more on problems Div2 C and Div2 D, But such problems where they don't depend on any specific algorithms: dp, binary search, graph, tree,....etc rather on problem solving skills where the difficulty is in the apprehending the solution itself. also problems which depend on creating certain permutations or matrices that specifies certain conditions.
any resources related will be welcomed too. If you can recommend any please, Thanks a lot :D
Most of the easy problems from tags like "constructive algorithms", "implementation", "brute force" etc. could be what you're looking for. Are you sure you checked this?
I don't want easy problems :D
I want some difficult ones.
IOI 2011 parrots , IOI 2016 practice task DNA , IOI 2013 cave , IOI 2012 last supper
I can't find the IOI 2016 practice tasks anywhere, can you share it?
There is a binary string s of ones and zeroes of length 1000 , you should find the string by asking at most 1024 questions.
In each question, you can ask if a certain string occurs as a substring of s or not.
Would you provide a link to the problem ?
Thanks in advance.
There are some contests on the gym that contains what you need ,,, This one http://codeforces.net/gym/100989 may conatin what u need .
To get what you want just search for coach Zaghloul
can you tell me where i could find couch zaghloul ?
Is she like andrew stankevich? :D
she ???
If I recall correctly IOI'13 Art Classroom does not require a "specific algorithm". It's kind of in the vein of classification problems like machine learning.