Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- class node {
- public:
- int num;
- node* next;
- node(int n) : next(nullptr), num(n){}
- };
- int main() {
- ios::sync_with_stdio(false);
- node* head = nullptr;
- node* iter = nullptr;
- node* prev = nullptr;
- node* next = nullptr;
- int m, n;
- cin >> m >> n;
- for (int i = 1; i <= m; i++) {
- if (head == nullptr) {
- next = new node(i);
- head = next;
- prev = head;
- }
- else {
- next = new node(i);
- prev->next = next;
- prev = next;
- }
- }
- iter = next;
- next->next = head;
- cout << "<";
- while (m > 0) {
- for (int i = 0; i < n-1; i++) {
- iter = iter->next;
- }
- prev = iter->next;
- iter->next = iter->next->next;
- m--;
- if (m == 0) {
- cout << prev->num << ">\n";
- }
- else {
- cout << prev->num << ", ";
- }
- delete prev;
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment