So, the first day of TOKI 2014 over, i think that many participants got full score, so post your solutions and scores here. Mine is (68 — 40 — 100).

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

1 | tourist | 3735 |

2 | MiFaFaOvO | 3681 |

3 | Um_nik | 3553 |

4 | Benq | 3376 |

5 | ecnerwala | 3295 |

6 | maroonrk | 3229 |

7 | TLE | 3223 |

8 | Radewoosh | 3216 |

9 | scott_wu | 3209 |

10 | Petr | 3205 |

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

1 | Errichto | 200 |

2 | antontrygubO_o | 191 |

3 | pikmike | 188 |

4 | Monogon | 184 |

4 | vovuh | 184 |

6 | Ashishgup | 182 |

7 | Um_nik | 179 |

8 | Radewoosh | 173 |

9 | SecondThread | 172 |

10 | McDic | 161 |

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/07/2020 07:19:56 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

What is TOKI?

Didn't find official site, got a e-mail from our coach. Here's the brief explanation

toki.or.id

but i didn't know they had a open contest for intl students too

I got 100-24-100. 1, 3

I had to do it at 1130PM as the other session was during school.

So I did A and C and then went to sleep :P

I got full score.

A:

https://ideone.com/epj1sB

B:

https://ideone.com/bU7o6J

C:

https://ideone.com/gTF8qe

By the way, reloading never stops at the site. I think something is wrong with it.

I was having the reloading problem, changed Google Chrome to Firefox and the problem was fixed.

HIR180 Hi there, could you please explain your logic for Problem B ? It would be really helpful .

Thanks :)

(Please see my code at first.)

definition:

dp[i] = (how many ways of getting i points in the question in which they made the same response)

c[i][j] = (as you know, it means "binomial coefficient")

ex[i] = (the number of candidates in question i)

num = (the sequence of the number of candidates which made they are wrong in the question in which they made the different response)

dp2[a][i] = (the sum of all the multiply of i elements from num[a...k], k is length of num)

all the values are calculated in equal or less than O(N^2).

Suppose Player A and Player B got i points in the question in which they made the same response.

So, Player A got another p-i points, and Player B got another q-i points.

How many ways of such situation?

The answer is dp2[0][k-(p-i)-(q-i)]*dp[i]*c[p-i+q-i][p-i].

(I suppose you'll be able to prove it easily :-))

Thank a lot! I got it :)

Would you please tell, where the contest was held (website)?

Contest site

However you need to register here first

Since the Day 2 of TOKI is over, I think we can start discussing the problems.

Anyone got 300 ?

I got (0-13-100), I think that day 2 a bit harder than day 1 :(

We will publish the statements, analyses, and test data soon. Stay tuned!