consider regular Codeforces round consist problem use dynamic scoringyou give final scoreboard for participant include time accept submission problem give also solution know able hack the change scoreboard happen end round challengeswhat good place endmore formally n people participate include for problem solve exactly k people end round maximum score problem define if n2k2n maximum possible score 500 if n4k2n maximum possible score 1000 if n8k2n maximum possible score 1500 if n16k2n maximum possible score 2000 if n32k2n maximum possible score 2500 if 32kn maximum possible score 3000 let maximum possible score problem equal s then contestant do not manage accepted solution hack earn 0 point problem if got solution accept t minute begin round solution was not hack earn point problemthe overall score participant equal sum point earn problem plus 100 point successful hack hacksthe result place equal plus number participant who s overall score strictly great