text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
int main() {
int p, q, n, i, j, count = 0;
scanf("%d", &n);
char room[n][2];
for (i = 0; i < n; i++) {
for (j = 0; j < 2; j++) {
scanf("%d", &room[i][j]);
}
}
for (i = 0; i < n; i++) {
if (room[i][1] - room[i][0] > 1) {
count++;
}
}
printf("%d", count);
}
|
#include <bits/stdc++.h>
int main() {
int n, p, q, i, c = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d", &p, &q);
if (q - p >= 2) {
c++;
} else
;
}
printf("%d\n", c);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, s, r = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p >> q;
if ((q - p) >= 2) {
r++;
}
}
cout << r << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[28];
int main() {
int n, counter = 0;
cin >> n;
int *arr = new int[2 * n];
for (int i = 0; i < 2 * n; i += 2) {
cin >> arr[i] >> arr[i + 1];
if (arr[i + 1] - arr[i] >= 2) counter++;
}
cout << counter;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int i, p, q;
for (i = 0; i < n; i++) {
cin >> p >> q;
if (q - p >= 2) count++;
}
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0, a, b, n;
cin >> n;
for (auto i = 0; i < n; i++) {
cin >> a >> b;
if (b - a >= 2) {
count++;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, j, k, count = 0, count1 = 0, sum = 0;
cin >> n;
while (n--) {
cin >> j >> k;
sum = k - j;
if (sum <= 1) {
count = 0;
} else if (sum > 1) {
count1++;
count1 = count1++;
}
}
cout << count + count1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b - a >= 2) res++;
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void file() {}
int gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
fast();
file();
short n, pi, qi, num = 0;
cin >> n;
for (int i = n; i != 0; i--) {
cin >> pi >> qi;
if (qi == pi || qi - pi == 1) num++;
}
cout << n - num << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, c = 0;
scanf("%d", &n);
int p[n], q[n];
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &q[i]);
}
for (i = 0; i < n; i++) {
if (p[i] < q[i] && (q[i] - p[i]) > 1) {
c++;
}
}
printf("%d", c);
}
|
#include <bits/stdc++.h>
int main() {
int n, i, a[202], count = 0;
scanf("%d", &n);
for (i = 0; i < 2 * n; i++) scanf("%d", &a[i]);
for (i = 0; i < 2 * n; i++) {
if (a[i + 1] - a[i] >= 2) {
count++;
i++;
} else
i++;
}
printf("%d", count);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, p, q, check;
std::cin >> n;
int count = 0;
while (n--) {
std::cin >> p >> q;
check = (q - p);
if (check >= 2) {
count++;
}
}
std::cout << count << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p[100], q[100], c = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i] >> q[i];
if (p[i] < q[i] && q[i] - p[i] >= 2) c++;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int ar[a * 2];
int aa = 0;
for (int AsAlwaysI = 0; AsAlwaysI < a * 2; AsAlwaysI++) {
int d;
cin >> d;
ar[AsAlwaysI] = d;
}
for (int AsAlwaysI = 0; AsAlwaysI < a * 2; AsAlwaysI++) {
AsAlwaysI++;
if (ar[AsAlwaysI] - ar[AsAlwaysI - 1] >= 2) aa++;
}
cout << endl << aa;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, n, a, b, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b;
if (b - a >= 2) c++;
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, arr[100], count = 0;
cin >> n;
int i = 0;
for (i; i < n; i++) {
cin >> x >> y;
if (y - x >= 2) count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, i;
cin >> n;
int p[n], q[n];
i = 0;
while (n--) {
cin >> p[i] >> q[i];
if (q[i] - p[i] >= 2) count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int c, d;
cin >> c >> d;
if (d - c > 1) {
count++;
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, y, res = 0;
cin >> n;
int i;
for (i = 0; i < n; i++) {
cin >> x >> y;
if (y >= (x + 2)) res++;
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, x = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p >> q;
if (q - p >= 2) x++;
}
cout << x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
while (n--) {
int a, b;
cin >> a >> b;
if ((b - a) >= 2) {
count++;
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cmpLToS(int a, int b) { return a > b; }
int cmpSToL(int a, int b) { return b > a; }
void CFNow() {
int n;
cin >> n;
int nCount = 0;
while (n--) {
int p, q;
cin >> p >> q;
if (q - p >= 2) nCount++;
}
cout << nCount << endl;
}
int main() {
CFNow();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b - a >= 2) {
count++;
}
}
cout << count;
}
|
#include <bits/stdc++.h>
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
const double pi = acos(-1.0);
const long long mod = 1e9 + 7;
using namespace std;
int ok = 0;
char s[105];
int a[105], b[105];
int main() {
int N;
scanf("%d", &N);
int t = 0;
for (int i = 1; i <= N; i++) {
scanf("%d %d", &a[i], &b[i]);
if (b[i] - a[i] >= 2) t++;
}
printf("%d\n", t);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int sum = 0;
for (int i = 1; i <= x; i++) {
int a;
int b;
cin >> a >> b;
if ((b - a) >= 2) {
sum++;
}
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, p, q, total;
scanf("%d", &n);
for (i = 0, total = 0; i < n; i++) {
scanf("%d%d", &p, &q);
if (q - p >= 2) total++;
}
printf("%d", total);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b - a >= 2) {
count++;
}
}
cout << count;
}
|
#include <bits/stdc++.h>
int main() {
int n;
int p, q, i;
scanf("%d", &n);
int c = 0;
for (i = 1; i <= n; i++) {
scanf("%d%d", &p, &q);
if ((q - p) >= 2) c++;
}
printf("%d", c);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long arr[100][2];
int32_t main() {
long long n;
cin >> n;
for (long long j = 1; j <= n; j++) {
for (long long i = 0; i <= 1; i++) {
cin >> arr[j][i];
}
}
long long left = 0;
for (long long i = 1; i <= n; i++) {
if ((arr[i][1] - arr[i][0]) >= 2) left++;
}
cout << left;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int solve() {
int n, k = 0, p, q, i, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p >> q;
if (q - p > 1) k++;
}
cout << k;
return 0;
}
int main() {
int t;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, count = 0;
;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if ((b - a) >= 2) {
count++;
}
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, n, c, i, count = 0, t, y, m;
scanf("%d", &m);
for (i = 1; i <= m; i++) {
scanf("%d %d", &t, &y);
if ((y - t) >= 2) {
count++;
}
}
printf("%d\n", count);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
while (n--) {
int a, b;
cin >> a >> b;
if (b - a > 1) count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n = 0;
int p = 0, q = 0;
cin >> n;
int cnt = 0;
while (n--) {
cin >> p >> q;
if (q - p >= 2) {
cnt++;
}
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0, p, q;
cin >> n;
while (n--) {
cin >> p >> q;
if (q - p > 1) c++;
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
int y[100];
int z[100];
cin >> x;
int a{0};
for (int i{0}; i < x; ++i) {
cin >> y[i] >> z[i];
if (z[i] - y[i] >= 2) ++a;
}
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt;
int main() {
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b - a > 1) cnt++;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b - a >= 2) count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int size, n, m, result = 0;
cin >> size;
for (long long i = 0; i < size; i++) {
cin >> n >> m;
if (m - n >= 2) result++;
}
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, flag = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p >> q;
if (p == q) {
continue;
} else if (p <= q - 2) {
flag++;
}
}
cout << flag << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int counter = 0;
for (int i = 0; i < n; ++i) {
int p, q;
cin >> p >> q;
if (q - p >= 2) {
++counter;
}
}
cout << counter;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int a[n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
scanf("%d", &a[i][j]);
}
}
int c = 0, k = 0, m = 0;
for (int i = 0; i < n; i++) {
if (a[i][0] == a[i][1])
c++;
else if (a[i][0] == a[i][1] - 1)
m++;
else
k++;
}
if (c == n || m == n)
printf("0");
else
printf("%d", k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T mabs(const T &a) {
return a < 0 ? -a : a;
}
void run() {
int n;
cin >> n;
int res = 0;
for (int i = (0), ei = (n); i < ei; i++) {
int p, q;
cin >> p >> q;
res += q - p >= 2;
}
cout << res << endl;
}
int main() {
run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int p, q;
for (int i = 0; i < n; i++) {
cin >> p >> q;
if (p <= q - 2) {
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, p, i, q, s = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &p, &q);
if (q >= p + 2) s = s + 1;
}
printf("%d", s);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, p, q;
int ans = 0;
std ::cin >> n;
for (int i = 0; i < n; i++) {
std ::cin >> p >> q;
if (q - p > 1) ans++;
}
std::cout << ans;
}
|
#include <bits/stdc++.h>
int main() {
int n, a[100], b[100], k = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &a[i], &b[i]);
}
for (int i = 0; i < n; i++) {
if (a[i] < b[i] && (abs(a[i] - b[i]) > 1)) {
k = k + 1;
}
}
printf("%d", k);
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int main() {
long long n, count = 0, p, q;
while (cin >> n) {
while (n--) {
cin >> p >> q;
if ((q - p) >= 2) count++;
}
cout << count << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
while (n--) {
int a, b;
cin >> a >> b;
if (b - a >= 2) {
c++;
}
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q;
cin >> n;
int N = 0;
while (n--) {
cin >> p >> q;
if ((q - p) >= 2) {
N++;
}
}
cout << N;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int sum = 0;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
if (b - a >= 2) sum++;
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> x >> y;
if (y - x >= 2) {
c++;
}
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int a, b;
while (n--) {
cin >> a >> b;
if (b - a >= 2) count++;
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, p, q, i, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &p, &q);
if (p < q && q - p >= 2) {
count++;
}
}
printf("%d\n", count);
}
|
#include <bits/stdc++.h>
int main() {
int n, p, q, c = 0, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &p, &q);
if (q - p >= 2) {
c++;
}
}
printf("%d", c);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, p, q, av;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d%d", &p, &q);
if (p < (q - 1)) av++;
}
printf("%d", av);
}
|
#include <bits/stdc++.h>
int main() {
int a, b, i, n, x = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a <= (b - 2)) {
x++;
}
}
printf("%d", x);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, p, q, kol;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p >> q;
if (q - p >= 2) ++kol;
}
cout << kol;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int q[n];
int i;
for (i = 0; i < n; i++) {
cin >> p[i];
cin >> q[i];
}
int cnt = 0;
for (i = 0; i < n; i++) {
if (abs(p[i] - q[i]) >= 2) cnt++;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, count = 0;
cin >> n;
while (n--) {
cin >> p >> q;
if (q - p >= 2) count++;
}
cout << count << '\n';
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, a, b;
int add = 0;
cin >> t;
while (t--) {
cin >> a >> b;
if (b - a >= 2) {
add++;
}
}
cout << add << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, m, l = 0, k = 0;
cin >> n;
int A[n], B[n];
for (i = 0; i < n; i++) {
cin >> A[i] >> B[i];
if (B[i] - A[i] >= 2) l++;
}
printf("%d", l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
while (n--) {
int a, b;
cin >> a >> b;
if (b - a >= 2) count += 1;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, x;
cin >> n;
x = 0;
for (int i = 1; i <= n; i++) {
cin >> a >> b;
if ((b - a) >= 2) x += 1;
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int room[105];
int n, i, p, q;
int ans = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &p, &q);
if (q - p >= 2) ans++;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b[2], count = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[0] >> b[1];
if (b[1] - b[0] >= 2) count += 1;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100], b[100], i, c = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
if ((b[i] - a[i]) >= 2) c++;
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cc = 0;
for (int i = 0; i < n; ++i) {
int a, b;
scanf("%d%d", &a, &b);
if (b >= a + 2) ++cc;
}
printf("%d\n", cc);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0, a, b;
while (n--) {
cin >> a >> b;
if (b - a >= 2) {
count++;
}
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int p, q;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> p >> q;
if (q - p >= 2) count++;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct student {
int ac1;
int ac2;
int ac3;
} ac[105];
int a[150];
int main() {
int n, sum = 0, sum1 = 0, sum2 = 0, sum3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ac[i].ac1 >> ac[i].ac2;
}
for (int i = 0; i < n; i++) {
if (ac[i].ac2 - ac[i].ac1 >= 2) {
sum++;
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int n;
scanf("%d", &n);
int p, q, r = 0;
for (int i = 0; i < n; ++i) {
scanf("%d %d", &p, &q);
if (q - p > 1) ++r;
}
printf("%d", r);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, cont = 0;
cin >> n;
while (n--) {
cin >> p >> q;
if (p < q - 1) {
cont++;
}
}
cout << cont;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int counter = 0, a, b, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b > a) {
if (b - a >= 2) counter++;
}
}
cout << counter;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, r, c, ct = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r >> c;
if (c - r >= 2) ct++;
}
cout << ct;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, pi, qi, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> pi >> qi;
if (qi - pi > 1) ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int answer = 0;
while (n--) {
int p, q;
scanf("%d %d", &p, &q);
answer += (p + 2 <= q);
}
printf("%d\n", answer);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, result = 0;
cin >> n;
while (n--) {
cin >> p >> q;
if (q - p >= 2) result++;
}
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b - a >= 2) ++count;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, a, b, t = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (b - a > 1) t++;
}
printf("%d", t);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ca, a, ans = 0;
cin >> n;
while (n--) {
cin >> a >> ca;
if (ca - a >= 2) ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x = 0, y = 0, counter = 0;
for (int i = 0; i < n; i++) {
cin >> x >> y;
if (y >= x + 2) counter++;
}
cout << counter << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, res = 0;
cin >> n;
while (n--) {
int a, b;
cin >> a >> b;
if (b - a >= 2) res++;
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n1, n2, n3 = 0, i;
cin >> m;
for (i = 0; i < m; i++) {
cin >> n1 >> n2;
if ((n2 - n1) >= 2) {
n3++;
}
}
cout << n3 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int p, q;
cin >> p >> q;
if (q - p > 1) count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 1e3 + 123;
const long long inff = 1e18;
int n, m, a[105], b[105];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i];
}
for (int i = 1; i <= n; ++i) {
if (b[i] - a[i] >= 2) m++;
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b - a >= 2) count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 0;
cin >> n;
while (n--) {
int x, y;
cin >> x >> y;
if ((x + 2) <= y)
k++;
else
k = k;
}
cout << k;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
while (n--) {
int p, q;
cin >> p >> q;
if ((q - p) >= 2) cnt++;
}
cout << cnt << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c = 0;
cin >> n;
while (n) {
cin >> a >> b;
if (b > a + 1) c += 1;
n--;
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int count = 0, a, b;
for (i = 0; i < n; i++) {
cin >> a >> b;
if ((b - a) >= 2) count++;
}
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for (int i = (1); i <= (n); i++) {
int p, q;
cin >> p >> q;
ans += q - p >= 2;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, sum = 0;
cin >> n;
int arr[n][2];
for (a = 0; a < n; a++) {
for (b = 0; b < 2; b++) {
cin >> arr[a][b];
}
}
for (a = 0; a < n; a++) {
if (arr[a][1] - arr[a][0] >= 2) {
sum = sum + 1;
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, a[110][110], co = 0;
cin >> n;
for (i = 0; i < n; i++)
for (j = 0; j < 2; j++) cin >> a[i][j];
for (i = 0; i < n; i++)
for (j = 0; j < 2; j++) {
if (a[i][j + 1] - a[i][j] >= 2) co++;
}
cout << co;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q, ra = 0;
cin >> n;
while (n--) {
cin >> p >> q;
if (q - p >= 2) ra++;
}
cout << ra;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (abs(a - b) > 1) {
count += 1;
}
}
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int p, q;
cin >> p >> q;
if (q - p > 1) ++count;
}
cout << count << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0, p = 0, q = 0;
int k = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p >> q;
if (q - p >= 2) k++;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n, p, q, ans = 0;
cin >> n;
while (n--) {
cin >> p >> q;
if ((q - p) >= 2) ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
long long mi = INT_MAX;
long long ma = INT_MIN;
long long int a[1002][1002];
bool comp(pair<long long int, long long int> &a,
pair<long long int, long long int> &b) {
return (a.second < b.second);
}
void solve() {
int n;
cin >> n;
int a, b, c = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (abs(a - b) > 1) {
c++;
}
}
cout << c;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
{
int t;
{
solve();
cout << endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.