|
|
вернуться в форумlimitation for the full search Suppose: 1) A>B 2) gcd(A,B)=1 Need to find maximal A*x + B*y I try all 0 <= x <= (N-B) / A + 1 This upper limit gives AC, but is it optimal? Re: limitation for the full search Послано -XraY- 18 ноя 2011 23:34 Edited by author 18.11.2011 23:48 |
|
|