Home
О нас
Products
Services
Регистрация
Войти
Поиск
UAGamesTactics
@UAGamesTactics
August 2021
1
33
Report
Написать программу в С++
Проверить входит ли в заданную последовательность символов каждая из букв слова key
Please enter comments
Please enter your name.
Please enter the correct email address.
Agree to
terms of service
You must agree before submitting.
Send
Answers & Comments
MaxLevs
Кодяра ниже
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
#include <iostream>#include <string>using namespace std;int main() { setlocale(LC_ALL, "Russian"); string key = "key", buffer; cout << "Введите последовательность: "; cin >> buffer; bool *bitmap = new bool[key.length()]; for (int j = 0; j < key.length(); ++j) bitmap[j] = false; for(int i = 0; i < buffer.length(); ++i) for(int j = 0; j < key.length(); ++j) if (buffer[i] == key[j]) bitmap[j] = true; for (int j = 0; j < key.length(); ++j){ cout << "\"" << key[j] << "\""; if (bitmap[j]) cout << " есть!" << endl; else cout << " нет!" << endl; } system("pause"); return 0;}
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
Кодяра выше
1 votes
Thanks 0
More Questions From This User
See All
UAGamesTactics
August 2022 | 0 Ответы
reshit pervoobraznuyu
Answer
UAGamesTactics
August 2022 | 0 Ответы
najti pervoobraznuyu 2x3
Answer
UAGamesTactics
August 2022 | 0 Ответы
najti pervoobraznuyu dlya funkcii grafik kotoroj prohodit cherez tochku a
Answer
UAGamesTactics
August 2022 | 0 Ответы
tex]...
Answer
UAGamesTactics
August 2022 | 0 Ответы
tex]...
Answer
UAGamesTactics
August 2022 | 0 Ответы
tex]...
Answer
UAGamesTactics
August 2022 | 0 Ответы
po staticheskim dannym v srednem 1 passazhirov otkazyvaetsya ot rejsa najti vero
Answer
UAGamesTactics
August 2022 | 0 Ответы
veroyatnost vyigrysha v lotereyu na odin bilet ravnyaetsya 07 kupleno 6 biletov
Answer
UAGamesTactics
August 2022 | 0 Ответы
najti pervoobraznuyud057ab8e6403fdc49f81d767a5116d62 21203
Answer
UAGamesTactics
August 2022 | 0 Ответы
pomogite s geometriej srochno9c2c528fb4b0425580c2c4ed05aac3e1 76643
Answer
рекомендуемые вопросы
rarrrrrrrr
August 2022 | 0 Ответы
o chem dolzhny pozabotitsya v pervuyu ochered vzroslye pri organizacionnom vyvoze n
danilarsentev
August 2022 | 0 Ответы
est dva stanka na kotoryh vypuskayut odinakovye zapchasti odin proizvodit a zapcha
myachina8
August 2022 | 0 Ответы
najti po grafiku otnoshenie v3v1 v otvetah napisano 9 no nuzhno reshenie
ydpmn7cn6w
August 2022 | 0 Ответы
Choose the correct preposition: 1.I am fond (out,of,from) literature. 2.where ar...
millermilena658
August 2022 | 0 Ответы
opredelite kak sozdavalas i kto sozdaval arabskoe gosudarstvo v kracii
MrZooM222
August 2022 | 0 Ответы
ch ajtmanov v rasskaze krasnoe yabloko ispolzuet metod rasskaz v rasskaze opi
timobila47
August 2022 | 0 Ответы
kakovo bylo naznachenie kazhdoj iz chastej vizantijskogo hrama pomogite pozhalujsta
ivanyyaremkiv
August 2022 | 0 Ответы
moment. 6....
pozhalujsta8b98a56c0152a07b8f4cbcd89aa2f01e 97513
sarvinozwakirjanova
August 2022 | 0 Ответы
pomogite pozhalusto pzha519d7eb8246a08ab0df06cc59e9dedb 6631
×
Report "Написать программу в С++ Проверить входит ли в заданную последовательность симв..."
Your name
Email
Reason
-Select Reason-
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Description
Helpful Links
О нас
Политика конфиденциальности
Правила и условия
Copyright
Контакты
Helpful Social
Get monthly updates
Submit
Copyright © 2024 SCHOLAR.TIPS - All rights reserved.
Answers & Comments
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
#include <iostream>#include <string>using namespace std;int main() { setlocale(LC_ALL, "Russian"); string key = "key", buffer; cout << "Введите последовательность: "; cin >> buffer; bool *bitmap = new bool[key.length()]; for (int j = 0; j < key.length(); ++j) bitmap[j] = false; for(int i = 0; i < buffer.length(); ++i) for(int j = 0; j < key.length(); ++j) if (buffer[i] == key[j]) bitmap[j] = true; for (int j = 0; j < key.length(); ++j){ cout << "\"" << key[j] << "\""; if (bitmap[j]) cout << " есть!" << endl; else cout << " нет!" << endl; } system("pause"); return 0;}
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
Кодяра выше