Codeforces Round 647 Div 2 Problem C

21

same pinch :slight_smile:

22

Yaā€¦I forgot himā€¦He must know.

23

I think he is not online now. I already tagged him at the start only.

24

Iā€™d call it undefined behavior, but I donā€™t know what Iā€™m talking about eitherā€¦ trust @ssjgz

3 Likes
25

wait for himā€¦I am going to sleep. Good Night!!

1 Like
26

Let leave this to cc and cf and gud night

4 Likes
27

@galencolin a small question help me plzz ā€¦

Given two no. A and B check whether A! % B ==0 ? or not

0<= A , B <= 10^(18) ?

How can i do this

28

Was about to answer, but first, source please

29

I increase A and B to MAX ie., 10^ 18 then how can i solve

I use this : https://www.geeksforgeeks.org/largest-power-k-n-factorial-k-may-not-prime/

But it works only for N upto 10^12

30

I mean, you could just extend the given solution with fast factorization

31

and also above GFG approach not worked for this questionā€¦how can i do this and even for bigger constraints :thinking:

32

Ok the i use above link if i need for bigger constraints but for now how can i solve , the gfg approach gave TLE :frowning_face:

33

Replace their prime factorization with this, the one on that page is bad

34

Yeah it works ā€¦thanks @galencolin i will read fast prime facto ā€¦ :slight_smile: