Skip to content

Commit 45ee676

Browse files
committed
New syntax for problem URL
1 parent 4413f3f commit 45ee676

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

64 files changed

+64
-64
lines changed

verify/combi/binom.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Binomial Coefficient (Prime Mod)
2-
#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#define CP_ALGO_MAXN 1e7
55
#include "cp-algo/number_theory/modint.hpp"

verify/geometry/arg.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Sort Points by Argument
2-
#define PROBLEM "https://judge.yosupo.jp/problem/sort_points_by_argument"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sort_points_by_argument
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#pragma GCC target("tune=native")
55
#include "cp-algo/geometry/point.hpp"

verify/geometry/closest_pair.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Closest Pair of Points
2-
#define PROBLEM "https://judge.yosupo.jp/problem/closest_pair"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/closest_pair
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#include "cp-algo/geometry/closest_pair.hpp"
55
#include <bits/stdc++.h>

verify/geometry/hull.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Static Convex Hull
2-
#define PROBLEM "https://judge.yosupo.jp/problem/static_convex_hull"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_convex_hull
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#pragma GCC target("tune=native")
55
#include "cp-algo/geometry/convex_hull.hpp"

verify/graph/cycle_directed.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Cycle Detection (Directed)
2-
#define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#pragma GCC target("tune=native")
55
#include "cp-algo/graph/cycle.hpp"

verify/graph/cycle_undirected.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Cycle Detection (Undirected)
2-
#define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection_undirected"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection_undirected
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#pragma GCC target("tune=native")
55
#include "cp-algo/graph/cycle.hpp"

verify/graph/euler_directed.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Eulerian Trail (Directed)
2-
#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_directed"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eulerian_trail_directed
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#pragma GCC target("tune=native")
55
#include "cp-algo/graph/euler.hpp"

verify/graph/euler_undirected.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Eulerian Trail (Undirected)
2-
#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_undirected"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eulerian_trail_undirected
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#pragma GCC target("tune=native")
55
#include "cp-algo/graph/euler.hpp"

verify/graph/mst.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Minimum Spanning Tree
2-
#define PROBLEM "https://judge.yosupo.jp/problem/minimum_spanning_tree"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/minimum_spanning_tree
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#include "cp-algo/graph/mst.hpp"
55
#include <bits/stdc++.h>

verify/graph/shortest_path.test.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// @brief Shortest Path
2-
#define PROBLEM "https://judge.yosupo.jp/problem/shortest_path"
2+
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shortest_path
33
#pragma GCC optimize("Ofast,unroll-loops")
44
#include "cp-algo/graph/shortest_path.hpp"
55
#include <bits/stdc++.h>

0 commit comments

Comments
 (0)