Problem:


Score : 100 points

Problem Statement

You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.

The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?

Constraints

-40 \leq X \leq 40

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

Print Yes if you will turn on the air conditioner; print No otherwise.

Sample Input 1

25

Sample Output 1

No

Sample Input 2

30

Sample Output 2

Yes



Sample input:
25


Sample output:
No

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    X = int(readline())

    if X >= 30:
        print('Yes')
    else:
        print('No')

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# abc174_a.py
N = int(input())
if N>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')


x = I()
if x >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#import
#import math
#import numpy as np
x= int(input())
#= input()
#= map(int, input().split())
#= list(map(int, input().split()))
#= [input(), input()]
#= [list(map(int, input().split())) for _ in range(N)]
#= [int(input()) for _ in range(N)]
#= {i:[] for i in range(N)}

if x >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print(["No","Yes"][int(input()) >= 30])

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x = ni()

print('Yes' if x >= 30 else 'No')

Submission status: Accepted

Solution code:

N = int(input())
if N >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

n = int(stdin.readline().rstrip())

if n >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#[int(i) for i in input().split()]
x = int(input())
if x >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x=int(input())

print("Yes" if x>=30 else "No")

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)


def nck(n, k, kaijyo):
    return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD


def npk(n, k, kaijyo):
    if k == 0 or k == n:
        return n % MOD
    return (kaijyo[n] * divide(kaijyo[n-k])) % MOD


def kaijyo(n):
    ret = [1]
    for i in range(1, n + 1):
        ret.append((ret[-1] * i)% MOD)
    return ret


def solve():
    a = getN()
    if a >= 30:
        print("Yes")
    else:
        print("No")

def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve()

Submission status: Accepted

Solution code:
# import sys
n = int(input())
if n>=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

x = readInt()

if x>=30:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


def solve():
    N = Scanner.int()
    if N >= 30:
        print('Yes')
    else:
        print('No')


def main():
    # sys.setrecursionlimit(1000000)
    # sys.stdin = open("sample.txt")
    solve()


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=int(input())
print("Yes" if a>=30 else "No")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    X = int(input())

    if X >= 30:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#import 
#=input()
x=int(input())
#=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

if x >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x = int(input())
    print("Yes" if x >= 30 else "No")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# ------------------- fast io --------------------
from math import gcd, ceil

def pre(s):
    n = len(s)
    pi = [0] * n
    for i in range(1, n):
        j = pi[i - 1]
        while j and s[i] != s[j]:
            j = pi[j - 1]
        if s[i] == s[j]:
            j += 1
        pi[i] = j
    return pi


def prod(a):
    ans = 1
    for each in a:
        ans = (ans * each)
    return ans

def lcm(a, b): return a * b // gcd(a, b)


def binary(x, length=16):
    y = bin(x)[2:]
    return y if len(y) >= length else "0" * (length - len(y)) + y


for _ in range(int(input()) if not True else 1):
    n = int(input())
    #n, k = map(int, input().split())
    #a, b = map(int, input().split())
    #c, d = map(int, input().split())
    #a = list(map(int, input().split()))
    #b = list(map(int, input().split()))
    #s = input()
    print("Yes" if n>=30 else "No")

Submission status: Accepted

Solution code:
X = int(input())

print("Yes" if 30 <= X else "No")

Submission status: Accepted

Solution code:
x=int(input())

print('Yes' if x>=30 else 'No')

Submission status: Accepted

Solution code:
X=int(input())
print('Yes'if 30<=X else 'No')

Submission status: Accepted

Solution code:
def main():
    print("Yes" if int(input()) >= 30 else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())
print("Yes" if x >=30 else "No")

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
from decimal import *
import heapq
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

x = INT()
if x >= 30:
    print("Yes")
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

n=int(input())
if n>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

if II()>=30:print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    N = int(input())
    if N >= 30:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X=int(input())
