s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s537172197 | p02567 | u021548497 | 1600481207 | Python | PyPy3 (7.3.0) | py | Runtime Error | 777 | 113488 | 2811 | """
セグメント木
func：二項演算の関数（モノイドである必要あり）
e：単位元（モノイドにおける）
update, find, bisect, 全てにおいて, 1-indexとなっている。
(大抵の場合、Atcoderの問題文の表記のままの値を、メソッドに代入すれば良い)
"""
class SegmentTree:
def __init__(self, n, func, e, arrange=None):
self.init(n)
self.func = func
self.e = e
self.make_arrange(arrange)
... |
s291239996 | p02567 | u021548497 | 1600481104 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2329 | 373816 | 2838 | """
セグメント木
func：二項演算の関数（モノイドである必要あり）
e：単位元（モノイドにおける）
update, find, bisect, 全てにおいて, 1-indexとなっている。
(大抵の場合、Atcoderの問題文の表記のままの値を、メソッドに代入すれば良い)
"""
class SegmentTree:
def __init__(self, n, func, e, arrange=None):
self.init(n)
self.func = func
self.e = e
self.make_arrange(arrange)
... |
s573542250 | p02567 | u021548497 | 1600480835 | Python | PyPy3 (7.3.0) | py | Runtime Error | 792 | 113724 | 2806 | """
セグメント木
func：二項演算の関数（モノイドである必要あり）
e：単位元（モノイドにおける）
update, find, bisect, 全てにおいて, 1-indexとなっている。
(大抵の場合、Atcoderの問題文の表記のままの値を、メソッドに代入すれば良い)
"""
class SegmentTree:
def __init__(self, n, func, e, arrange=None):
self.init(n)
self.func = func
self.e = e
self.make_arrange(arrange)
... |
s323127821 | p02567 | u021548497 | 1600479172 | Python | PyPy3 (7.3.0) | py | Runtime Error | 5517 | 113220 | 3166 | """
セグメント木
func：二項演算の関数（モノイドである必要あり）
e：単位元（モノイドにおける）
update, find, bisect, 全てにおいて, 1-indexとなっている。
(大抵の場合、Atcoderの問題文の表記のままの値を、メソッドに代入すれば良い)
"""
class SegmentTree:
def __init__(self, n, func, e, arrange=None):
self.init(n)
self.func = func
self.e = e
self.make_arrange(arrange)
... |
s559346572 | p02567 | u077291787 | 1600396906 | Python | PyPy3 (7.3.0) | py | Runtime Error | 439 | 119036 | 4431 | from typing import Callable, List, TypeVar
S = TypeVar("S")
class SegmentTree:
"""Segment Tree
References:
https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp
"""
__slots__ = ["e", "op", "_n", "_size", "tree"]
def __init__(self, a: List[S], e: S, op: Callable[[S, S], S... |
s974252890 | p02567 | u785989355 | 1600267321 | Python | Python (3.8.2) | py | Runtime Error | 35 | 9664 | 8301 | header_code = """
#include <vector>
#include <algorithm>
#include <cassert>
#include <vector>
namespace aclython {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
... |
s991562266 | p02567 | u785989355 | 1600267193 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9708 | 8328 | header_code = """
#include <vector>
#include <algorithm>
#include <cassert>
#include <vector>
namespace aclython {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
... |
s245030248 | p02567 | u910632349 | 1600242099 | Python | PyPy3 (7.3.0) | py | Runtime Error | 862 | 96436 | 2196 | class SegmentTree: #1-indexed
def __init__(self,list,f=lambda x,y:x+y,inf=0):
self.height=(len(list)-1).bit_length()+1 #木の高さ
self.zero=2**(self.height-1) #最下段に添字を合わせる用
self.id=inf #単位元
self.tree=[self.id]*(2**self.height) #木を単位元で初期化
self.f=f
for i in range(len(list)):... |
s259423029 | p02567 | u722217673 | 1600218292 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2019 | 145928 | 18137 | #region bcf
# code section by Barry Fam
#
# pylint: disable= reimported
#region rangedata.py
#region hyperlist.py
import itertools
# def hyperlist(*dim, default_factory=None):
def hyperlist(*dim, **kwarg):
default_factory = kwarg.pop("default_factory", None)
ranges = [range(n) for n in dim]
h = [None]*di... |
s136472805 | p02567 | u722217673 | 1600217756 | Python | PyPy3 (7.3.0) | py | Runtime Error | 1843 | 146084 | 18150 | #region bcf
# code section by Barry Fam
#
# pylint: disable= reimported
#region rangedata.py
#region hyperlist.py
import itertools
# def hyperlist(*dim, default_factory=None):
def hyperlist(*dim, **kwarg):
default_factory = kwarg.pop("default_factory", None)
ranges = [range(n) for n in dim]
h = [None]*di... |
s678894990 | p02567 | u467736898 | 1600217101 | Python | Python (3.8.2) | py | Runtime Error | 216 | 45132 | 14371 | # メモリリークを直した
# TODO: 更新ルールの異なる複数のセグ木を作ったときに正しく動くか検証
# PyPy より遅いならこれ使う意味無いのでは…？
code_segtree = r"""
#define PY_SSIZE_T_CLEAN
#include <Python.h>
#include "structmember.h"
// >>> AtCoder >>>
#ifndef ATCODER_SEGTREE_HPP
#define ATCODER_SEGTREE_HPP 1
#include <algorithm>
#ifndef ATCODER_INTERNAL_BITOP_HPP
#define ATCO... |
s572157334 | p02567 | u467736898 | 1600212510 | Python | Python (3.8.2) | py | Runtime Error | 219 | 45100 | 14390 | # メモリリークを直した
# TODO: 更新ルールの異なる複数のセグ木を作ったときに正しく動くか検証
# PyPy より遅いならこれ使う意味無いのでは…？
code_segtree = r"""
#define PY_SSIZE_T_CLEAN
#include <Python.h>
#include "structmember.h"
// >>> AtCoder >>>
#ifndef ATCODER_SEGTREE_HPP
#define ATCODER_SEGTREE_HPP 1
#include <algorithm>
#ifndef ATCODER_INTERNAL_BITOP_HPP
#define ATCO... |
s098757915 | p02567 | u875291233 | 1600199085 | Python | PyPy3 (7.3.0) | py | Runtime Error | 321 | 74328 | 3135 | class segment_tree:
__slots__ = ["op_M", "e_M","N","N0"."dat"]
def __init__(self, N, operator_M, e_M):
self.op_M = operator_M
self.e_M = e_M
self.N = N
self.N0 = 1<<(N-1).bit_length()
self.dat = [self.e_M]*(2*self.N0)
# 長さNの配列 initial で初期化
def build(self, ini... |
s755991585 | p02567 | u077291787 | 1600179433 | Python | Python (3.8.2) | py | Runtime Error | 228 | 84864 | 3289 | from typing import Callable, List, Union
T = Union[int, str]
class SegmentTree:
"""Segment Tree"""
__slots__ = ["_n", "_log", "_size", "op", "e", "tree"]
def __init__(self, v: List[T], op: Callable[[T, T], T], e: T) -> None:
self._n = len(v)
self._log = (self._n - 1).bit_length()
... |
s796659118 | p02567 | u375616706 | 1600076787 | Python | PyPy3 (7.3.0) | py | Runtime Error | 135 | 98124 | 2394 | class SegmentTree():
'''
非再帰
segment tree
'''
def __init__(self, n, func, init=float('inf')):
'''
n->配列の長さ
func:func(a,b)->val, func=minだとRMQになる
木の高さhとすると,
n:h-1までのノード数。h段目のノードにアクセスするために使う。
data:ノード。
parent:k->child k*2+1とk*2+2
'''
... |
s950668516 | p02567 | u571969099 | 1599942016 | Python | PyPy3 (7.3.0) | py | Runtime Error | 160 | 128396 | 3419 | from typing import Callable, TypeVar, List
import sys
input = sys.stdin.readline
T = TypeVar('T')
class SegTree:
def __init__(self, v: List[T], op: Callable[[T, T], T], e: Callable[[], T]) -> None:
self._n = len(v)
self.log = (self._n - 1).bit_length()
self.size = 1 << self.log
sel... |
s092573579 | p02567 | u571969099 | 1599941479 | Python | PyPy3 (7.3.0) | py | Runtime Error | 516 | 127920 | 3330 | from typing import Callable, TypeVar, List
import sys
input = sys.stdin.readline
T = TypeVar('T')
class SegTree:
def __init__(self, v: List[T], op: Callable[[T, T], T], e: Callable[[], T]) -> None:
self._n = len(v)
self.log = (self._n - 1).bit_length()
self.size = 1 << self.log
sel... |
s828172940 | p02567 | u021548497 | 1599930372 | Python | Python (3.8.2) | py | Runtime Error | 3181 | 31508 | 2690 | import sys
sys.setrecursionlimit(10000000)
input = sys.stdin.readline
class SegmentTree:
def __init__(self, n, func, e, arrange=None):
self.init(n)
self.func = func
self.e = e
self.make_arrange(arrange)
def init(self, n):
self.inf = pow(2, 32)
self.n = n
... |
s876308492 | p02567 | u682672120 | 1599914810 | Python | PyPy3 (7.3.0) | py | Runtime Error | 642 | 106468 | 6201 | class SegmentTree:
'''
Segment tree。区間を表す関数の引数は全て閉区間で統一する(search系の戻り値を考慮)
--------
n:要素数, func:演算(モノイド), e:単位元(モノイド), init_list:初期値
'''
def __init__(self, n, func=lambda x, y : max(x, y), e = -float('inf'), init_list = None):
assert n > 0 and (not init_list or len(init_list) <= n)
... |
s325393001 | p02567 | u682672120 | 1599914754 | Python | PyPy3 (7.3.0) | py | Runtime Error | 135 | 96716 | 6200 | class SegmentTree:
'''
Segment tree。区間を表す関数の引数は全て閉区間で統一する(search系の戻り値を考慮)
--------
n:要素数, func:演算(モノイド), e:単位元(モノイド), init_list:初期値
'''
def __init__(self, n, func=lambda x, y : max(x, y), e = -float('inf'), init_list = None):
assert n > 0 and (not init_list or len(init_list) <= n)
... |
s896406737 | p02567 | u682672120 | 1599864826 | Python | PyPy3 (7.3.0) | py | Runtime Error | 647 | 104824 | 4918 | class SegmentTree:
def __init__(self, n, func=lambda x, y : max(x, y), default_val = -float('inf'), init_list = None):
assert n > 0 and (not init_list or len(init_list) <= n)
self.n = n
self.leaf_n = 1
while n > self.leaf_n:
self.leaf_n <<= 1
self.node_n = (self.l... |
s588916294 | p02567 | u682672120 | 1599860369 | Python | PyPy3 (7.3.0) | py | Runtime Error | 589 | 105068 | 4876 | class SegmentTree:
def __init__(self, n, func=lambda x, y : max(x, y), default_val = -float('inf'), init_list = None):
assert n > 0 and (not init_list or len(init_list) <= n)
self.n = n
self.leaf_n = 1
while n > self.leaf_n:
self.leaf_n <<= 1
self.node_n = (self.l... |
s435522778 | p02567 | u682672120 | 1599859161 | Python | PyPy3 (7.3.0) | py | Runtime Error | 603 | 105220 | 4896 | class SegmentTree:
def __init__(self, n, func=lambda x, y : max(x, y), default_val = -float('inf'), init_list = None):
assert n > 0 and (not init_list or len(init_list) <= n)
self.n = n
self.leaf_n = 1
while n > self.leaf_n:
self.leaf_n <<= 1
self.node_n = (self.l... |
s277190703 | p02567 | u682672120 | 1599854088 | Python | PyPy3 (7.3.0) | py | Runtime Error | 560 | 104460 | 5291 | class SegmentTree:
def __init__(self, n, func=lambda x, y : max(x, y), default_val = -float('inf'), init_list = None):
assert n > 0 and (not init_list or len(init_list) <= n)
self.leaf_n = 1
while n > self.leaf_n:
self.leaf_n <<= 1
self.node_n = (self.leaf_n << 1) - 1
... |
s604871763 | p02567 | u779805689 | 1599790355 | Python | PyPy3 (7.3.0) | py | Runtime Error | 996 | 129704 | 3190 | class Segment_Tree():
def __init__(self,N,calc,unit,L=[]):
"""calcを演算とするN項のSegment Treeを作成
N:要素数
calc:演算(2変数関数,モノイド)
unit:モノイドcalcの単位元 (xe=ex=xを満たすe)
"""
self.calc=calc
self.unit=unit
N=max(N,len(L))
d=max(1,(N-1).bit_length())
k=2**... |
s086876928 | p02567 | u779805689 | 1599789233 | Python | PyPy3 (7.3.0) | py | Runtime Error | 961 | 129156 | 3263 | class Segment_Tree():
def __init__(self,N,calc,unit,L=[]):
"""calcを演算とするN項のSegment Treeを作成
N:要素数
calc:演算(2変数関数,モノイド)
unit:モノイドcalcの単位元 (xe=ex=xを満たすe)
"""
self.calc=calc
self.unit=unit
N=max(N,len(L))
d=max(1,(N-1).bit_length())
k=2**... |
s055098040 | p02567 | u779805689 | 1599789010 | Python | PyPy3 (7.3.0) | py | Runtime Error | 1050 | 128872 | 3302 | class Segment_Tree():
def __init__(self,N,calc,unit,L=[]):
"""calcを演算とするN項のSegment Treeを作成
N:要素数
calc:演算(2変数関数,モノイド)
unit:モノイドcalcの単位元 (xe=ex=xを満たすe)
"""
self.calc=calc
self.unit=unit
N=max(N,len(L))
d=max(1,(N-1).bit_length())
k=2**... |
s760436890 | p02567 | u779805689 | 1599787064 | Python | PyPy3 (7.3.0) | py | Runtime Error | 913 | 130084 | 3244 | class Segment_Tree():
def __init__(self,N,calc,unit,L=[]):
"""calcを演算とするN項のSegment Treeを作成
N:要素数
calc:演算(2変数関数,モノイド)
unit:モノイドcalcの単位元 (xe=ex=xを満たすe)
"""
self.calc=calc
self.unit=unit
N=max(N,len(L))
d=max(1,(N-1).bit_length())
k=2**... |
s383564777 | p02567 | u960080897 | 1599521474 | Python | PyPy3 (7.3.0) | py | Runtime Error | 858 | 102204 | 2699 | # Date [ 2020-09-08 00:35:49 ]
# Problem [ j.py ]
# Author Koki_tkg
import sys
# import math
# import bisect
# import numpy as np
# from decimal import Decimal
# from numba import njit, i8, u1, b1 #JIT compiler
# from itertools import combinations, product
# from collections import Counter, deque, defaultdict
# sys.s... |
s008725579 | p02567 | u960080897 | 1599521049 | Python | Python (3.8.2) | py | Runtime Error | 5514 | 32924 | 2689 | # Date [ 2020-09-08 00:35:49 ]
# Problem [ j.py ]
# Author Koki_tkg
import sys
# import math
# import bisect
# import numpy as np
# from decimal import Decimal
# from numba import njit, i8, u1, b1 #JIT compiler
# from itertools import combinations, product
# from collections import Counter, deque, defaultdict
# sys.s... |
s470073760 | p02568 | u828706986 | 1600596773 | Python | PyPy3 (7.3.0) | py | Runtime Error | 120 | 69600 | 13804 | import types
_atcoder_code = """
# Python port of AtCoder Library.
__version__ = '0.0.1'
"""
atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)
_atcoder__bit_code = """
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def _bsf(n: int) -> int:
... |
s332506455 | p02568 | u216928054 | 1600433532 | Python | PyPy3 (7.3.0) | py | Runtime Error | 4471 | 263472 | 6480 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 998244353
def set_depth(depth):
global DEPTH, SEGTREE_SIZE, NONLEAF_SIZE
DEPTH = depth
SEGTREE_SIZE = 1 << DEPTH
NONLEAF_SIZE = 1 << (DEPTH - 1)
def set_width(width):
set_depth((w... |
s527418325 | p02568 | u034128150 | 1599674719 | Python | PyPy3 (7.3.0) | py | Runtime Error | 1740 | 143524 | 5772 | # お試しでassert文を入れてみました。速度面での比較用。
MOD = 998244353
mask32 = (1 << 32) - 1
class LazySegmentTree:
__slots__ = ["n", "data", "lazy", "me", "oe", "fmm", "fmo", "foo"]
def __init__(self, monoid_data, monoid_identity, operator_identity, func_monoid_monoid, func_monoid_operator, func_operator_operator):
self... |
s740175126 | p02568 | u368780724 | 1599630529 | Python | PyPy3 (7.3.0) | py | Runtime Error | 246 | 165152 | 4151 | import sys
readline = sys.stdin.readline
class Lazysegtree:
def __init__(self, A, fx, ex, fm, initialize = True):
#作用の単位元をNoneにしている
#fa(operator, idx)の形にしている、data[idx]の長さに依存する場合などのため
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.ex = ex
self.lazy = [None]*... |
s032702338 | p02568 | u368780724 | 1599630367 | Python | PyPy3 (7.3.0) | py | Runtime Error | 5590 | 3493868 | 4161 | import sys
readline = sys.stdin.readline
class Lazysegtree:
def __init__(self, A, fx, ex, fm, initialize = True):
#作用の単位元をNoneにしている
#fa(operator, idx)の形にしている、data[idx]の長さに依存する場合などのため
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.ex = ex
self.lazy = [None]*... |
s433243096 | p02569 | u467736898 | 1600458032 | Python | Python (3.8.2) | py | Runtime Error | 216 | 56900 | 21578 | # TODO: メモリリーク確認
# TODO: max_right とかが正しく動くか検証
# TODO: 更新ルールの異なる複数のセグ木を作ったときに正しく動くか検証
code_lazy_segtree = r"""
#define PY_SSIZE_T_CLEAN
#include <Python.h>
#include "structmember.h"
//#define ALLOW_MEMORY_LEAK // メモリリーク許容して高速化
// >>> AtCoder >>>
#ifndef ATCODER_LAZYSEGTREE_HPP
#define ATCODER_LAZYSEGTREE_HPP 1
#... |
s793531502 | p02569 | u467736898 | 1600341295 | Python | Python (3.8.2) | py | Runtime Error | 5530 | 691228 | 20270 | # TODO: メモリリーク確認
# TODO: max_right とかが正しく動くか検証
# TODO: 更新ルールの異なる複数のセグ木を作ったときに正しく動くか検証
code_lazy_segtree = r"""
#define PY_SSIZE_T_CLEAN
#include <Python.h>
#include "structmember.h"
//#define ALLOW_MEMORY_LEAK // メモリリーク許容して高速化
// >>> AtCoder >>>
#ifndef ATCODER_LAZYSEGTREE_HPP
#define ATCODER_LAZYSEGTREE_HPP 1
#... |
s556118001 | p02570 | u867616076 | 1600692056 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9120 | 108 | d = int(input())
t = int(input())
s = int(input())
if(d <= t*s):
print("Yes")
else:
print("No")
|
s800088310 | p02570 | u282376189 | 1600654975 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8932 | 160 | N = int(input())
A = list(map(int,input().split()))
mod = 1000000000 + 7
add = 0
for i in range(N):
tmp = sum(A[i+1:N])
add += tmp * A[i]
print(add%mod) |
s840285056 | p02570 | u196182810 | 1600648080 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9056 | 247 | def SumOfProduct(n, arrayA):
ans = 0
for i in range(0, len(arrayA)):
for j in range(i + 1, len(arrayA)):
ans += arrayA[i] * arrayA[j]
print(ans)
n = int(input())
arrayA = list(map(int, input().split()))
SumOfProduct(n, arrayA)
|
s671738164 | p02570 | u085186789 | 1600638395 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8996 | 84 | D,T,S = list(int,input().split())
if D <= T * S:
print("YES")
else:
print("NO")
|
s768858261 | p02570 | u085186789 | 1600638204 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8592 | 152 | D, T, S = list(map((int, input().split()))
if D <= T * S:
print("YES")
else:
print("NO") |
s196748862 | p02570 | u292746386 | 1600606065 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9044 | 99 | D, T, S = (int(d) for d in input().split())
if T * s >= D:
print("Yes")
else:
print("No") |
s480500786 | p02570 | u910358825 | 1600558686 | Python | Python (3.8.2) | py | Runtime Error | 114 | 26996 | 180 | import numpy
n=int(input())
l=list(map(int, input().split()))
res=0
l.append(0)
l.reverse()
cum=numpy.cumsum(l)
for i in range(n+1):
res+=l[n-i]*cum[n-i-1]
print(res%(10**9+7)) |
s177839448 | p02570 | u910358825 | 1600557760 | Python | Python (3.8.2) | py | Runtime Error | 111 | 27044 | 297 | import numpy
n=input()
l=list(map(int, input().split()))
res=0
#print(f"le{len(l)}")
l.append(0)
l.reverse()
for i in range(len(l)):
print(l[len(l)-1-i],numpy.cumsum(l)[len(l)-i-2])
res+=l[len(l)-1-i]*numpy.cumsum(l)[len(l)-i-2]
#print(f"{res}レス")
print(res%(10**9+7))
#print(res) |
s809105964 | p02570 | u678302457 | 1600555831 | Python | PyPy3 (7.3.0) | py | Runtime Error | 85 | 68196 | 55 | D, T, S = map(int, input.split(' '))
print(D / S <= T) |
s248625020 | p02570 | u910358825 | 1600554660 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8928 | 191 | n=input()
l=list(map(int, input().split()))
res=0
#print(f"le{len(l)}")
for i in range(len(l)):
for j in range(i+1,len(l)):
res+=l[i]*l[j]
#print(res)
print(res%(10**9+7)) |
s414064284 | p02570 | u910358825 | 1600551926 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8948 | 77 | d,t,s=map(int, input().split())
if d/s<=t:
print("Yes")
elif:
print("No") |
s294176584 | p02570 | u090046582 | 1600537745 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8908 | 118 | D = int(input())
T = int(input())
S = int(input())
time=D/S
if time <= T:
print("yes")
else:
print("no")
|
s532191845 | p02570 | u267933821 | 1600511035 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9108 | 121 | D=int(input())
T=int(input())
S=int(input())
limit_speed=D/T+D%T
if(limit_speed<=S):
print("Yes")
else:
print("No")
|
s290674593 | p02570 | u636582303 | 1600508758 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9140 | 95 | d, t, s = list(map(int, input()))
min = d / s
if min <= t:
print("Yes")
else:
print("No") |
s452686322 | p02570 | u135642682 | 1600470905 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9120 | 89 | d, t, s = input().split()
if int(s) * int(t) >= d:
print("Yes")
else:
print("No") |
s169123188 | p02570 | u507444571 | 1600458488 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8920 | 83 | d,t,s=list(int,input().split())
if d/t<=s:
print("yes")
else:
print("No")
|
s884391256 | p02570 | u507444571 | 1600458378 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9128 | 100 | d=int(input())
t=int(input())
s=int(input())
if d/t<=s:
print("yes")
else:
print("No") |
s841384621 | p02570 | u828545616 | 1600454734 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9048 | 170 | d = input()
t = input()
s = input()
#print (d +' ' + t +' ' + s )
t = int(t) * 60
if int(d) / int(t) == s or int(d) / int(t) < s:
print('yes')
else:
print('no') |
s520936780 | p02570 | u848097937 | 1600453580 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9032 | 100 | D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
print("Yes")
else:
print("No") |
s088077714 | p02570 | u048826171 | 1600394978 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9168 | 100 | d = int(input())
t = int(input())
s = int(input())
if (t*s >= d):
print("Yes")
else:
print("No") |
s134822461 | p02570 | u048826171 | 1600394858 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9116 | 98 | d = int(input())
t = int(input())
s = int(input())
if t*s >= d:
print("Yes")
else:
print("No") |
s942225864 | p02570 | u273914730 | 1600377840 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9120 | 91 | D=int(input())
T=int(input())
S=int(input())
if T*S>=D:
print('Yes')
else:
print('No') |
s162801615 | p02570 | u273914730 | 1600377738 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9052 | 73 | input(D)
input(T)
input(S)
if T*S>=D:
print('Yes')
else:
print('No') |
s341070923 | p02570 | u034316276 | 1600374709 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8984 | 127 | a = [input() for i in range(3)]
D = int(a[0])
T = int(a[1])
S = int(a[2])
if T*S <= D:
print("Yes")
if T*S > D:
print("No") |
s801757360 | p02570 | u537208079 | 1600374708 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9100 | 84 | a,b,c = map(int, input())
if a <= b*c :
print('Yes')
elif a > b*c :
print('No') |
s151826556 | p02570 | u919274345 | 1600374614 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9092 | 77 | D, T, S = map(int, input())
if D <= T * S:
print('Yes')
else:
print('No') |
s415806429 | p02570 | u034316276 | 1600374614 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9064 | 127 | a = [input() for i in range(3)]
D = int(a[0])
T = int(a[1])
S = int(a[2])
if T*S <= S:
print("Yes")
if T*S > S:
print("No") |
s615596353 | p02570 | u919274345 | 1600374538 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9072 | 79 | D, T, S = map(int, input())
if D >= T * S:
print(Yes)
else:
print(No)
|
s980143642 | p02570 | u440649533 | 1600373068 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8800 | 347 | #include<stdio.h>
int main(void){
int d, s, t;
scanf("%d",&d);
scanf("%d",&s);
scanf("%d",&t);
if(d/s<=t){
printf("Yes");
}
else if(d/s>=t){
printf("No");
}
return 0;
}
/*
d=input(int(''))
t=input(int(''))
s=input(int(''))
if d*s<=t:
print("Yes")
elif d*s... |
s324331112 | p02570 | u537208079 | 1600372710 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9120 | 96 | a = input()
a = [int(a)]
b = a[1]*a[2]
if b >= a[0]:
print('Yes')
elif b < a[0]:
print('No') |
s967159062 | p02570 | u537208079 | 1600372518 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9008 | 90 | a = int([input()])
b = a[1]*a[2]
if b >= a[0]:
print('Yes')
elif b < a[0]:
print('No') |
s698858862 | p02570 | u440649533 | 1600372467 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9092 | 108 | d=input(int(''))
t=input(int(''))
s=input(int(''))
if d*s<=t:
print("Yes")
elif d*s>=t:
print("No") |
s598528555 | p02570 | u034316276 | 1600372465 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9104 | 104 | D = int(input())
T = int(input())
S = int(input())
if D*S <= T:
print("Yes")
if D*S > T:
print("No") |
s848965515 | p02570 | u440649533 | 1600372405 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9008 | 103 |
d=input(int())
t=input(int())
s=input(int())
if d*s<=t:
print("Yes")
elif d*s>=t:
print("No") |
s135769627 | p02570 | u440649533 | 1600372393 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8908 | 97 | int d,t,s
d=input()
t=input()
s=input()
if d*s<=t:
print("Yes")
elif d*s>=t:
print("No") |
s538560634 | p02570 | u537208079 | 1600372146 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9044 | 88 | a = int[input()]
b = a[1]*a[2]
if b >= a[0]:
print('Yes')
elif b < a[0]:
print('No') |
s845853081 | p02570 | u034316276 | 1600372127 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8956 | 156 | D = int(input())
T = int(input())
S = int(input())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
if D*S <= T:
print("Yes")
if D*S > T:
print("No") |
s306781058 | p02570 | u801939897 | 1600372046 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 88 | input('{} {} {}'.format(a,b,c))
if int(a/c)<=int(b):
print('Yes')
else:
print('No') |
s065623838 | p02570 | u537208079 | 1600372027 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9024 | 85 | a = [input()]
b = a[1]*a[2]
if b >= a[0]:
print('Yes')
elif b < a[0]:
print('No') |
s106877768 | p02570 | u440649533 | 1600372022 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9084 | 87 | d=input()
t=input()
s=input()
if d*s<=t:
print("Yes")
elif d*s>=t:
print("No") |
s080652579 | p02570 | u440649533 | 1600371966 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9016 | 87 | d=input()
t=input()
s=input()
if d*s<=t:
print("Yes")
elif d*s>=t:
print("No") |
s388431403 | p02570 | u801939897 | 1600371835 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8988 | 86 | x=input('{} {} {}'.format(a,b,c))
if int(a/c)<=b:
print('Yes')
else:
print('No')
|
s718094238 | p02570 | u687145102 | 1600371586 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8972 | 117 | D = input()
T = input()
S = input()
1<=D<=10000
1<=T<=10000
1<=S<=10000
if D<=T*S:
print('Yes')
else:
print('No') |
s039461408 | p02570 | u617322197 | 1600371543 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8960 | 120 | d = input()
D = int("d")
t = input()
T = int("t")
s = input()
S = int("s")
if T*S>=D:
print("Yes")
else:
print("No") |
s305313749 | p02570 | u617322197 | 1600371440 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8984 | 84 | d = input()
t = input()
s = input()
if t*s>=d:
print("Yes")
else:
print("No")
|
s627618737 | p02570 | u687145102 | 1600371416 | Python | Python (3.8.2) | py | Runtime Error | 31 | 8920 | 131 | D = input()
T = input()
S = input()
1 <= D <= 10000
1 <= T <= 10000
1 <= S <= 10000
if D <= T*S:
print('Yes')
else:
print('No') |
s417175494 | p02570 | u617322197 | 1600371218 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9128 | 100 | d = int(input())
t = int(input())
s = int(input())
if t * s >= d:
print('Yes')
else:
print('No') |
s461360587 | p02570 | u742260762 | 1600362472 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9060 | 100 | D = int(input())
T = int(input())
S = int(input())
if D <= T*S:
print("Yes")
else:
print("No")
|
s862316282 | p02570 | u742260762 | 1600362239 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9076 | 99 | D = int(input())
T = int(input())
S = int(input())
if D/S <= T:
print("Yes")
else:
print("No") |
s364721434 | p02570 | u874092557 | 1600345025 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9020 | 243 | S = input()
T = input()
res = len(T)
for i in range(len(S)) :
for j in range(i,len(S)) :
if (S[i:j] in T) and (i>=T.index(S[i:j])) :
diff = len(T) - len(S[i:j])
if res>=diff :
res = diff
print(res) |
s244239220 | p02570 | u874092557 | 1600343850 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9080 | 284 | S = input()
T = input()
min = 100000
for i in range(len(S)) :
for j in range(len(S),i-1,-1) :
if (S[i:j] in T) :
if (min > len(T) - len(S[i:j])) and (i >= T.index(S[i:j]) and j<=len(T)-T.index(S[i:j]) ) :
min = len(T) - len(S[i:j])
print(min) |
s408234183 | p02570 | u712082626 | 1600281424 | Python | PyPy3 (7.3.0) | py | Runtime Error | 103 | 74712 | 141 | n = int(input())
a = list(map(int, input().split()))
result= 0
for j in range(0,n):
result += a[j]*sum(a[j+1:n])
print(result%(10**9+7)) |
s508408214 | p02570 | u556477263 | 1600260838 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8960 | 95 | d, t, s = map(int, input().split())
if d > t * s:
print('no')
if d <= t * s:
print('yes') |
s374610769 | p02570 | u510582860 | 1600204427 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8920 | 396 | N,M=map(int,input().split())
V=[]
for _ in range(M):
a,b=map(int,input().split())
f=True
for t in V:
if a in t and b not in t:
f=False
t.append(a)
break
if a in t and b not in t:
f=False
t.append(b)
break
if f:
... |
s071529052 | p02570 | u430395207 | 1600201675 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8836 | 95 | [D T S] = [int(i) for i in input().split()]
if D <= T * S:
print("yes")
else:
print("no")
|
s013640609 | p02570 | u466916194 | 1600177753 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9080 | 116 | d=input()
arr = [int(d) for i in d.split()]
t1 = arr[0]/arr[-1]
if t1<= arr[1]:
print("Yes")
else:
print("No")
|
s519303442 | p02570 | u466916194 | 1600177600 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9168 | 100 | d,t,s =int(input()),int(input()),int(input())
t1 = d/s
if t1<= t:
print("Yes")
else:
print("No") |
s220876682 | p02570 | u466916194 | 1600177522 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9056 | 98 | d,t,s =int(input()),(input()),int(input())
t1 = d/s
if t1<= t:
print("Yes")
else:
print("No")
|
s442904087 | p02570 | u637387397 | 1600168924 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9088 | 85 | d,t,s = input().split(" ")
if d <= int(t)*int(s):
print("Yes")
else:
print("No") |
s002535727 | p02570 | u956318161 | 1600120384 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9028 | 67 | d,t,s=int(input())
if S*t >= d:
print("Yes")
else:
print("No")
|
s705144443 | p02570 | u770293614 | 1600083520 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8912 | 142 | N=input()
A=map(int,input().split(' '))
summed=0
for i in range(0,N):
for j in range(i+1,N):
sumed+=A[i]*A[j]
MOD=10**9+7
print(sumed%MOD)
|
s593634346 | p02570 | u692657167 | 1600081633 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 74720 | 779 | def get_primes(n):
max_p = int(n ** 0.5)
p = 0 # 素数
pl = [] # 素数リスト
el = [i for i in range(2, n + 1)] # 探索リスト
while p <= max_p:
nxt = []
p = el[0]
pl.append(p)
for e in el:
if e % p == 0:
# D[e] = p
pass
else:
... |
s463486597 | p02570 | u900535595 | 1600077938 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9024 | 105 | n = list(map(int,input().split(" "))
if (n[0]/n[2])<n[1]:
print('YES')
else:
print('NO) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.