Instruction

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 343    Accepted Submission(s): 99

Problem Description
Nowadays, Jim Green has produced a kind of computer called JG. In his computer, the instruction is represented by binary code. However when we code in this computer, we use some mnemonic symbols. For example, ADD R1, R2 means to add the number in register R1
and R2, then store the result to R1. But this instruction cannot be execute directly by computer, before this instruction is executed, it must be changed to binary code which can be executed by computer. Each instruction corresponds to a 16-bit binary code.
The higher 6 bits indicates the operation code, the middle 5 bits indicates the destination operator, and the lower 5 bits indicates the source operator. You can see Form 1 for more details.

15 operation
code(6 bits)109destination
operator code(5 bits)54source
operator code(5 bits)0Form
1

In JG system there are 6 instructions which are listed in Form 2.

instructionADD
Ra,RbSUB Ra,RbDIV
Ra,RbMUL Ra,RbMOVE
Ra,RbSET RafunctionAdd
the number in register Ra and Rb, then store the result to Ra.Subtract
the number in register Ra to Rb, then store the result to Ra.Divide
the number in register Ra by Rb, then store the result to Ra.Mulplicate
the number in register Ra and Rb, then store the result to Ra.Move
the number in register Rb to Ra.Set 0 to Ra.Form
2

Operation code is generated according to Form 3.

OperationADDSUBDIVMULMOVESETOperation
code000001000010000011000100000101000110Form
3

Destination operator code and source operator code is the register code of the register which is related to.

There are 31 registers in total. Their names are R1,R2,R3…,R30,R31. The register code of Ri is the last 5 bits of the number of i in the binary system. For eaxample the register code of R1 is 00001, the register code of R2 is 00010, the register code of R7
is 00111, the register code of R10 is 01010, the register code of R31 is 11111.

So we can transfer an instruction into a 16-bit binary code easyly. For example, if we want to transfer the instruction ADD R1,R2, we know the operation is ADD whose operation code is 000001, destination operator code is 00001 which is the register code of
R1, and source operator code is 00010 which is the register code of R2. So we joint them to get the 16-bit binary code which is 0000010000100010.

However for the instruction SET Ra, there is no source register, so we fill the lower 5 bits with five 0s. For example, the 16-bit binary code of SET R10 is 0001100101000000

You are expected to write a program to transfer an instruction into a 16-bit binary code or vice-versa.

 
Input
Multi test cases (about 50000), every case contains two lines.

First line contains a type sign, ‘0’ or ‘1’. 

‘1’ means you should transfer an instruction into a 16-bit binary code;

‘0’ means you should transfer a 16-bit binary code into an instruction.

For the second line.

If the type sign is ‘1’, an instruction will appear in the standard form which will be given in technical specification; 

Otherwise, a 16-bit binary code will appear instead.

Please process to the end of file.



[Technical Specification]

The standard form of instructions is 

ADD Ra,Rb

SUB Ra,Rb

DIV Ra,Rb

MUL Ra,Rb

MOVE Ra,Rb

SET Ra

which are also listed in the Form 2.

1≤a,b≤31

There is exactly one space after operation, and exactly one comma between Ra and Rb other than the instruction SET Ra. No other character will appear in the instruction.
 
Output
For type ‘0’,if the 16-bit binary code cannot be transferred into a instruction according to the description output “Error!” (without quote), otherwise transfer the 16-bit binary code into instruction and output the instruction in the standard form in a single
line.

For type ‘1’, transfer the instruction into 16-bit binary code and output it in a single line.
 
Sample Input
1
ADD R1,R2
0
0000010000100010
0
1111111111111111
 
Sample Output
0000010000100010
ADD R1,R2
Error!
 
Source
 
Recommend
 
