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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s199041027 | p03773 | u638745327 | 1579033659 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | A,B = int(input()).split()
print((A+B)%24) |
s961631960 | p03773 | u638745327 | 1579033515 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | A = int(input())
B = int(input())
print((A+B)%24) |
s891531983 | p03773 | u696444274 | 1578354883 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 122 | x, y= list(map(int, input().split()))
#a,b,c = list(input().split())
if x+y < 24:
print(x+y)
else:
print(x+y-24) |
s348565716 | p03773 | u185037583 | 1577886957 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 60 | a,b=input().split()
sum=a+b
print(sum if sum<24 else sum-24) |
s175993746 | p03773 | u148551245 | 1577869401 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1328 | fn main() {
let a: i32 = read();
let b: i32 = read();
let ans = (a+b) % 24;
println!("{}", ans);
}
// 以下関数
use std::io::*;
use std::str::FromStr;
pub fn read<T: FromStr>() -> T {
let stdin = stdin();
let stdin = stdin.lock();
let token: String = stdin
.bytes()
.map(|c| c.expect("failed to read char") as char)
.skip_while(|c| c.is_whitespace())
.take_while(|c| !c.is_whitespace())
.collect();
token.parse().ok().expect("failed to parse token")
}
pub const MOD: u64 = 10e9 as u64 + 7;
pub fn is_prime(n: i32) -> bool {
if n < 2 {
return false;
} else if n == 2 {
return true;
}
let mut i = 2;
while i * i < n {
if n % i == 0 {
return false;
} else {
i += 1;
continue;
}
}
true
}
pub fn lcm(mut n: i32, mut m: i32) -> i32 {
n = if n > m { m } else { n };
m = if n > m { n } else { m };
let mut i = n;
while i % m != 0 {
i += n;
}
i
}
pub fn abs(n: i32) -> i32 {
if n >= 0 {
n
} else {
-n
}
}
pub fn max(n: i32, m: i32) -> i32 {
if n >= m {
n
} else {
m
}
}
pub fn min(n: i32, m: i32) -> i32 {
if n <= m {
n
} else {
m
}
} |
s894895509 | p03773 | u503283842 | 1576881655 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 799 | def ncr(x,y):
ans=1
q=x-y
while x>y:
ans*=x
x=x-1
while q>1:
ans=ans/q
q=q-1
return ans
x=input().split()
n=int(x[0])
a=int(x[1])
b=int(x[2])
v=[0]*n
x = input().split()
ind=0
M={1:0}
M2={1:0}
for i in x:
v[ind]=int(i)
if int(i) in M:
M[v[ind]]+=1
else:
M[v[ind]]=1
ind+=1
v.sort(reverse=True)
cnt=0
ind=0
m=0
while cnt<a:
cnt+=1
m=((cnt-1)*m+v[ind])/cnt
if v[ind] in M2:
M2[v[ind]]+=1
else:
M2[v[ind]]=1
ind+=1
while cnt<b:
if (cnt*m+v[ind])/(cnt+1)<m-0.5:
break
else:
cnt+=1;
if v[ind] in M2:
M2[v[ind]]+=1
else:
M2[v[ind]]=1
ind+=1
print(m)
maxw=cnt;
ways=0;
for i in range(cnt,a-1,-1):
if v[ind-1] not in M2:
M2[v[ind]]=0
if v[ind-1] not in M:
M[v[ind-1]]=0
ways+=ncr(M[v[ind-1]],M2[v[ind-1]])
M2[v[ind-1]]-=1
print(int(ways))
|
s642542307 | p03773 | u112567325 | 1576869145 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 77 | a,b = list(map(int,input().split()))
print(a+b) if 24 > a+b else prin(a+b-24) |
s709456386 | p03773 | u504165508 | 1576720355 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 60 | a,b=input()
a=a+b
if a-24>=0:
print(a-24)
else:
print(a) |
s084115174 | p03773 | u007263493 | 1575119356 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 93 | a,b = map(int,input().split())
if a + b < 24:
print(a + b)
else:
print(a + b -24) |
s272778105 | p03773 | u383828019 | 1575074199 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 250 | import math
n = int(input())
i = int(math.sqrt(n))
prime = False
x = 2
while x<=i:
if n%x==0:
prime = True
break
x+=1
if prime==True:
print(len(str(n)))
else:
while i<=n:
if n%i==0:
print(len(str(i)))
break
i+=1 |
s859210470 | p03773 | u383828019 | 1575071660 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 409 | nm = [int(x) for x in input().split()]
n = nm[0]
m = nm[1]
students = []
checkpoints = []
distances = []
for i in range(n):
students.append([int(x) for x in input().split()])
for i in range(m):
checkpoints.append([int(x) for x in input().split()])
for i in students:
for j in checkpoints:
distances.append(abs(j[0]-i[0])+abs(j[1]-i[1]))
print(distances.index(min(distances))+1)
distances = [] |
s770164691 | p03773 | u712768978 | 1575070429 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | print((int(input())+int(input()))%24) |
s663868542 | p03773 | u609814378 | 1574735564 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 160 | A,B = map(int, input().split())
if A < B:
print(A+B)
elif A == 0 and B == 0:
print(0)
elif A != 0 and B==0:
print(0)
elif A > B:
print((A+B-24) |
s499984706 | p03773 | u088974156 | 1574648597 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | a,b=map(int,input().split())
print(sum(a+b)%24) |
s543135288 | p03773 | u840310460 | 1573772070 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 267 | N = int(input())
a = []
b = []
for i in range(1, N//2):
if N % i ==0:
a.append(i)
b.append(N/i)
aa = list(map(str, a))
bb = list(map(str, b))
ans = []
for i in range(len(aa)):
ans.append(max(len(aa[i]), len(bb[i])))
print(min(ans)) |
s148538729 | p03773 | u923659712 | 1573753818 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 44 | a.b=map(int,input().split())
print((a+b)%24) |
s773265932 | p03773 | u923659712 | 1572906102 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 301 | n,a,b=map(int,input().split())
v=list(map(int,input().split()))
v.sort()
v.reverse()
ave=0
for i in range(a):
ave+=v[i]
print(ave/a)
l=0
for j in range(a,b):
if v[a-1]==v[j]:
l+=1
p=v.count(v[a-1])
from math import factorial
a=factorial(p) / factorial(p-l) / factorial(l)
print(a)
|
s689454153 | p03773 | u677400065 | 1571161756 | Python | Python (3.4.3) | py | Runtime Error | 22 | 2940 | 79 | a,b = map(int, input(),split())
if a+b > 23:
print(24-a+b)
else:
print(a+b) |
s142805859 | p03773 | u448655578 | 1570162083 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | A,B = map(int, input().split())
print(sum(A,B)%24) |
s366042805 | p03773 | u223904637 | 1569544597 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 71 | a,b=map(int,input())
if a+b>=24:
print(a+b-24)
else:
print(a+b) |
s403159489 | p03773 | u089376182 | 1569539154 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | print((int(input())+int(input()))%24) |
s990017903 | p03773 | u661980786 | 1569116458 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 39 | a,b = map(int,input())
print((a+b)//24) |
s270739387 | p03773 | u871841829 | 1569038376 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 6 | A
B
|
s853510837 | p03773 | u297801580 | 1568440494 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38512 | 40 | A,B=int(input().split())
print((A+B)%24) |
s693015024 | p03773 | u297801580 | 1568440423 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38512 | 32 | A,B=int(input())
print((A+B)%24) |
s708974857 | p03773 | u597455618 | 1568260605 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 149 | n = int(input())
ans = len(str(n))
for i in range(1, int(n**(1/2))+1):
if n%i == 0:
ans = min(ans, max(len(str(i)), len(str(n//i))))
print(ans) |
s024511473 | p03773 | u396391104 | 1567616339 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 34 | a,b = int(input())
print((a+b)%24) |
s644934899 | p03773 | u518987899 | 1566534052 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | A,B = map(int, input().strip())
print((A+B)%24) |
s058863408 | p03773 | u703890795 | 1566459340 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | A B = map(int, input().split())
print((A+B)%24)
|
s092626980 | p03773 | u703890795 | 1566459071 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | A B = map(int, input().split())
print((A+B)%24) |
s253515597 | p03773 | u740047492 | 1566335798 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 91 | A. B = map(int, input().split())
if A + B >= 24:
print((A + B) - 24)
else:
print(A + B) |
s050756683 | p03773 | u318165580 | 1566164788 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | a,b=map(int,input().split())
if a+b<24:
print(a+b)
else:
print((a+b)%24) |
s977989525 | p03773 | u729535891 | 1565824687 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | A, B = map(int, input())
print((A + B) % 24) |
s401963861 | p03773 | u598229387 | 1565819274 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 39 | a,b = map(int, input())
print((a+b)%24) |
s440477396 | p03773 | u558764629 | 1565487479 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 39 | A,B = map(int,input())
print((A+B)%24) |
s191053638 | p03773 | u740767776 | 1565087917 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 82 | A, B = int(input().split())
if A + B > 24:
print(A + B -24)
else:
print(A + B) |
s016225519 | p03773 | u904804404 | 1564873585 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 64 | print((lambda a,b : (a+b)//24)(list(map(int,input().split())) )) |
s220296756 | p03773 | u333190709 | 1563572222 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 53 | A, B = map(int. input().split())
print((A + B) % 24) |
s156915836 | p03773 | u243699903 | 1562328217 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | a,m=map(int,input().split())
print((a+b)%24) |
s014339898 | p03773 | u296150111 | 1560874840 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 | a,b=mp(int,input().split())
if a+b>24:
print(a+b-24)
else:
print(a+b) |
s328315699 | p03773 | u204236873 | 1560572362 | Python | Python (3.4.3) | py | Runtime Error | 151 | 12408 | 1413 | from sys import stdin
import operator as op
import numpy
import math
def combination_table(N):
C = []
for i in range(N+1):
C.append([0] * (N+1))
for i in range(N+1):
for j in range(i+1):
if (j==0 or j==i):
C[i][j] = 1
else:
C[i][j] = C[i-1][j-1]+C[i-1][j]
return C
if __name__ == "__main__":
N, A, B = stdin.readline().split(" ")
N = int(N)
A = int(A)
B = int(B)
V = []
line = stdin.readline().split(" ")
unique_elements = dict()
for e in line:
V.append(int(e))
if not int(e) in unique_elements:
unique_elements[int(e)] = 1
else:
unique_elements[int(e)] += 1
V.sort(reverse=True)
C = combination_table(N)
# find optimal selections between A and B
optimal = [A]
highest_avg = -1
for i in range(A, B+1):
avg = float(sum(V[:i])) / float(i)
if (avg > highest_avg):
highest_avg = avg
optimal = [i] # reset the list
elif (avg == highest_avg):
if not i in optimal:
optimal.append(i)
total = 1
for e in optimal:
# unique elements and count in for optimal value
op_elemements = dict()
for i in range(e):
if V[i] in op_elemements:
op_elemements[V[i]] += 1
else:
op_elemements[V[i]] = 1
# find the sum
for key, value in op_elemements.items():
# print (unique_elements[key], value, C[unique_elements[key]][value])
total = total * C[unique_elements[key]][value]
print ("{:6f}".format(highest_avg))
print (int(total))
|
s215895087 | p03773 | u371409687 | 1560274671 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | a,b=map(int,input().split())
if a+b < 24:
print(a+b)
else : print(24-a-b) |
s498780135 | p03773 | u785989355 | 1559464596 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 624 | N,A,B = list(map(int,input().split()))
v = list(map(int,input().split()))
v.sort()
v=v[::-1]
a=v[A-1]
is_first = True
end=-1
for i in range(N):
if v[i]==a:
if is_first:
first=i
is_first=False
else:
if not is_first:
end=i
break
def comb(n,k):
a = 1
b = 1
for i in range(min(n-k,k)):
a*=n-i
b*=i+1
return a//b
#print(comb(3,1))
if end==-1:
end=N
if first==0 and end>=B:
print(a)
print(sum([comb(end,i) for i in range(A,min(B+1,end+1))]))
else:
print(sum(v[:A])/A)
print(comb(end-first,A-first)) |
s579307270 | p03773 | u399721252 | 1559327752 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | print((int(input())+int(input()))%24) |
s633691900 | p03773 | u377036395 | 1557586311 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 95 | a,b = map(int, input().split())
ans = a + b
if ans < 24:
print(s)
else:
print(s - 24) |
s841794164 | p03773 | u377036395 | 1557585995 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | a,b = int(input().split())
ans = a + b
if ans > 24:
print(ans - 24)
else:
print(ans) |
s954000881 | p03773 | u221345507 | 1556661487 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 389 | N = int(input())
ans = 10**10 #適当に初期化
ans_ = 10**10
divisors = []
for i in range(1, int(N**0.5)+1):
if N % i == 0:
divisors.append(i)
if i != N // i:
divisors.append(N//i)
if len(str(N//i))<=ans:
ans =N//i
ans_=i
if N ==1:
ans =1
print(max(len(str(ans)),len(str(ans_)))) |
s241833092 | p03773 | u102461423 | 1556567379 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | a,b = map(int,input())
ans = (a+b)%24
print(ans) |
s062078094 | p03773 | u475675023 | 1556328372 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 44 | a,b=map(int,inpuy().split())
print((a+b)%24) |
s083163526 | p03773 | u475675023 | 1556328276 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | print((int(input())+int(input()))%24) |
s084302163 | p03773 | u025136560 | 1554615298 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2692 | 618 | def prime_factors(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
N = int(input())
prime_list = prime_factors(N)
X = 0
Y = 0
if len(prime_list) <= 2:
prime_list.append(1)
if prime_list and len(prime_list) >= 2:
X = prime_list.pop(-1)
Y = prime_list.pop(-1)
for L in reversed(prime_list):
if X <= Y:
X = X*L
else:
Y = Y*L
if X >= Y:
print(len(str(X)))
else:
print(len(str(Y))) |
s300611893 | p03773 | u121732701 | 1554506684 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 86 | a, b = map(int, input().split())
if A+B>=24:
print(A+B-24)
else:
print(A+B)
|
s567528935 | p03773 | u121732701 | 1554503591 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 |
a, b = map(int, input().split())
if A+B=>24:
print(A+B-24)
else:
print(A+B) |
s658713241 | p03773 | u305965165 | 1553259938 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 102 | a, b = (int(i) for i in input().split())
res = a+b
if res > 23
print(res-24)
else:
print(res) |
s516786371 | p03773 | u074445770 | 1552438221 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 82 | a,b=map(int,input().split())
if (a+b≧24):
print(a+b-24)
else:
print(a+b) |
s151398230 | p03773 | u074445770 | 1552438134 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 80 | a,b=map(int,input().split())
if a+b≧24:
print(a+b-24)
else:
print(a+b) |
s967881312 | p03773 | u367130284 | 1551803397 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38256 | 144 | import math
n=int(input())
l=[]
for i in range(1,int(math.sqrt(n))+2):
if n%i==0:
l+=[max(len(str(i)),len(str(n//i)))]
print(min(l)) |
s102182054 | p03773 | u166696759 | 1550809072 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | a, b = map(int, input().split())
print((a+b) % 24 ) |
s299756443 | p03773 | u367130284 | 1550384256 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 47 | a,b=map(int,input().split());print(sum(a,b)%24) |
s965575387 | p03773 | u518064858 | 1550269106 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 80 | a,b=map(int,input().split())
if a+b>=24:
print(a+b-24):
else:
print(a+b) |
s542901035 | p03773 | u960513073 | 1549600977 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 53 | a,b = list(map(int, input().split()))
print(mod(a+b)) |
s717091651 | p03773 | u371467115 | 1544860322 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 45 | A,B=map(int,input().split())
print(eval(A+B)) |
s771591424 | p03773 | u828847847 | 1542996387 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 2099 | #include "bits/stdc++.h"
using namespace std;
/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define sec second
#define fir first
#define pb push_back
/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;
/* constant */
//const int inf = pow(2, 62);
//const int mod = 1e9 + 7;
const int mod = 100000;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};
/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}
/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
/* main */
int ceil(int a, int b){
if(a % b == 0) return a /b;
else return a /b + 1;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a, b; cin >> a >> b;
print((a + b) % 24);
}
|
s644090292 | p03773 | u131405882 | 1541586780 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 255 | import math
N=int(input())
if N==1:
print(1)
else:
nmax = math.ceil(math.sqrt(N))
Bdigimin = 10
for i in range(nmax):
if N % (i+1) == 0:
Bdigi = math.floor(math.log10(N/(i+1)))
if Bdigimin > Bdigi:
Bdigimin = Bdigi
print(int(Bdigimin+1))
|
s267065796 | p03773 | u131405882 | 1541583290 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3316 | 217 | import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
if N % i == 0:
Bdigi = math.floor(math.log10(N/i))
if Bdigimin > Bdigi:
Bdigimin = Bdigi
print(int(Bdigimin+1))
|
s010092095 | p03773 | u131405882 | 1541583219 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 217 | import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
if N % i == 0:
Bdigi = math.floor(math.log10(N/i))
if Bdigimin > Bdigi:
Bdigimin = Bdigi
print(int(Bdigimin+1))
|
s868894673 | p03773 | u131405882 | 1541583110 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 217 | import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
if N % i == 0:
Bdigi = math.floor(math.log10(N/i))
if Bdigimin > Bdigi:
Bdigimin = Bdigi
print(int(Bdigimin+1))
|
s493259176 | p03773 | u131405882 | 1541582940 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 217 | import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
if N % i == 0:
Bdigi = math.floor(math.log10(N/i))
if Bdigimin > Bdigi:
Bdigimin = Bdigi
print(int(Bdigimin+1))
|
s968909513 | p03773 | u131405882 | 1541582508 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 216 | import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimax = 1
for i in range(1,nmax):
if N % i == 0:
Bdigi = math.floor(math.log10(N/i))
if Bdigimax < Bdigi:
Bdigimax = Bdigi
print(int(Bdigimax))
|
s281181905 | p03773 | u330039499 | 1541131300 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2692 | 55 | A, B = map(int, raw_input().split()
print (A + B) % 24
|
s669413917 | p03773 | u330039499 | 1541131270 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 55 | A, B = map(int, raw_input().split()
print (A + B) % 23
|
s632941258 | p03773 | u030879708 | 1540782185 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 380 | import math
N,A,B=map(int,input().split())
v=list(map(int,input().split()))
a=v.sort()[-A:]
print(sum(a)/A)
b=v.count(a[0])
c=a.count(a[0])
if c!=A:
print(math.factorial(b)//(math.factorial(c)*math.factorial(b-c)))
else:
l=[]
i=min([b-c,B-A])
for k in range(0,i+1):
l.append(math.factorial(b)//(math.factorial(c+k)*math.factorial(b-c-k)))
print(sum(l)) |
s022608508 | p03773 | u853900545 | 1539880144 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | a,b = map(int,input().splilt())
print((a+b)//24) |
s962089630 | p03773 | u484856305 | 1538849423 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | a,b=map(int,input().split())
print(a+b%24) |
s114676396 | p03773 | u427344224 | 1538246144 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 487 | N, M = map(int, input().split())
ab_list = []
cd_list = []
for i in range(N):
ab = list(map(int, input().split()))
ab_list.append(ab)
for i in range(M):
cd = list(map(int, input().split()))
cd_list.append(cd)
for a, b in ab_list:
num = -1
min_num = 10 ** 10 + 1
count = 0
for c, d in cd_list:
count += 1
distance = abs(a-c) + abs(b-d)
if distance < min_num:
min_num = distance
num = count
print(num) |
s171598619 | p03773 | u138486156 | 1537969761 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 40 | a, b = map(int, input())
print((a+b)%24) |
s007009987 | p03773 | u484460274 | 1537842305 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 414 | #include <iostream>
#include <math.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
using namespace std;
int main(){
int A,B;
cin>>A>>B;
cout<<(A+B)%24<<endl;
return 0;
}
|
s638497479 | p03773 | u394482932 | 1535992438 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | print(eval(int,input().replace(" ","+"))%24) |
s136980316 | p03773 | u005260772 | 1534975797 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 49 | print (int(raw_input()) + int(raw_input())) % 24
|
s027419867 | p03773 | u005260772 | 1534975755 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 47 | print (int(raw_input()) + int(raw_input()) % 24 |
s566245769 | p03773 | u366644013 | 1534340326 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | a, b = map(input().split())
print((a+b)%24) |
s029412259 | p03773 | u214617707 | 1533390336 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | a, b = map(int, inpput().split())
print((a + b) % 24)
|
s958746978 | p03773 | u214617707 | 1533390304 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 52 | a, b = map(it, inpput().split())
print((a + b) % 24) |
s681054597 | p03773 | u384679440 | 1532912869 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 176 | import math
N = int(input())
ans = len(str(N))
for A in range(1, int(math.sqrt(N)) + 1):
if N % A == 0:
B = N // A
ans = min(ans, max(len(str(A)), len(str(B))))
print(ans) |
s849180777 | p03773 | u415905784 | 1531706498 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | A, B = map(int, input().split())
return((A + B) % 24) |
s974667622 | p03773 | u986269893 | 1530212572 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | num=input().split(" ")
a=num[0]
b=num[1]
if a+b>=24:
print(a+b-24)
else:
print(a+b) |
s019624125 | p03773 | u026788530 | 1528386347 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 544 | import math
N = int(input())
n = int(math.sqrt(N))+1
#print(n)
def digit(x):
if 100<= x <1000:
return 3
elif 1000 <= x < 10000:
return 4
elif 10000 <= x < 100000:
return 5
elif 100000 <= x < 1000000:
return 6
elif 1000000 <= x < 10000000:
return 7
elif 10000000 <= x < 100000000:
return 8
elif 100000000 <= x < 10000000000:
return 9
else:
return 10
while True:
if(N % n == 0):
k = N / n
print(digit(k))
break
n-=1
|
s381907532 | p03773 | u857259336 | 1528367452 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 738 | // header {{{
#include <bits/stdc++.h>
using namespace std;
// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(int i=(l);i<(r);i++)
#define dec(i, l, r) for(int i=(r)-1;i>=(l);i--)
#define pb push_back
#define se second
#define fi first
#define mset(a, b) memset(a, b, sizeof(a))
using LL = long long;
using G = vector<vector<int>>;
int di[] = {0, -1, 0, 1};
int dj[] = {1, 0, -1, 0};
// }}}
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int a, b;cin >> a >> b;
cout << (a+b)%24 << endl;
return 0;
}
|
s216268045 | p03773 | u528388170 | 1528329076 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | A = int(input())
B = int(input())
print((A+B)%24) |
s839715071 | p03773 | u864565901 | 1528174445 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | print((int(input())+int(input()))%24) |
s090733136 | p03773 | u409064224 | 1526500440 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | a = list(map(int,input()split()))
b = a[0] + a[1]
if b > 24:
b -= 24
print(b) |
s931080768 | p03773 | u499259667 | 1524259464 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 23 | (t if t < 24 else t-24) |
s038547428 | p03773 | u866107333 | 1522076978 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | a,b = map(int, raw_input().split())
print a+b
|
s260069438 | p03773 | u866107333 | 1522076886 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | S = map(int, raw_input().split())
print S[0] + S[1]
|
s680444898 | p03773 | u866107333 | 1522076786 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 51 | S = map(int,raw_input().split( ))
print S[0] + S[1] |
s103569127 | p03773 | u866107333 | 1522076749 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 42 | S = raw_input().split( )
print S[0] + S[1] |
s904812150 | p03773 | u439176910 | 1520976300 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 308 | import math
N = int(input().rstrip())
def f(a,b):
a = str(a)
b = str(b)
return len(a) if len(a) > len(b) else len(b)
n = int(math.sqrt(N))
ans = len(str(N))
for a in range(1,n+1):
if N % a == 0:
b = N // a
res = f(a,b)
if res < ans:
ans = res
print(ans) |
s882986235 | p03773 | u748135969 | 1518986332 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | a, b = int(map, input().split())
h = a + b
if h < 24:
print(h)
else:
print(24 - h) |
s979161677 | p03773 | u019584841 | 1518907870 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | a,b=map(int,input().split())
if a+b<24:
print(a+b)
else:
print(a+b-24 |
s700889294 | p03773 | u854627522 | 1514245791 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | import sys
a, b = sys.stdin.readline().split()
print((a+b)%24) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.