Problem:


Score : 200 points

Problem Statement

There are N rectangular plate materials made of special metal called AtCoder Alloy.
The dimensions of the i-th material are A_i \times B_i (A_i vertically and B_i horizontally).

Takahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \times W.
He is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.
When cutting a material, the cuts must be parallel to one of the sides of the material.
Also, the materials have fixed directions and cannot be rotated.
For example, a 5 \times 3 material cannot be used as a 3 \times 5 plate.

Out of the N materials, how many can produce an H \times W plate if properly cut?

Constraints

1 \leq N \leq 1000

1 \leq H \leq 10^9

1 \leq W \leq 10^9

1 \leq A_i \leq 10^9

1 \leq B_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N H W
A_1 B_1
A_2 B_2
:
A_N B_N

Output

Print the answer.

Sample Input 1

3 5 2
10 3
5 2
2 5

Sample Output 1

2

Takahashi wants a 5 \times 2 plate.

The dimensions of the first material are 10 \times 3. We can obtain a 5 \times 2 plate by properly cutting it.

The dimensions of the second material are 5 \times 2. We can obtain a 5 \times 2 plate without cutting it.

The dimensions of the third material are 2 \times 5. We cannot obtain a 5 \times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \times 2 plate.

Sample Input 2

10 587586158 185430194
894597290 708587790
680395892 306946994
590262034 785368612
922328576 106880540
847058850 326169610
936315062 193149191
702035777 223363392
11672949 146832978
779291680 334178158
615808191 701464268

Sample Output 2

8



Sample input:
3 5 2
10 3
5 2
2 5


Sample output:
2

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
l=[list(map(int,input().split())) for i in range(n)]
c=0
for j in range(n):
  if h<=l[j][0] and w<=l[j][1]:c+=1
print(c)

Submission status: Accepted

Solution code:
N,H,W=map(int,raw_input().split())
A=[]
B=[]
Ans=0
for i in range(N):
    ab=map(int,raw_input().split())
    if ab[0]>=H and ab[1]>=W:
        Ans+=1

print Ans

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())

cnt = 0
for i in range(N):
    A, B = map(int, input().split())
    if A >= H and B >= W:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
ans = 0
for i in range(n):
    a, b = map(int, input().split())
    if h <= a and w <= b:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
result = 0
for i in range(n):
    a,b = map(int,input().split())
    if a>=h and b>=w:
        result += 1
print(result)

Submission status: Accepted

Solution code:
n, h, w = list(map(int, input().split()))
count=0
for _ in range(n):
  _h, _w = list(map(int, input().split()))
  count += (int(_h/h) * int(_w/w))>0

print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ans = 0
for i in range(N):
    a, b = map(int, input().split())
    ans += (a >= H and b >= W)
print(ans)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
lst=[list(map(int,input().split())) for i in range(n)]
ans=0
for e in lst:
    ans+=(e[0]>=h and e[1]>=w)
print(ans)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
c = 0

for i in range(n):
    a1,b1 = map(int,input().split())
    if (a1 >= h) and  (b1>=w):
        c += 1

print(c)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
res = 0
for i in range(n):
    a,b = map(int,input().split())
    res += a>=h and b>=w
print(res)

Submission status: Accepted

Solution code:
N, H, W = map(int, raw_input().split())
count = 0
for i in range(N):
   A, B = map(int, raw_input().split())
   if H <= A and W <= B:
      count += 1
print(count)

Submission status: Accepted

Solution code:
N,H,W=map(int,input().split())
count=0
for i in range(N):
	A,B=map(int,input().split())
	if (A >= H) & (B >= W):
		count+=1
print(count)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
print(len(list(filter(lambda x:int(x[0])>=h and int(x[1])>=w, [input().split() for i in range(n)]))))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=0
for i in range(a):
  e,f=map(int,input().split())
  if e>=b and f>=c:
    d+=1
print(d)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
res=0
for i in range(n):
  hh,ww=map(int,input().split())
  if hh>=h and ww>=w:
    res+=1
print(res)

Submission status: Accepted

Solution code:
n, h, w = map(int, raw_input().split())

count = 0
for i in xrange(n):
    a, b = map(int, raw_input().split())

    if a >= h and b >= w:
        count += 1

print count

Submission status: Accepted

