摘要： #include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>using namespace std;int str[11000];int main( ){ int N, M, i, j; while ( scanf("%d%d", &N, &M) != EOF) { for ( i = 1; i <= N; i++) str[i-1] = i; //默认已经是第1小了 int num = 0; while( num 阅读全文

摘要： EncodingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11610Accepted Submission(s): 4882Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k sam 阅读全文

摘要： Least Common MultipleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12188Accepted Submission(s): 4467Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the nu 阅读全文

摘要： Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11217Accepted Submission(s): 5051Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, 阅读全文

摘要： SafecrackerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2962Accepted Submission(s): 1534Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Kle 阅读全文