【Manthan, Codefest 18 (rated, Div. 1 + Div. 2) A】Packets

【链接】我是链接,点我呀:)
【题意】

在这里输入题意

【题解】

多重背包的二进制优化。
就是将数量x分成接近log2x份
然后这log2x份能组合成1..x内的所有数字。
从而将多重背包转化成01背包
1,2,4,8....贪心地选，然后不够的部分x-(1+2+4...)再作为一份就好

【代码】

#include <bits/stdc++.h>
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define lson l,mid,rt<<1
#define ri(x) scanf("%d",&x)
#define rl(x) scanf("%lld",&x)
#define rs(x) scanf("%s",x)
#define rson mid+1,r,rt<<1|1
using namespace std;const double pi = acos(-1);
const int dx[4] = {0,0,1,-1};
const int dy[4] = {1,-1,0,0};int n;int main(){#ifdef LOCAL_DEFINEfreopen("rush_in.txt", "r", stdin);#endifscanf("%d",&n);int now = 0,cnt = 0;for (int i = 1; ;i*=2){now+=i;if (now>n) {now-=i;break;}cnt++;}if (now<n) cnt++;printf("%d\n",cnt);return 0;
}

【Manthan, Codefest 18 (rated, Div. 1 + Div. 2) A】Packets相关推荐

Codefest 18 (rated, Div. 1 + Div. 2)-D-Valid BFS--思维--已知bfs序，求是否正确
Codefest 18 (rated, Div. 1 + Div. 2)-D-Valid BFSvj地址题意:给你一段bfs序列,让你判断是否正确思路:先给节点排序(很关键) 我们给每一个的点的邻 ...
[Manthan, Codefest 18][Codeforces 1037E. Trips]
题目链接:1037E - Trips 题目大意:有n个人,m天,每天晚上都会有一次聚会,一个人会参加一场聚会当且仅当聚会里有至少k个人是他的朋友.每天早上都会有一对人成为好朋友,问每天晚上最多能有多少 ...
Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) F. Bits And Pieces sosdp预处理超集
传送门文章目录题意: 思路: 题意: n≤1e6,ai≤2e6n\le1e6,a_i\le2e6n≤1e6,ai≤2e6 思路: 由于(aj&ak)(a_j \And a_k)(aj& ...
Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)
Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) 题号题目知识点 A XORinacci B Uniqueness ...
Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated) D. Kuroni and the Celebration 交互 + 思维
传送门文章目录题意: 思路: 题意: 给你一颗树,每次可以询问两个点的lcalcalca,询问次数不能超过⌊n2⌋\left \lfloor \frac{n}{2} \right \rfloor⌊ ...
Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)
Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) 题号题目知识点 A Kuroni and the Gifts ...
Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)
Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) 题号题目知识点 A A Variety of Opera ...
Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2)
Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) 题号题目知识点 A Game of Life B Lor ...
Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)
Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) 题号题目知识点 A ...

【Manthan, Codefest 18 (rated, Div. 1 + Div. 2) A】Packets

【Manthan, Codefest 18 (rated, Div. 1 + Div. 2) A】Packets相关推荐

最新文章

热门文章