제출 #429765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
429765		dreezy	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	332 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;
/* subtask1 : brutazo*/
/*subtask 2 easy brutazo*/
#define ll long long

/***

answer is you either chose a bit or you dont
but, when we have multiple of the same bits we get repetition
we need to count how many times that happens


if they were all differente then answer is

a.size() chose x

we need to count repetitions

2^2 + 2^2 + 2^4 == 8 + 16 = 24

2^3 + 2^3 + 2^3 = 8 + 8 + 8 = 16

*/

long long count_tastiness(long long x, vector<long long> a) {
	ll ans = 0;
	
	//vector that stores how many bits we can use to make this power of two
	
	 for(ll pow : a)
			ans+= pow!= 0;
	
	return ans;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23