Используем закон де Моргана и закон двойного отрицания.
Решение во вложении.
#include <iostream>
using namespace std;
int main()
{
setlocale(LC_ALL, "RUSSIAN");
string str1;
int count=0;
cout << "Программа подсчета количества букв \"к\" строке" << endl;
str1 = "Строка";
for (int i = 0; i < str1.length(); i++)
if (str1[i] == 'к')
count++;
cout << "Буква встречается в строке " << count << " раз" << endl;
system("pause");
}
Ответ:
https://tproger.ru/problems/python-3-exercises-for-beginners-geekbrains/
Объяснение:
1.
t = [1, 1, 4, 3, 2, 5, 8, 13, 21, 34, 56, 90, 135]
for i in range(len(t)):
if i < 5:
print(t[i])
2.
result = []
for elem in a:
if elem in b:
result.append(elem)
print(result)
3.
result = sorted(my_dict, key=my_dict.get, reverse=True)[:3]
5A316 = 3·160+10·161+5·162
= 3·1+10·16+5·256 = 3+160+1280 = 144310
0hex
=
0dec
=
0oct
0
0
0
0
1hex
=
1dec
=
1oct
0
0
0
1
2hex
=
2dec
=
2oct
0
0
1
0
3hex
=
3dec
=
3oct
0
0
1
1
4hex
=
4dec
=
4oct
0
1
0
0
5hex
=
5dec
=
5oct
0
1
0
1
6hex
=
6dec
=
6oct
0
1
1
0
7hex
=
7dec
=
7oct
0
1
1
1
8hex
=
8dec
=
10oct
1
0
0
0
9hex
=
9dec
=
11oct
1
0
0
1
Ahex
=
10dec
=
12oct
1
0
1
0
Bhex
=
11dec
=
13oct
1
0
1
1
Chex
=
12dec
=
14oct
1
1
0
0
Dhex
=
13dec
=
15oct
1
1
0
1
Ehex
=
14dec
=
16oct
1
1
1
0
Fhex
=
15dec
=
17oct
1
1
1
1