print(['No','Yes'][X>=30])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return [LIST() for _ in range(n)]
def NSTR(n): return [input() for _ in range(n)]


INF = float("inf")
MOD = 10**9 + 7


def main():
    X = INT()
    if 30 <= X:
        print("Yes")
    else:
        print("No")

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print("Yes")if int(input())>=30 else print("No")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X = INT()

print("Yes" if X >= 30 else "No")

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array

# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    print('Yes' if N >= 30 else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, math
from functools import lru_cache
from collections import defaultdict
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def main():
    X = ii()
    print('Yes' if X >= 30 else 'No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())
ans = 'Yes' if x >= 30 else 'No'
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

X=int(input())
YesNo(X>=30)

Submission status: Accepted

Solution code:
#

import sys
input=sys.stdin.readline

def main():
    X=int(input())
    if X>=30:
        print("Yes")
    else:
        print("No")
    
    
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
def main():
    n = int(input())
    if(n>=30):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())
if x >= 30:
  print('Yes')
else:
  print ('No')

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip('\r\n')

X = int(input())

print('Yes' if X >= 30 else 'No')

Submission status: Accepted

Solution code:
n = int(input())
print("Yes" if(n >= 30) else "No")

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
x = I()
print('Yes' if x >= 30 else 'No')

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    X = int(input())
    if X >= 30:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = I()
    if x >= 30:
        print("Yes")
    else:
        print("No")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


x = int(sys.stdin.buffer.readline())
if x >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
if n >= 30:
  print("Yes")
else:print("No")

Submission status: Runtime Error

Solution code:
x = int(inpt())
if(x >= 30):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = input()

if n >= 30:
  print ('Yes')
else:
  print ('No')

Submission status: Runtime Error

Solution code:
xin = int(input())
	
if ( X >= 30 ):
	print("yes")
else:
	print("no")

Submission status: Runtime Error

Solution code:
if int(input()) >=30:
  print("Yes")
if else:
  print("No")

Submission status: Runtime Error

Solution code:
a=int(input())
a>=30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a=int(input())
a>=30:
  print('Yes')
 else:
  print('No')

Submission status: Runtime Error

Solution code:
temperature=input()
if temperature >= 30:
  print('Yes')
 else:
  print('No')

Submission status: Runtime Error

Solution code:
X = int(input())
if x >= 30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
x=input()

if x>=30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
X=input()

if x>=30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N,D=map(int,input().split())
cnt=0
for idx in range(N):
  X,Y=map(int,input().split())
  if X**2+Y**2<=D**2:
    cnt=cnt+1
print(cnt)

Submission status: Runtime Error

Solution code:
import math
N, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse = True)

ans_l = 0
ans_h = A[0]
while ans_l != ans_h:
    ans_m = (ans_l + ans_h) // 2
    tmp_n = 0
    for a in A:
        tmp_n += math.ceil(a / ans_m) - 1
    if tmp_n > K:
        ans_l = ans_m + 1
    else:
        ans_h = ans_m

print(ans_h)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
x = int(input())

if x >= 30:
  print('Yes')
else
  print('No')

Submission status: Runtime Error

Solution code:
X=input()

if int(X)>=30:
  print('Yes')
  else :
    print('No')

Submission status: Runtime Error

Solution code:
import copy
import math

N, K = list(map(int,input().split()))
As = list(map(int,input().split()))

sorted_As = sorted(As,reverse = True)
cut_As = copy.copy(sorted_As)
count_list = [0]*len(sorted_As)

for i in range(K):
    index = cut_As.index(max(cut_As))
    count = count_list[index]
    count_list[index] += 1
    cut_As[index] = sorted_As[index] / (count+2)

'''
for i in range(K):
    count = count_list[0]
    count_list[0] += 1
    cut_As[0] = sorted_As[0] / (count+2)
    cut_As,sorted_As,count_list = (list(x) for x in zip(*sorted(zip(cut_As,sorted_As,count_list),reverse = True)))
'''

