码迷,mamicode.com
首页 >  
搜索关键字:bit reversal    ( 10533个结果
POJ 1459 Power Network
Power NetworkTime Limit: 2000msMemory Limit: 32768KBThis problem will be judged onPKU. Original ID:145964-bit integer IO format:%lld Java class name:M...
分类:Web程序   时间:2014-09-13 12:00:39    阅读次数:201
POJ 2135 Farm Tour
Farm TourTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:213564-bit integer IO format:%lld Java class name:MainW...
分类:其他好文   时间:2014-09-13 00:43:04    阅读次数:253
HDU 3062 Party
PartyTime Limit: 1000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:306264-bit integer IO format:%I64d Java class name:Main有n对夫...
分类:其他好文   时间:2014-09-12 21:56:44    阅读次数:342
POJ 1094 Sorting It All Out
Sorting It All OutTime Limit: 1000msMemory Limit: 10000KBThis problem will be judged onPKU. Original ID:109464-bit integer IO format:%lld Java class n...
分类:其他好文   时间:2014-09-12 01:06:42    阅读次数:178
Programming pages of Jasper Neumann
http://programming.sirrida.de/Discussion topicsBit permutationsDownload source filesList of function descriptionsOnline source code generator for bit ...
分类:Web程序   时间:2014-09-11 23:40:02    阅读次数:320
HDU 1704 Rank
RankTime Limit: 1000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:170464-bit integer IO format:%I64d Java class name:Mainthere...
分类:其他好文   时间:2014-09-11 22:16:02    阅读次数:228
Bit Twiddling Hacks
http://graphics.stanford.edu/~seander/bithacks.htmlBit Twiddling HacksBy Sean Eron Andersonseander@cs.stanford.eduIndividually, thecode snippets here ...
分类:其他好文   时间:2014-09-11 22:15:02    阅读次数:315
POJ 2431 Expedition
ExpeditionTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:243164-bit integer IO format:%lld Java class name:Main...
分类:其他好文   时间:2014-09-11 20:54:42    阅读次数:323
linux md5
一:字符串“hello”的MD5:[root@localhost~]#echo-n‘hello‘|md5sum|cut-d‘‘-f1命令解释:md5sum:显示或检查MD5(128-bit)校验和,若没有文件选项,或者文件处为"-",则从标准输入读龋echo-n:不打印换行符。cut:cut用来从标准输入或文本文件中剪切列或域。剪切文本可以将之粘贴..
分类:系统相关   时间:2014-09-11 17:35:12    阅读次数:365
Codeforces Round #265 (Div. 2)
A.inc ARG 感觉题意不是很清楚,看样例才看懂,就是一串二进制数,左边是低位,就扫一遍记录下改变的bit数#include #include #include using namespace std;const int maxn = 200;int n, cnt;char lis[maxn]....
分类:其他好文   时间:2014-09-11 17:11:22    阅读次数:191
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!