Hello World

#include<bits/stdc++.h> using namespace std; const int inf=1e9; int n; int a[310],s[310]; int dp[310][310]; int main(){ cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i&...

01背包 #include<iostream> #include<cstring> using namespace std; const int maxn=1e5+1000; int n,m; int v[maxn],w[maxn]; int dp[maxn]; int main(){ cin>>n>>m; memset(dp,0,sizeof(...

Description Goneril is a very sleep-deprived cow. Her day is partitioned into N (3 <= N <= 3,830) equal time periods but she can spend only B (2 <= B < N) not necessarily contiguous period...

Description Let’s imagine how apple tree looks in binary computer world. You’re right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enumera...

Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his ‘toilet series’ (where he had to use his toilet paper to draw on, ...