buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [["-", 15, 339, 51, 16, 31, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 119, 120], ["-", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120]] | 1 | 916 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | [["-", 0, 37, 0, 41, 75, 16, 12, 2, 63, 22], ["+", 0, 37, 0, 41, 75, 16, 12, 2, 63, 22]] | 1 | 639 | 2 |
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stack>
#include <vector>
using Number = double;
const Number EPS = 1e-10;
const Number INF = 1e10;
const Number PI = acos(-1.0);
inline int sign(Number x) { return (x < -EPS) ? -1 : (x > EPS) ? ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stack>
#include <vector>
using Number = double;
const Number EPS = 1e-10;
const Number INF = 1e10;
const Number PI = acos(-1.0);
inline int sign(Number x) { return (x < -EPS) ? -1 : (x > EPS) ? ... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 4,467 | 3 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int dy[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int INF = 1 << 30;
const double EPS = 1e-15;
#define PB push_back
#define mk make_pair
#define fi first
#define se second
#define ll long long
#define reps(i, j, k) for (int i ... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int dy[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int INF = 1 << 30;
const double EPS = 1e-15;
#define PB push_back
#define mk make_pair
#define fi first
#define se second
#define ll long long
#define reps(i, j, k) for (int i ... | [["-", 8, 9, 0, 37, 0, 41, 75, 16, 31, 22], ["+", 8, 9, 0, 37, 0, 41, 75, 16, 31, 22]] | 1 | 2,140 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
// Description: ????????????
// Verifyed: various problem
using namespace placeholders;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
// Description: ????????????
// Verifyed: various problem
using namespace placeholders;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r... | [["+", 8, 9, 0, 37, 0, 41, 75, 16, 17, 18], ["+", 8, 9, 0, 37, 0, 41, 75, 16, 12, 13], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 687 | 4 |
#include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define x first
#define y second
#define pu push_back
typedef complex<double> point;
bool ccw(point a, point b, point c) {
b -= a;
c -= a;
c *= conj(b);
if (c.imag() <= 0)
return true;
return false;
}
int ma... | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define x second
#define y first
#define pu push_back
typedef complex<double> point;
bool ccw(point a, point b, point c) {
b -= a;
c -= a;
c *= conj(b);
if (c.imag() <= 0)
return true;
return false;
}
int ma... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 523 | 4 |
#include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define x second
#define y first
#define M st.size()
typedef complex<double> point;
pair<int, int> a[100000];
vector<int> st;
bool ccw(point a, point b, point c) {
b -= a, c -= a;
c *= conj(b);
if (c.imag() <= 0)
... | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define x second
#define y first
#define M st.size()
typedef complex<double> point;
pair<int, int> a[100000];
vector<int> st;
bool ccw(point a, point b, point c) {
b -= a, c -= a;
c *= conj(b);
if (c.imag() <= 0)
... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 357 | 2 |
#include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
#define push push_back
#define sz stack.size()
#define m make_pair
#define N_MAX 10000
#define x second
#define y first
using namespace std;
typedef complex<int> point;
typedef pair<int, int> P;
bool ccw(point p0, point p1, point p2) {
poi... | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
#define push push_back
#define sz stack.size()
#define m make_pair
#define N_MAX 100001
#define x second
#define y first
using namespace std;
typedef complex<int> point;
typedef pair<int, int> P;
bool ccw(point p0, point p1, point p2) {
po... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 20]] | 1 | 504 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stack>
#include <utility>
using namespace std;
pair<int, int> P[100000];
int ANS[100000];
int numa = 0;
int main() {
int n;
cin >> n;
int x, y;
for (int i = 0; i < n; i++) {
cin >> x >> y;
P[i] = ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stack>
#include <utility>
using namespace std;
pair<int, int> P[100000];
int ANS[100000];
int numa = 0;
int main() {
int n;
cin >> n;
int x, y;
for (int i = 0; i < n; i++) {
cin >> x >> y;
P[i] = ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 538 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
// ------ Classes ------ //
class Point {
public:
long double px, py;
Point() : px(0), py(0){};
Point(long double px_, long double py_) : px(px_), py(py_){};
friend bool operator==(const Point &p1, const Point &p2) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
// ------ Classes ------ //
class Point {
public:
long double px, py;
Point() : px(0), py(0){};
Point(long double px_, long double py_) : px(px_), py(py_){};
friend bool operator==(const Point &p1, const Point &p2) ... | [["-", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35], ["+", 8, 9, 0, 7, 8, 1, 0, 34, 0, 21]] | 1 | 1,254 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using vec = complex<double>;
using line = pair<vec, vec>;
using polygon = vector<vec>;
const double eps = 0.0000001;
double inner_product(vec u, vec v) { return real(u * conj(v)); }
dou... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using vec = complex<double>;
using line = pair<vec, vec>;
using polygon = vector<vec>;
const double eps = 0.0000001;
double inner_product(vec u, vec v) { return real(u * conj(v)); }
dou... | [["-", 0, 41, 15, 16, 31, 2, 63, 118, 119, 120], ["+", 0, 41, 15, 16, 31, 2, 63, 118, 119, 120], ["-", 0, 41, 15, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 41, 15, 16, 12, 2, 63, 118, 119, 120]] | 1 | 1,380 | 4 |
#include <bits/stdc++.h>
using namespace std;
struct Point {
long long x, y;
Point() : x(0), y(0) {}
Point(long long _x, long long _y) : x(_x), y(_y) {}
bool operator<(Point other) const {
if (x == other.x)
return y < other.y;
return x < other.x;
}
};
struct Vector {
long long x, y;
Vector(l... | #include <bits/stdc++.h>
using namespace std;
struct Point {
long long x, y;
Point() : x(0), y(0) {}
Point(long long _x, long long _y) : x(_x), y(_y) {}
bool operator<(Point other) const {
if (x == other.x)
return y < other.y;
return x < other.x;
}
};
struct Vector {
long long x, y;
Vector(l... | [["+", 51, 16, 31, 16, 31, 16, 12, 16, 31, 22], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 685 | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vb = vector<bool>;
using vd = vector<double>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvd = vector<vd... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vb = vector<bool>;
using vd = vector<double>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvd = vector<vd... | [["-", 0, 14, 49, 53, 54, 55, 0, 356, 365, 146], ["+", 0, 14, 49, 53, 54, 55, 0, 356, 365, 147], ["-", 51, 16, 12, 23, 0, 16, 31, 91, 17, 111], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 147]] | 1 | 975 | 6 |
#include <iostream>
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
struct Point {
int x, y;
};
Point set_p(int a, int b) {
Point p;
p.x = a;
p.y = b;
return p;
}
struct Vector {
int vx, vy;
};
Vector set_v(const Point &p1, const Point &p2) {
Vector v;
... | #include <iostream>
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
struct Point {
int x, y;
};
Point set_p(int a, int b) {
Point p;
p.x = a;
p.y = b;
return p;
}
struct Vector {
int vx, vy;
};
Vector set_v(const Point &p1, const Point &p2) {
Vector v;
... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18]] | 1 | 673 | 2 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> p;
int det(p a, p b) { return a.first * b.second - a.second * b.first; }
p mainasu(p a, p b... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> p;
int det(p a, p b) { return a.first * b.second - a.second * b.first; }
p mainasu(p a, p b... | [["-", 0, 2, 3, 4, 0, 66, 28, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 66, 28, 118, 119, 120], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["+", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["-", 0, 1, 0, 16, 31, 16, 12, 118,... | 1 | 391 | 12 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(... | #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(... | [["-", 3, 4, 0, 2, 3, 4, 0, 118, 119, 120], ["+", 3, 4, 0, 2, 3, 4, 0, 118, 119, 120]] | 1 | 1,048 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define per(i, a, n) for (int i = (n)-1; i >= (a); i--)
#define MP make_pair
typedef double db;
const db EPS = 1e-8;
inline int sign(db a) { return a < -EPS ? -1 : a > EPS; }
inline int cmp(db a, db b) { return sign(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define per(i, a, n) for (int i = (n)-1; i >= (a); i--)
#define MP make_pair
typedef double db;
const db EPS = 1e-8;
inline int sign(db a) { return a < -EPS ? -1 : a > EPS; }
inline int cmp(db a, db b) { return sign(a... | [["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 1,841 | 2 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <math.h>
#include <stdio.h>
#include <utility>
#include <vector>
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void Input(std::vector<std::pair<int, int>> &vnnInput);
bool bCrossProduct(std::pair<int, int> &point,
std::vec... | #include <algorithm>
#include <cmath>
#include <functional>
#include <math.h>
#include <stdio.h>
#include <utility>
#include <vector>
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void Input(std::vector<std::pair<int, int>> &vnnInput);
bool bCrossProduct(std::pair<int, int> &point,
std::vec... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 844 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-8;
int dcmp(double d) {
if (fabs(d) < EPS) {
return 0;
} else {
return d < 0 ? -1 : 1;
}
}
struct Vector {
double x, y;
Vector(double x = 0, double y = 0) : x(x), y(y) {}
bool ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-8;
int dcmp(double d) {
if (fabs(d) < EPS) {
return 0;
} else {
return d < 0 ? -1 : 1;
}
}
struct Vector {
double x, y;
Vector(double x = 0, double y = 0) : x(x), y(y) {}
bool ... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 585 | 2 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#define X real()
#define Y imag()
#define EPS 1e-10
using namespace std;
typedef complex<double> P;
typedef vector<P> Poly;
typedef pair<P, P> L;
namespace std {
bool operator<(const P &a, const P &b) {
... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#define X real()
#define Y imag()
#define EPS 1e-10
using namespace std;
typedef complex<double> P;
typedef vector<P> Poly;
typedef pair<P, P> L;
namespace std {
bool operator<(const P &a, const P &b) {
... | [["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 484 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct Point {
double x, y;
bool operator<(const Point &p) const {
if (y == y)
return x < p.x;
return y < p.y;
}
};
Point sub(Point p1, Point p2) {
Point p;
p.x = p1.x - p2.x;
p.y = p1.y - p2.y;
return p;
}
d... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct Point {
double x, y;
bool operator<(const Point &p) const {
if (y == p.y)
return x < p.x;
return y < p.y;
}
};
Point sub(Point p1, Point p2) {
Point p;
p.x = p1.x - p2.x;
p.y = p1.y - p2.y;
return p;
}
... | [["+", 0, 57, 15, 339, 51, 16, 12, 118, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 118, 17, 131]] | 1 | 580 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1 << 30
#define LINF 1LL << 60
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-9, pi = acos(-1.0);
namespace std {
bool operator<(const Point &lhs, const Point &rhs... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1 << 30
#define LINF 1LL << 60
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-9, pi = acos(-1.0);
namespace std {
bool operator<(const Point &lhs, const Point &rhs... | [["-", 12, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 12, 2, 63, 118, 28, 69, 341, 342, 0, 22]] | 1 | 999 | 6 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef vector<int> VI;
typed... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef vector<int> VI;
typed... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 1,787 | 5 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
bool asc(const complex<int> &a, const complex<int> &b) {
if (a.real() != b.real())
return a.real() < b.real();
else
return a.imag() < b.imag();
}
int cross_product(complex<int> a, complex<in... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
bool asc(const complex<int> &a, const complex<int> &b) {
if (a.real() != b.real())
return a.real() < b.real();
else
return a.imag() < b.imag();
}
int cross_product(complex<int> a, complex<in... | [["+", 64, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 660 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// 点类
class Point {
public:
double x, y;
Point(){};
Point(double x, double y) : x(x), y(y) {}
Point operator+(Poi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// 点类
class Point {
public:
double x, y;
Point(){};
Point(double x, double y) : x(x), y(y) {}
Point operator+(Poi... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 20]] | 1 | 2,187 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define dump(a) (cerr << #a <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define dump(a) (cerr << #a <... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 320 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, W;
vector<int> v, w;
int dp[10001];
int main() {
cin >> N >> W;
v.resize(N);
w.resize(N);
for (int i = 0; i < N; i++)
cin >> v[i] >> w[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < W; j++) {
if (j - w[i] < 0)
continue;
... | #include <bits/stdc++.h>
using namespace std;
int N, W;
vector<int> v, w;
int dp[10001];
int main() {
cin >> N >> W;
v.resize(N);
w.resize(N);
for (int i = 0; i < N; i++)
cin >> v[i] >> w[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
if (j - w[i] < 0)
continue;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 162 | 2 |
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX_N = 100;
const int MAX_W = 1000;
int dp[MAX_N + 1][MAX_W + 1];
int N, W;
int w[MAX_N];
int v[MAX_N];
void solve() {
for (int i = 0; i < N; i++) {
for (int j = 0; j < W; j++) {
if (j < w[i]) {
dp[i + 1][j]... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX_N = 100;
const int MAX_W = 10000;
int dp[MAX_N + 1][MAX_W + 1];
int N, W;
int w[MAX_N];
int v[MAX_N];
void solve() {
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {
dp[i + 1][... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 250 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
scanf("%d", &N);
scanf("%d", &W);
vector<int> v(N);
vector<int> w(N);
for (int i = 0; i < N; i++) {
scanf("%d", &v[i]);
scanf("%d", &w[i]);
}
vector<vector<int>> dp(N + 1, vector<int>(W +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
scanf("%d", &N);
scanf("%d", &W);
vector<int> v(N);
vector<int> w(N);
for (int i = 0; i < N; i++) {
scanf("%d", &v[i]);
scanf("%d", &w[i]);
}
vector<vector<int>> dp(N + 1, vector<int>(W +... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 246 | 6 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define VARIABLE(x) cerr << #x... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define VARIABLE(x) cerr << #x... | [["-", 3, 4, 0, 66, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 66, 28, 69, 341, 342, 0, 13]] | 1 | 332 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
typedef long long ll;
typedef unsigned lon... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
typedef long long ll;
typedef unsigned lon... | [["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 331 | 2 |
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int v[N], w[N];
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
int DP[N + 1][W + 1];
for (int i = 0; i < N + 1; i++) {
DP[i][0] = 0;
}
for (int i = 0; i < W + 1; i++) {
DP[0][i] = 0;
}... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int v[N], w[N];
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
int DP[N + 1][W + 1];
for (int i = 0; i < N + 1; i++) {
DP[i][0] = 0;
}
for (int i = 0; i < W + 1; i++) {
DP[0][i] = 0;
}... | [["-", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 303 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int v[N], w[N];
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
int DP[N + 1][W + 1];
for (int j = 0; j <= W; j++) {
DP[0][j] = 0;
}
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= W; j++) {
... |
#include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int v[N], w[N];
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
int DP[N + 1][W + 1];
for (int j = 0; j <= W; j++) {
DP[0][j] = 0;
}
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= W; j++) {
... | [["-", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 273 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
#define REP(var, count) for (int var = 0; var < count; var++)
int DP[110][10010]; // N???????????§????????????????¨?w
int main(void) {
int N, W;
cin >> N >> W;
REP(i, N) {
int v, w;
cin >> v >> w;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
#define REP(var, count) for (int var = 0; var < count; var++)
int DP[110][10010]; // N???????????§????????????????¨?w
int main(void) {
int N, W;
cin >> N >> W;
REP(i, N) {
int v, w;
cin >> v >> w;
... | [["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 178 | 2 |
/*
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_C&lang=jp
*/
#include <iostream>
using namespace std;
int v[1001], w[1001];
int n, k;
int dp[101][10001];
/*
ナップサック
iは品物の番号、jはその時の重さ
*/
void knapsack() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (w[i] > j) {
d... | /*
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_C&lang=jp
*/
#include <iostream>
using namespace std;
int v[1001], w[1001];
int n, k;
int dp[101][10001];
/*
ナップサック
iは品物の番号、jはその時の重さ
*/
void knapsack() {
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k; j++) {
if (w[i] > j) {
dp... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 198 | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, h;
int v[105], w[105];
int d[105][105];
int main() {
cin >> n >> h;
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= h; j++) {
if (h < w[i])
d[i + 1][j] = d[i][j];
else if (h >= ... | #include <bits/stdc++.h>
using namespace std;
int n, h;
int v[105], w[105];
int d[105][10005];
int main() {
cin >> n >> h;
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= h; j++) {
if (j < w[i])
d[i + 1][j] = d[i][j];
else if (j >... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 196 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
#define v first
#define w second
using namespace std;
typedef pair<int, int> pii;
int main(void) {
int n, m;
cin >> n >> m;
vector<pii> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].v >> a[i].w;
int dp[10001];
fill(dp, dp + 10001, 0);
... | #include <algorithm>
#include <iostream>
#include <vector>
#define v first
#define w second
using namespace std;
typedef pair<int, int> pii;
int main(void) {
int n, m;
cin >> n >> m;
vector<pii> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].v >> a[i].w;
int dp[10001];
fill(dp, dp + 10001, 0);
... | [["-", 0, 16, 12, 118, 28, 69, 341, 342, 0, 22], ["+", 0, 16, 12, 118, 28, 69, 341, 342, 0, 22]] | 1 | 189 | 2 |
n = gets.to_i
s = n.times.map { gets.to_i }
list = [-1]
debug = nil
s.each{|a|
puts " " if debug
p "a = #{a}" if debug
p "list = #{list}" if debug
# a???list???????°???????????°????????????°?????????????¬????a???
if list.last < a # list????????????a???????°?????????£??????
p "if : #{list} << #{a}" if debu... | n = gets.to_i
s = n.times.map { gets.to_i }
list = [-1]
debug = nil
s.each{|a|
puts " " if debug
p "a = #{a}" if debug
p "list = #{list}" if debug
# a???list???????°???????????°????????????°?????????????¬????a???
if list.last < a # list????????????a???????°?????????£??????
p "if : #{list} << #{a}" if debu... | [["+", 75, 95, 0, 89, 8, 170, 0, 751, 0, 121], ["+", 75, 95, 0, 89, 8, 170, 0, 751, 15, 22]] | 4 | 254 | 2 |
n = gets.to_i
a = []
n.times{ a << gets.to_i }
dp = Array.new
dp << -1
n.times do |i|
if dp.last < a[i]
dp << a[i]
else
left = 0
right = dp.size
mid = 0
while left <= right
mid = (left + right)/2
if a[i] >= dp[mid]
left = mid + 1
else
right = mid - 1
end
... | n = gets.to_i
a = []
n.times{ a << gets.to_i }
dp = Array.new
dp << -1
n.times do |i|
if dp.last < a[i]
dp << a[i]
else
left = 0
right = dp.size - 1
mid = 0
while left <= right
mid = (left + right)/2
if a[i] >= dp[mid]
left = mid + 1
else
right = mid - 1
... | [["+", 0, 121, 75, 95, 0, 662, 12, 738, 17, 33], ["+", 0, 121, 75, 95, 0, 662, 12, 738, 12, 612]] | 4 | 140 | 2 |
import bisect
a = int(input())
b = [int(input()) for d in range(a)]
c = [b[1]]
for i in b[1:]:
if c[-1] < i:
c.append(i)
else:
c[bisect.bisect_left(c,i)] = i
print(len(c))
| import bisect
a = int(input())
b = [int(input()) for d in range(a)]
c = [b[0]]
for i in b[1:]:
if c[-1] < i:
c.append(i)
else:
c[bisect.bisect_left(c,i)] = i
print(len(c))
| [["-", 0, 1, 0, 662, 12, 634, 0, 206, 206, 612], ["+", 0, 1, 0, 662, 12, 634, 0, 206, 206, 612]] | 5 | 81 | 2 |
from sys import stdin
import bisect
readline = stdin.readline
dp = [-float('inf')]
n = int(readline())
a = (int(readline()) for _ in range(n))
for ai in a:
if dp[-1] < ai:
dp.append(ai)
else:
dp[bisect.bisect(dp, ai)] = ai
print(len(dp) - 1) | from sys import stdin
from bisect import bisect_left
readline = stdin.readline
dp = [-float('inf')]
n = int(readline())
a = (int(readline()) for _ in range(n))
for ai in a:
if dp[-1] < ai:
dp.append(ai)
else:
dp[bisect_left(dp, ai)] = ai
print(len(dp) - 1) | [["-", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 314], ["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 487], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["-", 0, 662, 31, 206, 206, 652, 63, 319, 500, 22], ["-", 0, 662, 31, 206, 206, 652, 63, 319, 0, 131], ["-", 0, 662, 31, 206, 206,... | 5 | 91 | 8 |
import bisect
def lis(A):
n = len(A)
L = [0] * n
L[0] = A[0]
length = 1
for i in range(1, n):
if L[length - 1] < A[i]:
L[length] = A[i]
length += 1
else:
L[bisect.bisect_left(L, A[i])] = A[i]
return length
n = int(input())
a = [int(input()) ... | import bisect
def lis(A):
n = len(A)
L = [0] * n
L[0] = A[0]
length = 1
for i in range(1, n):
if L[length - 1] < A[i]:
L[length] = A[i]
length += 1
else:
L[bisect.bisect_left(L[:length], A[i])] = A[i]
return length
n = int(input())
a = [int(... | [["+", 31, 206, 206, 652, 3, 4, 0, 206, 0, 70], ["+", 206, 652, 3, 4, 0, 206, 206, 663, 0, 102], ["+", 206, 652, 3, 4, 0, 206, 206, 663, 0, 22], ["+", 31, 206, 206, 652, 3, 4, 0, 206, 0, 73]] | 5 | 123 | 4 |
import bisect
n=eval(input())
a=[eval(input()) for i in range(n)]
dp=[float('inf') for _ in range(n)]
for i in range(n):
dp[bisect.bisect_left(dp,a[i])]=a[i]
print(dp)
for i in range(n):
if dp[i]==float('inf'):
i-=1
break
print((i+1)) | import bisect
n=eval(input())
a=[eval(input()) for i in range(n)]
dp=[float('inf') for _ in range(n)]
for i in range(n):
dp[bisect.bisect_left(dp,a[i])]=a[i]
for i in range(n):
if dp[i]==float('inf'):
i-=1
break
print((i+1)) | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 108 | 4 |
# -*- coding: utf-8 -*-
from bisect import bisect
N = int(input())
A = [int(input()) for _ in range(N)]
L = [A[0]]
for i in range(1, N):
if L[-1] < A[i]:
L.append(A[i])
else:
L[bisect(L, A[i])] = A[i]
print(len(L)) | # -*- coding: utf-8 -*-
from bisect import bisect_left
N = int(input())
A = [int(input()) for _ in range(N)]
L = [A[0]]
for i in range(1, N):
if L[-1] < A[i]:
L.append(A[i])
else:
L[bisect_left(L, A[i])] = A[i]
print(len(L)) | [["-", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["-", 0, 1, 0, 662, 31, 206, 206, 652, 63, 22], ["+", 0, 1, 0, 662, 31, 206, 206, 652, 63, 22]] | 5 | 95 | 4 |
import bisect
n = int(input())
A = []
for i in range(n):
num = int(input())
if A == []:
A.append(num)
elif num > A[-1]:
A.append(num)
else:
j = bisect.bisect_left(A, num)
A[j] = num
print(len(A) - 1) | import bisect
n = int(input())
A = []
for i in range(n):
num = int(input())
if A == []:
A.append(num)
elif num > A[-1]:
A.append(num)
else:
j = bisect.bisect_left(A, num)
A[j] = num
print(len(A)) | [["-", 0, 1, 0, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 84 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String A = sc.nextLine();
String B = sc.nextLine();
int NA = A.length();
int NB = B.length();
int[][] dp = new int[NA + 1][NB + 1];
for (int i = 0; i < NA; i++) {
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String A = sc.nextLine();
String B = sc.nextLine();
int NA = A.length();
int NB = B.length();
int[][] dp = new int[NA + 1][NB + 1];
for (int i = 0; i < NA + 1; i++) {
... | [["+", 8, 196, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 279 | 4 |
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s1 = br.readLine();
String s2 = br.readLine();
int len1 = s1.length();
int len2 = s2.length();
in... | import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s1 = br.readLine();
String s2 = br.readLine();
int len1 = s1.length();
int len2 = s2.length();
in... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 298 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s1 = sc.next().toCharArray();
char[] s2 = sc.next().toCharArray();
int n = s1.length;
int m = s2.length;
int[][] dp = new int[2][m + 1];
for (int i = 0; i ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s1 = sc.next().toCharArray();
char[] s2 = sc.next().toCharArray();
int n = s1.length;
int m = s2.length;
int[][] dp = new int[2][m + 1];
for (int i = 0; i ... | [["+", 0, 11, 12, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 11, 12, 492, 3, 4, 0, 16, 12, 499]] | 3 | 350 | 2 |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
private static void solve() {
... |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
private static void solve() {
... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 1,307 | 4 |
#include <stdio.h>
#include <string.h>
char array1[1001], array2[1001];
int a, b, array[1001][1001];
int min(int, int, int);
void search(int, int);
int main(void) {
int i, j;
scanf("%s", array1);
scanf("%s", array2);
a = strlen(array1);
b = strlen(array2);
for (i = a - 1; i >= 0; i--) {
array1[i + 1] ... | #include <stdio.h>
#include <string.h>
char array1[1001], array2[1001];
int a, b, array[1001][1001];
int min(int, int, int);
void search(int, int);
int main(void) {
int i, j;
scanf("%s", array1);
scanf("%s", array2);
a = strlen(array1);
b = strlen(array2);
for (i = a - 1; i >= 0; i--) {
array1[i + 1] ... | [["-", 0, 2, 3, 4, 0, 69, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 71, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 434 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int min(int a, int b) { return (a < b ? a : b); }
int read_file(char *fname,
char **buf) // ??????????????? fname, ?????????????????? buf
// (????????¢??°?????§?????¢????¢????)
{
int n;
char *p;
FILE *fin;
fin ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int min(int a, int b) { return (a < b ? a : b); }
int read_file(char *fname,
char **buf) // ??????????????? fname, ?????????????????? buf
// (????????¢??°?????§?????¢????¢????)
{
int n;
char *p;
FILE *fin;
fin ... | [["-", 0, 11, 12, 69, 28, 69, 71, 16, 17, 33], ["-", 0, 11, 12, 69, 28, 69, 71, 16, 12, 13], ["-", 0, 1, 0, 11, 12, 69, 71, 16, 17, 33], ["-", 0, 1, 0, 11, 12, 69, 71, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 647 | 6 |
#include <iostream>
#include <string>
int cost[1001][1001];
int min(int k, int l) {
if (k > l)
return l;
else
return k;
}
int min3(int k, int l, int m) {
int n = min(k, l);
return min(n, m);
}
void pre(std::string &s1, std::string &s2, int size1, int size2) {
for (int i = 0; i <= size1; i++) {
... | #include <iostream>
#include <string>
int cost[1001][1001];
int min(int k, int l) {
if (k > l)
return l;
else
return k;
}
int min3(int k, int l, int m) {
int n = min(k, l);
return min(n, m);
}
void pre(std::string &s1, std::string &s2, int size1, int size2) {
for (int i = 0; i <= size1; i++) {
... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 1... | 1 | 379 | 8 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int ed(string x, string y) {
vector<vector<int>> tb(
vector<vector<int>>((int)x.size() + 1, vector<int>(y.size() + 1, 0)));
for (int i = 0; i < (int)x.size(); i++)
tb[i][0] = i;
for (int i = 0; i < (int)y.size(); i++)
tb[0]... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int ed(string x, string y) {
vector<vector<int>> tb(
vector<vector<int>>((int)x.size() + 1, vector<int>(y.size() + 1, 0)));
for (int i = 0; i < (int)x.size() + 1; i++)
tb[i][0] = i;
for (int i = 0; i < (int)y.size() + 1; i++)
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 321 | 4 |
#include <iostream>
#include <string>
using namespace std;
int D[1001][1001] = {{0}};
string S, T;
int equal(char c, char d) {
if (c == d)
return 0;
else
return 1;
}
int main() {
cin >> S >> T;
int n = S.size(), m = T.size();
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
i... | #include <iostream>
#include <string>
using namespace std;
int D[1001][1001] = {{0}};
string S, T;
int equal(char c, char d) {
if (c == d)
return 0;
else
return 1;
}
int main() {
cin >> S >> T;
int n = S.size(), m = T.size();
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
i... | [["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 222 | 4 |
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typ... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typ... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 320 | 4 |
// 動的計画法
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
// コイン両替問題：
// 額面が d1, ..., dm のコインで n 支払う
// 各コインの使用枚数は無制限
int coin_changing(vector<int> coin, const int sum) {
static const int INF = 1000000000;
sort(coin.begin(), coin.end());
vector<int> dp(sum + 1, INF);
dp[... | // 動的計画法
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
// コイン両替問題：
// 額面が d1, ..., dm のコインで n 支払う
// 各コインの使用枚数は無制限
int coin_changing(vector<int> coin, const int sum) {
static const int INF = 1000000000;
sort(coin.begin(), coin.end());
vector<int> dp(sum + 1, INF);
dp[... | [["+", 15, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 589 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int levenshtein(string s1, string s2) {
int len1 = s1.size(), len2 = s2.size();
vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1));
for (auto i = 0; i < len1; i++)
dp[i][0] = i;
for (auto i = 0; i < len2;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int levenshtein(string s1, string s2) {
int len1 = s1.size(), len2 = s2.size();
vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1));
for (auto i = 0; i <= len1; i++)
dp[i][0] = i;
for (auto i = 0; i <= len... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 251 | 8 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 100000000
typede... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 100000000
typede... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 340 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MAX 1010
string s1, s2;
int dp[MAX][MAX]... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MAX 1010
string s1, s2;
int dp[MAX][MAX]... | [["+", 51, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 51, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 51, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 260 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1005;
int dp[MAX][MAX];
int edit_distance(const string &s1, const string &s2) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < (int)s1.size(); i++)
dp[i][0] = i;
for (int i = 0; i < (int)s2.size(); i++)
dp[0][i] = i;
for (int i = 1; i <= ... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1005;
int dp[MAX][MAX];
int edit_distance(const string &s1, const string &s2) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= (int)s1.size(); i++)
dp[i][0] = i;
for (int i = 0; i <= (int)s2.size(); i++)
dp[0][i] = i;
for (int i = 1; i <... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 272 | 4 |
// Edit Distance (Levenshtein Distance)
#include <bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main() {
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < 1001; i++) {
dp[i][0] = i;
dp[0][i] = i;
}
for (int i = 1; i <= s1.length(); i++)
for (int j = 1; j <= s2.length(); j++)
... | // Edit Distance (Levenshtein Distance)
#include <bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main() {
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < 1001; i++) {
dp[i][0] = i;
dp[0][i] = i;
}
for (int i = 1; i <= s1.length(); i++)
for (int j = 1; j <= s2.length(); j++)
... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 209 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define dump(a) (cerr << #a <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define dump(a) (cerr << #a <... | [["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 351 | 4 |
#include <iostream>
#include <string>
using namespace std;
int L[1000][1000];
int main() {
string a, b;
cin >> a;
cin >> b;
for (int i = 0; i <= a.size(); ++i)
L[i][0] = i;
for (int i = 0; i <= b.size(); ++i)
L[0][i] = i;
for (int i = 1; i <= a.size(); ++i) {
for (int j = 1; j <= b.size(); ++j... | #include <iostream>
#include <string>
using namespace std;
int L[1001][1001];
int main() {
string a, b;
cin >> a;
cin >> b;
for (int i = 0; i <= a.size(); ++i)
L[i][0] = i;
for (int i = 0; i <= b.size(); ++i)
L[0][i] = i;
for (int i = 1; i <= a.size(); ++i) {
for (int j = 1; j <= b.size(); ++j... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, ... | 1 | 230 | 8 |
#include <algorithm>
#include <iostream>
#include <string>
#define INF (1ULL << 20)
using namespace std;
int dp[1001][1001];
int main() {
fill(dp[0], dp[1000], INF);
string s1, s2;
cin >> s1 >> s2;
int s1size = s1.size() + 1, s2size = s2.size() + 1;
for (int i = 0; i < s1size; ++i) {
for (int j = 0; j <... | #include <algorithm>
#include <iostream>
#include <string>
#define INF (1ULL << 20)
using namespace std;
int dp[1001][1001];
int main() {
fill(dp[0], dp[1000], INF);
string s1, s2;
cin >> s1 >> s2;
int s1size = s1.size() + 1, s2size = s2.size() + 1;
for (int i = 0; i < s1size; ++i) {
for (int j = 0; j <... | [["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 225 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
// d[i][j]:=?????????s1???1?????????~i??????????????§?????¨??????????????¨?????????s2???1?????????~j??????????????§?????¨?????????????????¨????????¢
//(index???0?????¨... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
// d[i][j]:=?????????s1???1?????????~i??????????????§?????¨??????????????¨?????????s2???1?????????~j??????????????§?????¨?????????????????¨????????¢
//(index???0?????¨... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 235 | 8 |
#include <bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main() {
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < 1001; i++) {
for (int j = 0; j < 1001; j++)
dp[i][j] = INT_MAX;
}
dp[0][0] = 0;
for (int i = 1; i <= (int)s1.size(); i++)
dp[i][0] = i;
for (int i = 1; i <= (int... | #include <bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main() {
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < 1001; i++) {
for (int j = 0; j < 1001; j++)
dp[i][j] = INT_MAX;
}
dp[0][0] = 0;
for (int i = 1; i <= (int)s1.size(); i++)
dp[i][0] = i;
for (int i = 1; i <= (int... | [["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 300 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int D[1001][1001] = {};
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i <= s1.length(); i++) {
for (int j = 0; j <= s2.length(); j++) {
if (i + j =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int D[1001][1001] = {};
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i <= s1.length(); i++) {
for (int j = 0; j <= s2.length(); j++) {
if (i + j =... | [["-", 3, 4, 0, 16, 12, 23, 0, 41, 64, 13], ["+", 3, 4, 0, 16, 12, 23, 0, 41, 64, 13]] | 1 | 262 | 25 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
static const int INF = 1e9;
int dp[1001][1001];
void solve() {
string s1, s2;
cin >> s1 >> s2;
int m = s1.size();
int n = s2.size();
for (int i = 0; i <= m; ++i) {
for (int j = 0; j <= n; ++j) {
dp[i][j] = INF;
}
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
static const int INF = 1e9;
int dp[1001][1001];
void solve() {
string s1, s2;
cin >> s1 >> s2;
int m = s1.size();
int n = s2.size();
for (int i = 0; i <= m; ++i) {
for (int j = 0; j <= n; ++j) {
dp[i][j] = INF;
}
... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 310 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define IOI 101
#define IOIOIOIOI 101010101
int dp[10 * IOI][10 * IOI];
string S, T;
int main() {
for (int i = 0; i < 10 * IOI; i++) {
for (int j = 0; j < 10 * IOI; j++) {
dp[i][j] = IOIOIOIOI;
}
}
cin >> S;
cin >> T;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define IOI 101
#define IOIOIOIOI 101010101
int dp[10 * IOI][10 * IOI];
string S, T;
int main() {
for (int i = 0; i < 10 * IOI; i++) {
for (int j = 0; j < 10 * IOI; j++) {
dp[i][j] = IOIOIOIOI;
}
}
cin >> S;
cin >> T;
... | [["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 22], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 310 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
typedef pair<int, string> P;
int main() {
string s1, s2;
cin >> s1 >> s2;
int n1 = s1.length();
int n2 = s2.length();
int dp[n1 + 1][n2 + 1];
fill(dp[0], dp[n1 + 1], 1e5);
for (int i = 0; i <= n1; i++)
dp[i][0] = i;
for (int i = 0; i <= ... | #include <algorithm>
#include <iostream>
using namespace std;
typedef pair<int, string> P;
int main() {
string s1, s2;
cin >> s1 >> s2;
int n1 = s1.length();
int n2 = s2.length();
int dp[n1 + 1][n2 + 1];
fill(dp[0], dp[n1 + 1], 1e5);
for (int i = 0; i <= n1; i++)
dp[i][0] = i;
for (int i = 0; i <= ... | [["+", 15, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 247 | 4 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1,... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1,... | [["+", 28, 69, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 28, 69, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 277 | 38 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mo... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 282 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namesp... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 269 | 4 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int dp[1001][1001] = {0};
int n, m;
string st1, st2;
int main(void) {
cin >> st1;
cin >> st2;... | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int dp[1001][1001] = {0};
int n, m;
string st1, st2;
int main(void) {
cin >> st1;
cin >> st2;... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 314 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main() {
string X, Y;
cin >> X;
cin >> Y;
for (int i = 0; i <= X.length(); i++) {
c[i][0] = i;
}
for (int j = 0; j <= Y.length(); j++) {
c[0][j] = j;
}
for (int i ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main() {
string X, Y;
cin >> X;
cin >> Y;
for (int i = 0; i <= X.length(); i++) {
c[i][0] = i;
}
for (int j = 0; j <= Y.length(); j++) {
c[0][j] = j;
}
for (int i ... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 268 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s1, s2;
void solve() {
int dp[s1.size() + 1][s2.size() + 1];
for (int i = 0; i < s1.size(); i++) {
dp[i][0] = i;
}
for (int i = 0; i < s2.size(); i++) {
dp[0][i] = i;
}
for (int i = 1; i <= s1.size(); i++) {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s1, s2;
void solve() {
int dp[s1.size() + 1][s2.size() + 1];
for (int i = 0; i <= s1.size(); i++) {
dp[i][0] = i;
}
for (int i = 0; i <= s2.size(); i++) {
dp[0][i] = i;
}
for (int i = 1; i <= s1.size(); i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 257 | 8 |
#include <iostream>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (n); i++)
const int M = 10000;
int memo[M + 1][M + 1];
int main() {
string s, t;
cin >> s >> t;
repeat(i, M + 1) memo[i][0] = memo[0][i] = i;
repeat(i, s.size() + 1) {
repeat(j, t.size() + 1) {
if (i == 0 or j == 0)
... | #include <iostream>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (n); i++)
const int M = 10000;
int memo[M + 1][M + 1];
int main() {
string s, t;
cin >> s >> t;
repeat(i, M + 1) memo[i][0] = memo[0][i] = i;
repeat(i, s.size() + 1) {
repeat(j, t.size() + 1) {
if (i == 0 or j == 0)
... | [["-", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 239 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int M = 1e9 + 7;
int main() {
int n, k, a = 1;
cin >> n >> k;
r(i, n) a = (a * k) % M;
cout << a << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int M = 1e9 + 7;
main() {
int n, k, a = 1;
cin >> n >> k;
r(i, n) a = (a * k) % M;
cout << a << endl;
}
| [["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40]] | 1 | 64 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
int ans = 1;
lp(i, n) ans *= k, ans %= (1000000007);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
long long ans = 1;
lp(i, n) ans *= k, ans %= (1000000007);
cout << ans << endl;
return 0;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 61 | 3 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
#define MOD 1000000007
#define MAX_P 200005
Int fact[MAX_P], inv[MAX_P], finv[MAX_P];
;
Int extgcd(Int a, Int b, Int &x, Int &y) {
Int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
#define MOD 1000000007
#define MAX_P 200005
Int fact[MAX_P], inv[MAX_P], finv[MAX_P];
;
Int extgcd(Int a, Int b, Int &x, Int &y) {
Int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16... | 1 | 990 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
const int inf = 999999999999999999;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
const int inf = 999999999999999999;
... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 318 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define INF 999999999
using namespace std;
string s1, s2;
int d[1050][1050];
int tmin(int a, int b, int c) {
int d = min(a, b);
int res = min(d, c);
return res;
}
int main() {
cin >> ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define INF 999999999
using namespace std;
string s1, s2;
int d[1050][1050];
int tmin(int a, int b, int c) {
int d = min(a, b);
int res = min(d, c);
return res;
}
int main() {
cin >> ... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 312 | 4 |
#include <bits/stdc++.h>
using namespace std;
int LevenshteinDistance(string s1, string s2) {
int d[s1.length() + 1][s2.length() + 1];
for (int i = 0; i <= s1.length(); i++)
d[i][0] = i;
for (int i = 0; i <= s2.length(); i++)
d[0][i] = i;
for (int i = 1; i <= s1.length(); i++) {
for (int j = 1; j ... | #include <bits/stdc++.h>
using namespace std;
int LevenshteinDistance(string s1, string s2) {
int d[s1.length() + 1][s2.length() + 1];
for (int i = 0; i <= s1.length(); i++)
d[i][0] = i;
for (int i = 0; i <= s2.length(); i++)
d[0][i] = i;
for (int i = 1; i <= s1.length(); i++) {
for (int j = 1; j ... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 258 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb push_back
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb push_back
#defi... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 878 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s1, s2;
cin >> s1 >> s2;
int dp[1010][1010];
for (int i = 0; i <= s1.size(); i++) {
dp[0][i] = i;
}
for (int i = 0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s1, s2;
cin >> s1 >> s2;
int dp[1010][1010];
for (int i = 0; i <= s1.size(); i++) {
dp[0][i] = i;
}
for (int i = 0... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 341 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X)... |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X)... | [["-", 28, 69, 28, 2, 3, 4, 0, 16, 31, 22], ["+", 28, 69, 28, 2, 3, 4, 0, 16, 31, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 369 | 8 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 347 | 4 |
#include <stdio.h>
#include <string.h>
int min(int a, int b) { return a > b ? b : a; }
int dp[1001][1001];
int main() {
char s1[1001];
char s2[1001];
scanf("%s", &s1);
scanf("%s", &s2);
dp[0][0] = 0;
for (int i = 1; i <= strlen(s1); i++) {
dp[i][0] = 1;
}
for (int i = 1; i <= strlen(s2); i++) {
... | #include <stdio.h>
#include <string.h>
int min(int a, int b) { return a > b ? b : a; }
int dp[1001][1001];
int main() {
char s1[1001];
char s2[1001];
scanf("%s", &s1);
scanf("%s", &s2);
dp[0][0] = 0;
for (int i = 1; i <= strlen(s1); i++) {
dp[i][0] = i;
}
for (int i = 1; i <= strlen(s2); i++) {
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 290 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double, double> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<double, double> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 433 | 4 |
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FOR2(i, z, n) for (int i = z; i < n; i++)
int main() {
string str1, str2;
cin >> str1 >> str2;
vector<vector<int>> matrix(str1.length() + 1,
vector<int>(str2.length() +... | #include <iostream>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FOR2(i, z, n) for (int i = z; i < n; i++)
int main() {
string str1, str2;
cin >> str1 >> str2;
vector<vector<int>> matrix(str1.length() + 1,
vector<int>(str2.length() +... | [["+", 0, 9, 0, 43, 49, 50, 51, 23, 0, 24], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 9, 0, 43, 49, 50, 51, 23, 0, 25]] | 1 | 256 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream> //动态规划剪枝是么从dp0开始
#include <memory.h>
#include <string> //stl和数据结构应该一起训练
using namespace std;
int dp[1001][1001]; //模拟三种操作，首先分析题目看看能不能模拟操作
int n;
int solve(string a, string b) {
int len1 = a.size(), len2 = b.size();
for (int i = 0; i <= len1; i++)
dp[i][0... | #include <algorithm>
#include <cmath>
#include <iostream> //动态规划剪枝是么从dp0开始
#include <memory.h>
#include <string> //stl和数据结构应该一起训练
using namespace std;
int dp[1001][1001]; //模拟三种操作，首先分析题目看看能不能模拟操作
int n;
int solve(string a, string b) {
int len1 = a.size(), len2 = b.size();
for (int i = 0; i <= len1; i++)
dp[i][0... | [["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 22]] | 1 | 262 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, k, n) for (int i = k; i < n; i++)
#define mmax(start, end) *max_element(start, end)
#define mmin(start, end) *min_element(start, end)
#define argmax max_element
#define argmin min_element
#define push push_back
#define pop pop_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, k, n) for (int i = k; i < n; i++)
#define mmax(start, end) *max_element(start, end)
#define mmin(start, end) *min_element(start, end)
#define argmax max_element
#define argmin min_element
#define push push_back
#define pop pop_... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 390 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespac... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespac... | [["-", 51, 41, 15, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 41, 15, 16, 12, 69, 341, 342, 0, 22]] | 1 | 308 | 2 |
str1 = gets.chomp
str2 = gets.chomp
lenStr1 = str1.length
lenStr2 = str2.length
matrix = Array.new()
(lenStr2+1).times{|i| matrix.push(Array.new(lenStr1,0))}
for i in 1..lenStr1 do
matrix[0][i] = i
end
for i in 1..lenStr2 do
matrix[i][0] = i
end
for i in 1..lenStr1 do
for j in 1..lenStr2 do
x = (str1[j-1] == str2[... | str1 = gets.chomp
str2 = gets.chomp
lenStr1 = str1.length
lenStr2 = str2.length
matrix = Array.new
(lenStr2+1).times{|i| matrix.push(Array.new(lenStr1,0))}
for i in 1..lenStr1 do
matrix[0][i] = i
end
for i in 1..lenStr2 do
matrix[i][0] = i
end
for i in 1..lenStr1 do
for j in 1..lenStr2 do
x = (str1[i-1] == str2[j-... | [["-", 0, 493, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 493, 0, 652, 486, 739, 0, 24], ["-", 15, 739, 0, 738, 31, 742, 0, 738, 31, 22], ["+", 15, 739, 0, 738, 31, 742, 0, 738, 31, 22], ["-", 15, 739, 0, 738, 12, 742, 0, 738, 31, 22], ["+", 15, 739, 0, 738, 12, 742, 0, 738, 31, 22]] | 4 | 193 | 6 |
s1 = gets.chomp
s2 = gets.chomp
# s1???????????°???[0..s1.size]?????£?????´???
# s2???????????°???[0..s2.size]?????£?????´???
# ??¨???????????????
res = Array.new(s1.size.succ).map{Array.new(s2.size.succ, 0)}
# ????????????????????????0???????????¨????????¢?????????????????????
for i in (0..s1.size) do
res[i][0] = i... | s1 = gets.chomp
s2 = gets.chomp
# s1???????????°???[0..s1.size]?????£?????´???
# s2???????????°???[0..s2.size]?????£?????´???
# ??¨???????????????
res = Array.new(s1.size.succ).map{Array.new(s2.size.succ, 0)}
# ????????????????????????0???????????¨????????¢?????????????????????
for i in (0..s1.size) do
res[i][0] = i... | [["+", 0, 121, 15, 738, 31, 742, 0, 738, 17, 33], ["+", 0, 121, 15, 738, 31, 742, 0, 738, 12, 612], ["+", 0, 121, 15, 738, 12, 742, 0, 738, 17, 33], ["+", 0, 121, 15, 738, 12, 742, 0, 738, 12, 612]] | 4 | 198 | 4 |
def make2d(m,n)
Array.new(m).map{Array.new(n,0)}
end
def min(x,y,z)
if x > y
return y
else
return x
end
end
def align_ed(s,t)
m = s.length()
n = t.length()
a = make2d(m+1,n+1)
a[0][0] = 0
for j in 1..n
a[0][j] = a[0][j-1] + 1
end
for i in 1..m
a[i][0] = a[i-1][0] + 1
end
fo... |
def make2d(m,n)
Array.new(m).map{Array.new(n,0)}
end
def min(x,y)
if x > y
return y
else
return x
end
end
def align_ed(s,t)
m = s.length()
n = t.length()
a = make2d(m+1,n+1)
a[0][0] = 0
for j in 1..n
a[0][j] = a[0][j-1] + 1
end
for i in 1..m
a[i][0] = a[i-1][0] + 1
end
for ... | [["-", 36, 36, 0, 493, 0, 735, 54, 778, 0, 21], ["-", 36, 36, 0, 493, 0, 735, 54, 778, 0, 22]] | 4 | 257 | 2 |
s1=input()
s2=input()
ls1=len(s1)
ls2=len(s2)
f=[[0 for j in range(ls2+1)] for i in range(ls1+1)]
for i in range(ls1+1):
f[i][0]=i
for i in range(ls2+1):
f[0][i]=i
for i in range(1,ls1+1):
for j in range(1,ls2+1):
if s1[i-1]!=s2[j-1]:
f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)
... | s1=input()
s2=input()
ls1=len(s1)
ls2=len(s2)
f=[[0 for j in range(ls2+1)] for i in range(ls1+1)]
for i in range(ls1+1):
f[i][0]=i
for i in range(ls2+1):
f[0][i]=i
for i in range(1,ls1+1):
for j in range(1,ls2+1):
if s1[i-1]!=s2[j-1]:
f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)
... | [["+", 0, 652, 3, 4, 0, 206, 51, 206, 0, 70], ["+", 0, 652, 3, 4, 0, 206, 51, 206, 206, 22], ["+", 0, 652, 3, 4, 0, 206, 51, 206, 0, 73], ["+", 0, 1, 0, 652, 3, 4, 0, 206, 0, 70], ["+", 0, 1, 0, 652, 3, 4, 0, 206, 206, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 206, 0, 73]] | 5 | 197 | 6 |
def ed(l1,l2):
dp=[[0 for x in range(len(l2)+1)] for y in range(len(l1)+1)]
for i in range(1,len(l1)+1):
dp[i][0]=i+1
for i in range(1,len(l2)+1):
dp[0][i]=i+1
for i in range(1,len(l1)+1):
for j in range(1,len(l2)+1):
if l1[i-1]==l2[j-1]:
cost... |
def ed(l1,l2):
dp=[[0 for x in range(len(l2)+1)] for y in range(len(l1)+1)]
for i in range(1,len(l1)+1):
dp[i][0]=i
for i in range(1,len(l2)+1):
dp[0][i]=i
for i in range(1,len(l1)+1):
for j in range(1,len(l2)+1):
if l1[i-1]==l2[j-1]:
cost=0
... | [["-", 8, 196, 0, 1, 0, 662, 12, 657, 17, 72], ["-", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 231 | 4 |
def levenshtein(X,Y):
f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]
for i in range(len(X)+1):
f[i][0]=i
for j in range(1,len(Y)+1):
f[0][j]=j
for i in range(1,len(X)+1):
for j in range(len(Y)+1):
if X[i-1]==Y[j-1]:
f[i][j]=min(f[i-1][j]+1,f[... | def levenshtein(X,Y):
f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]
for i in range(len(X)+1):
f[i][0]=i
for j in range(len(Y)+1):
f[0][j]=j
for i in range(1,len(X)+1):
for j in range(1,len(Y)+1):
if X[i-1]==Y[j-1]:
f[i][j]=min(f[i-1][j]+1,f[... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 257 | 4 |
def search(X,Y):
n=len(X)
m=len(Y)
p=[i for i in range(m+1)]
for i in range(n):
q=list(range(m+1))
q[0] = i+1
for j in range(m):
if X[i]==Y[j]:
cost=0
else:
cost=1
q[j+1]=min(p[j+1]+1,q[j]+1,p[j]+cost)
p,q=q,p
return pre[m]
X=input()
Y=input()
print(search(X,Y))
| def search(X,Y):
n=len(X)
m=len(Y)
p=[i for i in range(m+1)]
for i in range(n):
q=list(range(m+1))
q[0] = i+1
for j in range(m):
if X[i]==Y[j]:
cost=0
else:
cost=1
q[j+1]=min(p[j+1]+1,q[j]+1,p[j]+cost)
p,q=q,p
return p[m]
X=input()
Y=input()
print(search(X,Y))
| [["-", 0, 14, 8, 196, 0, 37, 0, 206, 51, 22], ["+", 0, 14, 8, 196, 0, 37, 0, 206, 51, 22]] | 5 | 151 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.