• SPOJ 10234. Here Be Dragons


    The Triwizard Tournament's third task is to negotiate a corridor of many segments, and reach the other end. The corridor is N segments long. The ith segment is either empty or has a dragon. Harry cannot pass the dragon and will have no option but to retreat if he encounters one. Is it possible for him to reach the exit starting from the entrance?

    Input (STDIN):
    The first line contains the number of test cases T.
    Each of the next T lines contains a string describing the corridor. The ith character is either a '.' if the segment is empty, or a 'D' if the segment contains a dragon.
    Output (STDOUT):
    Output T lines, each containing either the string "Possible" if you can reach the exit, and "You shall not pass!" if it is not possible to reach the exit.
    Constraints:
    1 <= T <= 50
    1 <= N <= 50
    Time Limit: 1 s
    Memory Limit: 32 MB
    Sample Input:
    3
    ..
    ..D.
    D..D
    Sample Output:
    Possible
    You shall not pass!
    You shall not pass!

    The Triwizard Tournament's third task is to negotiate a corridor of many segments, and reach the other end. The corridor is N segments long. The ith segment is either empty or has a dragon. Harry cannot pass the dragon and will have no option but to retreat if he encounters one. Is it possible for him to reach the exit starting from the entrance?

    Input (STDIN):

    The first line contains the number of test cases T.

    Each of the next T lines contains a string describing the corridor. The ith character is either a '.' if the segment is empty, or a 'D' if the segment contains a dragon.

    Output (STDOUT):

    Output T lines, each containing either the string "Possible" if you can reach the exit, and "You shall not pass!" if it is not possible to reach the exit.

    Constraints:

    1 <= T <= 50

    1 <= N <= 50

    Sample Input:

    3

    ..

    ..D.

    D..D

    Sample Output:

    Possible

    You shall not pass!

    You shall not pass!

     1 #include<iostream>  
     2 #include<string.h>  
     3 #include<stdio.h>  
     4 #include<ctype.h>  
     5 #include<algorithm>  
     6 #include<stack>  
     7 #include<queue>  
     8 #include<set>  
     9 #include<math.h>  
    10 #include<vector>  
    11 #include<map>  
    12 #include<deque>  
    13 #include<list>  
    14 using namespace std;  
    15 int main()
    16 {
    17     char a[100];
    18     int n,flag=0;
    19     scanf("%d",&n);
    20     for(int i=0;i<n;i++)
    21     {
    22         flag=1;
    23         cin>>a;
    24         int m=strlen(a);
    25         for(int l=0;l<m;l++)
    26         {
    27             if(a[l]=='D')
    28             {
    29             flag=-1;
    30             printf("You shall not pass!
    ");
    31             break;
    32             }
    33         } 
    34         if(flag==1)
    35         printf("Possible
    ");
    36     }
    37     return 0;
    38 } 
    View Code
  • 相关阅读:
    hdu1506(dp)
    windows下安装JMeter
    phpstudy 80端口被占用,修改端口
    久违的phpstorm
    软件项目版本号的命名规则及格式
    phpstudy 局域网访问
    java+eclipse+selenium环境搭建
    软件测试方法汇总
    功能测试大全
    如何有效地描述软件缺陷(Defect)?
  • 原文地址:https://www.cnblogs.com/qscqesze/p/3856462.html
Copyright © 2020-2023  润新知