Codeforces 문제 푸는 길 - 467A George and Accommodation

1900 단어 Codeforces
A. George and Accommodation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The dormitory has n rooms in total. At the moment the i-th room has pi people living in it and the room can accommodate qi people in total (pi ≤ qi). Your task is to count how many rooms has free place for both George and Alex.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of rooms.
The i-th of the next n lines contains two integers pi and qi (0 ≤ pi ≤ qi ≤ 100) — the number of people who already live in the i-th room and the room's capacity.
Output
Print a single integer — the number of rooms where George and Alex can move in.
Examples
input
3
1 1
2 2
3 3

output
0

input
3
1 10
0 10
10 10

output
2

문제풀이 사고방식: George와 Alex에 동시에 입주할 수 있는 방이 몇 칸인지 구하는 물문제입니다.
다음은 문제풀이 코드(java 구현)
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int count = 0;
		int p = 0;
		int q = 0;
		for(int i = 0; i < n;i++){
			p = scanner.nextInt();
			q = scanner.nextInt();
			scanner.nextLine();
			if((q-p) >= 2){
				count++;
			}
		}
		System.out.println(count);
	}
}

좋은 웹페이지 즐겨찾기