How can I get better at programming. I feel lost. I have solved lot's of problems, but i feel like i am getting worse over time. At first, My brain cells, which are already lower then average. When I was young, i had a brain surgoery, real. Actually.Did you ever hear the tragedy of Darth Plagueis The Wise? I thought not. It’s not a story the Jedi would tell you. It’s a Sith legend. Darth Plagueis was a Dark Lord of the Sith, so powerful and so wise he could use the Force to influence the midichlorians to create life… He had such a knowledge of the dark side that he could even keep the ones he cared about from dying. The dark side of the Force is a pathway to many abilities some consider to be unnatural. He became so powerful… the only thing he was afraid of was losing his power, which eventually, of course, he did. Unfortunately, he taught his apprentice everything he knew, then his apprentice killed him in his sleep. Ironic. He could save others from death, but not himself.I sexually Identify as an the sun. Ever since I was a boy I dreamed of slamming hydrogen isotopes into each other to make helium & light and send it throught the galaxy. People say to me that a person being a star is Impossible and I’m fucking retarded but I don’t care, I’m beautiful. I’m having a plastic surgeon inflate me with hydrogen and raise my temperature to over 6000 °C. From now on I want you guys to call me “Sol” and respect my right to give you vitamin D and probably sunburns. If you can’t accept me you’re a fusionphobe and need to check your astral privilege. Thank you for being so understanding.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/21/2025 16:06:21 (l1).
Desktop version, switch to mobile version.
Supported by
take med first
to become better at programming, you should stop using magic to be a red if you are newbie...
agree++
Programming, to me, feels like magic in general! Actually. Did you ever hear the story about Dijkstra`s algorithm? Dijkstra’s Algorithm: The Map Problem Imagine you live in a magical town with lots of houses connected by roads. Each road has a number written on it, showing how long it takes to travel that road. Some roads are short, like a quick walk, and others are long, like walking up a steep hill. One day, you want to visit your friend who lives in another house far away. Naturally, you want to get there as quickly as possible. But there's a catch: there are a lot of roads and many ways to get to your friend’s house. How do you figure out which way is the fastest? This is where Dijkstra’s algorithm comes in to save the day. The Goal Dijkstra’s algorithm helps you find the shortest path between your house (the starting point) and your friend’s house (the destination). You can also use it to find the shortest path to any house in town. How It Works: Step-by-Step Let’s pretend you’re standing outside your house, holding a notebook and a pencil. The notebook is where you’ll write down how long it takes to get to each house. At first, you don’t know the times, so you’ll write "infinity" (∞) for every house except your own. For your house, you write 0 because you’re already there—it takes 0 minutes to be at your own house. Step 1: Mark Your Starting Point You start at your house. Write 0 for your house in your notebook because it’s your starting point. For every other house, write ∞ because you don’t know how long it will take to get there yet. Step 2: Look Around From your house, you can see the roads connected to it. Each road has a number written on it (the travel time). Write down the travel time to each house that’s directly connected to your house. For example: If there’s a road to House A that takes 5 minutes, write 5 next to House A in your notebook. If there’s a road to House B that takes 10 minutes, write 10 next to House B. Step 3: Visit the Closest House Look at your notebook and find the house with the smallest number (the shortest travel time). Let’s say House A has the smallest number. Go to House A next—it’s your new current house. Step 4: Update Your Notebook Now that you’re at House A, repeat the process: Look at all the roads connected to House A. For each connected house, calculate how long it would take to get there if you went through House A. For example, if it took 5 minutes to get to House A, and there’s a road from House A to House C that takes 3 minutes, then the total time to House C through House A is 5 + 3 = 8. Compare this new time with the time you already have written down for House C in your notebook. If the new time is shorter, update it. Step 5: Repeat the Process Find the next closest house that you haven’t visited yet (the house with the smallest number in your notebook). Go to that house and repeat the process: check its roads, calculate new times, and update your notebook if necessary. Step 6: Stop When You’re Done Keep doing this until you’ve visited all the houses, or until you’ve found the shortest path to the house you’re interested in (like your friend’s house). When you’re done, your notebook will show the shortest time to get to every house in town from your starting point. A Simple Example Let’s walk through an example to make it crystal clear. Here’s the layout of our magical town: Your house (Start) is connected to: House A (5 minutes) House B (10 minutes) House A is connected to: House B (2 minutes) House C (8 minutes) House B is connected to: House C (6 minutes) House D (7 minutes) House C is connected to: House D (3 minutes) Step 1: Initialize Your Notebook At the start, your notebook looks like this: House Time Start 0 A ∞ B ∞ C ∞ D ∞ Write 0 for your house (Start), because you’re already there. For the rest, write infinity (∞). Step 2: Look at Your Neighbors From your house (Start): It takes 5 minutes to get to House A. It takes 10 minutes to get to House B. Update your notebook: House Time Start 0 A 5 B 10 C ∞ D ∞ Step 3: Visit the Closest House The closest house is House A (5 minutes). Go there next. From House A: To House B: It would take 5 (to A) + 2 = 7 minutes. To House C: It would take 5 (to A) + 8 = 13 minutes. Update your notebook if these new times are shorter: House Time Start 0 A 5 B 7 C 13 D ∞ Step 4: Visit the Next Closest House The next closest house is House B (7 minutes). Go there next. From House B: To House C: It would take 7 (to B) + 6 = 13 minutes. (No change; it’s the same as before.) To House D: It would take 7 (to B) + 7 = 14 minutes. Update your notebook: House Time Start 0 A 5 B 7 C 13 D 14 Step 5: Visit the Next Closest House The next closest house is House C (13 minutes). Go there next. From House C: To House D: It would take 13 (to C) + 3 = 16 minutes. (But we already have a shorter time to House D—14 minutes—so no change.) Your notebook stays the same: House Time Start 0 A 5 B 7 C 13 D 14 Step 6: Visit the Last House Finally, go to House D. There are no more houses to check, so you’re done! Your final notebook shows the shortest time to get to each house: House Time Start 0 A 5 B 7 C 13 D 14 Why Is This Useful? Dijkstra’s algorithm isn’t just for magical towns—it’s used in real-life applications like: GPS navigation: Finding the fastest route to your destination. Internet routing: Determining the quickest path for data to travel. Network design: Optimizing the layout of communication or transportation networks. It’s a way to solve any problem where you need to find the shortest path in a graph (a network of points and connections). The Big Idea At its heart, Dijkstra’s algorithm is all about: Starting small (with what you know). Gradually exploring the world around you. Keeping track of the best paths you’ve found so far. Always choosing the shortest path you haven’t tried yet. It’s like being a very careful traveler, always looking for the quickest way to get where you want to go.
If you'd like more details, specific adjustments, or any part rewritten, let me know!
Yeah Dijkstra's algorithm is a very interesting algorithm, but have you ever heard about the story of segment tree? One day, a young boy named John had N trees in a line : 1, 2, 3, ..., N. There was no apples, so John and his family were very sad. But one day, he found an old man. He said that it will make M spells, of 2 types: updates "p x" — x more apples wil grow into tree number p and queries "a b" — John need to calculate what tree in interval [a,b] has the least number of apples. If John will answer fast, the old man will give him an infinite number of apples for his family. John didn't know what to do, but a magic cat came to help him. The cat showed him a magic tree, and asked him to assign every leaf an apple tree and every node to a segment. She explained that he can update by updating the leaf and then recalculate to the root. To answer the queries, he can create the range by merging multiple nodes, in O(log) time complexity. John is very happy because he have infinity apples. Now he decided to write a book about the magic cat's tree so that every programmer know about it.
Can confirm. I was the magic cat.
I don't really belive you. Let me explain: years later, John got so many apples that his number overflowed, and now he has -4,294,967,294 apples, so he became very sad again. The old man came again, but this time he is only asking queries. John is happy, because he can use the cat's tree, but a magic rabbit appeared. The rabbit explained that John could store the answer for every range with the lenght power of 2, by dividing every range in two halves. Then he can answer queries in O(1) time complexity by merging two as big as possible ranges. Using RMQ (Rabbit's Magical Queries), John can answer even more faster than the cat. Now she is angry, so he leaved the boy and no one have seen her since then.
I can confirm that you were right because I was that log.
Seeing your profile, 1. Give some time.(Its been 2 month since you started on cf) 2. Solve more and harder problems ;)
"which are already lower then average" , bro theyre not just lower than average , they are lowering the average
lmao
I have looked at your submission history and can see that you are practicing a lot of different problem just keep on practicing and you will see yourself slowly improve. Also don't be afraid to take part in the contests, It does not really matter if you don't do well since there is always the next contest.
When solving any problem, it's crucial to engage with it thoughtfully before seeking out the editorial. Each question you successfully solve is a stepping stone toward becoming a more skilled programmer. Approach each challenge with curiosity and intent; don’t just solve problems for the sake of completing them. Instead, embrace the journey, enjoy the learning process, and make coding an enjoyable experience. It will take time and if you love this process, time will fly very swiftly. Happy Coding!
To become better at programming you need to learn from the ground up, by using archives such as CSES and Pbinfo if you are romanian. Hah! Did you know that Romania is a country located at the crossroads of Central, Eastern and Southeast Europe. It borders Ukraine to the north and east, Hungary to the west, Serbia to the southwest, Bulgaria to the south, Moldova to the east, and the Black Sea to the southeast. It has a mainly continental climate, and an area of 238,397 km2 (92,046 sq mi) with a population of 19 million people. Romania is the twelfth-largest country in Europe and the sixth-most populous member state of the European Union. Europe's second-longest river, the Danube, empties into the Danube Delta in the southeast of the country. The Carpathian Mountains cross Romania from the north to the southwest and include Moldoveanu Peak, at an altitude of 2,544 m (8,346 ft). Bucharest is the country's largest urban area and economic hub. Other major urban centres include Cluj-Napoca, Timișoara, Iași, Constanța and Brașov.
Settlement in the territory of modern Romania began in the Lower Paleolithic, later becoming the kingdom of Dacia before Roman conquest and Romanisation. The modern Romanian state emerged in 1859 through the union of Moldavia and Wallachia and gained independence from the Ottoman Empire in 1877. During World War I, Romania joined the Allies, and after the war, territories including Transylvania and Bukovina were integrated into Romania. In World War II, Romania initially aligned with the Axis but switched to the Allies in 1944. Following the war and occupation by the Red Army, Romania became a socialist republic and a member of the Warsaw Pact. After the 1989 Revolution, Romania began a transition towards democracy and a market economy.
Romania is a developing country with a high-income economy, recognized as a middle power[9] in international affairs. It is a unitary republic with a multi-party system and a semi-presidential representative democracy. It hosts several UNESCO World Heritage Sites and is a growing tourist attraction, receiving 13 million foreign visitors in 2023.[10] Its economy ranks among the fastest growing in the European Union,[11][12] primarily driven by the service sector. Romania is a member of several international organizations, including the European Union, NATO, and the BSEC.
Sorry for earlier, i got taken away. I also suggest that you use virtual contest and after the contest check editorials for proof. Actually, did you ever hear the story of Voldemort, the one whose name must not be spoken? Lord Voldemort (/ˈvoʊldəmɔːr/ VOHL-də-mor, /-mɔːrt/ -mort in the films)[j] is a fictional character and the main antagonist in the Harry Potter series of novels by J. K. Rowling. He first appears in Harry Potter and the Philosopher's Stone (1997) and returns either in person or in flashbacks in each novel in the series except the third, Harry Potter and the Prisoner of Azkaban, in which he is only mentioned. Voldemort, an anagrammatic sobriquet for his birth name Tom Marvolo Riddle, is the archenemy of Harry Potter, who according to a prophecy has "the power to vanquish the Dark Lord". After killing Harry's parents, Lily and James Potter, he attempts to murder the boy, but instead leaves him with a scar on his forehead in the shape of a lightning bolt. Nearly every witch or wizard dares not utter his name and refers to him instead with such monikers as "You-Know-Who", "He-Who-Must-Not-Be-Named", or "The Dark Lord". Voldemort's obsession with blood purity signifies his aim to rid the wizarding world of Muggle (non-magical) heritage and to conquer both worlds, Muggle and wizarding, to achieve pure-blood dominance. Through his mother's family, he is the last descendant of the wizard Salazar Slytherin,[6][7] one of the four founders of Hogwarts School of Witchcraft and Wizardry. He is the leader of the Death Eaters, a group of wizards and witches dedicated to ridding the Wizarding World of Muggles and establishing Voldemort as its supreme ruler.
I hope this helps you!
Your problem distribution says it all. Using this extension, you can see that out of your 157 solved problems, 142 are rated 800. I highly suggest that you start solving more difficult problems. There are many posts addressing how to train for competitive programming. Personally, I think you should solve problems rated 300-700 points higher than your current rating — or even more, depending on how comfortable you feel. The problems shouldn't be unrealistically hard for you.
Participate in as many contests as you can, but after each contest, make sure to solve the problems you couldn't solve during the contest. Using the editorial wisely for guidance is okay. While participating in many contests has its advantages (e.g., improving speed, revisiting concepts, etc.), solving only problems with ratings lower than yours will eventually limit your growth. You'll reach a point where you can no longer surpass your current peak rating.
That's why it's important to consistently challenge yourself by solving problems JUST BEYOND your current skill level.
What should be better approach from below:
1) Stay at particular difficulty rating until you are comfortable
2) Move onto higher difficulty rating and you will eventually become comfortable in lower difficulty rating
You can also see my profile, I have solved more than 70 problem in 1300 rating. But still I could solve 2 out of 10 problem on average.
But Now I have shifted to 1400
Did I took right decision to shift to 1400 rating or I must stay at 1300 rating?
Honeslty just go into some virtual contests and note somewhere whats the rating of the easiest problem that you werent able to solve, and, based on that, you will have a better thinking of what you should do. (for your own good, ignore the rest of this message. thanks!)
Actually, my favourite battle in history is the Battle of Waterloo! The Battle of Waterloo was fought on Sunday 18 June 1815, near Waterloo (at that time in the United Kingdom of the Netherlands, now in Belgium), marking the end of the Napoleonic Wars. The French Imperial Army under the command of Napoleon I was defeated by two armies of the Seventh Coalition. One of these was a British-led force with units from the United Kingdom, the Netherlands, Hanover, Brunswick, and Nassau, under the command of field marshal Arthur Wellesley, Duke of Wellington (often referred to as the Anglo-allied army or Wellington's army). The other comprised three corps (the 1st, 2nd and 4th corps) of the Prussian army under Field Marshal Blücher; a fourth corps (the 3rd) of this army fought at the Battle of Wavre on the same day. The battle was known contemporarily as the Battle of Mont Saint-Jean in France (after the hamlet of Mont-Saint-Jean) and La Belle Alliance in Prussia ("the Beautiful Alliance"; after the inn of La Belle Alliance).[15] Upon Napoleon's return to power in March 1815 (the beginning of the Hundred Days), many states that had previously opposed him formed the Seventh Coalition and hurriedly mobilised their armies. Wellington's and Blücher's armies were cantoned close to the northeastern border of France. Napoleon planned to attack them separately, before they could link up and invade France with other members of the coalition. On 16 June, Napoleon successfully attacked the bulk of the Prussian Army at the Battle of Ligny with his main force, while a small portion of the French Imperial Army contested the Battle of Quatre Bras to prevent the Seventh Coalition army from reinforcing the Prussians. The Seventh Coalition army held their ground at Quatre Bras, and on the 17th, the Prussians withdrew from Ligny in good order, while Wellington then withdrew in parallel with the Prussians northward to Waterloo on 17 June. Napoleon sent a third of his forces to pursue the Prussians, which resulted in the separate Battle of Wavre with the Prussian rear-guard on 18–19 June and prevented that French force from participating at Waterloo. Upon learning that the Prussian Army was able to support him, Wellington decided to offer battle on the Mont-Saint-Jean[16] escarpment across the Brussels Road, near the village of Waterloo. Here he withstood repeated attacks by the French throughout the afternoon of 18 June,[17] and was eventually aided by the progressively arriving 50,000 Prussians who attacked the French flank and inflicted heavy casualties. In the evening, Napoleon assaulted the Anglo-allied line with his last reserves, the senior infantry battalions of the Imperial Guard. With the Prussians breaking through on the French right flank, the Anglo-allied army repulsed the Imperial Guard, and the French army was routed. Waterloo was the decisive engagement of the Waterloo campaign and Napoleon's last. It was also the second bloodiest single day battle of the Napoleonic Wars, after Borodino. According to Wellington, the battle was "the nearest-run thing you ever saw in your life".[18] Napoleon abdicated four days later, and coalition forces entered Paris on 7 July. The defeat at Waterloo marked the end of Napoleon's Hundred Days return from exile. It precipitated Napoleon's second and definitive abdication as Emperor of the French, and ended the First French Empire. It set a historical milestone between serial European wars and decades of relative peace, often referred to as the Pax Britannica. In popular culture, the phrase "meeting one's Waterloo" has become an expression for someone suffering a final defeat. The battlefield is located in the Belgian municipalities of Braine-l'Alleud and Lasne,[19] about 15 kilometres (9.3 mi) south of Brussels, and about 2 kilometres (1.2 mi) from the town of Waterloo. The site of the battlefield today is dominated by the monument of the Lion's Mound, a large artificial hill constructed from earth taken from the battlefield itself, but the topography of the battlefield near the mound has not been preserved.
Appreciated your response boss! :)
But why you are writing long comments which are irrelevant to topic of blog here?
Or may be I didn't got the humor :(=)
Its because (I hope that) the OP of this topic made a joke about him randomly switching topics when talking about something serious
Oh! You are mimicking him
LOL!
Actually what you have to do is pretty simple..
Are you kidding ??? What the **** are you talking about man ? You are a biggest looser i ever seen in my life ! You was doing PIPI in your pampers when i was beating players much more stronger then you! You are not proffesional, because proffesionals knew how to lose and congratulate opponents, you are like a girl crying after i beat you! Be brave, be honest to yourself and stop this trush talkings!!! Everybody know that i am very good blitz player, i can win anyone in the world in single game! And "w"esley "s"o is nobody for me, just a player who are crying every single time when loosing, ( remember what you say about Firouzja ) !!! Stop playing with my name, i deserve to have a good name during whole my chess carrier, I am Officially inviting you to OTB blitz match with the Prize fund! Both of us will invest 5000$ and winner takes it all!
I suggest all other people who's intrested in this situation, just take a look at my results in 2016 and 2017 Blitz World championships, and that should be enough... No need to listen for every crying babe, Tigran Petrosyan is always play Fair ! And if someone will continue Officially talk about me like that, we will meet in Court! God bless with true! True will never die ! Liers will kicked off...
Hope you have a great day!