Solution code:
n, h, w = input().split()
n = int(n)
h = int(h)
w = int(w)
a = []
b = []

for i in range(n):
	add = input().split()
	a.append(int(add[0]))
	b.append(int(add[1]))

count = 0
for i in range(n):
	if a[i] >= h and b[i] >= w:
		count += 1
	else:
		pass

print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
cnt = 0
for _ in range(N):
    A, B = map(int, input().split())
    cnt += H <= A and W <= B
print(cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
#a = int(input())
# スペース区切りの整数の入力
#b, c = map(int, input().split())
# 文字列の入力
#s = input()
# 出力
#print("{} {}".format(a+b+c, s))

N, H, W = map(int, input().split())
ans = 0

for x in range(0, N):
	A, B = map(int, input().split())
	
	if (H <= A and W <= B):
		ans += 1

print("{}".format(ans))

Submission status: Accepted

Solution code:
N,X,Y = map(int,input().split())
cnt = 0
for i in range(N):
    x,y = map(int,input().split())
    if x >= X and y >= Y:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
k = 0
for i in range(n):
  a, b = map(int, input().split())
  if a >= h and b >= w:
    k += 1
print(k)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
r = 0
for i in range(n):
  a, b = map(int, input().split())
  if a >= h and b >= w:
    r += 1
print(r)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
count = 0
for _ in range(n):
    a, b = map(int, input().split())
    if h <= a and w <= b:
        count += 1
print(count)

Submission status: Accepted

Solution code:
n, tate, yoko = map(int, input().split())
ans = 0
for _ in range(n):
    Y, X = map(int, input().split())
    if Y >= tate and X >= yoko: ans += 1
print(ans)

Submission status: Accepted

Solution code:
N, H, W = [int(_) for _ in input().split()]
AB = [[int(_) for _ in input().split()] for i in range(N)]

result = 0

for a, b in AB:
    if a >= H and b >= W:
        result += 1

print(result)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
count = 0
for i in range(N):
  A, B = map(int, input().split())
  if A >= H and B >= W:
    count += 1
print(count)

Submission status: Accepted

Solution code:
N, H, W = list(map(int, input().split()))
A, B = [], []
count = 0
for i in range(N):
    a, b = list(map(int, input().split()))
    A.append(a)
    B.append(b)
for i, j in zip(A, B):
    if i>=H and j>=W:
        count += 1
print(count)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
cnt=0
for i in range(n):
  a,b=map(int,input().split())
  if a>=h and b>=w:
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
print(len(list(filter(lambda ab: ab[0] >= H and ab[1] >= W, AB))))

Submission status: Accepted

Solution code:
N,H,W=map(int,input().split())
ans=0
for i in range(N):
  A,B=map(int,input().split())
  if H<=A and W<=B:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
c = 0
N, H, W = map(int, input().split())
for i in range(N):
	A, B = map(int, input().split())
	if  A>= H and B >= W:
		c = c + 1
print(c)

Submission status: Accepted

Solution code:
N, H, W = list(map(int, input().split()))
length_datas = [input() for i in range(N)]
count = 0
for data in length_datas:
    A, B = list(map(float, data.split()))
    if (A >= H) and (B >= W):
        count += 1

print(count)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())

arr = []
count = 0
for i in range(N):
    arr.append(list(map(int,input().split())))

for i in arr:
    if i[0] >= H and i[1] >= W:
        count+=1

print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
cnt = 0

for _ in range(N):
    a, b = list(map(int, input().split()))
    if a >= H and b >= W:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
N, H, W = list(map(int, input().strip().split(' ')))

AB = []

cnt = 0

for i in range(N):
	AB.append(list(map(int, input().strip().split(' '))))	#[A][B]
	
	
for i in range(N):
	if int(AB[i][0]) >= H:
			if int(AB[i][1]) >= W:
				cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
i = 0
k = 0
answer = 0
a = [""] * n
b = [""] * n
while i < n:
    a[i],b[i] = map(int,input().split())
    i += 1

while k < n:
    if h <= a[k] and w <= b[k]:
        answer += 1
    k += 1
print(answer)

Submission status: Accepted

Solution code:
import numpy as np

param = [int(i) for i in input().split()]
N = param[0]
H = param[1]
W = param[2]

material = np.empty([N,2],dtype=np.int)

