关于括号的打法

最新推荐文章于 2024-06-04 05:41:15 发布

SAW992

最新推荐文章于 2024-06-04 05:41:15 发布

阅读量303

点赞数

文章标签： c++ 算法 c语言

本文链接：https://blog.csdn.net/weixin_72506718/article/details/130714424

版权

#include <bits/stdc++.h>
#define ll long long
#define int long long
#define ull unsigned long long
#define vb v.begin()
#define ve v.end()
#define vc v.clear()
#define vs (int)v.size()
#define ss (int)s.size()
#define rs(i) resize(i)
#define ft first
#define sd second
#define inf 0x3f3f3f3f
#define P pair<int, int>
#define Pll pair<ll, ll>
#define Pis pair<int, string>
#define Psi pair<string, int>
#define Pic pair<int, char>
#define Pci pair<char, int>
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define rofn(i, a, b) for (int i = a; i > b; i--)
#define rofe(i, a, b) for (int i = a; i >= b; i--)
#define Ios ios::sync_with_stdio(false), cin.tie(0)
const ll N = 100020;
const ll M = 110;
const int INF = 2147483647;
using namespace std;
signed main()
{
	Ios;
	string s;
	cin >> s;
	int n;
	cin >> n;
	int cnt = 0;
	forn(i, 0, s.size())
	{
		if (s[i] == '1')
		{
			cnt += ((ll)1 << (s.size() - 1 - i));//正确的打法
		}
	}
	//cout << ((ll)1 << 60);
	if (cnt > n)
	{
		cout << -1 << endl;
		return 0;
	}
	forn(i, 0, s.size())
	{
		if (s[i] == '?')
		{
			if (cnt + ((ll)1 << (s.size() - 1 - i)) <= n) cnt += ((ll)1 << (s.size() - 1 - i));
			//else break;
		}
		/*
		else
		{
			if (s[i] == '1')
			{
				if ((ll)1 << (s.size() - 1 - i)+cnt > n)
				{
					cout << -1<<endl;
					return 0;
				}
				else
				{
					cnt += (ll)1 << (s.size() - 1 - i);

				}
			}
		}
		*/
		
	}
	if (cnt > n)
	{
		cout << -1 << endl;
		return 0;
	}
	cout << cnt << endl;
	return 0;
}
/*

*/
/*******************************************
				  坤坤助我
............................................
............................................
............................................
............................................
.............................1ffLf1.........
............................GGGGGGGC........
....................8CCCftCCCCC1;LLG,.......
..................:CC8CCC.CCCCCCii..........
.................CC88CCCC.CCCCCCC...........
................CC88CCCCC .8.:8CCC..........
................888 CCCCC.88888G;;,.........
,................888CC88.888888888,.........
:::...............CCC888.888888888..........
:::::............Gi1tC8f888888C88,..........
:::::::,........111tttfffffLG8888...........
:::::::::,....ii111ttttttfffttG.............
::::::::::::i111tttffffffffffttt............
::::::::::11tttttfff....fffffftt ...........
..:::::::1Lf1tff,..........fffff1...........
....,:::iiftG::::::.........,LLGtL..........
::::::;:i11t:;;;;;;::,,,,,,,,, f1ii,::,,,,,,
::::::::i11t:::::::::::::::::::f111:::::::::
::::::::111:::::::::::::::::::::t111::::::::
:::::::i1if::::::,,,,,,,,,,,,,,:i111::::::,:
,,,,,::,8G,,,,,,,,,,,,,,,,,,,,,,,tL1:,,,,,,,
,,,,,,:LGL;,,,,,,,,,,,,,,,,,,,,,,,CLf,,,,,,,
,,,,,;LGGG,,,,:,,,,,,,,,,,,,,,,,,,LGCG,,,,,,

*******************************************/

#include <bits/stdc++.h>
#define ll long long
#define int long long
#define ull unsigned long long
#define vb v.begin()
#define ve v.end()
#define vc v.clear()
#define vs (int)v.size()
#define ss (int)s.size()
#define rs(i) resize(i)
#define ft first
#define sd second
#define inf 0x3f3f3f3f
#define P pair<int, int>
#define Pll pair<ll, ll>
#define Pis pair<int, string>
#define Psi pair<string, int>
#define Pic pair<int, char>
#define Pci pair<char, int>
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define rofn(i, a, b) for (int i = a; i > b; i--)
#define rofe(i, a, b) for (int i = a; i >= b; i--)
#define Ios ios::sync_with_stdio(false), cin.tie(0)
const ll N = 100020;
const ll M = 110;
const int INF = 2147483647;
using namespace std;
signed main()
{
	Ios;
	string s;
	cin >> s;
	int n;
	cin >> n;
	int cnt = 0;
	forn(i, 0, s.size())
	{
		if (s[i] == '1')
		{
			cnt += (ll)(1 << (s.size() - 1 - i));//错误的打法
		}
	}
	//cout << ((ll)1 << 60);
	if (cnt > n)
	{
		cout << -1 << endl;
		return 0;
	}
	forn(i, 0, s.size())
	{
		if (s[i] == '?')
		{
			if (cnt + (ll)(1 << (s.size() - 1 - i)) <= n) cnt += (ll)(1 << (s.size() - 1 - i));
			//else break;
		}
		/*
		else
		{
			if (s[i] == '1')
			{
				if ((ll)1 << (s.size() - 1 - i)+cnt > n)
				{
					cout << -1<<endl;
					return 0;
				}
				else
				{
					cnt += (ll)1 << (s.size() - 1 - i);

				}
			}
		}
		*/
		
	}
	if (cnt > n)
	{
		cout << -1 << endl;
		return 0;
	}
	cout << cnt << endl;
	return 0;
}
/*

*/
/*******************************************
				  坤坤助我
............................................
............................................
............................................
............................................
.............................1ffLf1.........
............................GGGGGGGC........
....................8CCCftCCCCC1;LLG,.......
..................:CC8CCC.CCCCCCii..........
.................CC88CCCC.CCCCCCC...........
................CC88CCCCC .8.:8CCC..........
................888 CCCCC.88888G;;,.........
,................888CC88.888888888,.........
:::...............CCC888.888888888..........
:::::............Gi1tC8f888888C88,..........
:::::::,........111tttfffffLG8888...........
:::::::::,....ii111ttttttfffttG.............
::::::::::::i111tttffffffffffttt............
::::::::::11tttttfff....fffffftt ...........
..:::::::1Lf1tff,..........fffff1...........
....,:::iiftG::::::.........,LLGtL..........
::::::;:i11t:;;;;;;::,,,,,,,,, f1ii,::,,,,,,
::::::::i11t:::::::::::::::::::f111:::::::::
::::::::111:::::::::::::::::::::t111::::::::
:::::::i1if::::::,,,,,,,,,,,,,,:i111::::::,:
,,,,,::,8G,,,,,,,,,,,,,,,,,,,,,,,tL1:,,,,,,,
,,,,,,:LGL;,,,,,,,,,,,,,,,,,,,,,,,CLf,,,,,,,
,,,,,;LGGG,,,,:,,,,,,,,,,,,,,,,,,,LGCG,,,,,,

*******************************************/

里面的1还是int类型

括号可以用于改变运算符的优先级