제출 #572953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572953		BenyKarimi	Knapsack (NOI18_knapsack)	C++17	0 / 100	0 ms	212 KiB

knapsack

#include<bits/stdc++.h>

#define For(i, x, n) for(int i = x; i < n; i++)
#define Rof(i, x, n) for(int i = n - 1; i >= x; i--)

#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define F first
#define S second
#define pb push_back
#define po pop_back
#define En endl
#define endl "\n"

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend();

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;

///const int MN = ;
const int MOD = 1e9 + 7;
const int LOG = 20;
const LL INF = 1e18 + 7;

int main () {
    IOS;
    cout << "JON" << En; 
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27