牛客月赛42

A.冰狱寒岚 思路

我们将这个数对2048取模得k，如果k大于等于1024那么我们就返回k-2048否则直接返回k

Code

#include
using namespace std;
#define ll long long
#define mod 1000000009
ll ksm(ll a,ll b) {
	ll ans = 1;
	for(;b;b>>=1LL) {
		if(b & 1) ans = ans * a % mod;
		a = a * a % mod;
	}
	return ans;
}

ll lowbit(ll x){return -x & x;}

const int N = 2e6+10;

int a[N];
ll n,x;

ll f(ll k) {
	k %= 2048;
	if(k >= 1024) return (k-2048);
	else return k;
}

int main()
{
	cin>>n;
	for(int i = 1;i >a[i];
		a[i] = f(a[i]);
	}
	for(int i = 1;i >y;
		bool fg = true;
		for(ll i = 0LL;i >f>>x;
		cout 10000000000LL ) {
		return;
	}
	if(loc == y) {
		fg = true;
		ans = min(ans,cnt);
		return;
	}
	if(loc >x>>y;
	dfs(0,x);
	if(fg) coutt;
	while(t--) {
		cin>>a>>b>>c>>N;
		int cnt = 0;
		while(a