摘要： 7758. Growing StringsProblem code: MGLAR10EnglishVietnameseGene and Gina have a particular kind of farm. Instead of growing animals and vegetables, asit is usually the case in regular farms, they grow strings. A string is a sequence of characters.Strings have the particularity that, as they grow, th 阅读全文

摘要： -----------------------A. Help Vasilisa the Wise 2---暴力枚举---#include using namespace std;int r1,r2,c1,c2,d1,d2;int a[2][2];bool solve(){ if (a[0][0]+a[0][1]!=r1) return false; if (a[1][0]+a[1][1]!=r2) return false; if (a[0][0]+a[1][0]!=c1) return false; if (a[0][1]+a[1][1]!=c2) return fa... 阅读全文

摘要： --------------A. Amusing Joke--前两行的字母恰好组成最后一行--#include #include using namespace std;char a[1111];int ch[26]={0};int main(){ cin>>a; for (int i=0;a[i];i++){ ch[a[i]-'A']++; } cin>>a; for (int i=0;a[i];i++){ ch[a[i]-'A']++; } cin>>a; for (int i=0;a[i];i++){ ... 阅读全文

摘要： Minimizing maximizerTime Limit:5000MSMemory Limit:30000KTotal Submissions:3047Accepted:1187DescriptionThe company Chris Ltd. is preparing a new sorting hardware called Maximizer. Maximizer has n inputs numbered from 1 to n. Each input represents one integer. Maximizer has one output which represents 阅读全文

摘要： BlocksTime Limit:1000MSMemory Limit:65536KTotal Submissions:3665Accepted:1611DescriptionPanda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he starts to think of a math problem of painting. Suppose there are N blocks in a line and each block can be 阅读全文

摘要： ---/*==============================================*\ | Code Library\*==============================================*//** head-file **/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /** define-for **/#define REP( 阅读全文

摘要： -----------------A. Helpful Maths----将一个由+和123组成的式子从小到大排序...----#include #include #include #include using namespace std;const int maxn=1111;char s[maxn];vectorvc;int main(){ vc.clear(); cin>>s; int len=strlen(s); for (int i=0;i='1'&&s[i]#include #include #include using namespac 阅读全文

摘要： Design the cityTime Limit:1 Second Memory Limit:32768 KBCerror is the mayor of city HangZhou. As you may know, the traffic system of this city is so terrible, that there are traffic jams everywhere. Now, Cerror finds out that the main reason of them is the poor design of the roads distribution, and 阅读全文

摘要： DescriptionDr.Ellie Arroway has established contact with an extraterrestrial civilization. However, all efforts to decode their messages have failed so far because, as luck would have it, they have stumbled upon a race of stuttering aliens! Her team has found out that, in every long enough message, 阅读全文

摘要： DescriptionProblem JJewel MagicI am a magician. I have a string of emeralds and pearls. I may insert new jewels in the string, or remove old ones. I may even reverse a consecutive part of the string. At anytime, if you point to two jewels and ask me, what is the length of the longest common prefix ( 阅读全文