#include <iostream>
using namespace std;
int main() {
    int x, sum = 0;

    cout << "Enter a number: ";
    cin >> x;

    // يمكننا بدلاً من استخدام الحلقة لفحص الأعداد الزوجية بشكل فردي
    // نستخدم تقنية الرياضيات لحساب مجموع الأعداد الزوجية بشكل أسرع
    // إذا كان العدد الذي أدخله المستخدم فرديًا، نقوم بتقليله بمقدار 1 ليصبح زوجيًا
    if (x % 2 != 0) x--;

    // الصيغة الرياضية لحساب مجموع الأعداد الزوجية هي (n/2) * (أول عدد زوجي + آخر عدد زوجي)
    // في حالتنا، العدد الأول هو 2 والعدد الآخر هو x
    sum = (x / 2) * (2 + x);

    cout << "The sum of even numbers from 0 to " << x << " is: " << sum << endl;
}

#include <iostream>
#include <climits>

using namespace std;

const string daysOfWeek[] = {"SUN", "MON", "TUE", "WED", "THU"};

struct Employee {
    string name;
    int workingHours[5];
};

Employee employees[4] = {
        {"Noura", {8, 7, 7, 5, 9}},
        {"Aziz", {9, 9, 10, 12, 5}},
        {"Deem", {6, 10, 11, 10, 9}},
        {"Omar", {8, 11, 5, 8, 12}}
};

void printTable() {
    cout << "\tSUN\tMON\tTUE\tWED\tTHU\t" << endl;
    for (int i = 0; i < 4; i++) {
        cout << employees[i].name << "\t";
        for (int j = 0; j < 5; j++) {
            cout << employees[i].workingHours[j] << "\t";
        }
        cout << endl;
    }
}

void modifyWorkingHours() {
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 5; j++)
            if (employees[i].workingHours[j] < 6) {
                employees[i].workingHours[j] = 6;
                cout << "The hours for " << employees[i].name << " on " << daysOfWeek[j] << " was changed to be 6" << endl;
            }
    }
}

int findMaxWorkingDay() {
    int maxWorkingDay = 0;
    int maxWorkingHours = 0;

    for (int i = 0; i < 5; i++) {
        int totalWorkingHours = 0;
        for (int j = 0; j < 4; j++) {
            totalWorkingHours += employees[j].workingHours[i];
        }

        if (totalWorkingHours > maxWorkingHours) {
            maxWorkingHours = totalWorkingHours;
            maxWorkingDay = i;
        }
    }

    return maxWorkingDay;
}

int findMinWorkingDay() {
    int minWorkingDay = 0;
    int minWorkingHours = INT_MAX;

    for (int i = 0; i < 5; i++) {
        int totalWorkingHours = 0;
        for (int j = 0; j < 4; j++) {
            totalWorkingHours += employees[j].workingHours[i];
        }

        if (totalWorkingHours < minWorkingHours) {
            minWorkingHours = totalWorkingHours;
            minWorkingDay = i;
        }
    }

    return minWorkingDay;
}

int main() {
    printTable();
    modifyWorkingHours();
    cout << endl << "After modifying working hours to 6 if less than 6:" << endl;
    printTable();

    int maxWorkingDay = findMaxWorkingDay();
    cout << endl << "The day with the highest total working hours is " << daysOfWeek[maxWorkingDay] << endl;

    int minWorkingDay = findMinWorkingDay();
    cout << endl << "The day with the lowest total working hours is " << daysOfWeek[minWorkingDay] << endl;

    return 0;
}

print("و عليكم السلام و رحمة الله و بركاته")