Today (20.10.2012) at 14:00 GMT the first contest of the Croatian Olympiad in Informatics takes place. You can login/register here. Duration: 3 hours. Good luck!

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

1 | tourist | 3557 |

2 | Radewoosh | 3468 |

3 | Um_nik | 3429 |

4 | Petr | 3354 |

5 | Benq | 3286 |

6 | mnbvmar | 3280 |

7 | wxhtxdy | 3276 |

7 | LHiC | 3276 |

9 | ecnerwala | 3214 |

10 | yutaka1999 | 3190 |

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

1 | Errichto | 191 |

2 | Radewoosh | 180 |

3 | tourist | 173 |

4 | antontrygubO_o | 165 |

4 | Vovuh | 165 |

6 | PikMike | 164 |

7 | rng_58 | 160 |

8 | Um_nik | 156 |

8 | majk | 156 |

10 | 300iq | 154 |

Today (20.10.2012) at 14:00 GMT the first contest of the Croatian Olympiad in Informatics takes place. You can login/register here. Duration: 3 hours. Good luck!

↑

↓

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2019 17:06:00 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

How to solve problem F >_< ..

Does anybody know why don't they display results immediately ? Can't wait for results ! :(

Your personal results are up right after the contest ends. Full results are posted in a week or so ( accoring to the organizers , this is an 'appeal period' , some contestants may complain about testcases {not meeting problem's constraints} , the grading process .. etc )

1 — easy, 2 — sort then easy, 3 — all tickets to girl one then easy, 4 — binary search, 5 — math, how to solve? 6 — thinking...

5 — one can observe that for any number smaller than k! the number in the second iteration will be smaller or equal to k. so all you have to do is finding out, which of the numbers have 2 as smallest "not divisor" which one has 3 and so an, up to 21 i think .

I believe it's LCM of first

kintegers, instead ofk!but when you have a number n smaller than k!, than there is one number between 1,2,3,4,5,..,k that does not divide n, so one of the smallest should be between 1 to k.

oh ok, if it is divisible by n, it is also divisible by 2*n and so on, so lcm should be right.

how do you want to solve 4 with binary search?

never mind, i remembered the problem differently...

6 — trivial divide and conquer works, when merging two 2

^{k}groups into a 2^{k + 1}group, you need to multiply three 2^{k}× 2^{k}matrix, use ordinaryO(n^{3}) algorithm, then whole algorithm works inO(n^{3}) eitherCan anyone add this contest to the gym, please?

The problem is that it's not an ACM ICPC format but IOI format instead and as far as I know the gym cannot accept the second one yet.