I need help to solved this intersting problem link .

thank you in advance.

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

1 | tourist | 3557 |

2 | Um_nik | 3494 |

3 | Radewoosh | 3344 |

4 | wxhtxdy | 3309 |

5 | LHiC | 3302 |

6 | Benq | 3286 |

7 | mnbvmar | 3274 |

8 | Petr | 3254 |

9 | yutaka1999 | 3190 |

10 | ksun48 | 3170 |

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

1 | Errichto | 191 |

2 | Radewoosh | 180 |

3 | PikMike | 165 |

3 | antontrygubO_o | 165 |

3 | Vovuh | 165 |

6 | rng_58 | 161 |

7 | tourist | 160 |

8 | majk | 156 |

8 | Um_nik | 156 |

10 | 300iq | 155 |

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: Oct/15/2019 18:21:37 (e1).

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?