80 lines
1.9 KiB
Python
80 lines
1.9 KiB
Python
# процентное соотношение букв в строке
|
|
S = input().lower()
|
|
# print (S)
|
|
g = S.count("g")
|
|
# print (g)
|
|
c = S.count("c")
|
|
# print (g)
|
|
print (((int(g)+int(c))/len(S))*100)
|
|
|
|
|
|
# то же, но написать сколько встречается букв
|
|
s = str(input())
|
|
l = len(s)-1
|
|
c = 1
|
|
t = ''
|
|
if len(s)==1:
|
|
t = t +s+str(c)
|
|
else:
|
|
for i in range(0,l):
|
|
if s[i]==s[i+1]:
|
|
c +=1
|
|
elif s[i]!=s[i+1]:
|
|
t = t + s[i]+str(c)
|
|
c = 1
|
|
for j in range(l,l+1):
|
|
if s[-1]==s[-2]:
|
|
t = t +s[j]+str(c)
|
|
elif s[-1]!=s[-2]:
|
|
t = t +s[j]+str(c)
|
|
c = 1
|
|
print(t)
|
|
|
|
# то же, что и прошлое, но наоборот из a2v5 сделать aavvvvv
|
|
t = ''
|
|
o = ''
|
|
n = 0
|
|
with open ('text.txt', 'r') as text:
|
|
s = text.readline().strip()
|
|
for i in s:
|
|
if i >= 'A':
|
|
n+=1
|
|
m=i
|
|
else:
|
|
n+=1
|
|
if n == (int(len(s))):
|
|
b = m*(int(i))
|
|
t+=b
|
|
break
|
|
o+=i
|
|
if s[n] >= 'A':
|
|
b = m*(int(o))
|
|
o = ''
|
|
t+=b
|
|
with open ('test.txt', 'w') as text:
|
|
text.write(t)
|
|
|
|
# подсчет одинаковых слов и вывод самого большого кол-ва раз
|
|
list = {}
|
|
ind = 0
|
|
len = 0
|
|
full_list = []
|
|
num = 0
|
|
with open ('text.txt', 'r') as text:
|
|
lines = [line.split() for line in text]
|
|
for parts in lines:
|
|
full_list += parts
|
|
for words in full_list:
|
|
len +=1
|
|
if ind != (len+1):
|
|
if words in full_list:
|
|
n = full_list.count(words)
|
|
list[words] = (n)
|
|
ind+=1
|
|
it = 0
|
|
for key, items in list.items():
|
|
if items > it:
|
|
it = items
|
|
it_key = key
|
|
print (it_key, it)
|