#460. 走路

http://oj.daimayuan.top/submissions
#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
const int N = 1e5 + 10;
int n, m;
int a[N], b[N];
int f[110][100005];
void solve() {
	cin >> n >> m;
	for (int i = 1;i <= n ;i ++) {
		cin >> a[i] >> b[i];
	}
	f[0][0] = 1;
	for (int i = 1; i <= n ; i ++) {
		for (int j = 0; j <= m; j ++) {
			if (j >= a[i])
				f[i][j] |= f[i - 1][j - a[i]];
			if (j >= b[i])
				f[i][j] |= f[i - 1][j - b[i]];
		}
	}
	for (int i = 0; i <= m; i ++) {
		cout << f[n][i];
	}
}
int main () {
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

注意这里是要看n步之后是否达到。不能不选。所以f[i][j] = f[i - 1][j - a]是不可行的 我一开始选择了这种。