Hello, Codeforces!

I'm glad to invite you to Grakn Forces 2020, which will be held on Sep/30/2020 17:35 (Moscow time). It will be combined rated round for both divisions.

This round is initiated and supported by Grakn Labs. More information you could find here.

All problems were authored and prepared by 300iq and isaf27. Thanks to coderz189, Retired_cherry, QAQAutoMaton, Prakash11, morzer, qlf9, nkamzabek, gdb_18, talibmohd, Dragnoid99, KAN and VladGanzha for testing problems and good advice. Thanks to MikeMirzayanov for great systems Codeforces and Polygon.

You will be given 9 problems and 2 hours 30 minutes to solve them. Please, read all the problems. Good luck, have fun and we wish everyone high ratings!

Thanks to Grakn Labs for the gifts to the participants:

Prizes:

• 1st place = 500 euros
• 2nd place = 250 euros
• 3rd place = 100 euros

Additional Prizes:

Top 50 receive:

Grakn Labs swag pack:

• Stickers
• Grakn Labs t-shirt

Random 50 from 51-250 receive:

Grakn Labs swag pack:

• Stickers
• Grakn Labs t-shirt

Grakn Labs is a team of people driven by a purpose: to solve the world's most complex problems, through knowledge engineering. They are the inventors of the Grakn knowledge graph and the Graql query language. Their technology helps organizations in various industries, including Life Sciences, Defence & Security, Financial Services, and Robotics, to build intelligent systems that will change the world.

Grakn Labs looking for the best to round out their team, if you think this sounds like an interesting chance to work on an innovative technology; they'd love to hear from you.

UPD! Scoring distribution: 500 — 1000 — 1250 — 2000 — 2500 — 2500 — 3000 — 3750 — 3750

UPD! Editorial

Congratulations to winners:

1. tourist
2. Benq
3. maroonrk
4. Egor
5. ecnerwala

“Codeforces… assemble!”

We are thrilled to announce Grakn Forces 2020; hosted by Codeforces and sponsored by Grakn Labs. Thank you to Codeforces for providing a world-class competition structure to partner with. We can’t wait to see what you all are capable of. This international competition consists of 1 round, lasting 2.5 hours. The contest will comprise 7-9 problems and will be in accordance with classic Codeforces rules.

Prizes:

• 1st place = 500 euros
• 2nd place = 250 euros
• 3rd place = 100 euros

Additional Prizes:

Top 50 receive:

Grakn Labs swag pack:

• Stickers
• Grakn Labs t-shirt

Random 50 from 51-250 receive:

Grakn Labs swag pack:

• Stickers
• Grakn Labs t-shirt

About Grakn Labs

Grakn Labs is a team of people driven by a purpose: to solve the world's most complex problems, through knowledge engineering. We are the inventors of the Grakn knowledge graph and the Graql query language. Our technology helps organizations in various industries, including Life Sciences, Defence & Security, Financial Services, and Robotics, to build intelligent systems that will change the world. From financial analytics to drug discovery, cyber threat detection to robotics disaster recovery, our technology empowers engineers around the world to tackle a higher order of complexity in knowledge and solve the world's most complex problems.

Based in London, UK, and founded in 2016, Grakn Labs is a team of people driven by a purpose: to solve the world's most complex problems, through knowledge engineering. In 2017, we were awarded Product of the Year by the University of Cambridge. After only a few years, our pioneering community has grown to 6K+ engineers, spread across 10+ countries around the globe -- and we're still growing. To continue pursuing this vision, we need to build a team of individuals who are not just the best and brightest in what they do, but also driven by a strong sense of purpose and compassion for the world.

What is Grakn and Graql?

Grakn is a distributed knowledge graph: a logical database to organize large and complex networks of data as one body of knowledge. Grakn provides knowledge engineering tools for developers to easily leverage the power of Knowledge Representation and Reasoning when building complex systems. Ultimately, Grakn serves as the knowledge-base foundation for cognitive and intelligent systems.

Graql is Grakn's query language. It provides an expressive knowledge schema language through an enhanced entity-relationship model, transactional queries that perform deductive reasoning in real-time, and analytical queries with native distributed Pregel and MapReduce algorithms. Graql provides a strong abstraction over low-level data constructs and complex relationships.

Graql is distributed as an open-source technology, while Grakn comes in two forms: Grakn Core — which is also open-source, and Grakn KGMS — our enterprise Knowledge Graph Management Service, available through Google Cloud and Amazon AWS.

