2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛 Super Resolution

Super Resolution
Accepted : 133		Submit : 203
Time Limit : 1000 MS		Memory Limit : 65536 KB

Super Resolution

Bobo has an n×m picture consists of black and white pixels. He loves the picture so he would like to scale it a×b times. That is, to replace each pixel with a×b block of pixels with the same color (see the example for clarity).

Input

The input contains zero or more test cases and is terminated by end-of-file. For each test case,

The first line contains four integers n,m,a,b . The i -th of the following n lines contains a binary string of length m which denotes the i -th row of the original picture. Character "0" stands for a white pixel while the character "1" stands for black one.

• 1≤n,m,a,b≤10
• The number of tests cases does not exceed 10 .

Output

For each case, output n×a rows and m×b columns which denote the result.

Sample Input

2 2 1 1
10
11
2 2 2 2
10
11
2 2 2 3
10
11

Sample Output

10
11
1100
1100
1111
1111
111000
111000
111111
111111

题意：将n*m的照片放大a*b倍

解法：模拟

#include<iostream>
#include<vector>
#include<cstring>
#include<cstdio>

#define  INF 1000000000

using namespace std;
int x[300][300];
int main()
{
    int n,m,a,b;
    while(cin>>n>>m>>a>>b)
    {
        string s[300];
        for(int i=0; i<n; i++)
        {
            cin>>s[i];
        }

        for(int i=0; i<n*a; i++)
        {
            for(int j=0; j<m*b; j++)
            {
                 cout<<s[i/a][j/b];
            }
            cout<<endl;
        }
    }
    return 0;
}