题意:将二进制编码转化成字符命令,或将字符命令转化成二进制。共同拥有六种命令。每种命令相应一个二进制编码。见题目表格。然后操作数有31种,各自是R1~R31,相应分别二进制00000~11111;当中要注意SET命令仅仅有一个操作数。它的二进制编码最后5位所有写为0,若SET操作输入的二进制编码后五位不全是0,则输出Error!。不满足要求的命令也输出Error。。另外操作数不能是00000.
蛋疼的一题,考虑不周。比赛没做出来。。。

。代码比較乱啊啊啊啊啊

代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define maxn 1005
#define MAXN 2005
#define mod 1000000009
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-6
typedef long long ll;
using namespace std; char ope[6][5]={{"ADD"},{"SUB"},{"DIV"},{"MUL"},{"MOVE"},{"SET"}};
char code[6][7]={{"000001"},{"000010"},{"000011"},{"000100"},{"000101"},{"000110"}};
char co[31][6]={ {"00001"} , {"00010"} , {"00011"} , {"00100"} , {"00101"} , {"00110"} , {"00111"} , {"01000"} , {"01001"} , {"01010"}
, {"01011"} , {"01100"} , {"01101"} , {"01110"} , {"01111"} , {"10000"} , {"10001"} , {"10010"} , {"10011"} , {"10100"}
, {"10101"} , {"10110"} , {"10111"} , {"11000"} , {"11001"} , {"11010"} , {"11011"} , {"11100"} , {"11101"} , {"11110"}
, {"11111"}};
char s1[5],s2[10]; int OP(char str[])
{
for (int i=0;i<6;i++)
{
if (strcmp(str,ope[i])==0)
return i;
}
} int main()
{
int n;
while (~scanf("%d",&n))
{
if (n==1)
{
scanf("%s%s",s1,s2);
int x=OP(s1);
int dd=x;
printf("%s",code[x]);
x=s2[1]-'0';
int ok=0;
if (isdigit(s2[2]))
{
ok=1;
x=x*10;
x=x+s2[2]-'0';
}
x--;
printf("%s",co[x]);
if (dd==5)
{
printf("00000\n");
continue;
}
if (ok)
{
x=s2[5]-'0';
if (isdigit(s2[6]))
{
x=x*10;
x=x+s2[6]-'0';
}
}
else
{
x=s2[4]-'0';
if (isdigit(s2[5]))
{
x=x*10;
x=x+s2[5]-'0';
}
}
x--;
printf("%s\n",co[x]);
}
else if (n==0)
{
scanf("%s",s1);
int len=strlen(s1);
int t=1;
int sum=0;
for (int i=5;i>=0;i--)
{
int x=s1[i]-'0';
sum+=t*x;
t=t*2;
}
if (sum>6||sum==0)
{
printf("Error!\n");
continue;
}
sum--;
int o=sum;
int flag=sum;
// printf("%s",ope[sum]);
t=1;
sum=0;
for (int i=10;i>=6;i--)
{
int x=s1[i]-'0';
sum+=t*x;
t=t*2;
}
if (sum>31||sum==0)
{
printf("Error!\n");
continue;
}
int aa=sum;
// printf(" R%d",sum);
if (flag==5)
{
t=1;
sum=0;
for (int i=15;i>=11;i--)
{
int x=s1[i]-'0';
// printf("x=%d\n",x);
sum+=t*x;
t=t*2;
}
if (sum==0)
{
printf("%s",ope[o]);
printf(" R%d",aa);
printf("\n");
continue;
}
else
{
printf("Error!\n");
continue;
}
}
t=1;
sum=0;
for (int i=15;i>=11;i--)
{
int x=s1[i]-'0';
// printf("x=%d\n",x);
sum+=t*x;
t=t*2;
}
if (sum>31||sum==0)
{
printf("Error!\n");
continue;
}
printf("%s",ope[o]);
printf(" R%d",aa);
printf(",R%d\n",sum);
}
}
return 0;
}

