DMOJ · bobhatestriangles

Bob Hates Triangles

This C++ solution uses simulation for DMOJ bobhatestriangles Bob Hates Triangles. Read the reasoning, inspect the code, or try your own test case below.

bobhatestrianglesImplementation & simulationSimulationC++16 lines

Solution032of 248

Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Bob Hates Triangles asks for an acyclic orientation; directing each edge from the smaller endpoint to the larger, as in the code, satisfies it.

Implementation & simulation

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗

Implementation

bob_hates_triangles.cpp

C++


    1#include <bits/stdc++.h>
    2 
    3using namespace std;
    4 
    5int main(){
    6    ios::sync_with_stdio(0);
    7    cin.tie(0);
    8    int n, m;
    9    cin >> n >> m;
    10    while (m--) {
    11        int u, v; cin >> u >> v;
    12        if (u < v) cout << u << ' ' << v << '\n';
    13        else cout << v << ' ' << u << '\n';
    14    }
    15    return 0;
    16}

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Your source code

Standard input Expected output Optional

Python records executed lines and locals automatically. For selected values in any language, add // @trace i, total on its own valid line; Python uses # @trace i, total.

StatusReady

Output

No run yet.

Diagnostics

No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.