Notice the unusual start time.

Hello!

Codeforces Round 674 (Div. 3) will start at 28.09.2020 11:05 (Московское время). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

This round consists mostly of the problems of the first stage of All-Russian Olympiad of School Students in Saratov and will be hosted during the real competition time. The problems were invented and prepared by Ivan BledDest Androsov, Alexander fcspartakm Frolov and me.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

• take part in at least two rated rounds (and solve at least one problem in each of them),
• do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria nooinenoojno Stepanova, Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round. Also thanks to Artem Rox Plotkin and Dmitrii _overrated_ Umnov for the discussion of ideas and testing the round!

Good luck!

UPD: Thanks to Ivan MrReDoX Ushakov, Ivan Ivan19981305 Georgiev and Dmitry nuipojaluista Kadomtsev for testing the round!

UPD2: Editorial is published!

My name is Vlad and I want to tell a story about how I ended up in the Grakn Labs. Before joining, I already worked for a couple of years in Kyiv and right after the graduation from Polytechnic Institute I moved to London to my current position, but it was a long path.

I was never sure if this whole experience is useful in any way for the real world, as a software engineer, up until joining Grakn Labs. ... a lot of attention during the recruitment process is paid to problem solving skills. We have algorithmic problems as part of our interview process and now we want to find our next engineer here on Сodeforces ...

— When did you start competitive coding?

When I was in the ~7-8 grade, my teacher showed us a website with problems and we got very competitive about it. After that, I was participating in math and informatics competitions up until the end of university

— What did you learn/ how did participating in coding competitions impact your skills?

The main impact is boosting logic and STEM-related skills in general. For example, I was not preparing for math or physics competitions explicitly, I didn't 'train' for them in any way, but just from participating in coding competitions, as a bonus, I was taking places in math and physics.

— What's it like working at Grakn Labs as an engineer?

There is a huge difference compared to the rest of the places I worked. I've been a part of 3 different companies in Kyiv and none of them comes close to the level of the community's involvement and interest in Grakn. The majority of engineers I know have a 'job' job and the only goal is to get paid and go home, here we have different attitudes and priorities. We are a team driven by a purpose: to solve the world's most complex problems through, knowledge engineering.

- What type of problems are your working on?

Enterprise programming is significantly different from competitions, it is much more 'slow is smooth, smooth is fast' oriented, but I do have interesting challenges. The project I work on is a tool to test the performance of Grakn (a database). We have to generate data, insert it into the database, make a lot of different queries, measure their speed, correctness and visualize the results in a bunch of charts. It involves a lot of optimizations both on the server and client-side.

We're always looking for the best to round out our team, if you think this sounds like an interesting chance to work on an innovative technology; we'd love to hear from you.

As-salamu alaykum, Codeforces! (Peace, Codeforces!)

We are glad to invite you to Codeforces Round 673 (Div. 1) and Codeforces Round 673 (Div. 2), which will take place at Sep/27/2020 18:05 (Moscow time) (notice later time than usual). The round is rated for both divisions. Each division will be given 6 problems to solve in 2 hours.

Problems were prepared by nkamzabek, bthero and me DimmyT.

We are very grateful and would like to sincerely thank the following people for their assistance in preparing the round:

• BledDest for the brilliant coordination of our round.

• adedalic, kdjonty31, Prakash11, namanbansal013, RockyB, Retired_cherry, saurabhyadavz, morzer, Mohamed.Sobhy, coderz189, hugopm, Tlatoani, dorijanlendvaj, and Roms for testing the problems and providing helpful feedback and suggestions.

• MikeMirzayanov for the amazing platforms Codeforces and Polygon.

This is our first round, we hope that the problems will be interesting and that the round will pass without issues.

Score distribution:

Div2: 500-1000-1500-2000-2500-3000

Div1: 500-1000-1250-2000-2250-2750

Wish everyone good luck and high rating!!!

UPD: problem ideas

UPD: Editorial Out

Congratulations to everyone, contest passed without issues!!!

Div1:

1. tourist

2. ksun48

3. maroonrk

4. 300iq

5. Aidos

Div2:

1. poorboy

2. kaisel

3. immortalhunt

4. hieu_2004

5. _dg_

Hello Codeforces Community. I would like to invite you all for ICPC Indonesia COMPFEST 12 Multi-Provincial Contest Online Mirror. I am the Person In Charge of the event.

