Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- #include <iostream>
- #include <algorithm>
- #include <cmath>
- #include <string>
- #include <set>
- #include <map>
- using namespace std;
- #define re return
- #define pb push_back
- #define eb emplace_back
- #define all(x) (x).begin(), (x).end()
- #define fi first
- #define se second
- #define sqrt(x) sqrt(abs(x))
- #define pi (3.14159265358979323846264338327950288419716939937510)
- #define unique(v) v.resize(unique(all(v)) - v.begin())
- #define bipbup ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
- typedef vector<int> vi;
- typedef vector<vi> vvi;
- typedef pair<int, int> ii;
- typedef vector<ii> vii;
- typedef vector<string> vs;
- typedef double D;
- typedef long double ld;
- typedef long long ll;
- typedef pair<ll, ll> pll;
- typedef vector<ll> vll;
- typedef unsigned long long ull;
- struct element
- {
- D inf;
- element* next;
- };
- element* beg, * help, * last, * beg1, * help1, * last1;
- int main()
- {
- bipbup;
- setlocale(LC_ALL, "Russian");
- int n, m;
- cin >> n >> m;
- beg = new element;
- last = beg;
- for (int i = 0; i < n; ++i)
- {
- help = new element;
- cin >> help->inf;
- last->next = help;
- last = help;
- }
- last->next = NULL;
- last = beg->next;
- beg1 = new element;
- cin >> beg1->inf;
- last1 = beg1;
- for (int i = 1; i < m; ++i)
- {
- help1 = new element;
- cin >> help1->inf;
- last1->next = help1;
- last1 = help1;
- }
- last1->next = NULL;
- help = beg->next;
- help1 = beg1;
- int k(0);
- bool f(0);
- while (help && help1)
- {
- if (help->inf == help1->inf)
- {
- k++;
- help1 = help1->next;
- help = help->next;
- if (k == m)
- {
- f = 1;
- break;
- }
- }
- else
- {
- help1 = beg1;
- help = help->next;
- k = 0;
- }
- }
- if (f)
- {
- cout << "Список L1: \n\t\t";
- help1 = beg1;
- while (help1)
- {
- cout << help1->inf << ' ';
- help1 = help1->next;
- }
- cout << "\nцеликом входит в список L:\n\t\t";
- help = beg->next;
- while (help)
- {
- cout << help->inf << ' ';
- help = help->next;
- }
- }
- else
- {
- cout << "Список L1: \n\t";
- help1 = beg1;
- while (help1)
- {
- cout << help1->inf << ' ';
- help1 = help1->next;
- }
- cout << "\nцеликом не входит в список L:\n\t";
- help = beg->next;
- while (help)
- {
- cout << help->inf << ' ';
- help = help->next;
- }
- }
- re 0;
- }
- /**
- 10
- 1 2 3 4 -5 6 7 8 9 10
- **/
Add Comment
Please, Sign In to add comment