2020 Multi-University Training Contest 6---- HDU--6828、Little Rabbit‘s Equation（模拟）

题目链接

题面：

题意：
判定给定等式在 2−162-162−16 进制，最低几进制下成立。

题解：
模拟即可，注意进制最低为2。

代码：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<bitset>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<ctime>
#define ui unsigned int
#define ll long long
#define llu unsigned ll
#define ld long double
#define pr make_pair
#define pb push_back
#define lc (cnt<<1)
#define rc (cnt<<1|1)
#define len(x)  (t[(x)].r-t[(x)].l+1)
#define tmid ((l+r)>>1)
#define fhead(x) for(int i=head[(x)];i;i=nt[i])
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
using namespace std;const int inf=0x3f3f3f3f;
const ll lnf=0x3f3f3f3f3f3f3f3f;
const double dnf=1e18;
const double alpha=0.75;
const int mod=998244353;
const double eps=1e-8;
const double pi=acos(-1.0);
const int hp=13331;
const int maxn=1100;
const int maxm=100100;
const int maxp=100100;
const int up=1100;map<char,int>mp;
void init(void)
{mp['0']=0,mp['1']=1,mp['2']=2;mp['3']=3,mp['4']=4,mp['5']=5;mp['6']=6,mp['7']=7,mp['8']=8;mp['9']=9,mp['A']=10,mp['B']=11;mp['C']=12,mp['D']=13,mp['E']=14;mp['F']=15;
}char str[110];ll get(int l,int r,int p)
{ll ans=0;for(int i=l;i<=r;i++)ans=ans*p+mp[str[i]];return ans;
}int main(void)
{init();while(scanf("%s",str+1)!=EOF){int len=strlen(str+1);int pos1=0,pos2=0;int l=2,r=16;for(int i=1;i<=len;i++){if(str[i]=='+'||str[i]=='-'||str[i]=='*'||str[i]=='/')pos1=i;else if(str[i]=='=')pos2=i;else l=max(l,mp[str[i]]+1);}ll ans1,ans2,ans3;bool flag=false;for(int i=l;i<=r;i++){ans1=get(1,pos1-1,i);ans2=get(pos1+1,pos2-1,i);ans3=get(pos2+1,len,i);if(str[pos1]=='+'){if(ans1+ans2==ans3){printf("%d\n",i);flag=true;break;}}else if(str[pos1]=='-'){if(ans1-ans2==ans3){printf("%d\n",i);flag=true;break;}}else if(str[pos1]=='*'){if(ans1*ans2==ans3){printf("%d\n",i);flag=true;break;}}if(str[pos1]=='/'){if(ans1/ans2==ans3&&ans1%ans2==0){printf("%d\n",i);flag=true;break;}}}if(flag==false) printf("-1\n");}return 0;
}

2020 Multi-University Training Contest 6---- HDU--6828、Little Rabbit‘s Equation（模拟）相关推荐

2017 Multi-University Training Contest - Team 7：1008. Hard challenge（模拟）
其他题目题解: 2017 Multi-University Training Contest - Team 7:1005. Euler theorem 2017 Multi-University Tr ...
2017 Multi-University Training Contest 3 hdu 6063
HDU 6063 思路: AC代码: #include "iostream" #include "string.h" #include "stack& ...
2016 Multi-University Training Contest 10 [HDU 5861] Road （线段树：区间覆盖+单点最大小）...
HDU 5861 题意在n个村庄之间存在n-1段路,令某段路开放一天需要交纳wi的费用,但是每段路只能开放一次,一旦关闭将不再开放.现在给你接下来m天内的计划,在第i天,需要对村庄ai到村庄bi的道 ...
2018 Multi-University Training Contest 6-oval-and-rectangle(hdu 6362)-题解
一.题意求椭圆内接矩形周长的期望. 二.推导过程已知$c$,容易得出矩形弦长$d=4a\sqrt{1-\frac{c^2}{b^2}}$ 接下来,矩形周长$p=4c+d=4c+4a\sqrt{1- ...
HDU 6091 - Rikka with Match | 2017 Multi-University Training Contest 5
思路来自某FXXL 不过复杂度咋算的.. /* HDU 6091 - Rikka with Match [ 树形DP ] | 2017 Multi-University Training Conte ...
HDU 6051 - If the starlight never fade | 2017 Multi-University Training Contest 2
/* HDU 6051 - If the starlight never fade [ 原根,欧拉函数 ] | 2017 Multi-University Training Contest 2 题意: ...
HDU 6058 - Kanade's sum | 2017 Multi-University Training Contest 3
/* HDU 6058 - Kanade's sum [ 思维,链表 ] | 2017 Multi-University Training Contest 3 题意:给出排列 a[N],求所有区间的第 ...
hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925 Apple Tree Time Limit: 2000/1000 MS (Java/Others ...
HDU 2019 Multi-University Training Contest 1 杭电2019多校联合训练赛第一场 1001 Blank (6578)
HDU 2019 Multi-University Training Contest 1 杭电2019暑期多校集训第一场 1001 Blank (6578) Problem Description T ...
HDU 6638 [2019 Multi-University Training Contest 6]
Snowy Smile Problem Description There are n pirate chests buried in Byteland, labeled by 1,2,-,n. Th ...

2020 Multi-University Training Contest 6---- HDU--6828、Little Rabbit‘s Equation（模拟）

2020 Multi-University Training Contest 6---- HDU--6828、Little Rabbit‘s Equation（模拟）相关推荐

最新文章

热门文章