Submission #48888

#TimeUsernameProblemLanguageResultExecution timeMemory
48888updown1printf 함수 1 (BSC_0_1)C++17
0 / 100
2 ms128 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define For(i, a, b) for(int i=a; i<b; i++) #define ffi For(i, 0, N) #define ffj For(j, 0, K+1) #define ffa ffi ffj #define s <<" "<< #define w cout #define e "\n" #define pb push_back #define mp make_pair #define a first #define b second //#define int ll //500,000,000 operations const int MAXN = 100000, INF = 100000000; //Global Variables int N, K, pre[MAXN], dp[MAXN][201], BIG=1000000, from[MAXN][201]; int main() { //ifstream cin("test.in"); ios_base::sync_with_stdio(0); cin.tie(0); cin >> N >> K; /*cin >> pre[0]; For (i, 1, N) { int a; cin >> a; pre[i] = a+pre[i-1]; }*/ }
#Verdict Execution timeMemoryGrader output
Fetching results...