for i in range(N):
    material[i,:] = [int(j) for j in input().split()]

count = np.array([material[:,0] >= H, material[:,1] >= W]).T
count = np.all(count==True, axis=1)
count = np.sum(count)
print(count)

Submission status: Accepted

Solution code:
N, H, W = list(map(int, input().split(" ")))

count = 0
for i in range(N):
    A, B = list(map(int, input().split(" ")))
    if A >= H and B >= W:
        count += 1

print(count)

Submission status: Accepted

Solution code:
# _*_ coding:utf-8 _*_
#  CADDi2018 for Beginners B AtCoderAlloy
#  https://atcoder.jp/contests/caddi2018b/tasks/caddi2018b_b

def checkGetArroy(getArroyHeight,getArroyWidth,nowArroyHeight,nowArroyWidth):
	if(getArroyHeight <= nowArroyHeight) and (getArroyWidth <= nowArroyWidth):
		return True
	else:
		return False


def countGetArroy(allArroyNumber,arroyHeight,arroyWidth,eachArroyHeightList,eachArroyWidthList):

	counter = 0
	patternRange = range(0,allArroyNumber,1)
	for i in patternRange:
		checkResult = checkGetArroy(arroyHeight,arroyWidth,eachArroyHeightList[i],eachArroyWidthList[i])
		if (checkResult==True):
			counter = counter + 1

	return counter


if __name__ == '__main__':
	n , h , w = map(int,input().strip().split(' '))
	alloyRange = range(0,n,1)
	heightList = []
	widthList = []
	for i in alloyRange:
		tmpHeight,tmpWidth = map(int,input().strip().split(' '))
		heightList.append(tmpHeight)
		widthList.append(tmpWidth)
	solution=countGetArroy(n,h,w,heightList,widthList)
	print(solution)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
cnt = 0
for i in range(n):
    a,b = map(int,input().split())
    if a>=h and b>=w:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
a =[]
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Submission status: Accepted

Solution code:
n,h,w = input().split()
a = [0] * int(n)
b = [0] * int(n)
i = 0
while i < int(n):
    a[i],b[i] = input().split()
    i = i + 1

i = 0
flag = 0

while i < int(n):
    if int(a[i]) >= int(h) and int(b[i]) >= int(w):
        flag = flag + 1
    i = i + 1
print(flag)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n,h,w = input().split()
n = int(n)
h = int(h)
w = int(w)
i = o = 0
for i in range(n):
    i = i + 1
    a,b = input().split()
    a = int(a)
    b = int(b)
    if a>=h and b>=w:
        o = o + 1
print(o)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
A = []
B = []
counter = 0
for i in range(0,N):
    a,b  = map(int, input().split())
    if a>=H and b>=W:
        counter +=1
print(counter)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
result = 0
for i in range(n):
    a,b=map(int,input().split())
    if (h<=a and w<=b):
        result += 1
print(result)

Submission status: Accepted

Solution code:
def read():
    N, H, W = list(map(int, input().strip().split()))
    A = []
    B = []
    for i in range(N):
        a, b = list(map(int, input().strip().split()))
        A.append(a)
        B.append(b)
    return N, H, W, A, B


def solve(N, H, W, A, B):
    count = 0
    for i in range(N):
        if A[i] >= H and B[i] >= W:
            count += 1
    return count


if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    N,H,W = map(int,input().split())
    A = []
    B = []
    counter = 0
    for i in range(N):
        a,b = map(int,input().split())
        if(a >= H and b >= W):
            counter += 1
    print(counter)

Submission status: Accepted

Solution code:
import sys

line = sys.stdin.readline().replace('\n', '').split(' ')
cnt = 0

height = int(line[1])
width = int(line[2])

for i in range(int(line[0])):

  board = sys.stdin.readline().replace('\n', '').split(' ')
  if int(board[0]) - height >= 0 and int(board[1]) - width >= 0:
    cnt += 1 

  #print (board[0])
print (cnt)

Submission status: Accepted

Solution code:
a=[]
a=input().split(" ")
N=int(a[0])
A=int(a[1])
B=int(a[2])
b=[]
for c in range(0,N):
    c=input().split(" ")
    b.extend(c)
