Pagini recente » Cod sursa (job #2720361) | Cod sursa (job #1752109) | Cod sursa (job #2600982) | Cod sursa (job #1631568) | Cod sursa (job #2669946)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("zoo.in");
ofstream fout("zoo.out");
int n, m;
pair <int, int> v[16006];
int main(){
fin >> n;
for (int i = 1; i <= n; ++i){
fin >> v[i].first >> v[i].second;
}
fin >> m;
for (int i = 1; i <= m; ++i){
int a, b, c, d;
fin >> a >> b >> c >> d;
int contor = 0;
for (int j = 1; j <= n; ++j){
if (a <= v[j].first && v[j].first <= c && b <= v[j].second && v[j].second <= d){
++contor;
}
}
fout << contor << "\n";
}
fin.close();
fout.close();
return 0;
}