HNUSTC语言基础简单数据结构acm入门第1讲搜索.pptVIP

C语言基础，简单数据结构，ACM入门讲座搜索部分;C语言是什么;ACM/ICPC;其他比赛;参考书目;天津赛区;POJ 2027 No Brainer Time Limit: 1000MSMemory Limit: 30000K Total Submissions: 15196Accepted: 10314 Description Zombies love to eat brains. Yum. Input The first line contains a single integer n indicating the number of data sets. The following n lines each represent a data set. Each data set will be formatted according to the following description: A single data set consists of a line X Y, where X is the number of brains the zombie eats and Y is the number of brains the zombie requires to stay alive. Output For each data set, there will be exactly one line of output. This line will be MMM BRAINS if the number of brains the zombie eats is greater than or equal to the number of brains the zombie requires to stay alive. Otherwise, the line will be NO BRAINS. Sample Input 3 4 5 3 3 4 3 Sample Output NO BRAINS MMM BRAINS MMM BRAINS ;Description Zombies love to eat brains. Yum. Input The first line contains a single integer n indicating the number of data sets. The following n lines each represent a data set. Each data set will be formatted according to the following description: A single data set consists of a line X Y, where X is the number of brains the zombie eats and Y is the number of brains the zombie requires to stay alive. Output For each data set, there will be exactly one line of output. This line will be MMM BRAINS if the number of brains the zombie eats is greater than or equal to the number of brains the zombie requires to stay alive. Otherwise, the line will be NO BRAINS. ;ACM题型分类;*;*;*;*;*;搜索基础;8皇后问题;深搜：可运行代码在备注中; 一个从起始状态到达目标状态包含多步操作，而每一步操作又有几种可能，只有正确的操作才能达到目标（如八皇后问题），这样的问题可以看做是一个树。 如果按照1-2-4-5-3-6-7的顺序，叫深度优先(DFS)如果按照1-2-3-4-5-6-7的顺序，叫广度优先(BFS);void DFS(int k) //处理第k步 { if (k==n) //已经处理到第n步，到达目的状态 输出结果 else //处理第k步 for (int i=1; i=m; i++) //第k步中有m种可能 { 处理第k步 DFS(k+1)；//进入第k+1步 } };帮助小明;帮助小明;*;POJ 1088