#bの偶数がAi,bの奇数がBi
d=0
for i in range(0,N):
    b1=int(b[2*i])
    b2=int(b[2*i+1])

    if b1 >= A and b2 >= B :
        d=d+1
    else:
        continue
print(d)

Submission status: Accepted

Solution code:
N,H,W = (int(x) for x in input().split())
A = []
B = []
for i in range(N):
    a,b = (int(x) for x in input().split())
    A.append(a)
    B.append(b)

num = []

for i in range(N):
    if A[i] >= H:
        num.append(i)

l = len(num)
ans = 0
for i in range(l):
    if B[num[i]] >= W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ab = [[int(i) for i in input().split()] for i in range(N)] 
k = 0
for x in ab:
    if x[0] >= H and x[1] >= W:
        k += 1
    else: pass
print(k)

Submission status: Accepted

Solution code:
nhw_list = list(map(int, input().split()))
tup_list = []
for i in range(nhw_list[0]):
    tup_list.append(list(map(int, input().split())))
count = 0
for tuple in tup_list:
    if tuple[0] >= nhw_list[1] and tuple[1] >= nhw_list[2]:
        count += 1
print(count)

Submission status: Accepted

Solution code:
import sys
lines = [list(map(int, line.strip().split(' '))) for line in sys.stdin]
print(sum([1 for h,w in lines[1:] if lines[0][1] <= h and lines[0][2] <= w]))

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
cnt = 0
for _ in range(N):
    A, B = map(int, input().split())
    if A >= H and B >= W:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
p = list(map(int, input().split()))

k = 0
for i in range(p[0]):
    ab = list(map(int, input().split()))
    if ab[0] >= p [1] and ab[1] >= p[2]:
        k += 1

print(k)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())

a_b = [map(int, input().split()) for _ in range(n)]

cnt = 0
for a, b in a_b:
    if h <= a and w <= b:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().strip().split(' '))
count = 0
for i in range(n):
    a, b = map(int, input().strip().split(' '))
    if a>= h and b>= w:
        count += 1

print(count)

Submission status: Accepted

Solution code:
data = input().split()

N = int(data[0])
H = int(data[1])
W = int(data[2])

A = []
B = []
count = 0

for i in range(N):
    a_b_data = input().split()
    A.append(int(a_b_data[0]))
    B.append(int(a_b_data[1]))
    
for j in range(N):
    if H <= A[j] and W <= B[j]:
        count = count + 1
        
print(count)

Submission status: Accepted

Solution code:
#coding:utf-8

n = list(map(int,input().split()))
alist = [list(map(int,input().split())) for i in range(n[0])]

res = 0

for i in range(n[0]):
	if n[1] <= alist[i][0] and n[2] <= alist[i][1]:
		res += 1
		
print(res)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
ab = [map(int, input().split()) for _ in range(n)]
print(sum([1 if a >= h and b >= w else 0 for a, b in ab]))

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
count = 0
for i in range(N):
  A, B  = map(int, input().split())
  if A >= H and B >= W:
    count += 1
print(count)

Submission status: Accepted

Solution code:
N,H,W = map(int, input().split())

count = 0

for i in range(N):
    A,B = map(int, input().split())

    if A >= H and B >= W:
        count += 1

print(count)

Submission status: Accepted

Solution code:
N, H, W = (int(i) for i in input().split())
set = [[int(i) for i in input().split()] for i in range(N)]
cnt = 0
for i in range(N):
    cnt += 1 if set[i][0]>=H and set[i][1]>=W else 0
print(cnt)

Submission status: Accepted

Solution code:
n, h, w = [int(i) for i in input().split()]
ita = [[int(i) for i in input().split()] for i in range(n)]
ans = 0

for i in range(n):
    if ita[i][0] >= h and ita[i][1] >= w:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n, h, w = (int(i) for i in input().split())
e = [[int(i) for i in input().split()] for i in range(n)] 
count = 0
for i in e:
  if i[0] >=h and i[1]>=w:
    count = count+1
print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
x = 0
for i in range(a):
    A,B=map(int,input().split())
    if A>=b and B>=c:
        x=x+1
    else:
        x=x
print(x)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
count = 0;
for i in range(N):
  h1,w1 = map(int,input().split());
  if h1 >= H and w1 >= W: 
    count = count + 1;
print(count)

Submission status: Accepted

