Product Modulo help!

help
11

if a[i] is 1 then its contribution will be zero right ?
because 1 modulo 1 is 0
1
5 2
1 1 1 1 1

Should be 0
Not 5%2

3 Likes
12

Seen you after a long time, really missed you @l_returns

2 Likes
13

:slight_smile: Same here

4 Likes
14

hell yes… i forgot :clap:

1 Like
15

Awwwwwwww :rofl::rofl::rofl::rofl::rofl:

16

They have weak test cases :frowning:

1 Like
17

Why? Your logic have AC?

18

yesss
print(n%m) :slight_smile:

1 Like
19

Damn… weak af… Can you please help me in this too… please please please

I divide the n/m and then checked whether it’s divisible by 2 or not. It passed half of the test cases… where must I have gone wrong?

20

Not weak, Wrong test cases LOL.
They also forgot it.
Test Case #3 fails with my soln

1 Like
21

:joy::joy::joy::rofl::rofl: bhai bhai

22

whats your solution ?

23

number of 1’s=k and then (n-k)%m

1 Like
24

Local contest requires local solution

2 Likes
25

XD

1 Like
27

Bro. Can you please help this alone? Please. Thanks

28

check n%(m+1).
if 0 then no;
else yes;

1 Like
29

Yes. This gave AC. Can you please explain? Thanks

30

Can you explain?

31

Yes , Its simple.
Whoever remains with m+1 tiles will loose surely because he can’t pick all the tiles and must pick at least one tile and hence the opponent can pick all the remaining tiles.
Therefore optimal game play is to play such that the other player is left with m+1 tiles.

3 Likes