[1일 1문제] 백준 단계별로 풀어보기 7-8, 1-3번 (1.29~2.2)

1.29

문제번호 1316

package baekjoon;

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

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

		int N = Integer.parseInt(br.readLine());
		int count = N;
		
		for(int i = 0; i < N; i++) {
			String str = br.readLine();
			
			boolean[] check = new boolean[26];
			
			for(int j = 0; j < str.length(); j++) {
				if(check[str.charAt(j)-'a']==false) {
					check[str.charAt(j)-'a'] = true;
				} else if (j > 0 && str.charAt(j)!=str.charAt(j-1)) {
					count--;
					break;
				}
			}
		}
		System.out.println(count);
		br.close();
	}
}

 

1.30

문제번호 25206

package baekjoon;

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

public class java_0130 {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		
		double sumScorexGrade = 0;
		double sumScore = 0;
		
		for(int i = 0; i < 20; i++) {
			st = new StringTokenizer(br.readLine());
			String object = st.nextToken();
			double score = Double.parseDouble(st.nextToken());
			String grade = st.nextToken();
			
			if(!(grade.equals("P"))) {
				switch(grade) {
					case "A+":
						sumScorexGrade += (score * 4.5);
						break;
					case "A0":
						sumScorexGrade += (score * 4.0);
						break;
					case "B+":
						sumScorexGrade += (score * 3.5);
						break;
					case "B0":
						sumScorexGrade += (score * 3.0);
						break;
					case "C+":
						sumScorexGrade += (score * 2.5);
						break;
					case "C0":
						sumScorexGrade += (score * 2.0);
						break;
					case "D+":
						sumScorexGrade += (score * 1.5);
						break;
					case "D0":
						sumScorexGrade += (score * 1.0);
						break;
					case "F":
						sumScorexGrade += (score * 0.0);
						break;
					default:
						break;
				}
				sumScore += score;
			}
		}
		
		System.out.printf("%.6f", sumScorexGrade/sumScore);
		br.close();
	}
}

 

1.31

문제번호 2738

package baekjoon;

import java.util.Scanner;

public class java_0131 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int M = sc.nextInt();
		
		int[][] a = new int [N][M];
		int[][] b = new int [N][M];
		
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < M; j++) {
				a[i][j] = sc.nextInt();
			}
		}
		
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < M; j++) {
				b[i][j] = sc.nextInt();
			}
		}
		
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < M; j++) {
				System.out.print(a[i][j] + b[i][j] + " ");
			}
			System.out.println();
		}
	}
}

 

2.1

문제번호 2566

package baekjoon;

import java.util.Scanner;

public class java_0201 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int[][] a = new int [9][9];
		int max = 0;
		int x = 1;
		int y = 1;
		
		for(int i = 0; i < 9; i++) {
			for(int j = 0; j < 9; j++) {
				a[i][j] = sc.nextInt();
			}
		}
		
		for(int i = 0; i < 9; i++) {
			for(int j = 0; j < 9; j++) {
				if(a[i][j] > max) {
					max = a[i][j];
					x = i + 1;
					y = j + 1;
				}
			}
		}
		
		System.out.println(max);
		System.out.println(x + " " + y);
	}
}

 

2.2

문제번호 10798

package baekjoon;

import java.util.Scanner;

public class java_0202 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char[][] a = new char[5][15];
		
		for(int i = 0; i < 5; i++) {
			String str = sc.next();
			for(int j = 0; j < str.length(); j++) {
				a[i][j] = str.charAt(j);
			}
		}
		
		for(int i = 0; i < 15; i++) {
			for(int j = 0; j < 5; j++) {
				if(a[j][i] != '\0') {
					System.out.print(a[j][i]);
				}
			}
		}
		
		sc.close();
	}
}