It will be fully translated later, sorry for slowpoking :(

| ||

| Obviously, suits are not change the answer. Look at all possible situations: [0 - 10] — zero ways. | |

| Complexity is |

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

1 | jiangly | 3678 |

2 | Benq | 3602 |

3 | ecnerwala | 3542 |

4 | maroonrk | 3541 |

5 | cnnfls_csy | 3540 |

6 | orzdevinwang | 3493 |

7 | inaFSTream | 3478 |

8 | Um_nik | 3430 |

9 | Geothermal | 3409 |

9 | Rebelz | 3409 |

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

1 | maomao90 | 174 |

2 | adamant | 164 |

3 | TheScrasse | 161 |

3 | SecondThread | 161 |

3 | awoo | 161 |

6 | nor | 159 |

7 | maroonrk | 158 |

8 | Um_nik | 156 |

9 | BledDest | 145 |

9 | Geothermal | 145 |

It will be fully translated later, sorry for slowpoking :(

| ||

| Obviously, suits are not change the answer. Look at all possible situations: [0 - 10] — zero ways. | |

| Complexity is |

Tutorial of Codeforces Beta Round 80 (Div. 2 Only)

Hi all!

Now it's time for 80th Codeforces Beta Round.

The authors of the contest are: Alex_KPR, winger, RAD, Connector, it4.kp. I hope all problems will be interesting for you and not extremely hard. ;)

Today is Connector's birthday — so, let's congratulate him together!

Good luck and have fun!

_____________________________________

Thank you for your action! =)

**Top 10 participants in the first division are:**

Place | Who |

1 | SergeiRogulenko |

2 | hos.lyric |

3 | Romka |

4 | neal |

5 | sdya |

6 | KADR |

7 | ftiasch |

8 | niyaznigmatul |

9 | dolphinigle |

10 | AleX |

There are only two participants who beat problem E: the winner of the contest SergeiRogulenko and MBabin who gets 76th place.

**Top 3 participants in the second division are:**

**Congratulations and good luck at the next time!**

Official tutorial will be added later. But AlexanderBolshakov already wrote the tutorial about most of problems.

Problems were translated by Delinur.

_____________________________________

Tutorial is here.

Announcement of Codeforces Beta Round 80 (Div. 1 Only)

Announcement of Codeforces Beta Round 80 (Div. 2 Only)

| ||

| In the very beginning of statement you may find some words about what is prime number and what is next prime number. Main point of problem is to check is Problem statement guarantees that 1. Number 2. There is no any prime number between Really, if there is prime number for(int i=n+1;i<=m;i++) where prime(i) is any correct way to check is number Another simple solution of this problem is to conside the fact that restrictions are no more than 50. It is possible to find all pairs if (n==2 && m==3) return "YES"; This solution gets "accepted" too. | |

| Complexity may be various because of diffenent realizations and is in range from If you are interested in why your solution gets "wrong answer" the test "2 5" maybe helps you. |

Tutorial of Codeforces Beta Round 69 (Div. 1 Only)

Tutorial of Codeforces Beta Round 69 (Div. 2 Only)

Hi all!

Glad to see you on the Codeforces Beta Round #69. As you suspect, it's not an usual contest.

Every division has 5 problems. Some problems are in both divisions; other are meant for certain division. But from the participant's point of view there are no striking differences from other rounds.

Please notice that such an experiment is the first one, so some technical troubles and unexpected problems are possible. Please treat with understanding if it occurs.

Also: the costs of the problems in the first division are 500-1000-1500-2000-**2000**. In the second division the costs are classic: 500-1000-1500-2000-2500.

The round was prepared by Alex_KPR, dagon and Marishka. Also RAD and it4.kp helped very much. The statements were translated by Maria Belova. The whole process was supervised by Mike Mirzayanov.

Good luck all!

_____________________________________

Top 10 participants in the first division are:

Place | Who |

1 | vepifanov |

2 | KADR |

3 | hos.lyric |

4 | Zhukov_Dmitry |

5 | e-maxx |

6 | Romka |

7 | ivan.popelyshev |

8 | Shef |

9 | RAVEman |

10 | ktuan |

Top 3 participants in the second division are:

_____________________________________

Announcement of Codeforces Beta Round 69 (Div. 1 Only)

Announcement of Codeforces Beta Round 69 (Div. 2 Only)

Problem A. A Student's Dream.

There was a lot of troubles because of incorrect statement. Now I hope statement is ok. Let's solve it. =)

If boy will goes to the left he will take her left hand with his right one and boy's left hand and girl's right hand will be unused. Situation is looks like the same if we swap them vice versa. So, we need to check two situations and choose the best one.

There is a simple way to check comfortableness, let's assume that boy has *B* fingers on active hand and girl has *G* fingers on active hand, so:

Tutorial of Codeforces Beta Round 58

Good evening!

Glad to see you at the 58-th beta round. Problems for today's contest are prepared by Orel STU and NNSU teams.

Good luck everyone!

Unfortunately, statement of problem A was incorrect in English. Russian statement was OK. I'm sorry for this mistake.

Results and ratings were updated.

Thanks for everybody who solve this contest!

Announcement of Codeforces Beta Round 58

Hi, everybody, and welcome to the Codeforces Beta Round #9!

I'm its author. :) I've tried to make problems easy to read and funny. I’d like to say thank you to Mike Mirzayanov (for choosing problems for the contest and everything he’s done to organize it), to Igor Kudryashov (for checking author's solutions and making test generators), to Dima Matov (for correcting everything :)) and, of course to Julia Satushina (for excellent translations of the problems’ legends).

I'd like to remind you that if you have any questions on the problems, the best way to ask them is to use the web interface on the problems page.

I believe that the contest will be interesting to you, dear participants! I’m looking forward to seeing your suggestions here.

Good luck!

Announcement of Codeforces Beta Round 9 (Div. 2 Only)

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/21/2024 21:42:55 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|