Solution code:
N, H, W = [int(_) for _ in input().split()]
AB =[[int(_) for _ in input().split()] for _ in range(N)]
print(sum([1 for a, b in AB if a >= H and b >= W]))

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
count = 0
for i in range(N):
    x, y = map(int, input().split())
    if x >= H and y >= W:
        count += 1
        
print(count)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
count=0
a=[[0] * 2 for i in range(n)]



for i in range(n):
    a[i]=list(map(int, input().split()))
    if a[i][0]>=h and a[i][1]>=w:
        count+=1
        
        
print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ans = 0
for i in range(N):
    a, b = map(int, input().split())
    if a >= H and b >= W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
cutable = []
for i in range(n):
    a, b = map(int, input().split())
    if h<=a and w<=b:
        cutable.append(i)
print(len(cutable))

Submission status: Accepted

Solution code:
from sys import stdin
n,h,w = [int(x) for x in stdin.readline().rstrip().split()]
data = [stdin.readline().rstrip().split() for _ in range(n)]
o=0
for rect in data:
    if int(rect[0])>=h and int(rect[1])>=w:
        o+=1

print(o)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())

count = 0
for i in range(n):
    a, b = map(int, input().split())
    if h <= a and w <= b:
        count = count + 1

print(count)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
count = 0
for i in range(N):
    a,b = map(int,input().split())
    if a>=H and b>=W:
        count+=1
print(count)

Submission status: Accepted

Solution code:
import numpy as np
N,H,W = map(int,input().split())
ab=[]
for i in range(N):
    ab.append(list(map(int,input().split())))
ab=np.array(ab)
print(ab[(ab[:,0]>=H)&(ab[:,1]>=W)].shape[0])

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split(' '))
lists = []
for i in range(N):
    lists.append(list(map(int, input().split(' '))))

count = 0

for list_ in lists:
    if H <= list_[0] and W <= list_[1]:
        count += 1

print(count)

Submission status: Accepted

Solution code:
def solve(N, H, W, ABs):
    ans = 0
    for A, B in ABs:
        ans += min(A // H, B // W)
    return ans


if __name__ == "__main__":
    N, H, W = tuple(map(int, input().split(" ")))
    ABs = [tuple(map(int, input().split(" "))) for _ in range(N)]
    print(solve(N, H, W, ABs))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N, H, W = map(int, input().split())

counter=0
for i in range(N):
  a, b = map(int, input().split())
  if a >= H and b >= W:
    counter+=1

print(counter)

Submission status: Accepted

Solution code:
N,H,W= map( int , raw_input().split() )

ans=0
for  i in range(N):
	a,b= map( int , raw_input().split() )
	if a>=H and b>=W:
		ans+=1

print ans

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
count = 0
for i in range(n):
    a,b = map(int,input().split())
    if a >= h and b >= w:
        count += 1
else:
    print(count)

Submission status: Accepted

Solution code:
N,W,H=[int(i) for i in input().split()]

ans=0

for i in range(N):
  w,h=[int(x) for x in input().split()]
  if h>=H and w>= W:
    ans+=1

print(ans)

Submission status: Accepted

Solution code:
n, h0, w0 = map(int, input().split())
count = 0
for i in range(n):
    h, w = map(int, input().split())
    if h >= h0 and w >= w0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
n,a,b = map(int, input().split())
l=[[int(i) for i in input().split()] for i in range(n)] 
c=0
for i,k in l:
    if i>=a and k>=b:
        c+=1
print(c)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
sum = 0
for i in range(N):
    A, B = map(int, input().split())
    if A >= H and B >= W:
        sum += 1
print(sum)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ab = [map(int, input().split()) for _ in range(N)]
s = 0
for a, b in ab:
    if a >= H and b >= W:
        s+=1

print(s, flush=True)

Submission status: Accepted

Solution code:
N, H, W = input().split()
N = int(N)
H = int(H)
W = int(W)
cnt = 0

for i in range(N):
	sozai_h, sozai_w = input().split()
	sozai_h = int(sozai_h)
	sozai_w = int(sozai_w)
	if sozai_h >= H and sozai_w >= W:
		cnt += 1
print (cnt)

Submission status: Accepted

Solution code:
n, h, w= [int(i) for i in input().split()]
e = [[int(i) for i in input().split()] for i in range(n)] 
#print(n,h,w)
#print(e)
cnt=0
for j in range(n):
  if e[j][0]>=h and e[j][1]>=w:
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
a = list()
b = list()
for i in range (n):
    tempa, tempb = map(int, input().split())
    a.append(tempa)
    b.append(tempb)


ans = 0
for i in range(n):
    if (int(a[i]) >= h) and (int(b[i]) >= w):
        ans += 1

print(int(ans))

Submission status: Accepted

Solution code:
n,h,w=map(int, input().split())
c=0
for i in range(n):
  a,b = map(int, input().split())
  if a>=h and b>=w:
    c=c+1
print(c)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
 
count=0
 
for i in range(N):
    A, B = map(int, input().split())
    if (A >= H)&(B >= W):
        count = count + 1
 
print(count)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
size=[]
cnt=0
for i in range(N):
    array=list(map(int,input().split()))
    if array[0]>=H and array[1]>=W :
        cnt=cnt+1
print(cnt)

Submission status: Accepted

Solution code:
nhw = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(nhw[0])]
ab.sort(reverse=True)
aba = [i for i in ab if i[0] >= nhw[1]]
abab = [i for i in aba if i[1] >= nhw[2]]
print(len(abab))

