ProblemsContestsResearch

Posts from the Repovive community.

Kunal Kashyap

There should be a feature to mark solved problems by a user

2026-04-03

+15
Aditya Shrinet

First Post

... Read more

2026-02-28

02
Hamza Hassanain

Repovive Interactive Problems Guide (Contestants & Setters)

... Read more

2025-12-26

+10
atoms

Repovive Pre-Opening Contest/ Discussion

... Read more

2025-12-02

03

Show posts by ...

Categories

Show & Tell7Announcements4Feedback4Competitive Programming3Research & Papers1

Admins

AmShZ1
Hamza Hassanain1
Shayan5

Top ranks

Um_nik0
Kosuke Kaneshita0
Alexander Golovanov0
Benjamin Qi0
Rubikun0
sunflowers0
abc8641975320
Egor Kulikov0
Jeroen Op de Beek0
maspy0
ProblemsContestsRoadmapsPlaygroundBlog
© 2026 Repovive Inc.

Because it saves time and show user how much he has done.

Hey everyone, welcome to my corner of the internet!
I’m Aditya, and this is my very first post here. I’ve always been fascinated by coding, problem-solving, and creative projects, so I decided to start this blog as a way to share my journey.

Expect posts about algorithms, debugging adventures, and maybe even some thoughts on entrepreneurship and creativity. My goal is to make this space both useful and fun—for myself and anyone who drops by.

Thanks for reading, and I’m excited to see whe

We are excited to announce support for Interactive Problems on Repovive! Unlike traditional problems where you read all input at once, interactive problems require your solution to "talk" to the judge in real-time. Think of it as a conversation where each side reacts to the other's messages.

How It Works: The "Conversation"

In a standard problem, the judge pipes a file into your program. In an interactive problem, the judge runs a second program called an Interactor alongside your solution.

1A. Magical Stones

Just sort both arrays and then take the absolute sum of the differences between corresponding elements. This is optimal because any swap from this configuration will only increase the cost.

1B. Sweet Gifts

Iterate through every subarray in O(n^2). Within the loop, keep track of the frequency using a count[] array and its maximum value using an mx variable.

1C. Rayan's Journey

We have a graph composed of sparse roads and dense teleport-devices. We can model the dense edges