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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s216354850 | p03774 | u027622859 | 1522347922 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 430 | N, M = map(int, input().split())
ab = [input().split() for a in range(M)]
cd = [input().split() for a in range(M)]
for y in range(M):
min_p = 999
point = 1
for x in range(M):
distance = abs(int(ab[y][0]) - int(cd[x][0])) + abs(int(ab[y][1]) - int(cd[x][1]))
if min_p == distance:
continue
elif min_p > distance:
min_p = distance
point += 1
print(point) |
s708144518 | p03774 | u027622859 | 1522347689 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 419 | N, M = map(int, input().split())
ab = [input().split() for a in range(M)]
cd = [input().split() for a in range(M)]
for y in range(M):
min_p = 999
for x in range(M):
distance = abs(int(ab[y][0]) - int(cd[x][0])) + abs(int(ab[y][1]) - int(cd[x][1]))
if min_p == distance:
continue
elif min_p > distance:
min_p = distance
point = x + 1
print(point) |
s855177771 | p03774 | u853586331 | 1499710154 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3188 | 397 | import math;
N,M=map(int,input().split(" "));
ab=[];
for i in range(0,N):
ab.append(input().split(" "));
cd=[];
for i in range(0,M):
cd.append(input().split(" "));
for j in range(0, N):
dist=9999999999999
nearm=0;
for j in range(0, M):
dist2 = math.fabs(int(ab[i][0]) - int(cd[j][0])) + math.fabs(int(ab[i][1]) - int(cd[j][1]));
if dist2 < dist:
dist = dist2;
nearm=j;
print(nearm+1);
|
s306293552 | p03774 | u343437894 | 1499651144 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 456 | n, m = map(int, input().split(" "))
def abs(n):
return n if n>0 else -n
for i in range(1, n+1):
ab = list(map(int, input().split(" ")))
for j in range(1, m+1):
cd = list(map(int, input().split(" ")))
for i in range(0, n):
delta = 999999999999
ans=0
for j in range(0, m):
newdelta = abs(ab[i][0]-cd[j][0]) + abs(ab[i][1]-cd[j][1])
if delta>newdelta:
delta=newdelta
ans=j+1
print(ans)
|
s346280552 | p03774 | u924353076 | 1493058209 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 432 | n,m = list(map(int, input().split()))
a=[]
b=[]
c=[]
d=[]
y=0
for i in range(n):
tmp=list(map(int, input().split()))
a.append(tmp[0])
b.append(tmp[1])
for i in range(m):
tmp=list(map(int, input().split()))
c.append(tmp[0])
d.append(tmp[1])
x=[1000000000]*n
for i in range(n):
for j in range(m):
x[j]=abs(c[j]-a[i])+abs(d[j]-b[i])
if x[y] > x[j]:
y = j
print(y+1)
y=0
|
s790416813 | p03774 | u124323472 | 1493057914 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 513 | n, m = list(map(int, input().split()))
a = []
b = []
for i in range(n):
tmp1, tmp2 = list(map(int, input().split()))
a.append(tmp1)
b.append(tmp2)
c = []
d = []
for i in range(m):
tmp1, tmp2 = list(map(int, input().split()))
c.append(tmp1)
d.append(tmp2)
for i in range(n):
tmp = abs(a[n] - c[0]) + abs(b[n] - d[0])
s = 1
for j in range(m):
tmp3 = abs(a[i] - c[j]) + abs(b[i] - d[j])
if tmp3 < tmp:
tmp = tmp3
s = j + 1
print(s) |
s486050716 | p03774 | u940047341 | 1493057390 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 392 | N,M = list(map(int, input().split()))
a = [0]*N
b = [0]*N
c = [0]*M
d = [0]*M
for k in range(N):
a[k],b[k] = list(map(int, input().split()))
for l in range(M):
c[l],d[l] = list(map(int, input().split()))
for i in range(N):
s=10**8+1
for j in range(M):
if s>abs(a[i]-c[j])+abs(b[i]-d[j]):
s=abs(a[i]-c[j])+abs(b[i]-d[j])
e=j+1
print(e) |
s633152426 | p03774 | u940047341 | 1493057241 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 391 | N,M = list(map(int, input().split()))
a = [0]*N
b = [0]*N
c = [0]*M
d = [0]*M
for k in range(N):
a[k],b[k] = list(map(int, input().split()))
for l in range(M):
c[l],d[l] = list(map(int, input().split()))
for i in range(N):
s=10**8
for j in range(M):
if s>abs(a[i]-c[j])+abs(b[i]-d[j]):
s=abs(a[i]-c[j])+abs(b[i]-d[j])
e=j+1
print(e)
|
s860119105 | p03774 | u226155577 | 1492918260 | Python | Python (2.7.6) | py | Runtime Error | 12 | 2568 | 327 | n, m = map(int, raw_input().split())
P = [map(int, raw_input().split()) for i in xrange(n)]
C = [map(int, raw_input().split()) for i in xrange(n)]
for a, b in P:
idx = -1; mi = ()
for i, (c, d) in enumerate(C):
di = abs(a-c) + abs(b-d)
if di < mi:
mi = di
idx = i
print idx+1 |
s317377202 | p03774 | u059262067 | 1492799502 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 507 | a = list(map(int,input().split(" ")))
b = list()
c = list()
ans = list()
for i in range(a[0]):
b.append(list(map(int,input().split(" "))))
for i in range(a[1]):
c.append(list(map(int,input().split(" "))))
for i in range(a[0]):
d = 0
e = 99999999
for ii in range(a[1]):
if e > abs(b[i][0] - c[ii][0]) + abs(b[i][1] - c[ii][1]):
e = abs(b[i][0] - c[ii][0]) + abs(b[i][1] - c[ii][1]):
d = ii
ans.append(d)
for i in range(a[0]):
print(ans[i])
|
s118124368 | p03774 | u059262067 | 1492756106 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 453 | A = list(map(int,input().split(" ")))
H = list()
C = list()
result = list()
for i in range(A[0]):
H.append(list(map(int,input().split(" "))))
for i in range(A[1]):
C.append(list(map(int,input().split(" "))))
for i in range(A[0]):
res = 0
tmp = 99999999
for ii in range(A[1]):
if tmp > abs(H[i][0] - C[ii][0]) + abs(H[i][1] - C[ii][1]):
res = ii
result.append(res)
for i in range(A[1]):
print(result[i])
|
s016380179 | p03774 | u059262067 | 1492755768 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 455 | A = list(map(int,input().split(" ")))
H = list()
C = list()
result = list()
for i in range(A[0]):
H.append(list(map(int,input().split(" "))))
for i in range(A[1]):
C.append(list(map(int,input().split(" "))))
for i in range(A[0]):
res = 0
tmp = 99999999
for ii in range(A[1]):
if tmp > abs(H[i*2-1] - C[i*2-1]) + abs(H[i*2] - C[i*2]):
res = ii
result.append(res)
for i in range(A[1]):
print(result[i])
|
s900705143 | p03774 | u474630266 | 1492658518 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 414 | N, M = map(int, input().split())
nodes, checks = [], []
for i in range(N):
nodes.append(map(int, input().split()))
for j in range(M):
checks.append(map(int, input().split()))
for i in range(N):
argMin, distMin = None, float('inf')
for j in range(M):
dist = abs(nodes[i][0] - checks[j][0]) + abs(nodes[i][1] - checks[j][1])
if dist < distMin: argMin, distMin = j, dist
print(j) |
s833898176 | p03774 | u450145303 | 1491875146 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 265 | N,M = list(map(int, input().split()))
s = [list(map(int,input().split())) for i in range(n)]
c = [list(map(int,input().split())) for j in range(n)]
for t1 in s:
l = list(map(lambda x: abs(t1[0] - x[0]) + abs(t1[1] - x[1]), c))
print(l.index(min(l)) + 1) |
s939023944 | p03774 | u049595114 | 1491785273 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 474 | N, M = list(map(int, input().split()))
students = list()
checkpoints = list()
for i in range(N):
students.append(list(map(int, input().split())))
for i in range(M):
checkpoints.append(list(map(int, input().split())))
ans = [0] * N
for i in range(N):
mindif = 4 * 10**8 + 1
for j in range(M):
dif = abs(students[i][0] - checkpoints[j][0]) + abs(students[i][1] - checkpoints[j][1])
if dif < mindif:
mindif = dif
ans[i] = j
for i in range(M):
print(ans[i])
|
s835687341 | p03774 | u471797506 | 1491445112 | Python | Python (2.7.6) | py | Runtime Error | 35 | 4520 | 464 | # -*- coding: utf-8 -*-
import sys,copy,math,heapq,itertools as it,fractions,re,bisect,collections as coll
N, M = map(int, raw_input().split())
ab = [map(int, raw_input().split()) for i in xrange(N)]
cd = [map(int, raw_input().split()) for i in xrange(N)]
for i, (a, b) in enumerate(ab):
mn = 1e10
p = -1
for j, (c, d) in enumerate(cd, 1):
tmp = abs(a - c) + abs(c - d)
if tmp < mn:
mn = tmp
p = j
print p
|
s968324043 | p03774 | u432688695 | 1491166083 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 632 | # -*- coding: utf-8 -*-
import sys
import os
N, M = list(map(int, input().split()))
students = []
checkpoints = []
for i in range(N):
a, b = list(map(int, input().split()))
students.append([a, b])
for i in range(N):
a, b = list(map(int, input().split()))
checkpoints.append([a, b])
for student in students:
min_dist = float('inf')
min_i = None
for i, checkpoint in enumerate(checkpoints):
manhattan_dist = abs(checkpoint[0] - student[0]) + abs(checkpoint[1] - student[1])
if manhattan_dist < min_dist:
min_dist = manhattan_dist
min_i = i
print(min_i + 1)
|
s930896918 | p03774 | u432688695 | 1491165575 | Python | Python (3.4.3) | py | Runtime Error | 27 | 3948 | 671 | # -*- coding: utf-8 -*-
import sys
import os
import pprint
from queue import Queue
N, M = list(map(int, input().split()))
students = []
checkpoints = []
for i in range(N):
a, b = list(map(int, input().split()))
students.append([a, b])
for i in range(N):
a, b = list(map(int, input().split()))
checkpoints.append([a, b])
for student in students:
min_dist = float('inf')
min_i = None
for i, checkpoint in enumerate(checkpoints):
manhattan_dist = abs(checkpoint[0] - student[0]) + abs(checkpoint[1] - student[1])
if manhattan_dist < min_dist:
min_dist = manhattan_dist
min_i = i
print(min_i + 1)
|
s476199227 | p03774 | u533084327 | 1491064495 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 688 | mport numpy as np
N,M = map(int,raw_input().split())
a = []
c = []
for i in range(N):
a.append(map(int,raw_input().split()))
#print a
for j in range(M):
c.append(map(int,raw_input().split()))
a = np.array(a)
c = np.array(c)
#print a.shape
#print c.shape
min = 100
index = np.zeros(N)
for i in range(N):
for j in range(M):
if min > np.abs(a[i][0]-c[j][0])+np.abs(a[i][1]-c[j][1]):
min = np.abs(a[i][0]-c[j][0])+np.abs(a[i][1]-c[j][1])
index[i] = j
elif min == np.abs(a[i][0]-c[j][0])+np.abs(a[i][1]-c[j][1]):
if j < index[i]:
index[i] = j
index = index.astype(np.int32)
for i in range(N):
print index[i]+1 |
s914863020 | p03774 | u533084327 | 1491059754 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 686 | mport numpy as np
N,M = map(int,raw_input().split())
a = []
c = []
for i in range(N):
a.append(map(int,raw_input().split()))
#print a
for j in range(M):
c.append(map(int,raw_input().split()))
a = np.array(a)
c = np.array(c)
#print a.shape
#print c.shape
min = 100
index = np.zeros(N)
for i in range(N):
for j in range(M):
if min > np.abs(a[i][0]-c[j][0])+np.abs(a[i][1]-c[j][1]):
min = np.abs(a[i][0]-c[j][0])+np.abs(a[i][1]-c[j][1])
index[i] = j
if min == np.abs(a[i][0]-c[j][0])+np.abs(a[i][1]-c[j][1]):
if j < index[i]:
index[i] = j
index = index.astype(np.int32)
for i in range(N):
print index[i]+1 |
s174204283 | p03774 | u345432788 | 1490693889 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 728 | #include <iostream>
#Include <vector>
#include <algorithm>
using namespace std;
struct Point {
int x, y;
Point(int x, int y):x(x), y(y) { }
};
int main() {
int N, M; cin >> N >> M;
vector<Point> a(N);
vector<Point> b(M);
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
a[i] = Point(x, y);
}
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
b[i] = Point(x, y);
}
for (int i = 0; i < N; i++) {
Point &p = a[i];
int idx = 0;
int minval = 1e9+10;
for (int j = 1; j < M; j++) {
int val = abs(p.y - b[i],y) + abs(p.x - b[i].x);
if (val < minval) {
idx = j;
minval = val;
}
}
cout << idx << endl;
}
return 0;
} |
s470377977 | p03774 | u379559362 | 1490678332 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 524 | import math
n, m = map(int, input().split())
# student input
student = []
for i in range(n):
a, b = map(int, input().split())
student.append([a, b])
# check point input
check = []
for j in range(n):
c, d = map(int, input().split())
check.append([c, d])
# calc
for s in student:
distance = 10e9
near = 0
for index, k in enumerate(check):
v = math.fabs(s[0] - k[0]) + math.fabs(s[1] - k[1])
if v < distance:
distance = v
near = index + 1
print(near)
|
s026145462 | p03774 | u813098295 | 1490675563 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 377 | N, M = map(int, raw_input().split())
a, b = [map(int, raw_input().split()) for _ in xrange(N)]
c, d = [map(int, raw_input().split()) for _ in xrange(M)]
for i in xrange(N):
for j in xrange(M):
d = abs(a[i]-c[j]) + abs(b[i]-d[j])
if j == 0:
t = d
ans = 1
elif t > d:
t = d
ans = j+1
print ans |
s159254137 | p03774 | u075012704 | 1490639256 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 985 | # B-Checkpoints
# 問題URL:http://abc057.contest.atcoder.jp/tasks/abc057_b
N, M = map(int, input().split()) #まずNとMを取得
ABs = [] # 学生のいる座標
CDs = [] # チェックポイントの座標
# 2行目よりN行分学生の座標を取得してABsに格納
for i in range(N):
ABs.append([int(x) for x in input().split()])
# 2+N行目よりM行分チェックポイントの座標を取得してCDsに格納
for i in range(N):
CDs.append([int(x) for x in input().split()])
for a,b in ABs:
#ABsの中身をa,b、CDsの中身をc,dとして取り出し各チェックポイントごとの距離を測定
distance = [abs(a-c) + abs(b-d) for c,d in CDs]
# 距離が同じ場合は最も番号が早いものを出力する。=(min()はもともとそのようにできている。早いもの優先）
#+1はリストは0番目から、チェックポイントは1番目から始まるため
print(distance.index(min(distance)) + 1) |
s175880012 | p03774 | u075012704 | 1490639204 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 1006 | # B-Checkpoints
# 問題URL:http://abc057.contest.atcoder.jp/tasks/abc057_b
N, M = map(int, input().split()) #まずNとMを取得
ABs = [] # 学生のいる座標
CDs = [] # チェックポイントの座標
# 2行目よりN行分学生の座標を取得してABsに格納
for i in range(N):
ABs.append([int(x) for x in input().split()])
# 2+N行目よりM行分チェックポイントの座標を取得してCDsに格納
for i in range(N):
CDs.append([int(x) for x in input().split()])
for a,b in ABs:
#ABsの中身をa,b、CDsの中身をc,dとして取り出し各チェックポイントごとの距離を測定
distance = [abs(a-c) + abs(b-d) for c,d in CDs]
print(distance)
# 距離が同じ場合は最も番号が早いものを出力する。=(min()はもともとそのようにできている。早いもの優先）
#+1はリストは0番目から、チェックポイントは1番目から始まるため
print(distance.index(min(distance)) + 1)
|
s323614359 | p03774 | u112902287 | 1490582382 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 357 | n, m = map(int, input().split())
pos = []
che = []
for i in range(n):
a,b=map(int,input().split())
pos.append([a,b])
for i in range(m):
a,b=map(int,input().split())
che.append([a,b])
for i in range(n):
dis = []
for j in range(m):
dis.append(abs(pos[i][0]-che[i][0])+abs(pos[i][1]-che[i][1]))
print(dis.index(min(dis))+1) |
s783946274 | p03774 | u112902287 | 1490582338 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 368 | n, m = map(int, input().split())
print(n,m)
pos = []
che = []
for i in range(n):
a,b=map(int,input().split())
pos.append([a,b])
for i in range(m):
a,b=map(int,input().split())
che.append([a,b])
for i in range(n):
dis = []
for j in range(m):
dis.append(abs(pos[i][0]-che[i][0])+abs(pos[i][1]-che[i][1]))
print(dis.index(min(dis))+1) |
s434704225 | p03774 | u456950583 | 1490581184 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 431 | #!/usr/bin/env python
nm = [int(i) for i in input().split()]
n = nm[0]
m = nm[1]
student = list()
point = list()
for i in range(n):
student.append([int(a) for a in input().split()])
for j in range(m):
point.append([int(b) for b in input().split()])
mat = [[abs(student[i][0]-point[j][0]) + abs(student[i][1]-point[j][1]) for i in range(n)] for j in range(m)]
for i in range(n):
print(mat[i].index(min(mat[i]))+1) |
s253854636 | p03774 | u456950583 | 1490581039 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 431 | #!/usr/bin/env python
nm = [int(i) for i in input().split()]
n = nm[0]
m = nm[1]
student = list()
point = list()
for i in range(n):
student.append([int(a) for a in input().split()])
for j in range(m):
point.append([int(b) for b in input().split()])
mat = [[abs(student[i][0]-point[j][0]) + abs(student[i][1]-point[j][1]) for j in range(m)] for i in range(m)]
for i in range(n):
print(mat[i].index(min(mat[i]))+1) |
s167394757 | p03774 | u456950583 | 1490580826 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 431 | #!/usr/bin/env python
nm = [int(i) for i in input().split()]
n = nm[0]
m = nm[1]
student = list()
point = list()
for i in range(n):
student.append([int(i) for i in input().split()])
for j in range(m):
point.append([int(j) for j in input().split()])
mat = [[abs(student[i][0]-point[j][0]) + abs(student[i][1]-point[j][1]) for j in range(m)] for i in range(m)]
for i in range(n):
print(mat[i].index(min(mat[i]))+1) |
s715023540 | p03774 | u456950583 | 1490580555 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 431 | #!/usr/bin/env python
nm = [int(i) for i in input().split()]
n = nm[0]
m = nm[1]
student = list()
point = list()
for i in range(n):
student.append([int(i) for i in input().split()])
for j in range(m):
point.append([int(i) for i in input().split()])
mat = [[abs(student[i][0]-point[j][0]) + abs(student[i][1]-point[j][1]) for j in range(m)] for i in range(m)]
for i in range(n):
print(mat[i].index(min(mat[i]))+1) |
s736173591 | p03774 | u456950583 | 1490580172 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 496 | #!/usr/bin/env python
nm = [int(i) for i in input().split()]
n = nm[0]
m = nm[1]
student = list()
point = list()
for i in range(n):
student.append([int(i) for i in input().split()])
for j in range(m):
point.append([int(i) for i in input().split()])
mat = [[0 for j in range(m)] for i in range(m)]
for j in range(m):
for i in range(n):
mat[i][j] = abs(student[i][0]-point[j][0]) + abs(student[i][1]-point[j][1])
for i in range(n):
print(mat[i].index(min(mat[i]))+1) |
s194629314 | p03774 | u976966750 | 1490579371 | Python | PyPy2 (5.6.0) | py | Runtime Error | 60 | 32876 | 748 | n,m=map(int,raw_input().split())
st=[]
ch=[]
l=[]
for i in range(n):
g=map(int,raw_input().split())
st.append(g)
for y in range(n):
r=map(int,raw_input().split())
ch.append(r)
def dis(a,b):
return abs(a[0]-b[0])+abs(a[1]-b[1])
for stu in st:
ctr=0
gh=10**9+7
new={}
for che in ch:
# print stu,che,dis(stu,che)
if dis(stu,che)<gh:
gh=dis(stu,che)
ctr+=1
if gh not in new:
new[gh]=[ctr]
else:
new[gh].append(ctr)
else:
ctr+=1
# print new
po=new.keys()
# print po
po.sort()
poi=new[po[0]]
# print poi
poi.sort()
l.append(poi[0])
for numb in l:
print numb
|
s456920196 | p03774 | u112002050 | 1490578906 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 659 | def get_min_distance_index(spos, check_pos):
manhattan_distance = lambda x1, y1, x2, y2:abs(x1 - x2) + abs(y1 - y2)
minimum = -1
min_index = 0
for index, chpos in enumerate(check_pos):
manhattan = manhattan_distance(spos[0], spos[1], chpos[0], chpos[1])
if minimum < 0 or manhattan < minimum:
minimum = manhattan
min_index = index + 1
return min_index
N, M = map(int, input().split())
student_pos = [[int(i) for i in input().split()]for _ in range(N)]
check_pos = [[int(i) for i in input().split()]for _ in range(N)]
for spos in student_pos:
print(get_min_distance_index(spos, check_pos))
|
s696847718 | p03774 | u481333386 | 1490578278 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 744 | # -*- coding: utf-8 -*-
def solve(s_pp, p_pp):
p_nums = []
for x, y in s_pp:
distance = []
for xx, yy in p_pp:
n = abs(x - xx) + abs(y - yy)
distance.append(n)
min_distance_idx = distance.index(min(distance))
p_nums.append(min_distance_idx + 1)
return p_nums
def main():
students, points = [int(e) for e in input().split()]
students_ps = []
points_ps = []
for _ in range(students):
x, y = [int(e) for e in input().split()]
students_ps.append([x, y])
for _ in range(points):
x, y = [int(e) for e in input().split()]
points_ps.append([x, y])
for answer in solve(students_ps, points_ps):
print(answer)
m |
s384684105 | p03774 | u581309643 | 1490578202 | Python | Python (3.4.3) | py | Runtime Error | 720 | 15196 | 587 | import numpy as np
N, M = map(int, input().split())
list_coStu = []
list_coChe = []
for i in range(N):
list_coStu.append(list(map(int, input().split())))
for i in range(N):
list_coChe.append(list(map(int, input().split())))
#calc distance
for iS in range(len(list_coStu)):
coStu = np.array(list_coStu[iS])
min_iC = 0
d = 4 * 10**8 + 1
for iC in range(len(list_coChe)):
coChe = np.array(list_coChe[iC])
dif = coChe - coStu
dist = np.sum(np.abs(dif))
if dist < d:
min_iC = iC
d = dist
print(min_iC + 1)
|
s981575288 | p03774 | u112002050 | 1490577904 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 406 | N, M = map(int, input().split())
student_pos = [[int(i) for i in input().split()]for _ in range(N)]
check_pos = [[int(i) for i in input().split()]for _ in range(N)]
manhattan_distance = lambda x1, y1, x2, y2:abs(x1 - x2) + abs(y1 - y2)
for spos in student_pos:
distances = [manhattan_distance(spos[0], spos[1], chpos[0],chpos[1]) for chpos in check_pos]
print(distances.index(min(distances)) + 1)
|
s019205372 | p03774 | u335830383 | 1490577897 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 442 | N, M = raw_input().split()
ss = []
for i in range(N):
ss.append(map(int, raw_input().split()))
ds = []
for i in range(M):
ds.append(map(int, raw_input().split()))
res = []
for i in range(int(N)):
max = 10000000000
rank = 0
for j in range(int(M)):
dis = abs(s[0]-d[0]) + abs(s[1]-d[1])
# dis = man_dis(ss[i],ds[j])
if max > dis:
rank = j+1
max = dis
print(rank)
|
s606878729 | p03774 | u335830383 | 1490577846 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 470 | N, M = raw_input().split()
ss = []
for i in range(N):
ss.append(map(int, raw_input().split()))
ds = []
for i in range(M):
ds.append(map(int, raw_input().split()))
def man_dis(s,d):
dis = abs(s[0]-d[0]) + abs(s[1]-d[1])
return dis
res = []
for i in range(int(N)):
max = 10000000000
rank = 0
for j in range(int(M)):
dis = man_dis(ss[i],ds[j])
if max > dis:
rank = j+1
max = dis
print(rank)
|
s566028027 | p03774 | u581309643 | 1490577845 | Python | Python (3.4.3) | py | Runtime Error | 394 | 13536 | 587 | import numpy as np
N, M = map(int, input().split())
list_coStu = []
list_coChe = []
for i in range(N):
list_coStu.append(list(map(int, input().split())))
for i in range(N):
list_coChe.append(list(map(int, input().split())))
#calc distance
for iS in range(len(list_coStu)):
coStu = np.array(list_coStu[iS])
min_iC = 0
d = 2 * 10**8 + 1
for iC in range(len(list_coChe)):
coChe = np.array(list_coChe[iC])
dif = coChe - coStu
dist = np.sum(np.abs(dif))
if dist < d:
min_iC = iC
d = dist
print(min_iC + 1)
|
s632690112 | p03774 | u239375815 | 1490577651 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 519 | n, m = map(int, input().split())
a = [[0, 0] for i in range(n)]
c = [[0, 0] for i in range(m)]
for i in range(n):
a[i][0], a[i][1] = map(int, input().split())
for i in range(n):
c[i][0], c[i][1] = map(int, input().split())
index = 0
for i in range(n):
for j in range(m):
if j == 0 :
k = abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1]) +1
di = abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1])
if di < k:
index = j + 1
k = di
print(index)
|
s502516128 | p03774 | u481333386 | 1490577578 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 684 | # -*- coding: utf-8 -*-
def solve(s_pp, p_pp):
p_nums = []
for x, y in s_pp:
distance = []
for xx, yy in p_pp:
n = abs(x, xx) + abs(y, yy)
distance.append(n)
p_nums.append(min(distance))
return p_nums
def main():
students, points = [int(e) for e in input().split()]
students_ps = []
points_ps = []
for _ in range(students):
x, y = [int(e) for e in input().split()]
students_ps.append([x, y])
for _ in range(points):
x, y = [int(e) for e in input().split()]
points_ps.append([x, y])
for answer in solve(students_ps, points_ps):
print(answer)
main()
|
s787311978 | p03774 | u239375815 | 1490577507 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 445 | n, m = map(int, input().split())
a = [[0, 0] for i in range(n)]
c = [[0, 0] for i in range(m)]
for i in range(n):
a[i][0], a[i][1] = map(int, input().split())
for i in range(n):
c[i][0], c[i][1] = map(int, input().split())
index = 0
for i in range(n):
k = 1<<20
for j in range(m):
di = abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1])
if di < k:
index = j + 1
k = di
print(index)
|
s840103658 | p03774 | u466826467 | 1490577505 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 499 | N, M = list(map(int, input().split()))
ab = []
for i in range(N):
ab.append(list(map(int, input().split())))
cd = []
for i in range(M):
cd.append(list(map(int, input().split())))
for ab_list in ab:
min_distance = 200000000
checkpoint = 0
for cd_list in cd:
checkpoint += 1
distance = abs(ab_list[0] - cd_list[0]) + abs(ab_list[1] - cd_list[1])
if distance < min_distance:
min_distance = distance
ans = checkpoint
print(ans)
|
s869078499 | p03775 | u468972478 | 1600911122 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9088 | 140 | n = int(input())
s = []
for i in range(1, n//2 + 1):
if n % i == 0:
a = max(len(str(i)), len(str(n//i)))
s.append(a)
print(min(s)) |
s223489197 | p03775 | u468972478 | 1600910976 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9168 | 129 | n = int(input())
s = 0
for i in range(1, n//2 + 1):
if n % i == 0:
s.append(max(len(str(i)), len(str(n//i))))
print(min(s)) |
s254354010 | p03775 | u009787707 | 1600555955 | Python | Python (3.8.2) | py | Runtime Error | 2205 | 9328 | 167 | import math
N=int(input())
num=(N**0.5)//1+1
num=int(num)
for i in range(num,N+1):
if N%i==0:
x=i
break
ans=int((math.log(x,10)+1)//1)
print(ans) |
s222391898 | p03775 | u009787707 | 1600555086 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9416 | 211 | def cal1(n):
num=(n**0.5)//1+1
for i in range(num,n+1):
if n//i==0:
num=i
break
return num
import math
N=int(input())
num=cal1(N)
print(int((math.log(num,10)+1)//1)) |
s686264986 | p03775 | u882564128 | 1600544788 | Python | Python (3.8.2) | py | Runtime Error | 45 | 9068 | 138 | import math
n = int(input())
for a in range(1, int(math.sqrt(n))):
if n%a == 0:
b = n//a
ans = len(str(b))
print(ans) |
s349973801 | p03775 | u546440137 | 1600030394 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9112 | 275 | import math
N = int(input())
def f(a,b):
if len(str(a)) < len(str(b)):
return len(str(b))
else:
return len(str(a))
ans = 100000000000
for i in range(1,math.sqrt(N)+1):
if N % i == 0:
ans = min(ans,f(i,N//i))
print(ans)
|
s482725352 | p03775 | u546440137 | 1600030069 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9332 | 238 | N = int(input())
def f(a,b):
if len(str(a)) < len(str(b)):
return len(str(b))
else:
return len(str(a))
ans = 100000000000
for i in range(1,N**(1/2)):
if N % i == 0:
ans = min(ans,f(i,N//i))
print(ans) |
s184417310 | p03775 | u755180064 | 1599626211 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9140 | 472 | import sympy
url = "https://atcoder.jp//contests/abc057/tasks/abc057_c"
def main():
n = int(input())
ans = 10000000000000000
ns = sympy.divisors(n)
for i in range(0, (len(ns)//2) + 1):
tmp = max(len(str(ns[i])), len(str(ns[len(ns)-i-1])))
ans = tmp if tmp < ans else ans
if len(ns) % 2 != 0:
tmp = len(str(ns[len(ns) // 2]))
ans = tmp if tmp < ans else ans
print(ans)
if __name__ == '__main__':
main()
|
s840599969 | p03775 | u038107109 | 1598916909 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9144 | 206 | N = int(input())
min_f = len(N)
for a in range(1, N):
if N % a != 0:
continue
b = int(N / a)
f = max(len(str(a)), len(str(b)))
if min_f > f:
min_f = f
if a**2 > N:
break
print(min_f) |
s563787730 | p03775 | u780529129 | 1598638814 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9340 | 498 | from collections import Counter
n = int(input())
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
cnt = Counter(prime_factorize(n))
two_five = min(cnt[2],cnt[5])
x = 0
for key in cnt:
if x < key:
x = key
keta = len(str(key))
print(max(keta,-(-two_five//2)+1)) |
s201407070 | p03775 | u780529129 | 1598638751 | Python | Python (3.8.2) | py | Runtime Error | 38 | 9420 | 498 | from collections import Counter
n = int(input())
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
cnt = Counter(prime_factorize(n))
two_five = min(cnt[2],cnt[5])
x = 0
for key in cnt:
if x < key:
x = key
keta = len(str(key))
print(max(keta,-(-two_five//2)+1)) |
s655699620 | p03775 | u677393869 | 1598584553 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9168 | 139 | N = int(input())
min_num = 10**5
for i in range(1, N+1):
if N % i == 0:
min_num = min(max(len(i), len(N//i)), min_num)
print(min_num) |
s513065540 | p03775 | u263824932 | 1598564273 | Python | PyPy3 (7.3.0) | py | Runtime Error | 100 | 85244 | 1071 | import math
N = int(input())
P = 0
P += N
Eratosthenes = [p for p in range(2, math.ceil(N ** 0.5))]
number = Eratosthenes[0]
sosuu = []
while number < N ** 0.25:
sosuu.append(number)
n_Eratosthenes = []
for n in Eratosthenes:
if n % number == 0:
pass
else:
n_Eratosthenes.append(n)
if len(n_Eratosthenes) == 0:
break
number = n_Eratosthenes[0]
Eratosthenes = n_Eratosthenes
numbers = sosuu + Eratosthenes
suuji = 0
answers = []
while N > 1 and suuji < len(numbers):
number = numbers[suuji]
if N % number == 0:
answers.append(number)
N = N // number
else:
suuji += 1
number = 1
for n in answers:
number *= n
other = P // number
if P==1:
print(1)
else:
if other == 1:
a = 1
b = 1
for n in range(len(answers)):
if n % 2 == 0:
a *= answers[n]
else:
b *= answers[n]
print(max(len(str(a)), len(str(b))))
else:
print(max(len(str(other)), len(str(number))))
|
s260815691 | p03775 | u263824932 | 1598563747 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 85200 | 973 | import math
N=int(input())
P=0
P+=N
Eratosthenes = [p for p in range(2, math.ceil(N ** 0.5))]
number = Eratosthenes[0]
sosuu = []
while number < N ** 0.25:
sosuu.append(number)
n_Eratosthenes = []
for n in Eratosthenes:
if n % number == 0:
pass
else:
n_Eratosthenes.append(n)
if len(n_Eratosthenes) == 0:
break
number = n_Eratosthenes[0]
Eratosthenes = n_Eratosthenes
numbers = sosuu + Eratosthenes
suuji = 0
answers = []
while N > 1 and suuji < len(numbers):
number = numbers[suuji]
if N % number == 0:
answers.append(number)
N = N // number
else:
suuji += 1
number=1
for n in answers:
number*=n
other=P//number
if other==1:
a=1
b=1
for n in range(len(answers)):
if n%2==0:
a*=answers[n]
else:
b*=answers[n]
print(max(len(str(a)),len(str(b))))
else:
print(max(len(str(other)),len(str(number))))
|
s124948433 | p03775 | u338597441 | 1598480180 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9188 | 336 | n=int(input())
a=list(map(int,input().split()))
color=[]
count,free=0,0
for i in range(n):
c=a[i]//400
if a[i]<3200 and c not in color:
color.append(c)
count+=1
elif a[i]>=3200:
free+=1
min,max=0,0
if count==0:
max=free
min=1
else:
max=count+free
min=count
print(min,max) |
s296239579 | p03775 | u104613587 | 1598239005 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8920 | 309 | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0),ios::sync_with_stdio(false);
int64_t n; cin>>n;
int ans=1e10;
for(int64_t i=1;i*i<=n;++i){
if(n%i==0){
int64_t t=max(n/i,i);
int tans=0;
while(t){
t/=10;
++tans;
}
ans=min(ans,tans);
}
}
cout<<ans<<"\n"s;
}
|
s376198914 | p03775 | u869790980 | 1597809804 | Python | PyPy2 (7.3.0) | py | Runtime Error | 140 | 64540 | 139 | n = int(raw_input())
m = len(str(n))
for a in range(2, n ** 0.5 + 1):
if n % a == 0:
m = min(m, max(len(str(a)), len(str(n/a))))
print m |
s376068567 | p03775 | u106778233 | 1597763893 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9444 | 203 | N = int(input())
ans = 111111111110
for i in range(int(N**0.5+2)):
if N%i == 0:
use = N//i
s = str(use)
t = str(i)
ans = min(ans, max(len(s), len(t)))
print(ans) |
s161274553 | p03775 | u706659319 | 1597676902 | Python | PyPy3 (7.3.0) | py | Runtime Error | 90 | 74724 | 182 | N = int(input())
r_N = int(N ** (1 / 2))
li = []
for n in range(1,r_N + 1):
if N % n == 0:
a = N // n
l = max(len(str(a)),len(str(n)))
li.append(l)
print(min(li)) |
s203369814 | p03775 | u706659319 | 1597676877 | Python | PyPy3 (7.3.0) | py | Runtime Error | 95 | 74548 | 182 | N = int(input())
r_N = int(N ** (1 / 2))
li = []
for n in range(1,r_N + 1):
if N % n == 0:
a = N // n
l = max(len(str(a)),len(str(n))))
li.append(l)
print(min(li)) |
s383862473 | p03775 | u330799501 | 1597435467 | Python | Python (3.8.2) | py | Runtime Error | 43 | 8972 | 468 | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
import math
n = int(input())
ans = []
nj = int(math.sqrt(n))
for i in range(1,nj):
a = i
if n % a == 0:
b = n // a
tmp = max(len(str(a)), len(str(b)))
#print(a,b)
ans.append(tmp)
print(min(ans))
|
s208222186 | p03775 | u804800128 | 1597415511 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9060 | 359 | import math
import sympy
#from sympy import sieve
N = int(input())
'''
lenN = math.floor(math.log(N,10)) + 1
# lenN = Nの桁数
rootN = math.floor(math.sqrt(N))
#rootN = floor( N ^ 1/2 )
Primes = list(sieve.primerange(1,rootN))
'''
Divisors = list(sympy.divisors(N))
Len_d = len(Divisors)
Ans = Divisors[ Len_d // 2 ]
print(math.floor(math.log(Ans,10))+1) |
s330597682 | p03775 | u325492232 | 1597090590 | Python | Python (3.8.2) | py | Runtime Error | 2207 | 39104 | 244 | n = int(input())
def f(a, b):
x = int(max(a, b))
return len(str(x))
results = []
for i in range(1, (n // 2) + 1):
if n % i == 0:
a = i
b = n / i
result = f(a, b)
results.append(result)
print(min(results)) |
s910218259 | p03775 | u325492232 | 1597090081 | Python | Python (3.8.2) | py | Runtime Error | 2207 | 43428 | 244 | n = int(input())
def f(a, b):
x = max(a, b)
return len(str(x))
results = []
for i in range(1, (n // 2) + 1):
if n % i == 0:
a = i
b = int(n / i)
result = f(a, b)
results.append(result)
print(min(results)) |
s561212876 | p03775 | u338597441 | 1596926003 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9432 | 195 | n=int(input())
for a in range(1,n**0.5+1):
if n%a==0:
b=n//a
sa=str(a)
sb=str(b)
if a<=b:
ans=len(sb)
else:
break
print(ans) |
s287179130 | p03775 | u338597441 | 1596924968 | Python | Python (3.8.2) | py | Runtime Error | 2205 | 9048 | 376 | n=int(input())
for i in range(1,n//2+1):
a=i
if n%a==0:
b=n//a
sa=str(a)
sb=str(b)
#print(a,b,len(sa),len(sb))
if len(sb)-len(sa)==0:
ans=len(sb)
break
elif len(sb)-len(sa)>=1:
ans=len(sb)
else:
#print(b,sb,len(sa),len(sb))
break
print(ans) |
s576141679 | p03775 | u338597441 | 1596924589 | Python | Python (3.8.2) | py | Runtime Error | 2205 | 9036 | 302 | n=int(input())
for i in range(1,(n)//2+1):
a=i
if n%a==0:
b=n//a
sa=str(a)
sb=str(b)
#print(a,b,len(sa),len(sb))
if len(sb)-len(sa)>=0:
ans=len(sb)
else:
#print(b,sb,len(sa),len(sb))
break
print(ans) |
s473374398 | p03775 | u823585596 | 1596078475 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9172 | 150 | import math
N=int(input())
ans=len(str(N))
for a in range(2,math.sqrt(N)+1):
if N%a==0:
b=N//a
ans=min(ans,len(str(b)))
print(ans) |
s747123595 | p03775 | u823585596 | 1596078436 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9436 | 155 | import math
N=int(input())
ans=len(str(N))
for a in range(2,math.sqrt(N**0.5)+1):
if N%a==0:
b=N//a
ans=min(ans,len(str(b)))
print(ans) |
s545626085 | p03775 | u373047809 | 1595955435 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9380 | 109 | n, m = int(input()), 0
for i in range(1, n**.5 + 1):
if n%i == 0:
m = max(m, i)
print(len(str(n // m))) |
s680739274 | p03775 | u373047809 | 1595955410 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9168 | 108 | n, m = int(input()), 0
for i in range(1, **.5 + 1):
if n%i == 0:
m = max(m, i)
print(len(str(n // m))) |
s414570827 | p03775 | u643270269 | 1595901848 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9116 | 236 | N = int(input())
res = []
import sympy
for a in sympy.divisors(N):
b = int(N/a)
if a*b == N:
a = str(a)
b = str(b)
if len(a) > len(b):
res.append(len(a))
else:
res.append(len(b))
res.sort()
print(res[0]) |
s992672325 | p03775 | u643270269 | 1595901808 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9044 | 239 | N = int(input())
res = []
import sympy
for a in sympy.divisors(N):
b = int(N/a)
if a*b == N:
a = str(a)
b = str(b)
if len(a) > len(b):
res.append(len(a))
else:
res.append(len(b))
res.sort()
print(res[0]) |
s413314580 | p03775 | u643270269 | 1595901323 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9136 | 218 | N = int(input())
res = []
for a in range(1, N):
b = int(N/a)
if a*b == N:
a = str(a)
b = str(b)
if len(a) > len(b):
res.append(len(a))
else:
res.append(len(b))
res.sort()
print(res[0]) |
s742866060 | p03775 | u643270269 | 1595901240 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9040 | 250 | N = int(input())
res = []
for a in range(1, N):
for b in range(1, int(N/a)+1):
if a*b == N:
a = str(a)
b = str(b)
if len(a) > len(b):
res.append(len(a))
else:
res.append(len(b))
res.sort()
print(res[0]) |
s331130017 | p03775 | u261082314 | 1595795919 | Python | Python (3.8.2) | py | Runtime Error | 36 | 9064 | 244 | N = int(input())
import math
if N == 1:
print(1)
else:
for a in reversed(range(1, (int(math.sqrt(N)))+1)):
if N % a == 0:
b = N/a
ans=max(len(str(int(a))), len(str(int(b))))
break
print(ans)
|
s562225221 | p03775 | u261082314 | 1595795632 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9088 | 220 | N = int(input())
if N == 1:
print(1)
else:
for a in reversed(range(1, (N//2)+1)):
if N % a == 0:
b = N/a
ans=max(len(str(int(a))), len(str(int(b))))
break
print(ans)
|
s290166163 | p03775 | u405733072 | 1595739518 | Python | Python (3.8.2) | py | Runtime Error | 38 | 9352 | 141 | n = int(input())
for i in range(int(n**0.5),0,-1):
if n%i == 0:
a = max(i,n//i)
print(int(math.log10(a))+1)
break |
s954021266 | p03775 | u807021746 | 1595628171 | Python | Python (3.8.2) | py | Runtime Error | 42 | 9108 | 212 | import math
N = int(input())
I = int(math.sqrt(N) // 1)
print(I)
a = []
for i in range(1, I):
if N%i==0:
j=N//i
k = len(str(i))
l = len(str(j))
m = max(k, l)
a.append(int(m))
print(min(a)) |
s421733979 | p03775 | u807021746 | 1595628062 | Python | Python (3.8.2) | py | Runtime Error | 42 | 9124 | 219 | import math
N = int(input())
I = int(math.sqrt(N) // 1)
print(I)
a = []
for i in range(1, I):
if N%i==0:
j=N//i
k = len(list(str(i)))
l = len(list(str(j)))
m = max(k, l)
a.append(m)
print(min(a)) |
s527820624 | p03775 | u807021746 | 1595627858 | Python | Python (3.8.2) | py | Runtime Error | 40 | 9148 | 210 | import math
N = int(input())
I = int(math.sqrt(N) // 1)
a = []
for i in range(1, I):
if N%i==0:
j=N//i
i = len(list(str(i)))
j = len(list(str(j)))
k = max(i, j)
a.append(k)
print(min(a)) |
s895994771 | p03775 | u354527070 | 1595039469 | Python | Python (3.8.2) | py | Runtime Error | 42 | 9140 | 198 | import math
n = int(input())
l = []
for i in range(1, int(math.sqrt(n))):
if n % i == 0:
a = len(str(int(n / i)))
b = len(str(int(i)))
l.append(max(a, b))
print(min(l)) |
s734143814 | p03775 | u612261372 | 1594954474 | Python | PyPy3 (7.3.0) | py | Runtime Error | 92 | 74844 | 126 | N = int(input())
ans = 100
for i in range(N+1//2):
if N % i == 0:
ans = min(ans, len(str(i))+len(str(N//i)))
print(ans) |
s537855813 | p03775 | u623814058 | 1594514775 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9044 | 143 | N = int(input())
y = []
for i in range(1, N//2):
if N % i == 0:
y.append( max( len(str(i)), len(str(int(N/i))) ) )
print(min(y)) |
s342614544 | p03775 | u633355062 | 1594250262 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9100 | 183 | import sympy
N = int(input())
div = sympy.divisors(N)
ans = 100
for i in range(len(div)):
a = div[i]
b = N // a
ans = min(ans, max(len(str(a)), len(str(b))))
print(ans)
|
s693364553 | p03775 | u455354923 | 1594057175 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9320 | 197 | N=int(input())
list = []
flg = True
for A in range(1,int((N+1)**0.5)):
for B in range(int((N+1)**0.5),N+1):
if A*B==N:
list.append(len(str(B)))
list.sort()
print((list[0]))
|
s929764109 | p03775 | u455354923 | 1594056881 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9308 | 338 | N=int(input())
list = []
flg = True
for A in range(1,int((N+1)**0.5)):
for B in range(1,N+1):
if A*B==N:
if len(str(A)) > len(str(B)):
list.append(len(str(A)))
print(list)
else:
list.append(len(str(B)))
#print(list)
list.sort()
print((list[0]))
|
s311615398 | p03775 | u671889550 | 1593916705 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9332 | 122 | N=int(input())
ans=float('inf')
for i in range(1,N**0.5+1):
if N%i==0:
ans=min(ans,len(str(N//i)))
print(ans) |
s616978011 | p03775 | u671889550 | 1593915650 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9076 | 126 | N=int(input())
f=[]
for i in range(1,(N+1)//2):
if N%i==0:
f.append(max(len(str(i)),len(str(N//i))))
print(min(f)) |
s578529575 | p03775 | u671889550 | 1593915542 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9136 | 126 | N=int(input())
f=[]
for i in range(1,(N+1)//2):
if N%i==0:
f.append(min(len(str(i)),len(str(N//i))))
print(max(f)) |
s764831906 | p03775 | u671889550 | 1593915470 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 8984 | 119 | N=int(input())
f=[]
for i in range(1,(N+1)//2):
if N%i==0:
f.append(min(len(str(i)),len(str(N//i))))
max(f) |
s958156451 | p03775 | u407702479 | 1593887772 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 9132 | 125 | import math
N=int(input())
for i in range(int(math.sqrt(N))-1,N+1):
if N%i==0:
print(len(str(i)))
exit(0) |
s388211768 | p03775 | u106971015 | 1593744653 | Python | Python (3.8.2) | py | Runtime Error | 35 | 9152 | 376 | import math
N = int(input())
def prime(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
l = prime(N)
sqrt = str(int(math.sqrt(N)))
print(max(len(sqrt),len(str(l[-1])))) |
s223483329 | p03775 | u273339216 | 1593638379 | Python | Python (3.8.2) | py | Runtime Error | 750 | 9168 | 640 | n = int(input())
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
sosu = make_divisors(n)
#print(type(sosu))
kumi = []
for i in range(len(sosu)):
for j in range(len(sosu)):
#print(type(sosu[i]))
if sosu[i]*sosu[j] == n:
kumi.append([str(sosu[i]), str(sosu[j])])
if len(kumi)%2 == 0:
print(len(min(kumi[len(kumi)/2])))
else:
print(len(min(kumi[round(len(kumi)/2)])))
|
s192765972 | p03775 | u343490140 | 1593549645 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9032 | 163 | n = int(input())
ans = 10
for i in range(1, n/2+1):
if n % i == 0:
if len(str(max(i, n/i))) <= ans:
ans = len(str(max(i, n/i)))
print(ans)
|
s262836664 | p03775 | u790012205 | 1593436245 | Python | Python (3.8.2) | py | Runtime Error | 44 | 9220 | 572 | N = int(input())
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
L = make_divisors(N)
l = len(L)
if l % 2 == 0:
a1 = str(L[l // 2] - 1)
a2 = str(L[l // 2])
print(max(len(a1), len(a2)))
else:
a1 = str(L[l // 2 - 1])
a2 = str(L[l // 2])
a3 = str(L[l // 2 + 1])
print(max(len(a1), len(a2), len(a3)))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.