|
|
вернуться в форумis there any effient algo to solve n<=11,m<=11?? I know how to construct larger cases when knowing solution n<=11&&m<=11,but brute_force for small tests is tooooooooo slow.. Re: is there any effient algo to solve n<=11,m<=11?? AC.... |
|
|
