Guys anyone need help in 👇👇


🔸A𝗻𝘆 𝗽𝗹𝗮𝗰𝗲𝗺𝗲𝗻𝘁 𝗲𝘅𝗮𝗺 help available ✅

💯%  clearance will be provided

🔸Contact : @ILOVEU_143❤️ to book slot for any placement exam.

Guys share this channel to ur friends...and whatsapp groups..

Any exam Dm me @ILOVEU_143❤️

https://amazoncustomerservice.hirepro.in/registration/amzcsin/addc1/apply/?event=13618&job=57650


Apply this 👆👆

If you want help Dm @ILOVEU_143✅

Visa Mock Interview available✅

Anyone need DM @Iloveu_143👨‍💻

Full visa preparation materials and mock to be taken....Daily..😊


Share @Coding_000❤️

Any one want projects -mini or Major 😊  Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️

Anyone need help in GRE and TOFEL, GMAT, DUOLINGO Exam help 👨‍💻👨‍💻

SOP , LOR✍📝

Note -paid 🤑

share✅ share ✅@Coding_000

Free Premium Courses with Certification:

Scholarship test ⚡️
Eligibility: Anyone can give the test
Fees: Zero
Last Date: 28th June

Register Now: https://www.codingninjas.com/studio/contests/scholarship-test-27th-to-28th-june-2023?utm_source=Growth-CS&utm_medium=RJ&utm_campaign=amigo_Hardik_28June

TECH MAHINDRA

Exam Help Available
Msg : @ILOVEU_143👨‍💻

Note: It's Paid 🤑🤑

Test Clearance Guaranteed ✅

Company: WileyEdge
Role: Software Development
Batch: 2023, 2022
Apply Link: https://hire.wileyedge.examly.io/registration-form?form=Registration%20Form&eventId=k73ekjdixn&eventTitle=WE

Dm @ILOVEU_143✅


For Coding Help or Any Exam Help 😄


💯 Clearance ✅

𝗔𝗻𝘆  𝗰𝗮𝗺𝗽𝘂𝘀 𝗽𝗹𝗮𝗰𝗲𝗺𝗲𝗻𝘁 𝗼𝗿 𝗢𝗳𝗳𝗰𝗮𝗺𝗽𝘂𝘀 𝗘𝘅𝗮𝗺.

𝗛𝗲𝗹𝗽 𝗮𝘃𝗮𝗶𝗹𝗮𝗯𝗹𝗲 𝗶𝗻 𝗔𝗹𝗹 𝗲𝘅𝗮𝗺𝘀✅.

𝗕𝗼𝗼𝗸 𝘆𝗼𝘂𝗿 𝘀𝗹𝗼𝘁.👨‍💻

𝗖𝗼𝗻𝘁𝗮𝗰𝘁 @ILOVEU_143 ❤️

𝗜𝘁𝘀 𝗽𝗮𝗶𝗱 ✅
𝟭𝟬𝟬% 𝗰𝗹𝗲𝗮𝗿𝗮𝗻𝗰𝗲 𝗴𝘂𝗮𝗿𝗮𝗻𝘁𝗲𝗲 🔥🔥
𝗦𝗵𝗮𝗿𝗲 @CODING_000👨‍💻

𝗔𝗻𝘆  𝗰𝗮𝗺𝗽𝘂𝘀 𝗽𝗹𝗮𝗰𝗲𝗺𝗲𝗻𝘁 𝗼𝗿 𝗢𝗳𝗳𝗰𝗮𝗺𝗽𝘂𝘀 𝗘𝘅𝗮𝗺.

𝗛𝗲𝗹𝗽 𝗮𝘃𝗮𝗶𝗹𝗮𝗯𝗹𝗲 𝗶𝗻 𝗔𝗹𝗹 𝗲𝘅𝗮𝗺𝘀✅.

𝗕𝗼𝗼𝗸 𝘆𝗼𝘂𝗿 𝘀𝗹𝗼𝘁.👨‍💻

𝗖𝗼𝗻𝘁𝗮𝗰𝘁 @ILOVEU_143 ❤️

𝗜𝘁𝘀 𝗽𝗮𝗶𝗱 ✅
𝟭𝟬𝟬% 𝗰𝗹𝗲𝗮𝗿𝗮𝗻𝗰𝗲 𝗴𝘂𝗮𝗿𝗮𝗻𝘁𝗲𝗲 🔥🔥
𝗦𝗵𝗮𝗿𝗲 @CODING_000👨‍💻

#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
        if (n % i == 0)
            return false;
    return true;
}
int main()
{
    int n, m;
    cin >> n >> m;
    int a = 0;
    int b = 0;
    while (n < m)
    {
        if (isPrime(n))
        {
            a = n;
            break;
        }
        n++;
    }
    while (n < m)
    {
        if (isPrime(m))
        {
            b = m;
            break;
        }
        m--;
    }
    cout << a + b;
    return 0;
}