Hello everyone!
We are starting a new series on Repovive: Weekly Challenges.
In each weekly challenge, we will release problems for 7 consecutive days. After each problem is released, you will have 24 hours to get it accepted. Penalty does not matter.
There will be a live ranking throughout the challenge. The goal of these challenges is both competition and learning, so try not to miss any day!
Next week, from Monday to Sunday, the topic will be Approximation.
For Week 1, we will release two independent problems each day: one Easy problem and one Hard problem. These two problems are separate tasks, so the Hard problem is not necessarily a harder version of the Easy problem.
In this style of problems, we usually have an optimization problem, but you do not need to find the optimal answer. It is enough to construct a solution with a guaranteed approximation factor specified in the statement. In many cases, finding the exact optimum is either not accepted or much harder than what is expected.
The problems this week are not intended to be extremely difficult. The main goal is to introduce this interesting style of problems and make it more familiar to participants.
If the reception is good, we will continue this type of challenge in the future.
- Start Date: Monday, 13 July 2026
- Duration: 7 days
- Registration Link: https://repovive.com/contests/10000
We hope you enjoy the challenge!








The link is showing is no such contest.
It's fixed now. Thanks.
a nice format! love to see more of these
The classification of topic based problem is very cool . Hoping to participate!!
Interesting! I'm so excited to see this new style of problems and how you managed to make it work.
Is this similar to atcoder heuristic contest ?
AmShZ is it? maybe ?
No, it is different. It's more like an algorithmic problem than a heuristic.
I get it. Thanks.
Don't forget to register the challenge.
Is it Rated ?
I was not told that the rating would change, but the standings show a change in the rating.
No, it's not rated. The DELTAs will be removed soon.
Can we discuss about the problem of Day 1 when Day 2 begins (it seems the contestants must solve the problem of each day within 24h), or should we wait the end of the contest?
Yes, you can discuss. Actually, you can submit the problem after the day ends, but it wont't affect the ranking.
I have a question about problem W1D3B. Light Cover:
Is there a specific (even easier) 2-approximation algorithm for bipartite graphs, or why was that "constraint" added?
Will you consider changing the time limit from 24hrs to a week? Then it keeps the same with HackerEarth Circuits or CodeChef Long. I don't have enough time to find solutions in a certain day, but will have plenty of time in another day.