#1067

1067. Sort with Swap(0,*) (25)

Givenanypermutationofthenumbers{0,1,2,...,N-1},itiseasytosorttheminincreasingorder.ButwhatifSwap(0,*)istheONLYoperationthatisallowedtouse?Forexample,tosort{4,0,...
代码星球 ·2020-04-08

1067: 密室寻宝(find)

#include<iostream>#include<iomanip>#include<cstdlib>#include<string>usingnamespacestd;intmain(){intp,q;intm,n;cin>>p>>q;m=p&...
代码星球 ·2020-04-04
首页上一页123下一页尾页