You could solve it online from 11 до 16 msk. http://www.rsatu.ru/acm/

For Java users: they'll rename your external class!

Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

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

1 | tourist | 3707 |

2 | Benq | 3672 |

3 | Radewoosh | 3655 |

4 | ksun48 | 3547 |

5 | jiangly | 3492 |

6 | Miracle03 | 3480 |

7 | ecnerwala | 3400 |

8 | maroonrk | 3385 |

9 | peehs_moorhsum | 3384 |

10 | sunset | 3338 |

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

1 | 1-gon | 214 |

2 | Um_nik | 190 |

3 | sus | 183 |

4 | awoo | 181 |

5 | YouKn0wWho | 180 |

6 | Errichto | 179 |

7 | tourist | 178 |

8 | -is-this-fft- | 172 |

9 | Radewoosh | 170 |

10 | Ashishgup | 169 |

You could solve it online from 11 до 16 msk. http://www.rsatu.ru/acm/

For Java users: they'll rename your external class!

Once the Timus profile member's page was corrected, the script, that analysed solved problems and gave them complexity, in its current form was unable to work.

To edit the script needed an older version of the profile. But in Google's cache did not find any such page, but found something else...

http://acm.timus.ru/tester/ - tester by Vladimir Yakovlev. Someone may heard about that tester.

But then the fun things started...

This is the news for English-speaking users of CodeForces.

There is a project **cforces.reformal.ru** made by freopen where users can add their ideas and report bugs. Administration of the CodeForces look through reformal and add most popular features (prove: one, two).

Unfortunately the is only Russian interface. But I've translated ideas that have at least 30 votes.

Tomorrow, 7th May 3am MSK 24-hours Google Code Jam Qualification Round starts.

Registration will be available until the end of the contest.

Advancing from the Qualification Round will require 25 points.

**UPD.** Round began.

You can find his code on the standings page, finding him in a table, double-pressing to a cell of a problem and finally clicking on a submit id.

But I don't give a guaranties that all code is correct.

GL & HF ;-)

Problem 1. Sinking Ship.

The problem has lots of solutions. I will tell most simple which I saw.

Let's make structure {string,integer} (pair<string,int> in C++), we read the data into array of our structure, transforming rank to a priority (number). After that the necessary number of times equal to quantity of priorities (this problem - 4), we output those names from array which have the equal to cycle count priority.

Some solutions fell, who didn't consider indexes in sorting, i.e. used simply sort on a rank, instead of taking index in structure, or instead of stable_sort.

Problem 2. Settlers Training.

Let's make array A with size k+1 where A_{i} is a number of settlers with a rank i. After that, while exist a settler with rank lower k (A[k] not equally n), we model training activity. Finally we output the needed amount of coins.

It is necessary not to be mistaken only, in bypassing an array with ranks from left to right, though the test 2 saves us from this potential error.

Problem 3. Bulls and Cows.

We make an array with 10000 elements, mark all possible in this game number by ones. Then we eliminate these numbers by game rules for every of n input, i.e. we mark with zero the numbers from an array at which comparison with a_{i} don't give numbers of bulls and cows b_{i} and c_{i}.

Finally if there is only one marked number - it's the answer, if there are several such numbers - there is not enough information, if no one number is marked - the data is incorrect.

Problem 4. Dividing Island.

The main problem - to make areas connected.

It's possible to solve this problem so: we fill our island with a snake which moves through a column upwards-downwards and moves to a next column at its filling. Initial coordinate is (1,1) if A is even or B = 1, or (B, 1) if A is odd and B > 1.

The problem has lots of solutions. I will tell most simple which I saw.

Let's make structure {string,integer} (pair<string,int> in C++), we read the data into array of our structure, transforming rank to a priority (number). After that the necessary number of times equal to quantity of priorities (this problem - 4), we output those names from array which have the equal to cycle count priority.

Some solutions fell, who didn't consider indexes in sorting, i.e. used simply sort on a rank, instead of taking index in structure, or instead of stable_sort.

Problem 2. Settlers Training.

Let's make array A with size k+1 where A

It is necessary not to be mistaken only, in bypassing an array with ranks from left to right, though the test 2 saves us from this potential error.

Problem 3. Bulls and Cows.

We make an array with 10000 elements, mark all possible in this game number by ones. Then we eliminate these numbers by game rules for every of n input, i.e. we mark with zero the numbers from an array at which comparison with a

Finally if there is only one marked number - it's the answer, if there are several such numbers - there is not enough information, if no one number is marked - the data is incorrect.

Problem 4. Dividing Island.

The main problem - to make areas connected.

It's possible to solve this problem so: we fill our island with a snake which moves through a column upwards-downwards and moves to a next column at its filling. Initial coordinate is (1,1) if A is even or B = 1, or (B, 1) if A is odd and B > 1.

Tutorial of Codeforces Beta Round #59 (Div. 2)

For example with prompting on a point of a competition it is possible to see a place occupied with the participant, rating change and we can go to the table of results.

And what else do you want to see in that graph? :)**UPD:** As for me...

1) Rank: 91** of 521**

2)

3) Maybe somethink like http://codeforces.ru/contest/13/standings

Couldn't stop not to make a screen picture.

We have met him suddenly, a pair of clocks before departure home.

P.S.: Every joke can have it's jest. ;)

What algorithms should be known to the person (command) to have possibility to solve the most of problems?

I wish to hear Your opinions.

Original:

gif 5 KB

jpg 25 KB

Brighter variants (jpg):

...if someone still uses them. =)

I watched the project in a month and this week I had a possibility to participate.

Many thanks MikeMirzayanov for the organisation of this project.

There are some offers concerning site improvements:

*1) direct discussion with quoting*

Discussion in the form of a tree happens rather inconveniently. The messages are posted nonlinear and it's sometimes difficult to watch updates in a huge topic. It seems to me consecutive answers with quoting possibility (in the form of the text and the link to a post) would be ideal.

**2) source code viewing directly from the table**

The question "And where I can see Peter's code?" appears frequently. It would be extremely useful to have possibility to watch the code directly from the table of competitions: when you press Ctrl + Click on a table cell you receive submit's queue. Clicking to the submit here would be very convenient for looking at initial code.

*To facilitate code viewing of top's participants such thing will help here:*

http://codeforces.com/contest/11/status/D?order=BY_ARRIVED_**ASC**

**4) link to contest tutorials**

There is no link (from contest page) on a post, containing problem's tutorials. In the absence of tutorials the link should make you offer to write tutorials.

*5) nickname change possibility*

Useful or not?

*7) opportunity to subscript/unsubscript topic/someone's blog/whole forum*

I'm really waiting for that.

*8) login redirecting bug*

*9) recent actions bug*

Dublicating messages on refresh.

*10) delivery bug*

*11) "narrow screens" bug*

Solved problems:

*3) base of algorithms - *Waiting for merging (and translating?) e-maxx and Codeforces.

*6) rating graph - *Implemented.

Thanks, fast ACes to you. :)

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/21/2021 03:19:05 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|