← All problemsSign in

Cycle Finding

CSESGraph AlgorithmsOpen on judge ↗

You are given a directed graph, and your task is to find out if it contains a negative cycle, and also give an example of such a cycle. Input The first input line has two integers n and m: the number of nodes and edges. The nodes are numbered 1,2,\ldots,n. After this, the input has m lines describing the edges. Each line has three integers a, b, and c: there is an edge from node a to node b who

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start