[BOJ] 2675 JAVA

Organ·2023년 9월 13일

[문제 풀이]

목록 보기

35/123

문자열 반복

문제

내 풀이

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;


public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int T = Integer.parseInt(br.readLine());
		int[] R = new int[T];
		String[] S = new String[T];
		
		for(int i = 0; i < T; i++)
		{
			StringTokenizer st = new StringTokenizer(br.readLine());

			R[i] = Integer.parseInt(st.nextToken());
			S[i] = st.nextToken();
		}

		for(int i = 0; i < T; i++)
		{
			for(int j = 0; j < S[i].length(); j++)
			{
				for(int k = 0; k < R[i]; k++)
				{
					System.out.print(S[i].charAt(j));
				}
			}
			System.out.println();
		}


	}
}

다른 풀이

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
 
public class Main {
 
	public static void main(String[] args) throws IOException {
 
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int T = Integer.parseInt(br.readLine());
		
		for(int i = 0; i < T; i++) {
	
			String[] str = br.readLine().split(" ");	// 공백 분리
			
			int R = Integer.parseInt(str[0]);	// String -> int
			String S = str[1];
			
			for(int j = 0; j < S.length(); j++) {
				for(int k = 0; k < R; k++) {
					System.out.print(S.charAt(j));
				}
			}
			System.out.println();
		}
	}
 
 
}