I need help to solved this intersting problem link .

thank you in advance.

Due to the installation of a new fire alarm in ITMO server room, the system may be occasionally unavailable on the 27-th of May between 06:00 and 15:00 (UTC).
×

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

1 | tourist | 3698 |

2 | mnbvmar | 3379 |

3 | Benq | 3339 |

4 | Vn_nV | 3330 |

5 | wxhtxdy | 3329 |

6 | LHiC | 3303 |

7 | sunset | 3278 |

8 | V--o_o--V | 3275 |

9 | Um_nik | 3247 |

10 | ecnerwala | 3245 |

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

1 | Radewoosh | 185 |

2 | Errichto | 183 |

3 | rng_58 | 162 |

4 | PikMike | 159 |

5 | Vovuh | 157 |

6 | Petr | 156 |

7 | 300iq | 154 |

8 | majk | 148 |

9 | Um_nik | 147 |

10 | Swistakk | 145 |

I need help to solved this intersting problem link .

thank you in advance.

↑

↓

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/27/2019 05:15:15 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

if you now know how to solve it then please help .

not sure at all but this might work:

First, let's work on finding the # of cool numbers <= X, for a given X (then we can get the answer by computing that for B and A-1).

For a fixed X, we can get the # of cool numbers with a dp[digit][sum1][sum2][alreadyless_bit]

digit will be the position of the digit we're trying, We will go from most significative to least. sum1 and sum2 are the sums of the two sets. alreadyless_bit tells if we are already strictly less than X, if so, the new digit can be any digit, otherwise, it has to be between 0 and the respective X's digit.

This counts the cool numbers but it might count each one many times, I don't know if you can avoid that hehe

Did you solve this problem later.. ? If yes can you share your idea?