1024 : The Smallest Floor Tile

时间限制Time Limit 1 秒Sec 内存限制Memory Limit 128 兆MB 提交次数Submitted 1 次Times 通过次数Solved 1 次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

Xiao Ming saw a wide variety of patterns in a floor shop.

He wants to know how every floor can be paved with the smallest floor tiles.

输入格式Input

There are no more than 20 test cases.

The first line of each case contains two integer numbers n and m, indicating the length and width of the floor.

Then n lines, each line contains exactly m letters indicating the patterns.

1 <= n <= 500, 1 <= m <= 500, all the patterns are uppercase letters as A~Z.

输出格式Output

For each case, output two integer numbers indicating the size of the smallest tile that could make up this floor.

样例Sample

提示Hint

For example

ABABAB
CDCDCD
ABABAB
CDCDCD

The smallest tile is

AB
CD

出题Author

CSGrandeur

来源Source

2021 SZTU AI Class Qualifying