By yevhenii_kanivets, history, 2 days ago, In English,

Starting from the version 1.3.1 of Codeforces Watcher, users can see latest Blog Posts in Recent Actions tab. It's already downloadable in Google Play.

Last few weeks BOGDAN_ spent by educating himself about multithreading and coroutines, which aren't easiest things in the universe ;) Thanks to his learnings, we've migrated Codeforces Watcher to Coroutines and it looks just great. You can see one of examples of confluence between Redux and Couroutines in AppMiddleware.kt.

By the way, Codeforces Watcher in an open-source project, so you are always welcome to check it out and learn new things or make suggestion on improvements. Stars won't hurt too, of course ;)

Read more »

 
 
 
 
  • Vote: I like it
  • +241
  • Vote: I do not like it

By MofK, 5 days ago, In English,

Hello Codeforces!

I am glad to invite you to Codeforces Round #601, which will take place on Nov/19/2019 17:35 (Moscow time). The round will be rated for both divisions.

All problems in this round were created and prepared by a team of all-Vietnamese setters: MofK, Prof.PVH, UncleGrandpa925, ngk. This is the first Vietnamese Div1 round. We tried to make both the problems and the statements interesting and hope that you will enjoy them!

There is an interactive problem in the round. You can read the guide for interactive problem here.

We would like to give a lot of thanks to:

We wish you an exciting round!

UPD: The message from MikeMirzayanov. If the issue heavily affected you and you want the round to be UNRATED for you, you can fill the appeal form by the link: https://codeforces.com/userForm/f0458e24fa295 Please do not fill it just in case. Be honest, fill in only if the problem broke your participation in the contest. Mike.

UPD: There will be five problems for Division 1 and six problems for Division 2. The score distribution is as follows:

Division 1: 750 — (500 + 750) — 1500 — 1750 — 2500

Division 2: 500 — 1000 — 1500 — 1750 — (1000 + 1250) — 2750

UPD2: : Thanks for participating! Congratulations to the winners!!!

Div. 1: Top 5 are also the only 5 contestant managed to solve all problems!

  1. Radewoosh

  2. maroonrk

  3. SkyDec

  4. stO

  5. ecnerwala

Honorable mention: taeyeon_ss for solving problem E in just 31mins!

Div. 2:

  1. MbahSA (solved all problems!)

  2. mintwhale (solved all problems!)

  3. Nightmare05

  4. Don_Quijote

  5. mangojunior

UPD3:Editorial is out!

Read more »

 
 
 
 
  • Vote: I like it
  • +537
  • Vote: I do not like it

By hugopm, 8 days ago, In English,

Hello, Codeforces!

I'm glad to invite you to Codeforces Round #600 (Div. 2), which will be held on Nov/16/2019 17:35 (Moscow time). It will be rated for all participants with rating below 2100. You will be given six problems and two hours to solve them. As usual, the score distribution will be announced shortly before the round.

The problems were invented and prepared by me. Huge thanks to:

This is the first french round on Codeforces, I hope that everybody will enjoy it :) GL&HF to all!

UPD1: Scoring distrubtion is 500-1000-1500-1750-2250-2750

UPD2: Editorial is out

UPD3: Thanks for participating! Congratulations to the winners:

Div.1 (unofficial) participants

  1. Um_nik (solved all problems in 38 minutes!)
  2. dreamoon_love_AA
  3. mango_lassi
  4. imeimi
  5. cerberus97

Div.2 participants

  1. whyzker
  2. root_power_6
  3. SeranOZ
  4. AlineSH
  5. niro14

First solve

Read more »

 
 
 
 
  • Vote: I like it
  • +794
  • Vote: I do not like it

By PikMike, history, 11 days ago, translation, In English,

Hello Codeforces!

On Nov/13/2019 17:35 (Moscow time) Educational Codeforces Round 76 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov, Maksim Ne0n25 Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Attention Codeforces!

Calling on all tech disruptors, data specialists and computer science pioneers.
We are offering fully-funded international scholarships for exceptional tech specialists from around the world. Accelerate your career by becoming an industry expert capable of making key data-driven decisions that add value and drive innovation within tech industries.

Harbour.Space University has partnered with SCG, a leading business conglomerate in the ASEAN region, to offer exceptional tech specialists the opportunity to work and study in two of the most dynamic and vibrant cities in the world. Join our progressive two-year program based in Bangkok, with 6 of the 24 months in Barcelona, to develop the international mindset needed to accelerate your career and redefine how data drives the businesses of the future.

Codeforces and Harbour.Space

Tuition fee:

2 years | €45,800

Education:

3 hours of study per day | 15h per week

Work Experience:

4 hours of internship per day at SCG | 20h per week

Living Allowance:

€16,800 euros | €700 per month living allowance


APPLY HERE→

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 neal 7 182
2 kmjp 7 216
3 socketnaut 7 218
4 KrK 7 225
5 ivan100sic 7 244
5 pwild 7 244

Congratulations to the best hackers:

Rank Competitor Hack Count
1 Aaman007 39:-10
2 liouzhou_101 59:-58
3 dzhiblavi 15
4 Rian_5900 31:-40
5 Fyodor 10:-2
278 successful hacks and 501 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A rahulDugar 0:00
B Siberian 0:02
C ZwariowanyMarcin 0:03
D LJC00118 0:16
E jjang36524 0:23
F TripleM5da 0:19
G black_horse2014 0:19

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +204
  • Vote: I do not like it

