lyf

摘要： Given 2 permutations of integers from 1 to N, you need to find the minimum number of operations necessary to change both or any one of them in such a ... 阅读全文

摘要： 小明系列问题――小明序列Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4521Description 大家都知道小明最喜欢研究跟序列有关的问题了，可是也就因为这样，... 阅读全文

摘要： Magic NumberTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4323DescriptionThere are many magic numbers whos... 阅读全文

摘要： Arcane Numbers 1Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4320DescriptionVance and Shackler like playi... 阅读全文

摘要： C. Devu and Partitioning of the Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu being a... 阅读全文

摘要： O(n) 筛选素数#includeusing namespace std;const int M = 1e6 + 10 ;int mindiv[M] ;//每个数的最小质因数int prim[M] , pnum ;//存素数bool vis[M] ;void prim () { for... 阅读全文

摘要： B -Building Fire StationsTime Limit:5000MSMemory Limit:131072KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3820Appoint description:DescriptionM... 阅读全文

摘要： K -Known NotationTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3829Appoint description:DescriptionDo you kno... 阅读全文

摘要： 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #include <cmath> 5 #include <vector> 6 #include <iostream> 7 #include <cassert> 8 9 阅读全文

摘要： Zero EscapeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 289Accepted Submission(s): 135Problem... 阅读全文