Hi, As you know practice tasks are published in the last week, if you know solutions can you share some hints, thanks in advance.

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

1 | tourist | 3882 |

2 | maroonrk | 3539 |

3 | Benq | 3513 |

4 | MiracleFaFa | 3466 |

5 | ksun48 | 3462 |

6 | ecnerwala | 3446 |

7 | slime | 3428 |

8 | Um_nik | 3426 |

9 | jiangly | 3401 |

10 | greenheadstrange | 3393 |

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

1 | awoo | 192 |

2 | -is-this-fft- | 191 |

3 | Monogon | 184 |

4 | YouKn0wWho | 182 |

4 | Um_nik | 182 |

6 | antontrygubO_o | 172 |

7 | maroonrk | 169 |

8 | kostka | 165 |

9 | SecondThread | 164 |

9 | errorgorn | 164 |

Hi, As you know practice tasks are published in the last week, if you know solutions can you share some hints, thanks in advance.

↑

↓

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/25/2022 21:49:34 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

problem 2 : here

problem 3 keyword: two pointers

thanks a lot

I used two pointers in third problem, but I can't get last 35 points... (If the restriction of the number of calling the row(a,b) method is 400000, it is easy...)

http://gyazo.com/5cefc933b359b884bb437c493811c89a

Yes , you should think of some trick and use the advantage that function row return the number of bridges.

this happened with me too! first coded 4*n rows calls solution then I tried not to make the pointers back one step and got 100%

I found 3*n rows calls solution but couldn't find any better algorithms...

My AC solution for 3rd problem makes exactly 2N calls to function "row" and then uses a very standard pointer walk to report bridges in order. I'd like to know what is the most interesting approach for problem "birthday".

I think it's great that practice tasks are open for anyone to submit. Does anyone know if it'll be also possible for the actual competition's tasks ? Perhaps we can hope for a live online contest ?

Euler's polynomial theorem.

please, show me example solution on pascal!!!