Submission status: Accepted

Solution code:
N,H,W = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
count = 0
for n in AB:
    if n[0] >= H and n[1] >= W:
        count += 1
print(count)

Submission status: Accepted

Solution code:
n, h, w=map(int, input().split())
a= [[int(i) for i in input().split()] for i in range(n)] 
b=0
for i in range(n):
  if (a[i][0]>=h and a[i][1]>=w):
    b+=1
print(b)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())

a, b = [], []
for i in range(n):
    ai, bi = map(int, input().split())
    a.append(ai)
    b.append(bi)

#%%
# n, h, w = [3, 5, 2]

# a = [10, 5, 2]
# b = [3, 2, 5]


#%%
ans = 0
for i in range(n):
    
    # print(a[i], h, b[i], w)
    if a[i] >= h:
        if b[i] >= w:
            ans += 1
print(ans)
#%%
w

Submission status: Accepted

Solution code:
from sys import stdin
N,k1,k2=[int(x) for x in stdin.readline().rstrip().split()]
a = []
for i in range(N):
    a.append([int(x) for x in stdin.readline().rstrip().split()])
cnt=0
for i in a:
    tmp1=i[0]-k1
    tmp2=i[1]-k2
    if tmp1>=0 and tmp2>=0:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
N,H,W=map(int,input().split())
plate=0
for i in range(N):
    a,b = map(int,input().split())
    if H<=a and W<=b:
        plate += 1

print(plate)

Submission status: Accepted

Solution code:
N, H, W = map(int, raw_input().split())
c = 0
for _ in range(N):
    A, B = map(int, raw_input().split())
    if A >= H and B >= W:
        c += 1
print c

Submission status: Accepted

Solution code:
N,H,W = map(int, input().split())
cnt = 0
for _ in range(N):
    A,B = map(int, input().split())
    if A >= H and B >= W:
      cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ans=0
for i in range(N):
    d, e = map(int, input().split())
    if (d >= H) and (e >= W):
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())

cnt=0
a=[]
b=[]

for i in range(n):
  c,d=map(int,input().split())
  a.append(c)
  b.append(d)

for i in range(n):
  e=int(a[i]/h)
  f=int(b[i]/w)
  cnt=cnt+min(e,f)
print(cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

from sys import stdin

n,h,w = [int(x) for x in stdin.readline().split()]
data = [[int(x) for x in stdin.readline().split()] for i in range(n)]

count = 0
for h0, w0 in data:
    if h0 >= h and w0 >= w:
        count += 1

print(count)

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools

# いくつか入力
n,h,w = (int(i) for i in input().split())  

# n行複数列の数をリストに
ab = [[int(i) for i in input().split()] for i in range(n)] 

answer = 0

for i in range(n):
    if(h <= ab[i][0] and w <= ab[i][1]):
        answer += 1

print(answer)

Submission status: Accepted

Solution code:
N,H,W= map(int,input().split())
a = [[]*N]*N
for i in range(N):
    a[i]=input().rstrip().split()


count=0
for i in range(0,N):
    if ((int(a[i][0])>=H)and(int(a[i][1])>=W)):
        count+=1


print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
count = 0
for n in range(N):
    if AB[n][0] >= H and AB[n][1] >= W:
        count += 1

print(count)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split(' '))

