[JAVA] 백준 기초 7

문제 2775번

 

https://www.acmicpc.net/problem/2775

2775번: 부녀회장이 될테야

2. 코딩

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
	
		int[][] APT = new int[15][15];
 
		for(int i = 0; i < 15; i++) {
			APT[i][1] = 1;	
			APT[0][i] = i;	
		}
 
 
		for(int i = 1; i < 15; i ++) {
 
			for(int j = 2; j < 15; j++) {	
				APT[i][j] = APT[i][j - 1] + APT[i - 1][j];
			}
		}
				
		int T = in.nextInt();
		
		for(int i = 0; i < T; i++) {
			int k = in.nextInt();
			int n = in.nextInt();
			System.out.println(APT[k][n]);
		}
	}
 
}

 

1. 문제 1193

 

https://www.acmicpc.net/problem/1193

1193번: 분수찾기

import java.util.Scanner;
 
public class Main {
 
	public static void main(String[] args) {
 
		Scanner in = new Scanner(System.in);
		int X = in.nextInt();
 
		int cross_count = 1, prev_count_sum = 0;
 
		while (true) {
        
			
			if (X <= prev_count_sum + cross_count) {	
				
				if (cross_count % 2 == 1) {
					System.out.print((cross_count - (X - prev_count_sum - 1)) + "/" + (X - prev_count_sum));
					break;
				} 
				
				else {	
					System.out.print((X - prev_count_sum) + "/" + (cross_count - (X - prev_count_sum - 1)));
					break;
				}
 
			} else {
				prev_count_sum += cross_count;
				cross_count++;
			}
		}
	}
}

 

 

1.  문제 10250

https://www.acmicpc.net/problem/10250

10250번: ACM 호텔

 

2. 코딩

import java.util.Scanner;
 
public class Main {
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
 
		int T = in.nextInt();
 
 
		for(int i = 0; i < T; i++) {
			
			int H = in.nextInt();
			int W = in.nextInt(); 	
			int N = in.nextInt();
			
			if(N % H == 0) {
				System.out.println((H * 100) + (N / H));
 
			} else {
				System.out.println(((N % H) * 100) + ((N / H) + 1));
			}
		}
	}
}