ProblemsContestsRoadmapsPlayground

Posts from the Repovive community.

Faraz Soomro

A small suggestion for the compiler

2025-12-31

04
Hamza Hassanain

Repovive Interactive Problems Guide (Contestants & Setters)

... Read more

2025-12-26

+10
Sultan Burger

What are veltos?????????

2025-12-03

00
dominique11 dipierro

Repovive Pre-Opening Contest/ Discussion

... Read more

2025-12-02

03
Aldebaran Rahman Adhitya

How to resolve "Internal Error" after submitting code?

2025-11-30

00
varun chowdary

Hello

2025-11-20

00
123

Show posts by ...

Categories

Feedback14Competitive Programming9Show & Tell7Announcements4Research & Papers2

Admins

AmShZ1
Hamza Hassanain1
Shayan7

Top ranks

Um_nik0
Kosuke Kaneshita0
Benjamin Qi0
Alexander Golovanov0
Rubikun0
abc8641975320
sunflowers0
Jeroen Op de Beek0
maspy0
Amirali Asgari0
ProblemsContestsRoadmapsPlayground
© 2026 Repovive

I was thinking about whether a code editor or compiler could have shortcut features, like:

  • Typing fori + Enter automatically expands to:

`for(int i = 0; i < n; i++) {

} `

  • Typing fore + Enter expands to:

`for(auto i : container) {

} `

And maybe other shortcuts for common code patterns to make coding faster.

Thanks!

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.

What are veltos, what do they do, and how do I get them?????

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

Hi! I'm new to Repovive and I joined the Test Contest earlier. I tried to submit my codes to the problems. However, I got an "Internal Error" mark on all of the questions. I would greatly appreciate any advice you can give for me to resolve this. Thank you!

Hello