天涯沧海的博客

Problem DescriptionYou need to construct a full n-ary tree(n叉树) with m layers.All the edges in this tree have a weight.But this weight cannot be chosen arbitrarily you can only choose from set S，the...

Problem DescriptionYou have a string of lowercase letters.You need to find as many sequence “gdCpc” as possible.But letters in the same position can only be used once。InputThe input file c...

Problem DescriptionChika gives you an integer sequence a1,a2,…,an and m tasks. For each task, you need to answer the number of "friendly pairs" in a given interval.friendly pair: for two integers ai...

#include<cstdio>#include<cstring>using namespace std;char str[14][14];int main(){ int i; while(scanf("%s",str[0])!=EOF){ for(i=1;i<14;i++){ scanf("%s",s...