BUCT_范文帝

Problem Description KazaQ wears socks everyday. At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts on a pair of socks which has the smal

Problem Description There is a youngster known for amateur propositions concerning several mathematical hard problems. Nowadays, he is preparing a thought-provoking problem on a specific type o

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072K(Java/Others) Problem Description Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge t