We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 1dcf679 commit 8196ed7Copy full SHA for 8196ed7
tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp
@@ -149,9 +149,8 @@ int main() {
149
assert(root_of[i].first == fgp.cycle_id[i]);
150
assert(root_of[i].second == fgp.cycle_pos[i]);
151
int cyc_len = ssize(cycle[root_of[i].first]);
152
- assert(
153
- cycle[root_of[i].first]
154
- [(root_of[i].second + 1) % cyc_len] ==
+ assert(cycle[root_of[i].first]
+ [(root_of[i].second + 1) % cyc_len] ==
155
a[i]);
156
assert(fgp.cycle_prev[i] ==
157
cycle[root_of[i].first]
0 commit comments