n is the number of vertex and Bruteforce is O(3^n)..Thanks in advance.
(it's a additional exercise of SRM487D1_550pt)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
n is the number of vertex and Bruteforce is O(3^n)..Thanks in advance.
(it's a additional exercise of SRM487D1_550pt)
void exgcd(int a,int b,int &x,int &y)
{ if (b) {exgcd(b,a%b,y,x);y-=x*(a/b);} else x=1,y=0; } int main() { int x,y; for(int i=1;i<=1000;i++) for(int j=i;j<=1000;j++) { exgcd(i,j,x,y); assert(max(abs(x),abs(y))<=max(i,j)); } }
Sometimes I just want to review a topic which I have ever read before,but there is no convenient approach to find it unless it is still appeared in "recent actions".
(SRM 514 250) In this problem n or m will be 1 and there is a elegant conclusion to solve this problem -- if you have a (1,even),you can go any girds,and if you have a (1,odd),you can go to any girds(x,y) which x+y is even
Name |
---|