Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- ll a, b;
- string s;
- string prom;
- cin >> a >> b >> s;
- ll answ = 0;
- bool inun = false;
- for (int i = 1; i <= 5; i++)
- {
- cin >> prom;
- bool t = false;
- for (int i = 0; i < prom.size(); i++)
- {
- ll k = s.find(prom[i]);
- if (k >= s.size() || k < 0)
- {
- t = true;
- break;
- }
- }
- if (t && !inun)
- inun = 1;
- else
- if (t)
- answ++;
- else
- inun = 0;
- }
- ll answk = 0;
- inun = false;
- for (int i = 1; i <= 5; i++)
- {
- cin >> prom;
- bool t = false;
- for (int i = 0; i < prom.size(); i++)
- {
- ll k = s.find(prom[i]);
- if (k >= s.size() || k < 0)
- {
- t = true;
- break;
- }
- }
- if (t && !inun)
- inun = 1;
- else
- if (t)
- answk++;
- else
- inun = 0;
- }
- cout << answ*a + answk*b;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement