- 博客(2)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 ZOJ-3162-To Go or Not to Go
点击打开题目链接 # include # include # include using namespace std; double dp[30][2]; void init() { memset(dp,0,sizeof(dp)); for(int i = 1;i < 30;i++){ dp[i][1] = dp[i-1][1] + dp[i-1
2015-11-13 20:27:10
530
原创 ZOJ-3897-Fiddlesticks
题目链接 # include # include using namespace std; int e[1100]; int main() { int t; scanf("%d",&t); while(t--){ int n,c,x = 0,ans; scanf("%d%d",&n,&c); for(
2015-11-05 21:37:51
450
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人