摘要:Leonardo's NotebookTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1514Accepted: 645Description— I just bought Leonardo's secret notebook! Rare object collector Stan Ucker was really agitated but his friend, special investigator Sarah Kepticwas unimpressed. — How do you know it is g
阅读全文
摘要:CARDSTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1033Accepted: 544DescriptionAlice and Bob have a set of N cards labelled with numbers 1 ... N (so that no two cards have the same label) and a shuffle machine. We assume that N is an odd integer. The shuffle machine accepts the set of car
阅读全文
摘要:CipherTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 16995Accepted: 4445DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret key at their last me
阅读全文
摘要:Cow SortingTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 4753Accepted: 1734DescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1...100,000. Since grumpy cows are more likely to damag
阅读全文