نصائح و استشارات برمجية

#include <iostream>

using namespace std;

struct pool {
    int data;
    pool *next;
};

pool *head = NULL;

void insertion(int value) {
    pool *first, *last;
    first = new pool;
    first->data = value;
    if (head == NULL) {
        head = first;
        first->next = NULL;
    } else {
        last = head;
        while (last->next != NULL) {
            last = last->next;
        }
        last->next = first;
        first->next = NULL;
    }
}

void display() {
    pool *cptr;
    if (head == NULL) {
        cout << "linked list is empty . ";
    } else {
        cptr = head;
        while (cptr != NULL) {
            cout << cptr->data << "\n";
            cptr = cptr->next;
        }
    }
}

int main() {
    insertion(10);
    insertion(20);
    insertion(30);
    insertion(40);
    insertion(50);
    display();
    return 0;
}

#include <iostream>
using namespace std;

int main() {
    int num1, num2;
    
    cout << "Enter first number: ";
    cin >> num1;
    
    cout << "Enter second number: ";
    cin >> num2;

    int lcm = (num1 > num2) ? num1 : num2;

    while (true) {
        if (lcm % num1 == 0 && lcm % num2 == 0) {
            cout << "Least Common Multiple: " << lcm << endl;
            break;
        }
        lcm++;
    }

    return 0;
}

#include <iostream>
using namespace std;

int main() {
    int num1, num2;
    
    cout << "Enter first number: ";
    cin >> num1;
    
    cout << "Enter second number: ";
    cin >> num2;

    int gcd = 1;
    for (int i = 1; i <= num1 && i <= num2; i++) {
        if (num1 % i == 0 && num2 % i == 0) {
            gcd = i;
        }
    }

    cout << "Greatest Common Divisor: " << gcd << endl;

    return 0;
}