Skip to content

Commit

Permalink
fix for gcc13
Browse files Browse the repository at this point in the history
  • Loading branch information
yosupo06 committed Nov 12, 2023
1 parent 0099a43 commit 9d88464
Show file tree
Hide file tree
Showing 6 changed files with 15 additions and 6 deletions.
2 changes: 2 additions & 0 deletions datastructure/range_chmin_chmax_add_range_sum/sol/correct.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,8 @@
#include <cstdint>
#include <iostream>
#include <vector>
#include <cstdio>

#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
#include <cassert>
#include <iostream>
#include <vector>
#include <cstdio>

#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
Expand Down
1 change: 1 addition & 0 deletions graph/min_cost_b_flow/sol/correct.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,7 @@
#include <queue>
#include <tuple>
#include <vector>
#include <cstdio>

enum Objective {
MINIMIZE = 1,
Expand Down
1 change: 1 addition & 0 deletions graph/min_cost_b_flow/sol/ssp.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -6,6 +6,7 @@
#include <tuple>
#include <vector>
#include <limits>
#include <cstdio>

enum Objective {
MINIMIZE = 1,
Expand Down
4 changes: 3 additions & 1 deletion graph/vertex_add_range_contour_sum_on_tree/sol/correct.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,9 @@ struct SegmentTree {
SegmentTree() : SegmentTree(0) {}
SegmentTree(int n) : _n(n), _seg(2 * n, e()) {}
SegmentTree(const std::vector<value_type> &a) : _n(a.size()), _seg(2 * _n) {
std::copy(a.begin(), a.end(), _seg.begin() + _n);
for (int i = 0; i < _n; i++) {
_seg[_n + i] = a[i];
}
for (int i = _n - 1; i > 0; --i) {
_seg[i] = op(_seg[2 * i + 0], _seg[2 * i + 1]);
}
Expand Down
11 changes: 6 additions & 5 deletions math/composition_of_formal_power_series/sol/naive.cpp
Original file line number Diff line number Diff line change
@@ -1,8 +1,9 @@
#include<iostream>
#include<vector>
#include<math.h>
#include<assert.h>
#include<algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <assert.h>
#include <algorithm>
#include <cstdio>
#define MOD 998244353LL
using namespace::std;

Expand Down

0 comments on commit 9d88464

Please sign in to comment.