CLLCM EDITORIAL

editorial
, , ,
8

You need to find (check if exist) an odd number x which is divisible by all array elements not all array elements divided by x. Hope it is clear to you now.

1 Like
9

" So if all numbers are odd then the answer will be “ YES ”, otherwise “ NO ” "
What if all the numbers are odd prime ?? Then any number can’t be divisible by all the other numbers…
Test Case:
3
3 5 7

10

The odd no. should be divisible by them.
Read Problem carefully.

11

But in question they said that the number X should be present in N numbers which chef have ?
In your example 105 is not in the number list ?
Please explain .

13

i too tried the same approach

14

I wrote about the logic. Hope it’ll help you. :slight_smile:

15

What’s wrong with my code.?? I used the logic if there is even num present print NO else print YES

#include< iostream >
using namespace std;
int main()
{
    int t;
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        int n,f=0;
        cin>>n;
        int arr[1000];

        for(int j=0;j<n;j++)
        cin>>arr[j];

        for(int j=0;j<n;j++)
        {
        if(arr[j]%2==0)
        {
            cout<<"NO"<<endl;
            f=1;
            break;
        }
        }
        if(f==0)
        cout<<"YES";
    }

    return 0;
}
17

See your output is not matching the way they wanted.

if(f==0)
{
    cout<<"YES\n";
}

try this once.

18

I too used the same technique. didn’t get the glitch

19

still didn’t worked

21

I’ve added C++14 program. Please check that & if any problem is still persists drop an email (falgunisarkar526@gmail.com). :mask:

22

one of the number is 105 .
because 3 * 5 * 7 = 105.
odd * odd = odd

23

I guess for a few big prime numbers in range 1-1000 the LCM would end up being the multiplication of those numbers and eventually overflow the 64 bit integer type which I naively thought was enough for the problem :sweat_smile: Lesson learned.

24

why this code gives wrong answer?
instead of scanf if I use cin then it gives ac. why?

25

YES, i got it from this .

26

Many people done using LCM because the problem name is “CLCM” LOL

27

Two interesting coder's legacy 2020 problems for beginners 🔥🔥 - Flying concepts of C.P. - YouTube Solution video of this “first” and second question of coder’s legacy 2020

28

what if I use long long int, will it still overflow?

29

Yes, it will. Let’s think if I give you at least ~20 prime number then their lcm will overflow for sure.

31

Can you please specify some primes under these constraints, which cause integer flow? I’m surprised to see.