Instruction (hdu 5083)的更多相关文章

  1. 2道acm编程题(2014):1.编写一个浏览器输入输出(hdu acm1088);2.encoding(hdu1020)

    //1088(参考博客:http://blog.csdn.net/libin56842/article/details/8950688)//1.编写一个浏览器输入输出(hdu acm1088)://思 ...

  2. Bestcoder13 1003.Find Sequence(hdu 5064) 解题报告

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5064 题目意思:给出n个数:a1, a2, ..., an,然后需要从中找出一个最长的序列 b1, b ...

  3. 2013 多校联合 F Magic Ball Game (hdu 4605)

    http://acm.hdu.edu.cn/showproblem.php?pid=4605 Magic Ball Game Time Limit: 10000/5000 MS (Java/Other ...

  4. (多线程dp)Matrix (hdu 2686)

    http://acm.hdu.edu.cn/showproblem.php?pid=2686     Problem Description Yifenfei very like play a num ...

  5. War Chess (hdu 3345)

    http://acm.hdu.edu.cn/showproblem.php?pid=3345 Problem Description War chess is hh's favorite game:I ...

  6. 2012年长春网络赛(hdu命题)

    为迎接9月14号hdu命题的长春网络赛 ACM弱校的弱菜,苦逼的在机房(感谢有你)呻吟几声: 1.对于本次网络赛,本校一共6名正式队员,训练靠的是完全的自主学习意识 2.对于网络赛的群殴模式,想竞争现 ...

  7. BestCoder Round #69 (div.2) Baby Ming and Weight lifting(hdu 5610)

    Baby Ming and Weight lifting Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K ( ...

  8. BestCoder Round #68 (div.2) geometry(hdu 5605)

    geometry Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Su ...

  9. 2013多校联合2 I Warm up 2(hdu 4619)

    Warm up 2 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total ...

随机推荐

  1. JS判断浏览器类型以及版本号

    <script type="text/javascript">        (function(){            window.nav={};       ...

  2. 轻松使用px为单位开发移动端页面

    研究移动端页面已经有许久了,一直执着于rem来开发,不谈性能怎么样,单从工作效率上看影响了不少,首先要固定设计稿的宽度,一般都是固定在640px,然后在根据根目录的字体大小来计算出每个元素的rem的值 ...

  3. Android特效--粒子效果之雨

    1. 单个雨点的行为 2. 完善雨点的行为和构造下雨场景 3. 在XML中定义可以控制下雨的属性 --------------------------------------------------- ...

  4. 【python】闰年规则

    公历闰年判定遵循的规律为: 四年一闰,百年不闰,四百年再闰. 公历闰年的简单计算方法(符合以下条件之一的年份即为闰年)1.能被4整除而不能被100整除.2.能被400整除.

  5. 为什么selenium定位不到元素

    在做web应用的自动化测试时,定位元素是必不可少的,这个过程经常会碰到定位不到元素的情况,一般可以从以下几个方面着手解决: 1.Frame/Iframe原因定位不到元素: 这个是最常见的原因,首先要理 ...

  6. java 转html为pdf

    最近有个需求转html为pdf . 用过itext . pd4ml  ,都不理想,不是样式有问题,就是页面大小有问题. 或字体有问题. 解决办法是通过wkhtmltopdf工具 , 下载地址为:htt ...

  7. u-boot Makefile Source Test

    一.概述 笔者已经写了一篇实现目标文件与源码分开的makefile测试实验,但是觉得不够完美,没有更多的体现u-boot Makefile的工作原理和特点.所以,决定重新修订,使之更加充分的接近u-b ...

  8. linux下配置NFS服务器

    (声明:本文大部分文字摘自Linux NFS服务器的安装与配置) 一.NFS简介     NFS 是Network File System的缩写,即网络文件系统.一种使用于分散式文件系统的协定,由Su ...

  9. 关于如何设置reduce的个数

    在默认情况下,一个MapReduce Job如果不设置Reducer的个数,那么Reducer的个数为1.具体,可以通过JobConf.setNumReduceTasks(int numOfReduc ...

  10. shuffle ----- mr 董西城

    http://dongxicheng.org/framework-on-yarn/apache-spark-shuffle-details/