- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Codeforces#228 (Div. 1)A_贪心
Fox and Box AccumulationFox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. The i-th box can hold at most xi boxes on its top (we’ll call xi th
2016-08-25 15:04:09
414
原创 Codeforces#385C_素数打表+dp
素数打表方法void init_prim() { memset(vis,1,sizeof(vis)); for(int i=2; i<=MM; i++) { if(vis[i]) { if(cnt[i])dp[i]+=cnt[i]; for(int j=i*2; j<=MM; j+=i)
2016-08-24 20:33:03
397
原创 Codeforces#371
There is a system of n vessels arranged one above the other as shown in the figure below. Assume that the vessels are numbered from 1 to n, in the order from the highest to the lowest, the volume of th
2016-08-20 15:00:23
491
原创 Codeforces#414B——Mashmokh and ACM
Mashmokh’s boss, Bimokh, didn’t like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh’s team. I
2016-08-18 13:42:31
649
原创 子集生成
给出一个集合，生成该集合的任意子集。# include<cstdio> # include<iostream> using namespace std; void subset(int n,int* a,int cur) { if(n==cur) { for(int i=1; i<=n; i++) if(a[i-1]) cout<<i<<" "
2016-08-17 22:10:29
459
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人