input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
n=I()
lis=LI()
mn=inf
for i in range(-100,100+1):
sm=0
for s in lis:
sm+=(s-i)**2
if sm<mn:
mn=sm
print(mn)
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
n=I()
lis=LI()
U,V=0,0
u=ceil(sum(lis)/n)
v=int(sum(lis)/n)
for i in range(n):
U+=(lis[i]-u)**2
V+=(lis[i]-v)**2
print((min(U,V)))
|
p04031
|
n = int(eval(input()))
a = list(map(int,input().split()))
mn = 10**9
for i in range(-100,101):
x = 0
for j in a:
x += (j-i)**2
mn = min(mn,x)
print(mn)
|
n = int(eval(input()))
a = list(map(int,input().split()))
x = round(sum(a)/n)
ans = 0
for i in a:
ans += (i-x)**2
print(ans)
|
p04031
|
num = int(eval(input()))
A = list(map(int, input().split()))
sumA = sum(A)
obj = round(sumA/num)
sum2A = 0
for i in range(num):
sum2A += A[i] ** 2
print((sum2A - (2*obj*sumA) + (num*obj**2)))
|
num = int(eval(input()))
A = list(map(int, input().split()))
sumA = sum(A)
obj = round(sumA/num)
ans = 0
for i in range(num):
ans += (A[i]-obj) ** 2
print(ans)
|
p04031
|
N = int(eval(input()))
a = list(map(int,input().split()))
ave = sum(a)/N
ave = round(ave)
sum = 0
for i in a:
sum += (i-ave)**2
print(sum)
|
n=int(eval(input()))
a=list(map(int,input().split()))
ave = round(sum(a)/n)
cost=0
for i in range(n):
cost+=(a[i]-ave)**2
print(cost)
|
p04031
|
n = int(eval(input()))
a_array = [int(x) for x in input().split()]
ans = float("inf")
for i in range(-100, 101):
tmp = 0
for a in a_array:
tmp += abs(a-i)**2
ans = min(ans, tmp)
print(ans)
|
n = int(eval(input()))
a_array = [int(x) for x in input().split()]
sum_a = sum(a_array)
if sum_a % n == 0:
sum_a = int(sum_a/len(a_array))
ans = 0
for a in a_array:
ans += abs(sum_a-a)**2
print((int(ans)))
else:
sum_a1 = int(sum_a/len(a_array))
sum_a2 = int(sum_a/len(a_array))+1
ans1 = 0
ans2 = 0
for a in a_array:
ans1 += abs(sum_a1-a)**2
ans2 += abs(sum_a2-a)**2
print((int(min(ans1, ans2))))
|
p04031
|
N=int(eval(input()))
a=[int(i) for i in input().split()]
ave=round(sum(a)/len(a))
cost=0
for i in a:
cost+=(i-ave)**2
print(cost)
|
n=int(eval(input()))
a=[int(i) for i in input().split()]
ave=round(sum(a)/len(a))
cost=0
for i in a:
cost+=(ave-i)**2
print(cost)
|
p04031
|
n=int(eval(input()))
a=list(map(int,input().split()))
ave=round(sum(a)/n)
a=[(x-ave)**2 for x in a]
print((sum(a)))
|
n=int(eval(input()))
a=list(map(int,input().split()))
avg=round(sum(a)/n)
ans=0
for i in range(n):
ans+=(a[i]-avg)**2
print(ans)
|
p04031
|
n=int(eval(input()))
a=list(map(int,input().split()))
total=0
ans=[]
for i in range(-100,101):
for j in a:
if j!=i:
total+=(i-j)**2
ans.append(total)
total=0
print((min(ans)))
|
n=int(eval(input()))
a=list(map(int,input().split()))
ans=float("inf")
for i in range(-100,101):
cost=0
for j in range(n):
cost+=(i-a[j])**2
ans=min(cost,ans)
print(ans)
|
p04031
|
N = int(eval(input()))
a = [int(i) for i in input().split()]
ans = float("inf")
for i in range(-100, 101):
ans = min(sum([(n - i)** 2 for n in a]), ans)
print(ans)
|
N=int(eval(input()));a=[int(i) for i in input().split()]
print((min([sum([(n-i)**2 for n in a])for i in range(-100,101)])))
|
p04031
|
n=int(eval(input()))
a=list(map(int,input().split()))
ans=float('inf')
for i in range(-100, 101):
tmp=0
for j in range(n):
tmp+=(i-a[j])**2
ans=min(tmp,ans)
print(ans)
|
n=int(eval(input()))
a=list(map(int,input().split()))
mean=sum(a)//n
ans=float('inf')
for i in range(5):
t=(mean-2)+i
tmp=0
for j in range(n):
tmp+=(a[j]-t)**2
ans=min(ans,tmp)
print(ans)
|
p04031
|
N = int(eval(input()))
A = list(map(int, input().split()))
total_costs = {}
if( len(set(A)) == 1 ):
print((0))
else:
for i in range(-100, 101):
cost = 0
for a in A:
cost += (a - i)**2
total_costs[i] = cost
print((min(total_costs.values())))
|
N = int(eval(input()))
A = list(map(int, input().split()))
total_costs = {}
if( len(set(A)) == 1 ):
print((0))
else:
for i in range(-100, 101):
cost = 0
for a in A:
cost += (a - i)*(a - i)
total_costs[i] = cost
print((min(total_costs.values())))
|
p04031
|
N = int(eval(input()))
A = list(map(int, input().split()))
mn = 10**9
for j in range(min(A), max(A)+1):
cost = 0
for i in range(N):
cost += (A[i]-j)**2
mn = min(cost, mn)
print(mn)
|
n = int(eval(input()))
a = list(map(int, input().split()))
ans = float('INF')
for i in range(min(a), max(a)+1):
cost = 0
for aa in a:
cost += (i - aa)**2
if cost < ans :
ans = cost
print(ans)
|
p04031
|
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 10**10
for i in range(-100, 101):
t = 0
for j in A:
t += (j-i)**2
if t < ans:
ans = t
print(ans)
|
n = int(eval(input()))
A = list(map(int, input().split()))
avg = sum(A)//n
avg2 = sum(A)//n + 1
ans = 0
ans2 = 0
for i in A:
ans += (i-avg)**2
ans2 += (i-avg2)**2
print((min(ans, ans2)))
|
p04031
|
n=int(eval(input()))
t = list(map(int,input().split()))
t.sort()
ans = 100000000000000
for i in range(t[0],t[-1]+1):
memo = 0
for j in t:
memo += (i-j)**2
ans = min(memo, ans)
print(ans)
|
n=int(eval(input()))
t = list(map(int,input().split()))
ans = 10000000000
for i in range(-100, 101):
memo = 0
for j in t:
memo += (i-j)**2
ans = min(ans, memo)
print(ans)
|
p04031
|
def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 100**6
for i in range(-100, 101):
tmp = 0
for j in a:
if i == j:
continue
tmp += (j - i)**2
if tmp < ans:
ans = tmp
print(ans)
resolve()
|
def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 10000000
for i in range(-100, 101):
s = 0
for j in a:
s += (i-j)**2
if ans > s:
ans = s
print(ans)
resolve()
|
p04031
|
from math import ceil
n = int(eval(input()))
numeros = [int(x) for x in input().split()]
saida = 2000000000000000
for i in range(min(numeros), max(numeros)+1):
valor = 0
for j in numeros:
valor += (j-i)**2
saida = min(valor, saida)
print(saida)
|
import sys
n = int(eval(input()))
numeros = [int(x) for x in input().split()]
saida = sys.maxsize
for i in range(min(numeros), max(numeros)+1):
valor = 0
for j in numeros:
valor += (j-i)**2
saida = min(valor, saida)
print(saida)
|
p04031
|
N = int(eval(input()))
a = list(map(int, input().split()))
def get_cost(now, target):
return (now - target) * (now - target)
ans = 10000000
for i in range(min(a), max(a) + 1):
cost_sum = 0
for j in a:
cost_sum += get_cost(j, i)
if cost_sum < ans:
ans = cost_sum
print(ans)
|
N = int(eval(input()))
a = list(map(int, input().split()))
mean = int(round(sum(a) / len(a)))
ans = 0
for i in range(len(a)):
ans += (a[i] - mean) ** 2
print(ans)
|
p04031
|
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
a=LI()
ans=10**10
for t in range(-100,101,1):
temp=0
for i in range(N):
temp+=(t-a[i])**2
ans=min(ans,temp)
print(ans)
main()
|
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
a=LI()
ave1=sum(a)//N
ans=[0,0]
for i in range(N):
ans[0]+=(ave1-a[i])**2
ans[1]+=(ave1-a[i]+1)**2
print((min(ans)))
main()
|
p04031
|
N = int(eval(input()))
a = sorted(map(int, input().split()))
cost = 10**9
for y in range(a[0], a[-1]+1):
cost = min(cost, sum([(x-y)**2 for x in a]))
print(cost)
|
N = int(eval(input()))
A = [int(i) for i in input().split()]
che1 = sum(A)//N
che2 = sum(A)//N + 1
ans1 = 0
ans2 = 0
for i in A:
ans1 += (i-che1)**2
ans2 += (i-che2)**2
print((min(ans1, ans2)))
|
p04031
|
n = int(eval(input()))
x = list(map(int,input().split()))
y = round(sum(x)/n)
g = 0
for i in x:
g += (i-y)**2
print(g)
|
n = int(eval(input()))
a = list(map(int,input().split()))
h = round(sum(a)/n)
g = 0
for i in a:
g += abs(h-i)**2
print(g)
|
p04031
|
mini=10**29
n=int(eval(input()))
l=[int(i) for i in input().split()]
for i in range(min(l)-19,max(l)+3):
sm=0
for j in l:
sm+=(i-j)*(i-j)
mini=min(mini,sm)
print(mini)
|
mini=10**29
n=int(eval(input()))
l=[int(i) for i in input().split()]
i = round(sum(l) / n )
for z in range(1):
sm=0
for j in l:
sm+=(i-j)*(i-j)
mini=min(mini,sm)
print(mini)
|
p04031
|
N=int(eval(input()))
*A,=list(map(int,input().split()))
mx=max(A)
mn=min(A)
ans=float('inf')
for i in range(mn,mx+1):
ans=min(ans, sum([(k-i)**2 for k in A]))
print(ans)
|
N=eval(input())
*A,=list(map(int,input().split()))
a=float('inf')
for i in range(min(A),max(A)+1):a=min(a, sum([(k-i)**2 for k in A]))
print(a)
|
p04031
|
from statistics import mean
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
ave = mean(a)
ave = round(ave)
ans =0
for i in a:
ans += (i-ave)**2
print(ans)
if __name__ == "__main__":
main()
|
n = int(eval(input()))
a = list(map(int, input().split()))
ave = round(sum(a)/n)
ans = 0
for i in a:
ans += (ave - i)**2
print(ans)
|
p04031
|
N = int(eval(input()))
a = [int(i) for i in input().split()]
li_ans = []
ans = 0
for j in range(min(a), max(a)):
for k in a:
ans += abs(k - j) ** 2
else:
li_ans.append(ans)
ans = 0
if len(li_ans) == 0:
print((0))
else:
print((min(li_ans)))
|
N = int(eval(input()))
a = [int(i) for i in input().split()]
li_ans = []
ans = 0
for j in range(min(a), max(a)):
for k in a:
ans += abs(k - j) ** 2
li_ans.append(ans)
ans = 0
if len(li_ans) == 0:
print((0))
else:
print((min(li_ans)))
|
p04031
|
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
m = min(A)
M = max(A)
Result = 100000000
for i in range(m, M+1):
Result_tmp = 0
for a in A:
Result_tmp += (a - i) * (a - i)
Result = min(Result_tmp, Result)
print(Result)
if __name__ == "__main__":
main()
|
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
m = min(A)
M = max(A)
Result = 0
for a in A:
Result += (a-m) * (a-m)
for i in range(m+1, M+1):
Result_tmp = 0
for a in A:
Result_tmp += (a - i) * (a - i)
Result = min(Result_tmp, Result)
print(Result)
if __name__ == "__main__":
main()
|
p04031
|
N = int(eval(input()))
a = list(map(int, input().split()))
min = None
for y in range(-100, 101):
sum = 0
for x in a:
sum += abs(x - y) ** 2
if min is None or min > sum:
min = sum
print(min)
|
# https://atcoder.jp/contests/abc043/tasks/arc059_a
n = int(eval(input()))
a = list(map(int, input().split()))
min = float('inf')
for y in range(-100, 101):
sum = 0
for x in a:
sum += (x - y) ** 2
if min > sum:
min = sum
print(min)
|
p04031
|
N=int(eval(input()))
li=list(map(int,input().split()))
ave1=sum(li)//N
ave2=sum(li)//N+1
ave3=sum(li)//N-1
ans1=0
ans2=0
ans3=0
for n in range(len(li)):
ans1+=(li[n]-ave1)**2
ans2+=(li[n]-ave2)**2
ans3+=(li[n]-ave3)**2
print((min(ans1,ans2,ans3)))
|
N=int(eval(input()))
li=list(map(int,input().split()))
ave1=sum(li)//N
ave2=sum(li)//N+1
ans1=0
ans2=0
for n in range(len(li)):
ans1+=(li[n]-ave1)**2
ans2+=(li[n]-ave2)**2
print((min(ans1,ans2)))
|
p04031
|
N = int(eval(input()))
A = list(map(int,input().split()))
cost = []
for n in range(min(A),max(A)+1):
cost.append(sum([(a-n)**2 for a in A]))
print((min(cost)))
|
N = int(eval(input()))
A = list(map(int,input().split()))
m = round(sum(A)/N)
print((sum([(a-m)**2 for a in A])))
|
p04031
|
N = int(eval(input()))
src = list(map(int,input().split()))
ans = 10**9
for i in range(-100,101):
tmp = sum([(a-i)**2 for a in src])
ans = min(ans, tmp)
print(ans)
|
N = int(eval(input()))
src = list(map(int,input().split()))
ans = float('inf')
for n in range(-100,101):
tmp = sum([(n-a)**2 for a in src])
ans = min(ans, tmp)
print(ans)
|
p04031
|
INF = int(1e9 + 7)
def main():
N, *an = list(map(int, open(0).read().split()))
ans = INF
for i in range(min(an), max(an) + 1):
tmp = 0
for ai in an:
tmp += (ai - i) ** 2
ans = min(ans, tmp)
print(ans)
return
main()
|
def main():
N, *an = list(map(int, open(0).read().split()))
print((min(sum((ai - (sum(an) // N)) ** 2 for ai in an),
sum((ai + (-sum(an) // N)) ** 2 for ai in an))))
return
main()
|
p04031
|
import statistics
am = int(eval(input()))
n_l = list(map(int, input().split(' ')))
m = round(statistics.mean(n_l))
S = 0
for a in range(am):
S += (n_l[a] - m)**2
print((int(S)))
|
am = int(eval(input()))
n_l = list(map(int, input().split(' ')))
m = round(sum(n_l)/len(n_l))
S = 0
for a in range(am):
S += (n_l[a] - m)**2
print((int(S)))
|
p04031
|
n = int(eval(input()))
a=list(map(int,input().split()))
#print(a)
amin = min(a)
amax = max(a)
min_sum=10**8
for x in range(amin,amax+1):
sum_for_x = sum([(y-x)**2 for y in a])
if sum_for_x < min_sum:
min_sum = sum_for_x
print(min_sum)
|
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 4 18:19:03 2018
@author: maezawa
"""
n = int(eval(input()))
a = list(map(int, input().split()))
mean_a = round(sum(a)/n)
ans = 0
for i in a:
ans += (i-mean_a)**2
print(ans)
|
p04031
|
n=int(eval(input()))
a=list(map(int,input().split()))
res = float('inf')
for i in range(-100,101):
tmp = 0
for j in a:
tmp += (j-i)**2
res = min(res,tmp)
print(res)
|
n = int(eval(input()))
a = list(map(int,input().split()))
res = float('inf')
for i in range(-100,101):
tmp = 0
for j in a:
tmp += (i-j)**2
res = min(res,tmp)
print(res)
|
p04031
|
# coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
if b:
print("yes")
else:
print("no")
def Yn(b):
if b:
print("Yes")
else:
print("No")
def YN(b):
if b:
print("YES")
else:
print("NO")
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
self.rank=[0]*n
def find(self,x):
if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
return self.P[x]
def same(self,x,y):
return self.find(x)==self.find(y)
def link(self,x,y):
if self.rank[x]<self.rank[y]:
self.P[x]=y
elif self.rank[y]<self.rank[x]:
self.P[y]=x
else:
self.P[x]=y
self.rank[y]+=1
def unite(self,x,y):
self.link(self.find(x),self.find(y))
def size(self):
S=set()
for a in range(self.n):
S.add(self.find(a))
return len(S)
def is_pow(a,b):#aはbの累乗数か
now=b
while now<a:
now*=b
if now==a:return True
else:return False
def getbin(num,size):
A=[0]*size
for a in range(size):
if (num>>(size-a-1))&1==1:
A[a]=1
else:
A[a]=0
return A
def get_facs(n,mod_=0):
A=[1]*(n+1)
for a in range(2,len(A)):
A[a]=A[a-1]*a
if(mod_>0):A[a]%=mod_
return A
def comb(n,r,mod,fac):
if(n-r<0):return 0
return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
x=num&(-num)
y=num+x
z=num&(~y)
z//=x
z=z>>1
num=(y|z)
if(num>=(1<<size)):return False
else:return num
def get_primes(n,type="int"):
if n==0:
if type=="int":return []
else:return [False]
A=[True]*(n+1)
A[0]=False
A[1]=False
for a in range(2,n+1):
if A[a]:
for b in range(a*2,n+1,a):
A[b]=False
if(type=="bool"):return A
B=[]
for a in range(n+1):
if(A[a]):B.append(a)
return B
def is_prime(num):
if(num<=1):return False
i=2
while i*i<=num:
if(num%i==0):return False
i+=1
return True
def ifelse(a,b,c):
if a:return b
else:return c
def join(A,c=""):
n=len(A)
A=list(map(str,A))
s=""
for a in range(n):
s+=A[a]
if(a<n-1):s+=c
return s
def factorize(n,type_="dict"):
b = 2
list_ = []
while b * b <= n:
while n % b == 0:
n //= b
list_.append(b)
b+=1
if n > 1:list_.append(n)
if type_=="dict":
dic={}
for a in list_:
if a in dic:
dic[a]+=1
else:
dic[a]=1
return dic
elif type_=="list":
return list_
else:
return None
def pm(x):
return x//abs(x)
def inputintlist():
return list(map(int,input().split()))
######################################################################################################
def main():
n=int(eval(input()))
A=inputintlist()
ans=inf
for a in range(-100,101):
x=0
for b in A:
x+=(a-b)**2
ans=min(ans,x)
print(ans)
main()
|
# coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
if b:
print("yes")
else:
print("no")
def Yn(b):
if b:
print("Yes")
else:
print("No")
def YN(b):
if b:
print("YES")
else:
print("NO")
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
self.rank=[0]*n
def find(self,x):
if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
return self.P[x]
def same(self,x,y):
return self.find(x)==self.find(y)
def link(self,x,y):
if self.rank[x]<self.rank[y]:
self.P[x]=y
elif self.rank[y]<self.rank[x]:
self.P[y]=x
else:
self.P[x]=y
self.rank[y]+=1
def unite(self,x,y):
self.link(self.find(x),self.find(y))
def size(self):
S=set()
for a in range(self.n):
S.add(self.find(a))
return len(S)
def is_pow(a,b):#aはbの累乗数か
now=b
while now<a:
now*=b
if now==a:return True
else:return False
def getbin(num,size):
A=[0]*size
for a in range(size):
if (num>>(size-a-1))&1==1:
A[a]=1
else:
A[a]=0
return A
def get_facs(n,mod_=0):
A=[1]*(n+1)
for a in range(2,len(A)):
A[a]=A[a-1]*a
if(mod_>0):A[a]%=mod_
return A
def comb(n,r,mod,fac):
if(n-r<0):return 0
return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
x=num&(-num)
y=num+x
z=num&(~y)
z//=x
z=z>>1
num=(y|z)
if(num>=(1<<size)):return False
else:return num
def get_primes(n,type="int"):
if n==0:
if type=="int":return []
else:return [False]
A=[True]*(n+1)
A[0]=False
A[1]=False
for a in range(2,n+1):
if A[a]:
for b in range(a*2,n+1,a):
A[b]=False
if(type=="bool"):return A
B=[]
for a in range(n+1):
if(A[a]):B.append(a)
return B
def is_prime(num):
if(num<=1):return False
i=2
while i*i<=num:
if(num%i==0):return False
i+=1
return True
def ifelse(a,b,c):
if a:return b
else:return c
def join(A,c=""):
n=len(A)
A=list(map(str,A))
s=""
for a in range(n):
s+=A[a]
if(a<n-1):s+=c
return s
def factorize(n,type_="dict"):
b = 2
list_ = []
while b * b <= n:
while n % b == 0:
n //= b
list_.append(b)
b+=1
if n > 1:list_.append(n)
if type_=="dict":
dic={}
for a in list_:
if a in dic:
dic[a]+=1
else:
dic[a]=1
return dic
elif type_=="list":
return list_
else:
return None
def pm(x):
return x//abs(x)
def inputintlist():
return list(map(int,input().split()))
######################################################################################################
def main():
n=int(eval(input()))
A=inputintlist()
ans=inf
for i in range(0,2):
a=sum(A)//len(A)+i
x=0
for b in A:
x+=(a-b)**2
ans=min(ans,x)
print(ans)
main()
|
p04031
|
n = int(eval(input()))
a = list(map(int, input().split()))
cost = [0] * 201
for i in range(201):
for j in a:
cost[i] += ((i - 100) - j) ** 2
print((min(cost)))
|
n = int(eval(input()))
A = [int(i) for i in input().split()]
ave = round(sum(A) / n)
ans = 0
for x in A:
ans += (x-ave)**2
print(ans)
|
p04031
|
N=int(eval(input()))
A=list(map(int,input().split()))
st=int(sum(A)/len(A))
go=st+1
ans=10**9+1
for i in range(st,go+1):
val=0
for a in A:
val+=(a-i)**2
ans=min(ans,val)
print(ans)
|
N=int(eval(input()))
A=list(map(int,input().split()))
ans=10**9+1
for i in (0,1):
val=0
for a in A:
val+=(a-int(sum(A)/len(A))-i)**2
ans=min(ans,val)
print(ans)
|
p04031
|
def c_be_together(N, A):
a_sum = sum(A)
option = (a_sum // N, (a_sum + N - 1) // N)
ans = float('inf')
for opt in option:
ans = min(ans, sum([(a - opt)**2 for a in A]))
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_be_together(N, A)))
|
def c_be_together(N, A):
a_sum = sum(A)
option = (a_sum // N, (a_sum + N - 1) // N) # 平均値の小数切り捨て|切り上げ
ans = min(sum([(a - opt)**2 for a in A]) for opt in option) # コストを計算
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_be_together(N, A)))
|
p04031
|
n = eval(input())
a = list(map(int, input().split()))
ans = list()
for i in range(min(a), max(a)+1):
cost = 0
for num in a:
cost += (num - i)**2
ans.append(cost)
print((min(ans)))
|
def cost(x):
cost = (x - ave)**2
return cost
n = eval(input())
a = list(map(int, input().split()))
ave = round(sum(a)/int(n))
print((sum(list(map(cost, a)))))
|
p04031
|
import math
n = int(eval(input()))
a = math.sqrt(n)
if n % a == 0.0:
b = int(math.log10(a)) + 1
print(b)
else:
a = int(a)
while n % a != 0:
a = a + 1
b = int(math.log10(a)) + 1
print(b)
|
import math
n = int(eval(input()))
a = math.sqrt(n)
if n % a == 0.0:
b = int(math.log10(a)) + 1
print(b)
else:
a = int(a)
for i in range(a, 0, -1):
if n % i == 0:
a = n / i
break
b = int(math.log10(a)) + 1
print(b)
|
p03775
|
import math
def cal(N):
num=math.ceil(N**0.5)
num=int(num)
for i in range(num,N+1):
if N%i==0:
x=len(str(i))
break
return x
print((cal(int(eval(input())))))
|
def cal(N):
num=(N**0.5)//1
num=int(num)
for i in range(num,0,-1):
if N%i==0:
k=int(N/i)
x=len(str(k))
break
return x
print((cal(int(eval(input())))))
|
p03775
|
import math
num = int(eval(input()))
num_sqrt = int(math.sqrt(num))
A = num_sqrt
while num % A != 0:
A += 1
B = int(num / A)
A, B = str(A), str(B)
ans = max(len(A), len(B))
print(ans)
|
import math
num = int(eval(input()))
num_sqrt = int(math.sqrt(num))
ans = 11
for A in range(1, num_sqrt+1):
if num % A == 0:
B = int(num / A)
A, B = str(A), str(B)
now_ans = max(len(A), len(B))
ans = min(ans, now_ans)
print(ans)
|
p03775
|
N=int(eval(input()))
result=0
count = 1
while count*count <= N:
if N % count == 0:
result=count
count+=1
print((len(str(N//result))))
|
n,r=int(eval(input())),1e9
for i in range(1,int(n**.5)+1):
if n%i==0: r=min(r,max(len(str(i)),len(str(n//i))))
print(r)
|
p03775
|
n,r=int(eval(input())),1e9
for i in range(1,int(n**.5)+1):
if n%i==0: r=min(r,max(len(str(i)),len(str(n//i))))
print(r)
|
n,r=int(eval(input())),1e9
for i in range(1,int(n**.5)+1):
if n%i==0: r=min(r,len(str(n//i)))
print(r)
|
p03775
|
n,r=int(eval(input())),1e9
for i in range(1,int(n**.5)+1):
if n%i==0:r=min(r,len(str(n//i)))
print(r)
|
n,r=int(eval(input())),1e9
print((min([len(str(n//i)) for i in range(1,int(n**.5)+1) if n%i==0])))
|
p03775
|
def digit(n):
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
N = int(eval(input()))
check = 100
for i in range(1, 1+N):
if N % i != 0:
continue
if N // i < i:
break
j = N // i
f = max(digit(i), digit(j))
check = min(check, f)
print(check)
|
def digit(n):
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
N = int(eval(input()))
check = 100
for i in range(1, int(1e6)):
if N % i != 0:
continue
if N // i < i:
break
j = N // i
f = max(digit(i), digit(j))
check = min(check, f)
print(check)
|
p03775
|
import math
n=int(eval(input()))
x=1
while(x<=n**0.5):
if(n%x!=0):
x+=1
else:
mins=int(math.log10(n//x))
x+=1
print((mins+1))
|
import math
import sys
n=int(eval(input()))
mi=int(math.log10(n))
nb=n
m=1
for i in range(1,int(nb**0.5)+2):
if(n%i==0):
mi=min(mi,max(int(math.log10(n/i)),int(math.log10(i))))
print((mi+1))
|
p03775
|
import math
number = int(eval(input()))
ruijou = int(math.sqrt(number))
check = 0
count = 0
result =100000000000
for i in range(1,int(ruijou)+1):
if number % i == 0:
check = int(number / i)
while not check == 0:
check = int(check / 10)
count += 1
if count < result :
result = count
count = 0
print(result)
|
n = int(eval(input()))
a,b,c = 0,0,float("Inf")
for i in range(1,int(n**0.5)+1):
if n % i == 0:
a = max(i,n//i)
b = 0
while not a == 0:
a //= 10
b += 1
c = min(c,b)
print(c)
|
p03775
|
n = int(eval(input()))
mul_list = []
for i in range(1, n+1):
if n % i == 0:
if i <= n / i:
mul = [i, n/i]
mul_list.append(mul)
else:
break
length = 10000000000000
result = 0
for line in mul_list:
dif = len(str(line[1]))-len(str(line[0]))
if dif < length:
result = len(str(int(line[1])))
print(result)
|
n = int(eval(input()))
mul_list = []
for i in range(1, n+1):
if i <= n / i:
if n % i == 0:
mul = [i, n/i]
mul_list.append(mul)
else:
break
length = 10000000000000
result = 0
for line in mul_list:
dif = len(str(line[1]))-len(str(line[0]))
if dif < length:
result = len(str(int(line[1])))
print(result)
|
p03775
|
N = int(eval(input()))
a = 1
i = 2
while i * i <= N:
if N % i == 0:
a = i
i += 1
b = N // a
print((max(len(str(a)), len(str(b)))))
|
N = int(eval(input()))
ans = 11
a = 1
i = 1
while i * i <= N:
if N % i == 0:
a = i
b = N//a
ans = min(ans, len(str((max(a,b)))))
i += 1
print(ans)
|
p03775
|
import math
N = int(eval(input()))
A = int(math.sqrt(N))
for i in range(A, N + 1):
if N % i == 0 or len(str(i)) == len(str(N)):
print((len(str(i))))
break
|
import math
N = int(eval(input()))
for i in range(int(math.sqrt(N)) + 1, 0, -1):
q, m = divmod(N, i)
if m == 0:
print((len(str(q))))
break
|
p03775
|
N = int(eval(input()))
min_f = len(str(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)
|
import math
N = int(eval(input()))
min_f = len(str(N))
for a in range(1, int(math.sqrt(N)) + 1):
if N % a != 0:
continue
b = int(N / a)
f = max(len(str(a)), len(str(b)))
if min_f > f:
min_f = f
print(min_f)
|
p03775
|
def F(a, b):
count = 0
c = max(a, b)
while c >= 10:
c = c / 10
count += 1
return count+1
N = int(eval(input()))
minimum = 15
for num in range(1,int(N/(10**5))+10**5+1):
if N % num == 0:
minimum = min(minimum, F(num, N/num))
print(minimum)
|
def F(a, b):
count = 0
c = max(a, b)
while c >= 10:
c = c / 10
count += 1
return count+1
N = int(eval(input()))
minimum = 15
for num in range(1,10**5+1):
if N % num == 0:
minimum = min(minimum, F(num, N/num))
print(minimum)
|
p03775
|
def F(a, b):
count = 0
c = max(a, b)
while c >= 10:
c = c / 10
count += 1
return count+1
N = int(eval(input()))
minimum = 15
for num in range(1,10**5+1):
if N % num == 0:
minimum = min(minimum, F(num, N/num))
print(minimum)
|
def F(a, b):
count = 0
c = max(a, b)
while c >= 10:
c = c / 10
count += 1
return count+1
N = int(eval(input()))
minimum = 15
for num in range(1,int(N**0.5)+1):
if N % num == 0:
minimum = min(minimum, F(num, N/num))
print(minimum)
|
p03775
|
N=int(eval(input()))
import math
rootN=math.sqrt(N)
if rootN==int(rootN):
n=int(rootN)
else:
for m in range(int(rootN)+1,N+1):
if N%m==0:
n=m
break
print((len(str(n))))
|
N=int(eval(input()))
import math
rootN=math.sqrt(N)
if rootN==int(rootN):
n=int(rootN)
else:
for m in reversed(list(range(1,int(rootN)+1))):
if N%m==0:
n=int(N/m)
break
print((len(str(n))))
|
p03775
|
import math
n=int(eval(input()))
a=int(math.sqrt(n))
if n%2 != a%2: a+=1
while n%a != 0:a+=2
b=int(n/a)
a_dig = len(str(a))
b_dig = len(str(b))
ans=max(a_dig,b_dig)
print(ans)
|
import math
n = int(eval(input()))
nn = int(math.sqrt(n))
while n%nn != 0: nn-=1
ans = len(str(n//nn))
print(ans)
|
p03775
|
import math
n = int(eval(input()))
nn = int(math.sqrt(n))
while n%nn != 0: nn+=1
ans = len(str(nn))
print(ans)
|
import math
n = int(eval(input()))
nn = int(math.sqrt(n))
while n%nn != 0: nn-=1
ans = len(str(n//nn))
print(ans)
|
p03775
|
N = int(eval(input()))
v = round(N ** 0.5)
while N % v != 0:
v += 1
print((len(str(v))))
|
N = int(eval(input()))
v = round(N ** 0.5)
while N % v != 0:
v -= 1
print((len(str(N // v))))
|
p03775
|
N = int(eval(input()))
def func(n):
return 11 if (N % n > 0) else len(str(N // n))
nn = min(list(range(1, int(N**(0.5) + 1))), key=func)
ans = len(str(N // nn))
print(ans)
|
def main():
N = int(eval(input()))
n = int(N**(0.5) + 1)
while N % n > 0:
n -= 1
print((len(str(N // n))))
if __name__ == '__main__':
main()
|
p03775
|
import sys
import itertools
input = sys.stdin.readline
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in range(N)]
def main():
N = int(eval(input()))
for i in range(int(N ** 0.5), N + 1):
if N % i == 0:
print((len(str(i))))
break
if __name__ == "__main__":
main()
|
import sys
import itertools
input = sys.stdin.readline
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in range(N)]
def main():
N = int(eval(input()))
for i in range(int(N ** 0.5), 0, -1):
if N % i == 0:
print((len(str(N // i))))
break
if __name__ == "__main__":
main()
|
p03775
|
from itertools import combinations
from functools import reduce
from operator import mul
def prime_dec(n):
i = 2
table = []
while i * i <= n:
while n % i == 0:
n /= i
table.append(int(i))
i += 1
if n > 1:
table.append(n)
return table
n = int(eval(input()))
ps = prime_dec(n)
ps = [1] if len(ps) == 0 else ps
ps_com = []
for i in range(len(ps)):
ps_com += set(combinations(ps, i+1))
divs = [reduce(mul, k) for k in ps_com if not len(k) == 0]
divs_twin = [(k, int(n/k)) for k in divs]
divs_twin = set(divs_twin)
divs_twin_len = [max(len(str(k[0])) ,len(str(k[1]))) for k in divs_twin]
print((min(divs_twin_len)))
|
from math import floor
def main():
n = int(eval(input()))
nsq = floor(n ** 0.5)
r = 11
for nsqe in range(nsq, 0, -1):
if n % nsqe == 0:
rt = max(len(str(nsqe)), len(str(n // nsqe)))
r = min(r, rt)
print(r)
if __name__ == '__main__':
main()
|
p03775
|
from math import floor
def main():
n = int(eval(input()))
nsq = floor(n ** 0.5)
r = 11
for nsqe in range(nsq, 0, -1):
if n % nsqe == 0:
rt = max(len(str(nsqe)), len(str(n // nsqe)))
r = min(r, rt)
print(r)
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import sqrt, ceil, log10
def main():
n = int(eval(input()))
sqrtn = ceil(sqrt(n))
r = n
for i1 in range(1, sqrtn + 1):
if n % i1 == 0:
t1 = log10(i1)
t2 = log10(n//i1)
t = max(t1, t2) + 1
r = min(r, t)
print((int(r)))
if __name__ == '__main__':
main()
|
p03775
|
import math
N=int(eval(input()))
Candidate=-(-math.sqrt(N)//1)
while N%Candidate!=0:
if Candidate>N:
break
Candidate+=1
print((len(str(Candidate))-2))
|
import math
N=int(eval(input()))
Candidate=-(-math.sqrt(N)//1)
while N%Candidate!=0:
Candidate-=1
Candidate=N/Candidate
print((len(str(Candidate))-2))
|
p03775
|
import math
N = int(eval(input()))
sqrt = math.floor(math.sqrt(N))
ans = 10
for A in range(1,sqrt+1):
n = 0
if N % A != 0:
continue
B = N / A
while not B == 0:
n += 1
B //= 10
ans = min(ans, n)
print(ans)
|
N = int(eval(input()))
f = lambda x,y:len(str(x)) if x > y else len(str(y))
from math import floor, sqrt
ans = len(str(N))
for a in range(1,floor(sqrt(N))+1):
if N % a == 0:
ans = min(ans, f(a,N//a))
print(ans)
|
p03775
|
def func(num):
cnt=0
while(num>0):
num=int(num/10)
cnt+=1
return cnt
N=int(eval(input()))
ans=100
for i in range(1,int(N**(1/2)+1)):
tmp=100
if(N%i==0):
tmp=max(func(i),func(N/i))
ans=min(ans,tmp)
print(ans)
|
#数字の桁を求める関数
def func(num):
cnt=0
while(num>0):
num=int(num/10)
cnt+=1
return cnt
N=int(eval(input()))
ans=100
#約数全列挙 O(sqrt(N))でできるので間に合う
for i in range(1,int(N**(1/2)+1)):
#tmpは桁数が入るので最初大きめで持っておく
tmp=100
if(N%i==0):
#問題文通り比較
tmp=max(func(i),func(N/i))
ans=min(ans,tmp)
print(ans)
|
p03775
|
def countDigs(n):
digs = 0
while n > 0:
digs += 1
n = n // 10
return digs
def digs(n):
for i in range(int((n + 0.1) ** 0.5), int(n // 2) + 1):
if (n % i == 0):
print((countDigs(i)))
return
print((countDigs(n)))
digs(int(eval(input())))
|
def countDigs(n):
digs = 0
while n > 0:
digs += 1
n = n // 10
return digs
# def calcUpperLimit(n):
# x = 1
# if (n <= x**2):
# return int(n // 2) + 1
# for i in range(x, 0, -1):
# if (n % x == 0):
# return n // x + 1
# return int(n // 2) + 1
# def digs(n):
# for i in range(int((n + 0.1) ** 0.5), calcUpperLimit(n)):
# if (n % i == 0):
# print(countDigs(i))
# return
# print(countDigs(n))
def digs(n):
for i in range(int((n + 0.1) ** 0.5), 0, -1):
if n % i == 0:
print((countDigs(n // i)))
return
digs(int(eval(input())))
|
p03775
|
n=int(eval(input()))
ans=10**5
x=int(n**0.5)
for i in range(x,0,-1):
if n%i==0:
y=n//i
ans=min(ans,len(str(y)))
print(ans)
|
n=int(eval(input()))
x=int(n**0.5)
for i in range(x,0,-1):
if n%i==0:
y=n//i
print((len(str(y))))
exit()
|
p03775
|
import math
n=int(eval(input()))
ans=10
for i in range(1,int(math.sqrt(n))+1):
if n%i==0:
b=int(n/i)
f=max(len(str(i)),len(str(b)))
ans=min(f,ans)
print(ans)
|
import math
n=int(eval(input()))
ans=100
for a in range(1,int(math.sqrt(n))+1):
if n%a==0:
m=max(len(str(a)),len(str(n//a)))
ans=min(ans,m)
print(ans)
|
p03775
|
import math
n=int(eval(input()))
lim=math.ceil(math.sqrt(n))
cnt=0
rec=0
for i in range(lim, n+1):
if n%i==0:
print((len(str(i))))
exit()
if n%(i+1-lim)==0 and cnt==0:
rec=n/(i+1-lim)
cnt+=1
if i>=rec:
print((len(str(rec))))
exit()
|
n=int(eval(input()))
l=int((n**0.5))+1
ans=n
for i in range(1, l+1):
if n%i==0:
ans=min(ans, len(str(n//i)))
print(ans)
|
p03775
|
import math
n = int(eval(input()))
a = int(math.sqrt(n))
for i in range(a, n + 1):
if n % i == 0:
print((len(str(i))))
exit()
|
import math
n = int(eval(input()))
a = int(math.sqrt(n))
for i in range(a + 1, 0, -1):
if n % i == 0:
# print(n // i, i)
print((max(len(str(i)), len(str(n // i)))))
exit()
|
p03775
|
import math
N = int(eval(input()))
def cnt_digits(N):
ctr = 0
while N>0:
N = int(N/10)
ctr += 1
return ctr
ans = cnt_digits(N)
for i in range(1, int(math.sqrt(N)+1)):
if N%i != 0: continue
B = int(N/i)
cur = max(cnt_digits(i),cnt_digits(B))
if (ans>cur):
ans=cur
print(ans)
|
import math
N=int(eval(input()))
ans=len(str(N))
for A in range(1, int(math.sqrt(N)+1)):
if N%A != 0: continue
B = int(N/A)
cur = max(len(str(A)),len(str(B)))
ans = min(ans,cur)
print(ans)
|
p03775
|
def main():
n = int(eval(input()))
m = 1
k = int(n ** 0.5)
ans = len(str(n))
for i in range(k + 1, 0, -1):
if n % i == 0:
n = n // i
m *= i
tmp = max(len(str(m)), len(str(n)))
ans = min(ans, tmp)
print(ans)
if __name__ == '__main__':
main()
|
def main():
n = int(eval(input()))
m = 1
k = int(n ** 0.5)
ans = len(str(n))
for i in range(k + 1, 0, -1):
if n % i == 0:
n = n // i
m *= i
tmp = max(len(str(m)), len(str(n)))
ans = min(ans, tmp)
break
print(ans)
if __name__ == '__main__':
main()
|
p03775
|
#n 10**10
#sqrtn 10**5
ans=10**6
n=int(eval(input()))
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans=min(len(str(n//i)),ans)
print(ans)
|
def F(a,b):
return max(len(str(a)),len(str(b)))
n=int(eval(input()))
ans=10**15
for i in range(1,int(n**0.5)+1):
if n%i==0:
a=i
b=n//i
ans=min(ans,F(a,b))
print(ans)
|
p03775
|
n = int(eval(input()))
min_f = 10
for i in range(1, n + 1):
if i ** 2 > n:
break
if n % i != 0:
continue
min_seq = max(len(str(i)), len(str(n // i)))
if min_seq < min_f:
min_f = min_seq
print(min_f)
|
n = int(eval(input()))
n_sqrt = int(n ** 0.5) + 1
ans = float('inf')
for i in range(1, n_sqrt + 1):
if n % i == 0:
j = int(n // i)
max_len = max(len(str(i)), len(str(j)))
ans = min(max_len, ans)
print(ans)
|
p03775
|
import math
# input
N = int(eval(input()))
i = int(math.sqrt(N))
while i > 0:
if N % i == 0:
print((len(str(N // i))))
break
else:
i -= 1
|
import math
# input
N = int(eval(input()))
i = int(math.sqrt(N))
while i:
if N % i == 0:
print((len(str(N // i))))
break
else:
i -= 1
|
p03775
|
n=int(eval(input()))
import math
ans=[]
ans_i=[]
for i in range(1,int(math.sqrt(n))+1):
if n%i==0:
ans.append(i)
ans_i.append(n//i)
v=max(ans[0],ans_i[0])
x=max(ans[-1],ans_i[-1])
print((len(str(min(v,x)))))
|
n=int(eval(input()))
a=[]
b=[]
import math
for i in range(1,math.ceil(math.sqrt(n)+1)):
if n%i==0:
a.append(i)
b.append(n//i)
c=[]
for i in range(len(a)):
c.append(max(a[i],b[i]))
d=str(min(c))
print((len(d)))
|
p03775
|
# C - Digits in Multiplication
N = int(eval(input()))
A = int(N**0.5)
ans = 1
for i in range(A,N):
if N % i == 0:
ans = len(str(i))
break
else:
ans = len(str(i))
print(ans)
|
# C - Digits in Multiplication
N = int(eval(input()))
A = int(N**0.5)
# print(A)
ans = 1
for i in range(A,0,-1):
if N % i == 0:
tmp = N / i
ans = len(str(int(tmp)))
break
else:
pass
print(ans)
|
p03775
|
n = int(eval(input()))
import math
root = math.ceil(math.sqrt(n))
for i in range(n):
if n%(root+i)==0:
print((len(str(root+i))))
break
|
n = int(eval(input()))
import math
root = math.ceil(math.sqrt(n))
for i in range(1,root+1):
if n%i==0:
ans = n//i
print((len(str(ans))))
|
p03775
|
from math import sqrt
n=int(eval(input()))
ans=[]
k=int(sqrt(n))
for i in range(1,k+1):
if n%i==0:
ans.append(len(str(int(n/i))))
ans.sort()
print((ans[0]))
|
def c(num):
cnt=0
while num>0:
num//=10
cnt+=1
return cnt
def main():
n=int(eval(input()))
ans=10**10
for i in range(1,int(n**0.5)+1):
if n%i!=0:
continue
b=n//i
ret=max(c(i),c(b))
if ans>ret:
ans=ret
print(ans)
main()
|
p03775
|
import math
n = int(eval(input()))
m = math.ceil(math.sqrt(n))
min_f = float('inf')
for i in range(1, m+1):
x = n/i
if x.is_integer():
x = int(x)
i = int(i)
f = max(len(str(i)), len(str(x)))
if min_f > f:
min_f = f
print(min_f)
|
n = int(eval(input()))
def make_divisors(n):
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)
#divisors.sort(reverse=True)
return divisors
d = make_divisors(n)
ans = 10**18
for a in d:
b = n//a
a = str(a)
b = str(b)
ans = min(ans, max(len(a), len(b)))
print(ans)
|
p03775
|
N = int(eval(input()))
ans1 = 0
A = '1'
B = str(N)
if len(A)>=len(B):
ans = len(A)
else:
ans = len(B)
for i in range(2,N+1):
A = i
if N%A==0:
B = int(N / A)
A = str(A)
B = str(B)
# print(A, B)
if len(A)>=len(B):
ans1 = len(A)
else:
ans1 = len(B)
if ans1 <= ans:
ans = ans1
if len(str(A))==len(str(B)):
break
print(ans)
|
import math
N = int(eval(input()))
ans1 = 0
A = '1'
B = str(N)
if len(A)>=len(B):
ans = len(A)
else:
ans = len(B)
for i in range(2,int(math.sqrt(N)+1)):
A = i
if N%A==0:
B = int(N / A)
A = str(A)
B = str(B)
# print(A, B)
if len(A)>=len(B):
ans1 = len(A)
else:
ans1 = len(B)
if ans1 <= ans:
ans = ans1
if len(str(A))==len(str(B)):
break
print(ans)
|
p03775
|
n = int(eval(input()))
element = []
i = 1
while i * i <= n:
if n % i == 0:
element.append([len(str(i)),len(str(n//i))])
i += 1
ans = max(element[0][0],element[0][1])
for i in range(len(element)):
ans = min(max(element[i][0],element[i][1]),ans)
print(ans)
|
n = int(eval(input()))
e = []
i = 1
while i * i <= n:
if n % i == 0:
e.append([str(i),str(n//i)])
i += 1
ans = 10**9
for i in range(len(e)):
ans = min(max(len(e[i][1]),len(e[i][0])),ans)
print(ans)
|
p03775
|
import math
n = int(eval(input()))
for i in range(int(math.sqrt(n)),n+1,1):
if n%i==0:
break
print((len(str(i))))
|
import math
n = int(eval(input()))
for i in range(int(math.sqrt(n)),0,-1):
if n%i==0:
a=n//i
# print(i)
print((max(len(str(i)),len(str(a)))))
break
|
p03775
|
n=int(eval(input()))
l=[]
t=int(n**0.5)
while len(l)==0:
if n%t==0:
l.append((t,n//t))
t+=1
x,y=l[0][0],l[0][1]
ans=max(len(list(str(x))),len(list(str(y))))
print(ans)
|
n=int(eval(input()))
l=[]
t=int(n**0.5)
while len(l)==0:
if n%t==0:
l.append((t,n//t))
t-=1
x,y=l[0][0],l[0][1]
ans=max(len(list(str(x))),len(list(str(y))))
print(ans)
|
p03775
|
def f(a,b):
return max(len(str(a)),len(str(b)))
N = int(eval(input()))
n = N
ans = N
for _ in range(1,int(n/2)+1):
if n % _ == 0:
# print("{}: {} {}".format(f(_,N/_),_,int(N/_)))
if ans >= f(_,int(N/_)):
ans = f(_,int(N/_))
else:
break
print(ans)
|
import math
def f(a,b):
return max(len(str(a)),len(str(b)))
N = int(eval(input()))
n = N
ans = N
for _ in range(1,int(math.sqrt(n))+1):
if n % _ == 0:
# print("{}: {} {}".format(f(_,N/_),_,int(N/_)))
if ans >= f(_,int(N/_)):
ans = f(_,int(N/_))
else:
break
print(ans)
|
p03775
|
N=int(eval(input()))
ans=10
for A in range(1,int(N**0.5)+1):
if N/A==int(N/A):
ans=min(ans,len(str(int(N/A))))
print(ans)
|
N = int(eval(input()))
def F(A, B):
return max(len(str(A)), len(str(B)))
ans = 10**30
for i in range(1, int(N**0.5)+1):
if N % i == 0:
ans = min(ans, F(i, N//i))
print(ans)
|
p03775
|
n=int(eval(input()));ans=10
for i in range(min(10**5,n)):
if n%(i+1)==0:ans=min(ans,max(len(str(i+1)),len(str(n//(i+1)))))
print(ans)
|
n=int(eval(input()))
ans=inf=float('inf')
for i in range(1,int(n**0.5)+1):
if n%i:continue
ans=max(len(str(n%i)),len(str(n//i)))
print(ans)
|
p03775
|
import math
n = int(eval(input()))
k = int(math.sqrt(n))
for i in range(k,n+1):
if n%i == 0:
a = i
break
s = len(str(a))
print(s)
|
import math
n = int(eval(input()))
k = int(math.sqrt(n))
for i in range(k+2,0,-1):
if n%i == 0:
a = n//i
break
s = len(str(a))
print(s)
|
p03775
|
n=int(eval(input()))
ans=float('inf')
for i in range(1,int(n**0.5)+1):
if n%i ==0:
x=len(str(i))
y=len(str(n//i))
z=max(x,y)
if ans > z:
ans=z
print(ans)
|
n=int(eval(input()))
ans=float('inf')
for i in range(1,int(n**0.5)+1):
if n%i == 0:
x=len(str(i))
y=len(str(n//i))
z=max(x,y)
ans=min(z,ans)
print(ans)
|
p03775
|
n = int(eval(input()))
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n**0.5)+1):
if n%i == 0:
return False
return True
if is_prime(n):
ans = len(str(n))
else:
x = int(n**0.5)
while n%x!=0:
x += 1
y = n//x
ans = max(len(str(x)), len(str(y)))
print(ans)
|
n = int(eval(input()))
x = round(n**0.5)
while n%x!=0:
x -= 1
y = n//x
print((len(str(max(x,y)))))
|
p03775
|
n = int(eval(input()))
x = int(n**0.5)
while n%x!=0:
x += 1
y = n//x
print((len(str(max(x,y)))))
|
n = int(eval(input()))
x = int(n**0.5)
while n%x != 0:
x -= 1
print((max(len(str(x)), len(str(n//x)))))
|
p03775
|
import sys
n = int(sys.stdin.readline().rstrip())
def main():
a = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
a = i
b = n // a
ans = len(str(b))
return ans
if __name__ == '__main__':
ans = main()
print(ans)
|
import sys
def divisors(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i: continue
res.append(i)
return res
n = int(sys.stdin.readline().rstrip())
def main():
res = divisors(n)
print((len(str(n // res[-1]))))
if __name__ == '__main__':
main()
|
p03775
|
import math
N = int(eval(input()))
p, q, r = 1, 1, N
if N % 2 == 0:
p = 2
q = 3
n = int(math.sqrt(N))
while q <= n:
if N % q == 0:
p = q
q += 1
num = str(max(p, N//p))
ans = len(num)
print(ans)
|
import math
N = int(eval(input()))
p, q, r = 1, 1, N
if N % 2 == 0:
p = 2
q = 3
n = int(math.sqrt(N))
while q <= n:
if N % q == 0:
p = q
q += 1
ans = len(str(N//p))
print(ans)
|
p03775
|
from math import sqrt
N = int(eval(input()))
n = int(sqrt(N)) + 10
def f(A, B):
a = len(str(A))
b = len(str(B))
return max(a, b)
ans = 10 ** 10
for i in range(1, n):
if (N//i) * i == N:
ans = min(ans, f(i, N//i))
print (ans)
|
N = int(eval(input()))
def make_divisors(n):
import math
divisors = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0: #割り切れるとき
divisors.append(i)
if i != n//i:
divisors.append(n//i)
divisors.sort()
return divisors
def F(A, B):
return max(len(str(A)), len(str(B)))
lst = make_divisors(N)
ans = 10 ** 18
for a in lst:
b = N // a
ans = min(ans, F(a, b))
print (ans)
|
p03775
|
n = int(eval(input()))
if n == 1:
print((1))
exit()
a = 1
b = n
for i in range(1, 10**10):
if n % i == 0:
if i > n // i:
print((min(len(str(i)), len(str(b)))))
exit()
a = i
b = n // i
|
n = int(eval(input()))
if n == 1:
print((1))
exit()
a = 1
b = n
for i in range(1, 10**5):
if n % i == 0:
if i > n // i:
print((min(len(str(i)), len(str(b)))))
exit()
a = i
b = n // i
print((len(str(b))))
|
p03775
|
n = int(eval(input()))
tmp = n
for x in range(1, n+1):
y = n//x
if x > y:
break
if n % x == 0:
tmp = y
ans = len(str(tmp))
print(ans)
|
N = int(eval(input()))
answer = 10**10
M = int(N**0.5)+1
for a in range(1,M):
if N%a==0:
b = N//a
F = max(len(str(a)),len(str(b)))
answer = min(answer,F)
print(answer)
|
p03775
|
def func(i, j):
il = len(str(i))
jl = len(str(j))
if il > jl:
return il
return jl
n = int(eval(input()))
min = len(str(10**10))
for i in range(1, n+1):
if n % i == 0:
if i > n/i:
break
fr = func(i, int(n/i))
if min > fr:
min = fr
print(min)
|
def func(i, j):
il = len(str(i))
jl = len(str(j))
if il > jl:
return il
return jl
n = int(eval(input()))
min = len(str(n))
for i in range(1, n+1):
if i**2 > n:
break
if n % i == 0:
fr = func(i, int(n/i))
if min > fr:
min = fr
print(min)
|
p03775
|
N = int(eval(input()))
ans = 10
for i in range(1,int(N**(1/2))+1):
if N%i == 0:
j = N//i
k = 0
while j//(10**k) > 0:
k += 1
ans = min(ans,k)
print(ans)
|
N = int(eval(input()))
ans = 11
for A in range(1,int(N**(1/2))+1):
if N%A == 0:
B = str(N//A)
tmp = len(B)
ans = min(tmp,ans)
print(ans)
|
p03775
|
N = int(eval(input()))
def digit(N):
d = 0
while N >= 1:
N /= 10
d += 1
return d
f = []
i = 1
while i * i <= N:
if N % i == 0:
d1 = digit(i)
d2 = digit(int(N/i))
f.append(max(d1, d2))
i += 1
print((min(f)))
|
N = int(eval(input()))
def digit(N):
return len(str(N))
f = []
i = 1
while i * i <= N:
if N % i == 0:
d1 = digit(i)
d2 = digit(int(N/i))
f.append(max(d1, d2))
i += 1
print((min(f)))
|
p03775
|
n = int(eval(input()))
ans = 0
for i in range(1, n+1):
if n%i == 0:
num = n//i
ans = max(len(str(num)), len(str(i)))
if num <= i:
break
print(ans)
|
n = int(eval(input()))
i, ans = 1, 0
while i**2 <= n:
if n%i == 0:
num = n//i
ans = max(len(str(num)), len(str(i)))
i += 1
print(ans)
|
p03775
|
from math import ceil, sqrt, floor, log10
N = int(eval(input()))
for i in range(ceil(sqrt(N)), N + 1):
if N % i == 0:
print((floor(log10(i)) + 1))
break
|
from math import floor, sqrt, log10
N = int(eval(input()))
for i in range(floor(sqrt(N)), 0, -1):
if N % i == 0:
print((floor(log10(N // i)) + 1))
break
|
p03775
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.