DieOrThink

#include#include#includeusing namespace std;#define N 1010__int64 a[N],b[N];__int64 inf;int main(){ int n,m; inf=1; for(int i=1;i<=18;i++) inf*=10; while(scanf("%d%d",&

#include#include#includeusing namespace std;const int N =110;int a[N];int dp[N][N];int main(){ int t; int n,m; scanf("%d",&t); while(t--){ scanf("%d%d",&n,&m); for(int i=1;

#include#include#includeusing namespace std;const int inf = 1000000007;int dp1[10010];int dp2[10010];int dp3[10010];int main(){ int n,x,y,a,b; while(scanf("%d%d%d%d%d",&n,&x,&y,&a,&b)!=EOF){

#include#include#includeusing namespace std;const int N=1010;const int inf=1e9+7;int dp[N];int main(){ int n; int Case=1; while(scanf("%d",&n)!=EOF){ memset(dp,0,sizeof(dp)); dp[1]=1;

#include#include#includeusing namespace std;const int N =210;int a[N];int dp[N][N];int main(){ int n; while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++){ scanf("%d",&a[i]); a[i+n]=a[i];

#include#include#includeusing namespace std;const int N =110;const int M =100005;int m;struct node{ int num; int val;}s[N];int dp[M];void CompletePack(int cost,int val){ for(int i=cost;i

#include#include#includeusing namespace std;const int inf=-0x7f7f7f7f;const int N =110;const int M =1010;struct node{ int val; int cost;}s[N];int dp[M][N];int main(){ int t; int n,m,l;

#include#include#include#includeusing namespace std;const int N=105;const int M=10005;const int inf=-0x7f7f7f7f;struct node{ int val; int cost;};vectorg[N];int dp[N][M];int main(){

#include#include#include#includeusing namespace std;const int inf =-0x7f7f7f7f;const int N =110;struct node{ int cost; int val;};vectorg[N];int dp[N][N];int flag[N];int main(){ int n,m;

#include#include#include#includeusing namespace std;const int N =1010;struct node{ int val; int cost;}s[N];int set[N];int dp[N];vectorg[N];bool flag[N];int temp[N];int find(int x){ int

#include#include#include#includeusing namespace std;const int N =1505;vectorg[N];bool flag[N];int dp[N][2];void dfs(int root){ if(g[root].size()==0){ dp[root][0]=0; dp[root][1]=1; ret

#include#include#include#include#include#includeusing namespace std;mapma;map::iterator na;const int N =210;char str1[N],str2[N];int cnt;int dp[N][2];bool uniq[N][2];int find(string str)

#include#include#include#includeusing namespace std;const int N =6005;int val[N];int dp[N][2];vectorg[N];bool flag[N];void dfs(int rt){ if(g[rt].size()==0){ dp[rt][1]=val[rt]; dp[rt][0

#include#include#include#includeusing namespace std;const int N =32005;const int M =62;vectorg[M];struct node{ int cost; int val;}s[M];int dp[M][N];void dfs(int rt,int m){ if(m==0){ r

#include#include#includeusing namespace std;const int N =125;int dp[N];__int64 a1[N],b1[N];int main(){ int a,b,t; while(scanf("%d%d%d",&a,&b,&t)!=EOF){ t/=15; int temp1=

#include#include#includeusing namespace std;const int N=110;struct node{ int price; int score; int val;}s[N];int dp[N][N][7];int main(){ int n,v1,v2,k; while(scanf("%d%d%d%d",&n,&v1,&v2,&

#include#include#includeusing namespace std;const int N=1010;struct node{ int st,ed; int val;}s[N];int dp[110];int cmp(node x,node y){ return x.ed<y.ed;}int main(){ int t; int n,m; sca

#include#include#includeusing namespace std;int dp[1010];int main(){ int n,m; while(scanf("%d",&n)!=EOF){ m=n; memset(dp,0,sizeof(dp)); dp[0]=1; for(int i=

#include#include#includeusing namespace std;#define N 1010struct node{ int x,y,val;}s[30];int dp[N][N];int main(){ int t,n,v1,v2; scanf("%d",&t); while(t--){ scanf("%d%

#include#include#includeusing namespace std;#define N 110#define inf 0x7f7f7f7fint edge[N][N];int a[N];int dp[10010];int main(){ int t,n,m; scanf("%d",&t); while(t--){ sca

#include#include#includeusing namespace std;#define inf 0x7f7f7f7f#define N 10005int a[N];int dp[N][2];int main(){ int n; while(scanf("%d",&n)!=EOF){ for(int i=1;i<=n;i++){ scanf("%d",&

#include#include#includeusing namespace std;#define inf 0x7f7f7f7f#define N 110int a[N];int dp[N][N];int main(){ int n; while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++){ scanf("%d",&a[i

#include#include#includeusing namespace std;#define inf 0x7f7f7f7f#define N 10010struct node{ int v; node *next; };struct vertexNode{ node *head;}g[N];struct type{ int st,c

#include#include#includeusing namespace std;#define N 35int dp[N][N];int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF){ memset(dp,0,sizeof(dp)); dp[0][1]=1; for(int i=1;i<=m;i++){

#include#include#includeusing namespace std;#define N 2010int Length[N];int RunState[N][505];int StopState[N][501];int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF){ for(int i=1;i<=n;i+

#include#include#includeusing namespace std;int dp[110][110][2];void getsolve(){ memset(dp,0,sizeof(dp)); dp[1][1][1]=0; dp[1][0][1]=1; dp[1][0][0]=1; dp[1][1][0]=0; for(int i=2;i<=100;i++

解法一：#include#include#includeusing namespace std;#define N 110#define inf -10000int a[N];int dp[N][N][N];int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF){ memset(dp,0,sizeof(dp)); f

#include#include#includeusing namespace std;#define inf 1000000007#define N 100005int a[N];int b[N];void getsolve(){ b[0]=1; for(int i=1;i<=N;i++){ b[i]=b[i-1]*2%inf; } return;}int mai

#include#include#includeusing namespace std;#define N 10002#define M 122double rate[M][M];double dp[N][M];int a[N];int main(){ int n,m; while(scanf("%d",&m)!=EOF){ int r=m*(m-1)*(m-2)/6;

#include#include#includeusing namespace std;#define inf 10000000#define N 310int a[N];int sum[N];int dp[N][N];int main(){ int n; while(scanf("%d",&n)!=EOF){ sum[0]=0; memset(dp,0,sizeof

#include#include#include#includeusing namespace std;const int N =310;int val[N];vectorg[N];int dp[N][N];void dfs(int rt,int m){ if(m==0) { return; } for(int h=0;h<g[rt].size();h++){ i