• [1233] Kakarotto's Fighting Value

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • Kakarotto is a hero in the Dragon Ball.
    and there are a array record his fighting value.
    It means the array is increase by order.

    Etond want to know Kakarotto's fighting value is ever been a giving number .


  • 输入
  • there are only one test case.

    1st line is a intger N (0 < n <= 100000) means the array's lenth.
    2nd line have N integers Ni( 0 < Ni < 2^32 - 1) the N inetgers in increase by order.
    3rd line is a integer M (0 < M <= 100000) means the times of Etond want to query Kakarotto fight value;
    4th line have M integers Mi(0 < Mi < 2^32 - 1)
  • 输出
  • For each query, If Kakarotto‘s fighting value have been the fighting value print "True" , or print "False".
  • 样例输入
  • 5
    1 2 3 5 9
    5
    1 2 3 4 5
    
  • 样例输出
  • True
    True
    True
    False
    True
    
  • 提示
  • 来源
  • monkeyde17
  • 操作

显示春菜