By geranazavr555, 2 weeks ago, translation, In English,

Hello, Codeforces!

I and cannor147, as students of ITMO University, joined the Codeforces team in June. From June to October, we mainly dealt with the development of the Polygon platform. In this post, we would like to present to you a list of what we have done during this time. This list does not include minor bug fixes or any improvements that are invisible to users.

PIN codes for problems and contests

Sometimes very important contests and problems are being developed in Polygon. In such cases, a leader of the jury may be worried about data leaking. For example, it can be so because of the weak password of another member of the jury. PIN code is an additional factor of confirmation the access for the problem or contest and it can be set up only by the owner. It is assumed that the PIN code will be sent in another secure way.

There is a link Create Pin for the owners in the contest interface:

Create Pin in the interface

The form of the PIN code creation

If a contest or a problem has the PIN code, you need to type it before continuing.

The input form for the PIN code

You can manage the PIN code of the problem in the tab Manage Access in the problem interface. The owner can create the PIN code or copy the PIN code from a contest that contains the problem.

Managing of the PIN code for problems

If you use Polygon API, there is a way to send requests for working with problems or contests, that have the PIN code. You have to provide a new additional parameter “pin” in your requests.

Groups of contests

Polygon grows up and the number of contests in Polygon grows up too. Sometimes you want to group some contests. For example, it seems convenient to group contests from the same programming workshop. Now in Polygon you can group some contests for faster management of the access rights for them.

Group of contests

Read more »

 
 
 
 
  • Vote: I like it
  • +739
  • Vote: I do not like it

By ahmed_aly, history, 2 weeks ago, In English,

I'm sadly announcing that a2oj.com (A2 Online Judge) will be retiring by end of 2019, I'll shut it down at midnight on New Year's Eve. It was something I took care of for about 10 years.

I'm really sorry, but I prefer not to explain my reasons, so please don't ask me why I'm doing this, it was hard enough for me to make this decision, and also please don't try to convince me to change my mind.

I'd like to say thank you to everyone who used it, and please accept my sincere apologies for shutting it down.

If you have something good to say about A2OJ (how you used it or how it helped you in any way), I'd love to read that, please send it to the following email (or in a comment here): bye@a2oj.com

Also please feel free to take a copy of any data you can access, and if you need some data in a specific format, please send your request to the following email: bye@a2oj.com (if the data isn't public, make sure to send from your registered and verified email which can access this data). I'll do my best to fulfill all requests.

Please only use the above email, because soon I'll be deactivating my personal Facebook account again, I'll also deactivate A2 Online Judge.

Edit 1: I'll keep a static version of all Ladders & Categories.

Edit 2: Here's how I generated the ladders, in case if anyone wants to implement it: https://codeforces.com/blog/entry/47442

Read more »

 
 
 
 
  • Vote: I like it
  • +1801
  • Vote: I do not like it

By gen, 3 weeks ago, In English,

Hi guys!

Glad to invite you to Codeforces Round #599 to be held this Nov/06/2019 18:05 (Moscow time)!

My name is Evgeny Vihrov, this is already my 6th Codeforces contest as an author. To introduce myself, I have participated twice in the ACM ICPC Finals (2012, 2014) and currently I am co-coaching teams for the ICPC at the University of Latvia. This is my first solo round, and it took 3.5 years to make! (the last one was #347 with Alex_2oo8).

In this contest you will have to help Ujan deal with his renovation issues. Hopefully, everyone will find a problem matching their taste!

Huge thanks to arsijo for coordinating the preparation of the contest and for the patience with the frequent delays. :) Thanks to Xellos, Origenes, KAN and opukittpceno_hhr for generously testing the round. And as always, thanks to MikeMirzayanov for the panem et circenses Codeforces and Polygon systems!

Wish you an exciting round!

UPD1: McDic is joining as a coauthor of the contest (reasons to be revealed later)!

UPD2: Scoring:

Div. 1: 500-1000-1500-2000-2500

Div. 2: 500-500-750-1500-2000-2500

UPD3: Thanks for participating! Congratulations to the winners!!!

Div. 1:

  1. Benq
  2. wxhtxdy
  3. ecnerwala
  4. AndreySergunin
  5. oxytocyna

Div. 2:

  1. hakobdilif
  2. is1813r
  3. Fype
  4. pizzadelivery
  5. tdas

UPD4: The editorial will be available tomorrow, sorry for the delay. :((

UPD5: The reason behind McDic entering as a coauthor is that one problem was exactly identical to some problem from some Codeforces round. We found out about it only at the last day before the contest, and McDic generously allowed to use his problem.

UPD6: Editorial is posted.

Read more »

 
 
 
 
  • Vote: I like it
  • +613
  • Vote: I do not like it

By UnstoppableSolveMachine, history, 3 weeks ago, translation, In English,

The MEX Foundation Contest #1 (supported by AIM Tech) that was held in the 37th Petrozavodsk Programming Camp now available in the Gym.

The authors of the contest are UnstoppableSolveMachine, cookiedoth, egor.lifar. The problems are of a good quality, a number of participants can approve it.

Special thanks to gritukan for useful advices, LHiC for testing the contest, V--gLaSsH0ldEr593--V for inspiration and AIM Tech Members for the problem review.

The editorial

Read more »

 
 
 
 
  • Vote: I like it
  • +167
  • Vote: I do not like it