Submission #1120414

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120414		vjudge1	Tracks in the Snow (BOI13_tracks)	C++11	0 / 100	1 ms	508 KiB

tracks

#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define endl "\n"
#define MAX 1003
#define ff first
#define ss second
using namespace std;

/*const int MAXN = 2e+5 + 5;

int temp;
int n, k;
vector <pair<int, int>> v(105);
vector <vector <int>> dp(105, vector <int>(105));

int solve(int i, int x) {
	if (i >= n || x > k) return 0;
	if (dp[i][x] != -1) return 0;
	int a = solve(i+1, x);
	int b = 0;
	if (x + v[i].ff <= k) b = solve(i+1, x+v[i].ff) + v[i].ss;
	return dp[i][x] = max(a, b);
}*/

signed main() {
	
	GOOD_LUCK
	
    int t=1;
//	cin >> t;
    while (t--) {
    	cout << 2;
	}
    return 0;
}
// Problem D
// by Ekber_Ekber

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70