A = []
B = []

for i in range(N):

    a,b = map(int,input().split(' '))

    A.append(int(a))
    B.append(int(b))


cnt = 0

for j in range(N):

    if A[j] >= H:
        if B[j] >= W:
            cnt =cnt + 1

print(cnt)

Submission status: Accepted

Solution code:
N,H,W = map(int, input().split())

ans = 0
for i in range(N):
    a,b = map(int, input().split())
    if a >= H and b >= W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N, H, W = map(int,input().split())
A_list = []
B_list = []
for i in range(N):
    A, B = map(int, input().split())
    A_list.append(A)
    B_list.append(B)
H_list = [H]*N
W_list = [W]*N
H_div = [x-y for (x,y) in zip(A_list,H_list)]
W_div = [x-y for (x,y) in zip(B_list,W_list)]
count = 0
for i,j in zip(H_div,W_div):
    if i>-1 and j>-1:
        count += 1
print(count)

Submission status: Accepted

Solution code:
N,H,W=list(map(int,input().split()))

seek=0

for i in range(N):
    a,b=list(map(int,input().split()))
    
    if a>=H and b>=W:
        seek+=1

print(seek)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
count = 0
for i in range(N):
  if A[i][0] >= H and A[i][1] >= W:
    count+=1
print(count)

Submission status: Accepted

Solution code:
N,H,W=map(int,input().split())
kekka=[]
count=0
for i in range(N):
    a,b=map(int,input().split())
    kekka.append(a)
    kekka.append(b)
for i in range(len(kekka)//2):
    if H<=kekka[i*2]:
        if W<=kekka[i*2+1]:
            count+=1
print(count)

Submission status: Accepted

Solution code:
a,t,y = map(int,input().split())
r = 0

for i in range(a):
    b,c= map(int,input().split())
    if b - t >= 0 and c - y >= 0:
        r += 1
print(r)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
ans=0
for i in range(n):
	x,y=map(int,input().split())
	xx=min(x//h,y//w)
	ans+=xx
print(ans)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(N)]
count = 0
for i in range(N):
    if ab[i][0] >= H and ab[i][1] >= W:
        count += 1
print(count)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())

arr = []
for i in range(n):
    arr += [list(map(int,input().split()))]

ans = 0    
    
for j in range(n):
    if arr[j][0] >= h and arr[j][1] >= w:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
nhw=list(map(int,input().split()))
ab = [[0,0] for i in range(nhw[0])]
for i in range(nhw[0]):
    ab[i]=list(map(int,input().split()))
c=0
for i in range(nhw[0]):
     if ab[i][0] >= nhw[1] and ab[i][1] >= nhw[2]:
        c += 1
print(c)

Submission status: Accepted

Solution code:
n, h, w = list(map(int, input().split()))
hl = []
wl = []
for i in range(n):
    a,b = list(map(int, input().split()))
    hl.append(a)
    wl.append(b)
#print()
ct = 0
for j in range(n):
    if hl[j]>=h and wl[j]>=w:
        ct +=1
print(ct)

Submission status: Accepted

Solution code:
N,H,W = list(map(int, input().split()))
count = 0
for i in range(N):
    a,b = list(map(int,input().split()))
    if H<=a and W <= b:
        count += 1
print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())


ab = []
for _ in range(N):
    a, b = map(int, input().split())
    ab.append([a, b])

ans = 0
for a, b in ab:
    board = 1
    while True:
        if H * board <= a and W * board <= b:
            board += 1
            ans += 1
        else:
            break

print(ans)

Submission status: Accepted

Solution code:
n, h, w  = list(map(int, input().split()))
a = []
for i in range(n):
    a.append(list(map(int, input().split())))

cnt = 0
for i in range(n):
    if a[i][0] >= h and a[i][1] >= w:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
nhw = input()

nhw = nhw.split(" ")
nhw = [int(x) for x in nhw]

count = 0

for i in range(nhw[0]):
  ab = input()
  ab = ab.split(" ")
  ab = [int(x) for x in ab]
  if ab[0] >= nhw[1] and  ab[1] >= nhw[2] :
    count +=1
print(count)