Блог пользователя Farsh_LE

Автор Farsh_LE, история, 2 месяца назад, По-английски

Hello codeforces !

Since we're approximately a month away from ACPC (Arab and Africa CPC) 2024 , I believe it's a good idea to get to know the participating teams and assess their current levels. It's also a great idea to add them as friends to compete against them virtually in gyms !

If you qualified to ACPC 2024 , please comment :

  • Country

  • University (or teens )

  • Team name

  • Team handles

for me :

Al-baath university from Syria , team Lik Shaghal and my teammates are Magician_Mathematician1 and HazemDalati .

Good luck everyone !

Upd : I don't know when exactly the contest is , but it must be after 1 or 2 months.

Полный текст и комментарии »

  • Проголосовать: нравится
  • +165
  • Проголосовать: не нравится

Автор Farsh_LE, история, 12 месяцев назад, По-английски

Hello codeforces

I noticed that there isn't a Goodbye 2023: 2024 is near contest in the upcoming rounds , this anual contests is always a nice one , so is it cancelled this year or just not anounced yet ?

MikeMirzayanov

Полный текст и комментарии »

  • Проголосовать: нравится
  • +1
  • Проголосовать: не нравится

Автор Farsh_LE, история, 21 месяц назад, По-английски

Ramadan mubarak to all my muslim brothers , hope you have a good month and good fasting and prayers !

Полный текст и комментарии »

  • Проголосовать: нравится
  • +163
  • Проголосовать: не нравится

Автор Farsh_LE, история, 21 месяц назад, По-английски

Hi codeforces

I was solving this problem:
You are given an undirected graph consisting of n vertices and n edges. It is guaranteed that the given graph is connected (i. e. it is possible to reach any vertex from any other vertex) and there are no self-loops and multiple edges in the graph.

Your task is to calculate the number of simple paths of length at least 1 in the given graph. Note that paths that differ only by their direction are considered the same (i. e. you have to calculate the number of undirected paths). For example, paths [1,2,3] and [3,2,1] are considered the same.

But I didn't notice that it has n edges (thought it had m edges which is given in the input), but I didn't find an answer better than n^2

so I want to ask , does anybody know a faster solution for the new problem(m edges )

Thanks!

Полный текст и комментарии »

  • Проголосовать: нравится
  • +8
  • Проголосовать: не нравится

Автор Farsh_LE, история, 22 месяца назад, По-английски

Hello Codeforces!

In the last few weeks(after I saw a round made by Experts and CMs) I thought about authoring some problems , just to have fun with my friends or to submit it to some CP website .

But I found it really hard to find a good idea for a problem which isn't the same or like some problem I solved before .

So I just want to ask high-rated coders and problem setters , are there some steps you follow when you want to make a new problems ?

Do you for example set some algorithm or topic before starting or just think for some problem then solve it

Thanks !

Полный текст и комментарии »

  • Проголосовать: нравится
  • +12
  • Проголосовать: не нравится

Автор Farsh_LE, история, 2 года назад, По-английски

As 2022 is coming to an end , there is no more time to achieve the goals we wanted in it .

So what are the goals you put before 2022 and you achieved , and what goals remain to 2023 to happen ?

For me the goals I didn't manage to achieve and I hope to make them true in 2023:

  • Qualify to IOI 2022 : I was the 5th in the deciding contest and only top 4 go to IOI ): hope i make it to IOI 2023
  • Reach CM: didn't happen but I was near
  • Go to ACPC teens : I couldn't participate in the first round

Goals I managed to achieve :

  • Qualified to IIOT 2022 and got a bronze medal

Looking forward to reading yours !

Anyway , Happy New Year to you all and I hope you achieve all your dreams in 2023!

Полный текст и комментарии »

  • Проголосовать: нравится
  • +48
  • Проголосовать: не нравится

Автор Farsh_LE, история, 2 года назад, По-английски

Hi codeforces

Today I found out that my solution for problem C last contest is skipped due to similarity with some other people , and this is really annoying because I am not a cheater

The code is really simple ( here is mine 180626136 ) and that's why any person.with the same idea will have a similar code Here is the code which skipped me 180640624

I didn't share my code with any person and I didn't use ideone or any other online compiler

You can look in my account and see that I was never a cheater and I am a person who wants to improve and doesn't really care about the rating

CODEFORCES was and always will be a fair place , but it's not fair that I get a skipped and some people who really cheat don't get it

That's why I ask MikeMirzayanov for help and to get my rating back

Or at least remove the skipped because I am not a cheater

Полный текст и комментарии »

  • Проголосовать: нравится
  • +49
  • Проголосовать: не нравится

Автор Farsh_LE, история, 2 года назад, По-английски

Hello codeforces!

About 10 months ago,I reached Expert after two years of practicing (well , I wasn't really practicing then )

But since being an expert , I nearly didn't miss a contest unless I wasn't able to participate , but I'm still going up and down in expert (and sometimes specialist too) , and I reached a rate more than 1800 only once, although I have some contests with a master performance.

And unfortunately, I accepted Ali_ZaiBug 's challenge that if i don't reach purple before the first of November(which is very soon) , he will upload a post on facebook laughing on me ):

Well, I don't really care about the post, but I want to reach purple before 2023.

So can I have some advices please ?

Thanks !

Полный текст и комментарии »

  • Проголосовать: нравится
  • +21
  • Проголосовать: не нравится