O--O's blog

Invitation to TheForces Round #9 (Fool-Forces) [New Round] [GYM]
By O--O, 13 months ago, In English

Hello, Codeforces!!

We are happy to invite you to TheForces Round #9 (Fool-Forces), which will take place on Mar/30/2023 18:05 (Moscow time)

Please don't forget the time. Contest starts soon...

This competition is similar to April Fool's Day Contests, As there's an official round on April 1st this year, We decided to hold our round sooner.

You will have 2 hours to solve 8 problems.

P.S : The problems are not sorted by difficulty, So please do read all the problems, Also the round will be available in gym for everyone after the contest end!

List of the top places :

  1. Joshc The only one who AKed the round! orz.

  2. BurnedChicken

  3. aryan12

  4. Sofapuden

  5. liupengsay

"Stay hungry! Stay foolish!" Steve Jobs.

Discord Group (500+ people)

Contests' archive

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

Comments Comments (34)
| Write comment?
»
13 months ago, # |
  Vote: I like it +15 Vote: I do not like it

As a tester, I suggest everyone to take part in this entertaining contest.

→ Reply
»
13 months ago, # |
  Vote: I like it +14 Vote: I do not like it

I always Like TheForces Round as 1) I get Maximum knowledge from the Problems 2) I don't have fear of losing ratings

→ Reply
»
13 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Cant wait to get fooled!

→ Reply
»
13 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Glad to be fooled before many of you lollll! Hope you would enjoy!

→ Reply
»
13 months ago, # |
  Vote: I like it +6 Vote: I do not like it

As a tester, the problems were funny. I suggest everyone to take part in this contest.

→ Reply
»
13 months ago, # |
  Vote: I like it -26 Vote: I do not like it

as a fool people, hope you guys get fun in this contest.

→ Reply
»
13 months ago, # |
  Vote: I like it +3 Vote: I do not like it

As a first-fooled person, I suggest everyone participate in this contest.

→ Reply
»
13 months ago, # |
  Vote: I like it +14 Vote: I do not like it

As a fool author, Give me contribution!

→ Reply
»
13 months ago, # |
  Vote: I like it +4 Vote: I do not like it

Is it rated?

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by E404_Not_Found (previous revision, new revision, compare).

→ Reply
»
13 months ago, # |
← Rev. 3   Vote: I like it -8 Vote: I do not like it

lol

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

So exciting...

→ Reply
»
13 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

What is the intended solution for $$$G$$$ please? O--O

→ Reply
»
13 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Very fun contest, I'm ashamed to say I enjoyed this more than the normal div 2 rounds, although G and D were a pain in the ass :(

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve Problem C. Morco

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

why you set $$$1 \leq n \leq 2023$$$ in G... I was sure its something with calendars, like what day of the week $$$1$$$st April of year $$$n$$$ was. I guess I was fooled

→ Reply
  • »
    »
    13 months ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    Because it's April fools day contest, It was for troll

    → Reply
»
13 months ago, # |
← Rev. 5   Vote: I like it +10 Vote: I do not like it

Problem A.

count of Vowels

problem B.

let every symbol 'a' be 1

symbol 'b' be 2

symbol 'c' be 3

and so on

than find multiply by modulo

problem C.

use morse code to decode text and it will be LIS

LIS is Longest Increasing Subsequence

so now its easy

problem D.

just find is cell (x,y) has color in sheet

problem E.

find second smallest (every word in statement is permutation of correct word)

Problem F.

85-n*69

dont ask how

Problem G.

consider sequence

12345678910111213...

You need to find n-th (1-index) symbol

problem H.

find ASCII n-th symbol (1-index) in string "TheForces rounds are the best rounds ever."

→ Reply
  • »
    »
    13 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Problem G.

    consider sequence

    12345678910111213...

    You need to find n-th (1-index) symbol

    → Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

as a tester I liked the problems and found them interesting , hope that you guys enjoyed the problems too

→ Reply