print(math.ceil(max(cut_As)))

Submission status: Runtime Error

Solution code:
x = int(input())
if x >= 30:
  print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x = int(input())
if x >= 30:
  print("yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x = input()
if x >= 30:
    print('Yes')
elif x < 30:
    print('No')

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int X;
  cin >> X;
  if(X >= 30){
  	cout << "Yes" << endl;
  }
  else{
  	cout << "No" << endl;
  }
}

Submission status: Runtime Error

Solution code:
x = int(raw_input())
if (x >= 30):
 	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
X = input()

if X>=30:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
N=int(input())
c=input()

i=0
listNum=[]

for i in range(N):
    w=c.count("W",0,i)
    s=c.count("R",i+1,N)
    listNum.append(max(w,s))
    i+=1
print(min(listNum))

Submission status: Runtime Error

Solution code:
S,W =map(int,input().split())
if W >=S:
    print('unsafe')
else:
    print('safe')

Submission status: Runtime Error

Solution code:
x = int(input())

if x=>30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
X=input()
if X>=30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
X=input()
if X >=30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
if int(input())>=30:
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
if int(input())>=30:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
cnt=0
for i in range(n):
  x,y=map(int,input().split())
  if x*x+y*y<=d*d:
    cnt+=1
  else:
    continue
print(cnt)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
cnt=0
for i in range(n):
  x,y=map(int,input().split())
  if x*x+y+y<=d*d:
    cnt+=1
  else:
    continue
print(cnt)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
cnt=0
for i in range(n):
  x,y=map(int,input().split())
  if x*x+y+y<=d*2:
    cnt+=1
  else:
    continue
print(cnt)

Submission status: Runtime Error

Solution code:
x = input()

if x >= 30 :
  print('Yes')
else :
  print('No')

Submission status: Runtime Error

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

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

kyori = d * d
count = 0

for s in range(n):
  nagasa = p[s][0] * p[s][0] + p[s][1] * p[s][1]
  if nagasa <= kyori:
    count += 1
    
print(count)

Submission status: Runtime Error

Solution code:
i = int(input())

if i >=30:
  print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
X = int(input())

if X < 30:
  print(No)
else:
  print(Yes)

Submission status: Runtime Error

Solution code:
X = input()
if 30 =< X:
    print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A = int(input())
if A >= 30:
    print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
import math
 
i = input().split()
n = int(i[0])
D = int(i[1])
num_list = []
count = 0
for i in range(n):
	num_list.append(list(map(int,input().split())))
 
for j in num_list:
    x = j[0]
    y = j[1]
    dist = math.sqrt(x ** 2 + y ** 2)
    if dist <= D:
        count += 1
 
print(count)

Submission status: Runtime Error

Solution code:
N =input()
if N >=30:
    print('Yes')
else :
    print('No')

Submission status: Runtime Error

Solution code:
x = input()

if x >= 30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
X = input()
if X < 30:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
X=int(input())
ans=None

if X>=30:
    ans=Yes
else:
    ans=No

print(ans)

Submission status: Runtime Error

Solution code:
X=int(input())
ans=None

if X>=30:
  ans=Yes
else:
  ans=No

print(ans)

Submission status: Runtime Error

Solution code:
import math

N, K = map(int, input().split())
A = list(map(int, input().split()))

left = 0
right = A[0]

while right - left > 1:
    mid = (left + right) // 2
    jk = 0
    for i in range(N):
        jk += A[i] / mid - 1
        if A[i] % mid == 0: jk += 1
    if jk <= K:
        right = mid
    else:
        left = mid

print(right)

Submission status: Runtime Error

Solution code:
int(raw_input())
if x >30 :
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n,d=[int(i) for i in input().strip().split(" ")]
ans=0
for _ in range(n):
  x,y=[int(i) for i in input().strip().split(" ")]
  if x*x+y*y==d*d:
    ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
