111qqz

摘要： http://poj.org/problem?id=1833还是next_permutation.这次是Int类型的需要注意的是next_permutation是先判断时候有后继，返回一个bool值，如果为true，就转化到后继。而next_permutation函数本书不考虑其值，就具有转化成后继... 阅读全文

摘要： http://poj.org/problem?id=1256题意是说求出一个字符串的全排列，按字典序需要注意的是字典序和传统意义上的字典序不同重新定义了,A#include #include #include #include #include #include using namespace st... 阅读全文

摘要： B. Mike and Funtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike and some bears are playing a... 阅读全文

摘要： A. Mike and Faxtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Mike was walking in the subw... 阅读全文

摘要： F -A Bug's LifeTime Limit:10000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionBackgroundProfessor Hopper is researching the... 阅读全文

摘要： C -Find them, Catch themTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe police office in Tadu City decide... 阅读全文

摘要： C. Tavas and Karafstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKarafs is some kind of vegeta... 阅读全文

摘要： D. Handshakestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn February, 30thnstudents came in t... 阅读全文

摘要： C. Polycarpus' Dicetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp hasndiced1, d2, ..., ... 阅读全文

摘要： B. Covered Pathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe on-board computer on Polycarp'... 阅读全文