1469 : School Badge

时间限制Time Limit 1 秒Sec 内存限制Memory Limit 128 兆MB 提交次数Submitted 0 次Times 通过次数Solved 0 次Times

标准评测 Standard

从标准输入读入，结果写到标准输出。评测将输出拆成 token，与标准答案逐项比较，不按整段逐字节比对。 Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.

比对Compare	token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored.
不同则错Differs	token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ.
输入Input	标准输入，格式见题面。Standard input; format as in the statement.
输出Output	标准输出。Standard output.

模板Template

C++ C Java Python

#include <iostream>
using namespace std;
int main() {
    int a, b;
    cin >> a >> b;
    cout << (a + b) << endl;
    return 0;
}

#include <stdio.h>
int main() {
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        System.out.println(a + b);
    }
}

a, b = map(int, input().split())
print(a + b)

题目描述Description

One day DOGGOD_Q and his friend went to a university for CCSP, they suddenly saw a huge board，which was printed with various school badges, so DOGGOD_Q talked with his friend:

DOGGOD_Q: Let's find out where our badge is!

friend: It's over there, blue and white.

DOGGOD_Q understood, it turns out that as long as the school badge has and only blue and white, this is our school badge. Now we turn some of the badges into a phalanx of n*m, and use an uppercase letter to indicate the color of this position (B is Blue, W is White, different color must have different uppercase letter), When this school badge has only blue and white colors, we can say it is our school badge, please write a program to judge it.

输入格式Input

The first line contains one integer T (1 \leq T \leq 100) which is the number of test cases.

The first line of the test case contains two integers n and m (1 \leq n, m \leq 100) which mean the size of phalanx.

Next follow n line each line has m uppercase letter, which indicate the color of this position.

输出格式Output

For each test case, print the answer – if it is our school badge, print “Yes”, otherwise print “No”.

CSGCPC

1469 : School Badge

题目描述Description

输入格式Input

输出格式Output

样例Sample

出题Author

来源Source