hdu 5083 有坑+字符串模拟水题

http://acm.hdu.edu.cn/showproblem.php?pid=5083

机器码和操作互相转化

注意SET还要判断末5位不为0输出Error


#pragma comment(linker, "/STACK:36777216")
#pragma GCC optimize ("O2")
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <iostream>
#include <algorithm>
using namespace std;
#define RD(x) scanf("%d",&x)
#define RD2(x,y) scanf("%d%d",&x,&y)
#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define clr0(x) memset(x,0,sizeof(x))
#define eps 1e-9
const double pi = acos(-1.0);
typedef long long LL;
const int modo = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int maxn = 55,maxm = 1e4 + 5;
string op[10] = {"","ADD","SUB","DIV","MUL","MOVE","SET"};
int real[26];
char s[maxn];
int getnum(int x,int y)
{
    int ans = 0;
    for(int i = x;i <= y;++i){
        ans += (s[i] - '0')<<(y-i);
    }
    return ans;
}
void print(int x,int len)
{
    int ans[10],num = 0;
    while(x){
        ans[num++] = x&1;
        x>>=1;
    }
    while(--len >= num)
        printf("0");
    while(num){
        printf("%d",ans[--num]);
    }
    return ;
}
int main(){
    int _;
    for(int i = 1;i <= 6;++i){
        real[op[i][op[i].length() - 1] - 'A'] = i;
    }
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d",&_)){
        if(_ == 0){
            scanf("%s",s);
            int _op = getnum(0,5);
            if(_op >= 7 || _op <= 0){
                printf("Error!\n");
                continue;
            }
            if(_op == 6){
                int x = getnum(6,10),y = getnum(11,15);
                if(!x || x > 31 || y != 0){
                    printf("Error!\n");
                    continue;
                }
                cout<<op[_op];
                printf(" R%d\n",x);
            }
            else{
                int x = getnum(6,10),y = getnum(11,15);
                if(!x || !y || x > 31|| y > 31){
                    printf("Error!\n");
                    continue;
                }
                cout<<op[_op];
                printf(" R%d,R%d\n",x,y);
            }
        }else{
            int __ = 0,_op,_a,_b;
            scanf("%s",s);
            _op = real[s[strlen(s) - 1] - 'A'];//cout<<s<<' '<<_op<<endl;
            if(_op == 6){
                scanf(" R%d",&_a);
                print(_op,6),print(_a,5),print(0,5);
                puts("");
            }else{
                scanf(" R%d,R%d",&_a,&_b);
                print(_op,6),print(_a,5),print(_b,5);
                puts("");
            }
        }
    }
    return 0;
}


转载于:https://www.cnblogs.com/zibaohun/p/4060203.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值