Problem Description The contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper.Unfortunately, what iSea could find was only an ancient printer: so ancient that you can't believe it, it on…

The contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper. Unfortunately, what iSea could find was only an ancient printer: so ancient that you can't believe it, it only had three kinds…

Ancient Printer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1803 Accepted Submission(s): 887 Problem DescriptionThe contest is beginning! While preparing the contest, iSea wanted to print the…

Ancient Printer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1511    Accepted Submission(s): 748 Problem Description The contest is beginning! While preparing the contest, iSea wanted to pri…

In order to understand early civilizations, archaeologists often study texts written in ancient languages. One such language, used in Egypt more than 3000 years ago, is based on characters called hieroglyphs. Figure C.1 shows six hieroglyphs and thei…

题目大意:给出一幅画,找出里面的象形文字. 要你翻译这幅画,把象形文字按字典序输出. 思路:象形文字有一些特点,分别有0个圈.1个圈.2个圈...5个圈.然后dfs或者bfs,就像油井问题一样,找出在同一块的0,找出在同一块的1,分别标上记号. 对于每个同一块的1,如果它们只和1个‘0’的块相邻,就表明这个象形文字没有圈.如果和2个‘1’的块相邻,就说明这个象形文字有一个圈.依此类推...和6个‘1’块相邻的就有五个圈. 最后统计一下每个象形文字和多少不同的块相邻,排一个序,输出. 要注意的是,…

算法:字典树 题意:给你一些单词,有一台打印机只能进行以下三种操作 1.读入 2.删除 3.打印 让你输出最少的操作次数将这些单词全部打印出来: (字典树节点-1)*2  表示读入和删除操作: 打印操作  单词数 最后一个最长的单词不需要进行删除操作: 所以答案=(字典树节点-1)*2+单词数-最长的字符串: Input There are several test cases in the input. Each test case begin with one integer N (1 ≤…

题目大意: 一个打印机 只有 打印,删除,a-z.操作 给你一堆队名,如何才能操作次数最少输出全部 (字典树节点数-1)*2 输入,删除操作数 字符串数 printf操作数 最长字符串的长度 最后一个不需要删除,所以尽量找最大的 所以 answer=(字典树节点数-1)*2+字符串数-最长字符串的长度 #include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> #inclu…

为找规律题  结果为   节点数*2-最长字段+字段个数 结点不能设置为0   与判断条件相冲突 #include<bits/stdc++.h> using namespace std; ][]={}; ]; ][];//这里数组开小了导致一直wa ; int pos; void insert1(char *s) { ; ;i<strlen(s);i++) { int ch=s[i]-'a'; ) { memset(trie[pos],,sizeof(trie[pos]));//用多少初…

题意: Alice和Bob正在下古代围棋,规则如下: 棋盘有8×8个格子,棋子下在棋盘的交叉点上,故可以有9×9个落子的位置 Alice执黑棋Bob执白棋轮流落子 与棋子直线相连的空白交叉点叫做气.当这些气都被对方棋子占据后,该棋子就没有了“气”,要被从棋盘上提掉.如果棋子的相邻(仅上下左右)直线交叉点上有了同色的棋子,则这两个棋子被叫做相连的.任意多个棋子可以以此方式联成一体,连成一体的棋子的气的数目是所有组成这块棋的单个棋子气数之和.如果这些气都被异色棋子占领,这块棋子就要被一起提掉. 当一…