temp = int(input())
if temp>=30:
  print("Yes")
else:
  print("No)

Submission status: Runtime Error

Solution code:
K = int(input())

t=7
for i in K:
    if t % K == 0 :
        print(i+1)
        break
    t= 10 * t + 7
else :
    print(-1)

Submission status: Runtime Error

Solution code:
x = (int)input()

if x >= 30:
  print("yes")
else
  print("No")

Submission status: Runtime Error

Solution code:
x=int(input())
if(x>=30){
  print("yes")
}
 else{
   print("no")
 }

Submission status: Runtime Error

Solution code:
X = int(input())
if X >= 30:
    print('Yes'):
else:
    print('No'):

Submission status: Runtime Error

Solution code:
x = int(input())
if X >= 30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N, K = map(int,input().split())
A = sorted(map(int,input().split()))
start = 0
end = A[-1]
while end - start != 0:
   l = (start + end)/2
   count = 0
   for i in range(N):
      count += (A[i]-1)//l
   if count > K:
      start = int(l)
   else:
      end = int(l+1)
print(int(l)+1)

Submission status: Runtime Error

Solution code:
t = input()

if t >= 30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a= input()

if a>=30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
X_string=input()
int=input(X_string)
if X>=30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a = input()
if a>=30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
if X >=30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
if X >= 30:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
import sys
K = int(input())

d = pow(9, -1, K)
t = 1
for ans in range(1, K):
    #x = 7*(pow(10, ans, K) - 1)*d
    t = (t*10) % K
    x = 7*(t - 1)*d
    if  x%K == 0:
        print(ans)
        sys.exit()

print(-1)

Submission status: Runtime Error

Solution code:
X = int(input())

if X >= 30:
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
a = input()

if a >= 30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
tem = int.input()
if tem >= 30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
tem = input()
if tem >= 30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:

tem = input()
if tem >= 30:
  print("Yes")
else:
  Print("No")

Submission status: Runtime Error

Solution code:
x = input()

if x >= 30:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
x = input()
if x >= 30:print("Yes")  
else:print("No")

Submission status: Runtime Error

Solution code:
x = input()
if x >= 30:
  print("Yes")
else:
  print('No')

Submission status: Runtime Error

Solution code:
X = input()
if X >= 30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
rt = int(inut())

if rt >= 30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
X=input()
if X >= 30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
X=input()
if X>=30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a=input()
if a>=30:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
for i in input:
    if i >= 30:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
import re

def checkFunction(c):
    # print(c)
    c = re.sub('W+$','',c)
    c = re.sub('^R+','',c)
    if (not 'WR' in c):
        return 0
    if c.index('WR') + 2 != len(c):
        c2 = c.replace('WR', 'RR',1)[:-1]
        return checkFunction(c2) + 1
    return 1


N = int(input())
c= input()

print(checkFunction(c))

Submission status: Runtime Error

Solution code:
if X >= 30:
		print('Yes')
	else:
		print('No')

Submission status: Runtime Error

Solution code:
x = int(input())
if x > 30:
  print("Yes")
else
  print("No")

Submission status: Runtime Error

Solution code:
s=input()


con=False

ans=0
for i in range(3):
  if(s[i]=="R" and con):
    ans+=1
  elif(s[i]=="R" and not(con)):
    ans=1
    con=True
  else:
    con=False
      
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
if n >= 25:
  print 'Yes'
else:
  print 'No'

Submission status: Runtime Error

Solution code:
X = int(input())
if X >= 30:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
if x>=30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = input()

if n >= 30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
x=int(input())
if x>=30:
  print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
T = input()

if T >= 30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
X = input()
if X>= 30:
  print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
wqydcgy

Submission status: Runtime Error

Solution code:
X = input()
if X >= 30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
x = input()
if x >=　30:
  print('Yes')
  else:
    print('No')