Ellery的book

#include<iostream>#include<string.h>using namespace std;int a[200];int dp[200][200];int main(){ int t;cin>>t; int cn=1; while(t--){ memset(dp,0,sizeof(dp)); int n;scanf(...

You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively. Each player can take one or more numbers from the left or...

One curious child has a set of N little bricks. From these bricks he builds different staircases. Staircase consists of steps of different sizes in a strictly descending order. It is not allowed for s...

Let’s call some positive integer classy if its decimal representation contains no more than 3 non-zero digits. For example, numbers 4, 200000, 10203 are classy and numbers 4231, 102306, 7277420000 are...

Dear Contestant,I’m going to have a party at my villa at Hali-Bula to celebrate my retirement from BCM. I wish I could invite all my co-workers, but imagine how an employee can enjoy a party when he ...

Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, ...

A school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Ma...

A balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indicated by the digit. When a pivot is ...

At 184~280 A.D ,there were many kingdoms in China. Three strongest among them are “Wei”, “Shu”, “Wu”. People call this period as “Three Kingdoms”.HH is a super “Three Kingdoms” fan, because at this p...

Balanced numbers have been used by mathematicians for centuries. A positive integer is considered a balanced number if: Every even digit appears an odd number of times in its decimal representation...

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, for all of h...

Input41 21 31 4Output1HintThe only set is {2,3,4}.Please use #pragma comment(linker, “/STACK:16777216”)Sample Input41 21 31 4Sample Output1HintThe only set is {2,3,4}.Ple...

A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monk...

Now I think you have got an AC in Ignatius.L’s “Max Sum” problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.Given ...

时间限制: 1 Sec 内存限制: 256 MB提交: 188 解决: 49[提交] [状态] [命题人:admin]题目描述商店正在出售小C最喜欢的系列玩具，在接下来的n周中，每周会出售其中的一款，同一款玩具不会重复出现。由于是小C最喜欢的系列，他希望尽可能多地购买这些玩具，但是同一款玩具小C只会购买一个。同时，小C的预算只有m元，因此他无法将每一款都纳入囊中。此外，小C不能连续两...

#include<iostream>#include<string.h>using namespace std;int a[200];int dp[200][200];int main(){ int t;cin>>t; int cn=1; while(t--){ memset(dp,0,sizeof(dp)); int n;scanf(...

#include<iostream>#include<string.h>#define inf 0x3f3f3f3fusing namespace std;int a[100];int r;int dp[1003][1003];int main(){ int sl; while(cin>>sl){ if(sl==0) break; int...

#include<iostream>#include<string.h>#define inf 0x3f3f3f3fusing namespace std;int a[100];int r;int dp[1003][1003];int main(){ int sl; while(cin>>sl){ if(sl==0) break; int...

一维数组01背包模板#include<iostream>#include<string.h>#include<algorithm>using namespace std;int a[1100];int m;int dp[1009];int main(){ int n; while(~scanf("%d",&n),n){ memset...

多重背包模板：#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int dp[100009];int a[20];int num[1009];int main(){ int al; while(cin>>al){ int n;cin&...

分组，每组只取一个的背包#include<iostream>using namespace std;int s[109],v[109],w[109];int dp[102][10009];int max(int a,int b,int c){ int t=a>b?a:b; return t>c?t:c;}int main(){ int n,...

#include<iostream>#include<string.h>using namespace std;const int mod=10007;int dp[1009][1009];int main(){ int t;int ca=0; while(~scanf("%d",&t)){ ca++; string ss;cin>&...

#include<iostream>#include<string.h>using namespace std;const int mod=10007;int dp[1009][1009];int main(){ int t;int ca=0; while(~scanf("%d",&t)){ ca++; string ss;cin>&...

#include<iostream>#include<string.h>using namespace std;int a[10009];int dp[10009];int vis[25][10009];int main(){ int n;int N; while(~scanf("%d",&N)){ memset(dp,0,sizeof(dp));...

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;struct node{ int a,b,c;}a[430];int dp[40500];bool cmp(node a,node b){ return a.b<b.b;}int m...

#include<iostream>#include<string.h>using namespace std;int dp[109][109];int main(){ string a; while(cin>>a){ if(a=="end") break; int n=a.size(); memset(dp,0,sizeof(dp))...

Firdaws and Fatinah are living in a country with n cities, numbered from 1 to n. Each city has a risk of kidnapping or robbery.Firdaws’s home locates in the city u, and Fatinah’s home locates in th...