题:https://nanti.jisuanke.com/t/41420 定义 dp[x][y] 表示第 x 个数到最后一个数能组成和为 y 的方案数 #include<bits/stdc++.h> using namespace std; typedef long long ll; ; ; ; int dp[N][M]; int a[N]; int main(){ int t; scanf("%d",&t); while(t--){ ; scanf("%…
Description There is an old stone game.At the beginning of the game the player picks n(1<=n<=50000) piles of stones in a line. The goal is to merge the stones in one pile observing the following rules: At each step of the game,the player can merge t…
http://www.skywind.me/blog/archives/1029 http://blog.csdn.net/skywind/article/details/8164713 https://github.com/skywind3000/gobang gobang Gobang game with artificial intelligence in 900 Lines !! How to play Download: git clone https://github.com/sky…