I was trying to solve the problem : https://beta.atcoder.jp/contests/abc114/tasks/abc114_d The editorial is not in English and google translate didn't help much.

Can someone please suggest the idea which is used to solve the problem ?

# | User | Rating |
---|---|---|

1 | tourist | 3778 |

2 | Benq | 3592 |

3 | ecnerwala | 3521 |

4 | Um_nik | 3423 |

5 | jiangly | 3375 |

6 | Petr | 3342 |

7 | Radewoosh | 3337 |

8 | scott_wu | 3313 |

9 | maroonrk | 3265 |

10 | yosupo | 3259 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 202 |

2 | 1-gon | 201 |

3 | rng_58 | 194 |

4 | SecondThread | 193 |

5 | awoo | 187 |

6 | vovuh | 183 |

7 | Um_nik | 182 |

8 | antontrygubO_o | 177 |

9 | Ashishgup | 175 |

10 | -is-this-fft- | 171 |

I was trying to solve the problem : https://beta.atcoder.jp/contests/abc114/tasks/abc114_d The editorial is not in English and google translate didn't help much.

Can someone please suggest the idea which is used to solve the problem ?

↑

↓

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/18/2021 03:47:15 (i3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

A number has exactly 75 divisors if its prime factorization is one of these forms: p^74, p^2*q^24, p^4*q^14, p^2*q^4*r^4. The ways correspond to 75, 3*25, 5*15, 3*5*5 which are all 75. For every prime up to N, count the number of times it divides N!. Then you can do simple nested loops to check all possible choices for each pattern.

Thanks !

Can you explain why the calculation is like this ? How do we determine, the last 3 lines below. I think, it may be to account for double counting, but it's not very clear to me.

The above 3 lines I am interested to understand comes from this submission based on the same idea : https://beta.atcoder.jp/contests/abc114/submissions/3706081

Here is the explanation, I received through another source : If you take a prime appearing >= 24 times you need a different prime appearning >= 2 times. So it's num25 * (num3 — 1) Because num3 covers all num25.

For last example -> The position of / 2 is sort of misleading, it's actually (num5 choose 2) * 3 = (num5 * (num5 — 1) / 2) * num3

Now you helped me a lot. Thanks!

Can anyone help with Problem C of this contest?

https://atcoder.jp/contests/abc114/tasks/abc114_c

you can use depth-first search to generate all

seven five three numbersand check if it is <= nsubmission_link