Added daily challenge section to Codeforces Seeker app. Tackle 10 new problems every 24 hours and climb the global leaderboard.

Download on Android Play Store: https://play.google.com/store/apps/details?id=com.dush1729.cfseeker

Download on Apple App Store: https://apps.apple.com/app/codeforces-seeker/id6759670793

Note: This feature will be released on App store in few days.

Codeforces Seeker is now live on App Store: link

Play store link: https://play.google.com/store/apps/details?id=com.dush1729.cfseeker

Project source code on GitHub: https://github.com/dush1729/CF-Seeker

In the latest update of CF Seeker app, I updated it's name to Codeforces Seeker to have better discoverability on Play store.

The latest update(Version 3.2) has following changes:

• Rating History: View user rating graph in User detail's page. Use navigation buttons to scroll through whole rating history in the rating graph.

• Contest Rating: In contest details page, now you can check rating changes of that contest along with problems and standings.

• Performance improvements: Few performance improvements to give smoother app experience.

Hope you like the new changes. Any feedback and feature requests are always welcome. :)

Latest version of CF Seeker has few major updates.

• Added Contest tab to keep track of all contest on codeforces.
• View contest problems and standings.
• Moved from user bottom sheet to detailed page to provide a cleaner, more immersive look.

The app is built offline-first to ensure a seamless experience — a standard I guarantee for every new feature I release.

Hello amazing people of Codeforces,

Hope your Christmas was wonderful. Here's to a fantastic New Year!

I am excited to announce my fun side project(CF Seeker) is live on Google Play store!

The source code is public on GitHub. Currently you can track rating changes of codeforces users with it. Hope to add more features as time progresses.

Please give it a try, I would love to know more about your experience. Any feedback and feature requests are welcome.

Just wanted to share this after watching many submissions for Ezzat and Two Subsequences TLEing because they used doubles.

Use

string s;
cin >> s;
double x = stod(s);

instead of

double x;
cin >> x;

Found this trick hidden in algo-lib template after we were wondering why https://codeforces.me/contest/1557/submission/125408355 is so fast even after using doubles.

I want to see all virtual contests I took part in. But on contests page, only latest 10 are shown. Is there any way I can view all?

Contest link

How to solve F? Does it use the fact that sequence is super increasing.

Can't find any announcement for ACL Beginner Contest, so creating this to discuss problems.

How to solve E?

I tried to make 9 segment tree for each 1 — 9 digits but couldn't find how to do update query where setting everything between l to r to zero when removing digit and to one when adding it.

Hi,

I have added compete and history to Codeforces helper.

Compete

Find how many rounds you have won against your rival. Mine is hell_hacker.

History

Find how you have performed in various type of contests Div. 2, Div. 3, Educational, Div. 1 + 2 etc.

TODO features:

• Track solved problems of each contest

If you have any feature please suggest down in comments. Thanks.

codingvalley is spamming everywhere with huge images which is making blogs too hard to read

MikeMirzayanov please add some restriction on dimension of images we allow on codeforces

thanks

Problem: https://codingcompetitions.withgoogle.com/kickstart/round/000000000019ffc8/00000000002d83dc

We can solve above problem using stack. But we can use eval from python 2 library also to solve this question. Thanks to sonu628 for this idea. But unfortunately this solution gives Runtime Error(RE) for second test and Accepted for first test. Can we fix this?

Solution: https://ideone.com/dDwtoM

Hi,

I was solving CYCLCSUM from recent Codechef Cook Off. I used segment tree to solve the problem. I got accepted when I set negative infinity as -1e15 and wrong answer when it is -1e18. I am probably getting wrong answer due to overflow.

So my question what should be the value of infinity in segment tree to avoid overflow?

Hello people,

I was feeling bored so I made a super tiny app called Codeforces Helper(https://codeforceshelper.herokuapp.com) using the Codeforces API. As of now, you can search contest by names so we don't need to keep track of specific contests like div 3 rounds and educational rounds. I am hoping to add few more features when I get free time but have no ideas. Feel free to suggest! If you liked the app or want to contribute, please star the github repository here. It will mean a lot to me. :)

As we all know upsolving is very important to improve your level because it forces you to solve harder problems which you couldn't solve during contest. I wrote a python code which uses codeforces API to find all the unsolved problems. You can find more description in the link. I know it's a bit slow(takes 4-6 seconds to parse one participated contest). That's why it saves the list in a file at the end. Please give it a try. :)

Known issue — This fetches almost all problems. Not all because http://codeforces.me/api/problemset.problems doesn't return all contest problems as expected. :( Need to find a fix for this.. Do send a pull request to github repo if you find it first. ;)

Given 3 types of queries

1. Insert element 'x' into multiset
2. Delete element 'x' from multiset
3. Find xor of all elements present in multiset which are less than 'k' (k is not fixed)

I required above solution in this problem. But I was unable to solve it this way. How to solve this?

I am trying to solve Spy Syndrome 2 for a long long time. This is my submission. I am unable to figure out why my code prints weird characters.

Hi everyone!

I have made a simple program which will give best order of solving problems during codeforces contest according to the user's speed. It will tell you whether it is better to solve problem in order C -> B -> A or B -> A -> C ( with many other permutations ) according to user's speed.

GitHub link

Time according to UTC +5.5

Codeforces Educational Round 9 --> Mar/01/2016 20:30 to Mar/01/2016 22:30

HackerEarth March Easy '16 --------> 01 Mar 2016, 21:30 to 02 Mar 2016, 00:30

HackerRank HourRank 6 ------------> Mar 1 2016, 22:00 to Mar 1 2016, 23:00

HourRank is unrated this time, maybe because of this clash. From past 2-3 months, I wanted to participate in HackerEarth Monthly Easy contests but i couldn't because there was always a clash.

Such type of clashes are complete turn off for many participants. So please try avoid such clashes in future and try to change the timing of contests(if possible) happening on 1st March 2016.

EDIT 1 — Both HourRank and March Easy are rated. This is for the first time HackerEarth contest will be rated!

I solved TopBiologist by recursion. I want to know if there is any iterative approach? We will need to run loop 6 times to generate sequence of length 6. Is there any shorter way to do this?

My code

Problem statement

I am unable understand the first testcase of this problem.

10 2 3

When L = 1, 5 and 7 then both will into abyss.

When L = 6 both will complete race at the same time.

So we should consider four cases when there will be tie. Why are we taking only 1, 6 and 7?

I am trying to solve this using dynamic programming with complexity of O ( N ^ 2 ) which will give TLE because N <= 10 ^ 5.

Problem Link

I am trying to solve Niceness of the string but i am getting WA because i think i am unable to process blank lines. For blank lines output will be zero. I am using scanf(" %[^\n]s",a) which will ignore blank lines.

My code