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;
}

hdu 5083 有坑+字符串模拟水题的更多相关文章

  1. HDU 6213 Chinese Zodiac 【模拟/水题/生肖】

    Problem Description The Chinese Zodiac, known as Sheng Xiao, is based on a twelve-year cycle, each y ...

  2. HDOJ 2317. Nasty Hacks 模拟水题

    Nasty Hacks Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota ...

  3. HDU 2096 小明A+B --- 水题

    HDU 2096 /* HDU 2096 小明A+B --- 水题 */ #include <cstdio> int main() { #ifdef _LOCAL freopen(&quo ...

  4. POJ 2014:Flow Layout 模拟水题

    Flow Layout Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 3091   Accepted: 2148 Descr ...

  5. hdu 2117:Just a Numble(水题,模拟除法运算)

    Just a Numble Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Tot ...

  6. [HDU 2602]Bone Collector ( 0-1背包水题 )

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602 水题啊水题 还给我WA了好多次 因为我在j<w[i]的时候状态没有下传.. #includ ...

  7. hdu 2025:查找最大元素(水题,顺序查找)

    查找最大元素 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Subm ...

  8. hdu 2050:折线分割平面(水题,递归)

    折线分割平面 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Subm ...

  9. hdu 2044:一只小蜜蜂...(水题,斐波那契数列)

    一只小蜜蜂... Time Limit: / MS (Java/Others) Memory Limit: / K (Java/Others) Total Submission(s): Accepte ...

随机推荐

  1. 1C - A + B Problem II

    I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum o ...

  2. Fastdfs 上传图片

    一.fastdfs-client的jar包导入 1.下载地址:https://github.com/happyfish100/fastdfs-client-java 2.将代码使用git下载下来之后, ...

  3. js 闭包 理解 copy

    闭包(closure)是Javascript语言的一个难点,也是它的特色,很多高级应用都要依靠闭包实现. 下面就是我的学习笔记,对于Javascript初学者应该是很有用的. 一.变量的作用域 要理解 ...

  4. LibreOJ 6004. 「网络流 24 题」圆桌聚餐 网络流版子题

    #6004. 「网络流 24 题」圆桌聚餐 内存限制:256 MiB时间限制:5000 ms标准输入输出 题目类型:传统评测方式:Special Judge 上传者: 匿名 提交提交记录统计讨论测试数 ...

  5. refused to Connection

    两种情况: .数据库账号密码错误 .mysql挂了

  6. Armadillo installation

    1.dependencies sudo apt-get install libopenblas-devsudo apt-get install liblapack-devsudo apt-get in ...

  7. js值类型与引用类型

    JavaScript值类型和引用类型有哪些 (1)值类型:数值.布尔值.null.undefined. (2)引用类型:对象.数组.函数. 三.如何理解值类型和引用类型及举例 我们可以用“连锁店”和“ ...

  8. rbenv安装本地ruby安装包

    cd .rbenv mkdir cache #把安装包拷进cache cd cache rbenv install 版本号

  9. 使用thymeleaf一旦没有闭合标签就会报错怎么解决

    问题:input标签未关闭报bug,代码稍有不慎就出小问题 使用springboot的thymeleaf模板时默认会对HTML进行严格的检查,导致当你的标签没有闭合时就会通不过,例如: //要想通过, ...

  10. 2019.01.20 NOIP模拟 迅雷(kruskal/二分+并查集)

    传送门 题意简述:给一张带权无向图,有a,ba,ba,b两类特殊点和普通点,问使得至少有一个aaa和一个bbb连通所需要的所有边边权最小值的最大值是多少. 思路: 一眼发现可以二分,考虑怎么check ...