George and Accommodation解决方法

Problem Description
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.
Sample Input

3
1 1
2 2
3 3

Sample Output

0
问题简述：
输入房间数，再依次输入房间已有人数和容纳量，最后计算输出可入住的房数。
问题分析：
可采用二维数组，以第一个下标为换行标志，即房号。并将其人数和容纳量放入第二维。
c++语言程序如下：#include <iostream> using namespace std; int main() {  int **a;  int n;  int t = 0;  cin >> n;  a = new int*[n];  for (int i = 0; i < n; i++)  {   a[i] = new int[2];  }  for (int i = 0; i < n; i++)  {   cin >> a[i][0] >> a[i][1];   if (a[i][1] > (a[i][0] + 1)) t++;  }  cout << t;  for (int i = 0; i < n; i++)   delete[] a[i];  delete[] a; }