I want to thank:

• Faculty of Computer Science, The University of Indonesia, for providing guidance and support for the official event.

• Our committee: hocky, JulianFernando, faustaadp, dewa251202, Defy_AK12, faishol27.

• Our testers: AMnu, stevenwjy, Yehezkiel

• MikeMirzayanov: for giving us the opportunity to host this online mirror. Also, for Codeforces and Polygon platform.

The online mirror will be held on , 3 hours after the official contest starts. Teams are allowed. The duration of the contest is 5 hours. For the official contestants, please refrain from joining this mirror contest.

Our problems are relatively easier than ICPC regional contests. However, we promise an interesting and diverse problem set. I'd say the overall difficulty is slightly more challenging than div two rounds. There might be an interactive problem. So make sure to familiarize yourself

About COMPFEST: COMPFEST is an annual event hosted by the University of Indonesia. It is the largest student-run IT event in Indonesia, and Competitive Programming Contest (CPC COMPFEST) is one of the competitions hosted.

Our contest on regional finder

Note: this contest is unrated.

UPD1: Editorial and contest review will be posted in a few hours, after we finish the official contest duty.

UPD2: Editorial is available here

Congratulations to the winners!

1. Extra Registration (LJC00118, xay5421, Sulfox)

2. jiangly

3. Bajetii (theodor.moroianu, freak93, bicsi)

4. 未来ガジェット研究所 (wasa855, frame233, memset0c)

5. QAQAutoMaton

6. wlzhouzhuan

7. 2016wudi fan club (ChthollyNotaSeniorious, leukocyte, Cirno_9baka)

8. wucstdio

9. Sugar_fan

10. Teams Are For The Weak (IceKnight1093)

Hello, Codeforces!

I am very glad to invite you to the Codeforces Round #672 (Div. 2), which will take place in Sep/24/2020 17:35 (Moscow time). This round will be rated for the participants with rating lower than 2100.

All tasks were made by me, but gepardo helped me a lot with the last two tasks, probably these tasks wouldn't have appeared if he didn't help me.

My thanks to:

• antontrygubO_o for coordinating this round. With this great coordination only good tasks remained in the contest.

• gepardo made a lot, there wouldn't have been this contest if he didn't help me. He not only helped me with making last two tasks, but also helped me to understand how to make tasks for Codeforces rounds. Thanks!

• EIK this is the person who teached me competitive programming — my Informatics teacher. Thanks!

• programmer228, Hacktafly, K1ppy inspired me to make this round, listened for the every task idea, provided feedback and testing. Thanks!

• Osama_Alkhodairy, vamaddur, thenymphsofdelphi, Devil, Ari, SleepyShashwat, TechNite, Monogon, Tech.Maniac, Kavit_Kheni for testing the round and the tasks. Thanks!

• MikeMirzayanov for Codeforces and Polygon platforms. Thanks!

• You for participating in this round. Thanks!

You will have 2 hours for solving 5 tasks, one of which will be divided into easy and hard verions. I hope you will enjoy the round, I tried to make short statements and strong pretests interesting tasks.

Score distribution: 500 — 1000 — (1000 + 1250) — 2000 — 3000

UPD: The editorial is available. English version will be ready after the system testing is over.

UPD2: The english version of the editorial is ready.

Hello, Codeforces!

Artyom123, Kotehok3 and I are happy to invite you to Codeforces Round 671 (Div. 2), which will be held on Sep/19/2020 17:35 (Moscow time). This round will be rated for all participants, whose rating is lower than 2100 (We really hope so).

We would like to thank:

• isaf27 for coordinating the round and helping us <3
• dorijanlendvaj, physics0523, kdjonty31, FairyWinx, Retired_cherry, Osama_Alkhodairy, Mohamed.Sobhy, morzer, saurabhyadavz, thenymphsofdelphi, MagentaCobra, Prakash11, MarwanNabil, hugopm, Kirill22 for testing the round and giving us useful feedback
• MikeMirzayanov for great Polygon and Codeforces platforms

You will be given 6 problems and 2 hours to solve them (or to play Valorant, because the contest is related to it for some reason). One problem has an easy version and a hard version.

You will have to help the agents from the game to grind that rating. Try your best as if you are playing ranked and they are your teammates!

gl hf

Here is the score distribution:

500 — 750 — 1250 — (750 + 1000) — 2250 — 3000

UPD: Editorial