Click the Twitter icon to follow our tweets and
know more about us.

George And Accommodation


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
JAVA CODE

import java.io.*;
public class q1
{
 public static void main(String args[])throws IOException
 {
            int a=0,b,c;
   BufferedReader k=new BufferedReader(new InputStreamReader(System.in));
  int n=Integer.parseInt(k.readLine());
  for(int i=0;i<n;i++)
  {
   String nm[]=k.readLine().split(" ");
   c=Integer.parseInt(nm[0]);
   b=Integer.parseInt(nm[1]);
   a+=(b-c>1)?1:0;
  }
  System.out.println(a);
 }
}

Comments (0)

Post a Comment