-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathart of balance2.py
76 lines (75 loc) · 1.53 KB
/
art of balance2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
# cook your dish here
from math import sqrt
for _ in range(int(input())):
st=input().upper()
lst=len(st)
prime=True
if lst < 2:
prime=False
else:
for i in range(2, int(sqrt(lst)) + 1):
if lst % i == 0:
prime=False
break
s=set(st)
c=[]
min_avg=999999
min_i=0
min_c=0
comp=0
for i in s:
c.append(st.count(i))
c.sort()
c.reverse()
l=len(c)
print(c)
i=1
f=[]
print(f)
while i<=26:
if prime and i<=lst:
if lst%i==0:
f.append(i)
elif i<=l:
if lst%i==0:
f.append(i)
i+=1
print(f)
for i in f:
print("for i="+str(i))
comp=lst/i
print("comp="+str(comp))
diff=0
if i>l:
i=l
for j in range(i):
print("for j="+str(j),end=" ")
diff+=abs(comp-c[j])
print(diff)
avg=diff/i
print(avg)
if avg<min_avg:
min_avg=avg
min_i=i
min_c=comp
print("min C="+str(comp))
d=[]
for i in range(l):
if i<=min_i-1:
c[i]=min_c-c[i]
print(c)
nebe=0
debe2=0
debe1=0
for i in c:
if i>0:
if type(i)==float:
nebe+=abs(i)
if type(i)==int:
debe2+=abs(i)
elif i<0:
debe1+=abs(i)
if nebe==debe1+debe2:
print(int(nebe))
elif nebe<debe1+debe2:
print(int(debe1+debe2))