hdu 5083Instruction(模拟大法好)

题目链接:

huangjing

题意:就是解码与编码。。从昨天wa到现在,又是ksh大神给我找的错误,哎,字符串的结尾要以‘\0‘结尾。。因为可能会影响后面的结果。。

题目:

Instruction

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

Total Submission(s): 394    Accepted Submission(s): 116

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

BestCoder Round #15

Recommend

heyang   |   We have carefully selected several similar problems for you:  5085 5084 5081 5080 5079

代码:

#include<cstdio>
#include<cstring>
#include<cstdlib>
char le[2],ri[2],op[16],str[16];

void fun(int n)
{
    for(int i=4;i>=0;i--)
    {
        if(n&(1<<i))  printf("1");
        else printf("0");
    }
}

int main()
{
    int Op,pd,cnt,ok,l,r,mul;
    ind:while(~scanf("%d",&Op))
    {
        if(Op==1)
        {
            ok=0;
            scanf("%s%s",op,str);
            if(strcmp(op,"ADD")==0)
                printf("000001");
            else if(strcmp(op,"SUB")==0)
                printf("000010");
            else if(strcmp(op,"DIV")==0)
                printf("000011");
            else if(strcmp(op,"MUL")==0)
                printf("000100");
            else if(strcmp(op,"MOVE")==0)
                printf("000101");
            else
                {
                    printf("000110");
                    ok=1;
                }
            for(int i=0;i<strlen(str);i++)
            {
                if(str[i]==',')
                {
                    pd=i;
                    break;
                }
            }
            cnt=0;
            for(int i=1;i<pd;i++)
            {
                le[cnt]=str[i];
                cnt++;
            }
            le[cnt]='\0';
            l=atoi(le);
            cnt=0;
            for(int i=pd+2;i<strlen(str);i++)
            {
                ri[cnt]=str[i];
                cnt++;
            }
            ri[cnt]='\0';
            r=atoi(ri);
            fun(l);
            if(ok)
                printf("00000\n");
            else
                {
                    fun(r);
                    printf("\n");
                }
        }
        else
        {
            scanf("%s",str);
            ok=cnt=0;
            for(int i=0;i<=5;i++)
            {
                op[cnt]=str[i];
                cnt++;
            }
            if(strcmp(op,"000110")==0)
              ok=1;
            l=0,mul=1;
            for(int i=10;i>=6;i--)
            {
                 l+=(str[i]-'0')*mul;
                 mul*=2;
            }
            r=0,mul=1;
            for(int i=15;i>=11;i--)
            {
                r+=(str[i]-'0')*mul;
                mul*=2;
            }
            if(ok)
            {
                if(l==0||r!=0)
                {
                    printf("Error!\n");
                    goto ind;
                }
                else
                    printf("SET R%d\n",l);
            }
            else
            {
                if(l==0||r==0)
                {
                    printf("Error!\n");
                    goto ind;
                }
                if(strcmp(op,"000001")==0)
                    printf("ADD ");
                else if(strcmp(op,"000010")==0)
                    printf("SUB ");
                else if(strcmp(op,"000011")==0)
                    printf("DIV ");
                else if(strcmp(op,"000100")==0)
                    printf("MUL ");
                else if(strcmp(op,"000101")==0)
                    printf("MOVE ");
                else
                {
                    if(!ok)
                    {
                        printf("Error!\n");
                        goto ind;
                    }
                }
                printf("R%d,R%d\n",l,r);
            }
        }
    }
    return 0;
}
/*
1
ADD R12,R2
*/
时间: 2024-09-27 21:18:35

hdu 5083Instruction(模拟大法好)的相关文章

HDU 4930 模拟

Fighting the Landlords Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 266    Accepted Submission(s): 87 Problem Description Fighting the Landlords is a card game which has been a heat for yea

hdu 1022 模拟栈

其实就是模拟一下栈啦. 1 #include <iostream> 2 using namespace std; 3 4 const int N = 10; 5 char o1[N]; 6 char o2[N]; 7 char s[N]; 8 int ans[N * 2]; 9 10 int main () 11 { 12 int n; 13 while ( cin >> n ) 14 { 15 cin >> o1 >> o2; 16 int top = 0

hdu 4054 模拟 练习十六进制输出

http://acm.hdu.edu.cn/showproblem.php?pid=4054 貌似一般区域赛都会有一道水题 这道题PE了一次  因为输出每个数其实是两个位 如果用空格补齐的话  应该用两个空格 我用了一个空格,,, 学到: 1.%x  十六进制输出  可以输出整型,字符型等等 2.%02x  保证两位 而且会输出先导0的两位 //#pragma comment(linker, "/STACK:102400000,102400000") #include <cstd

hdu 5246(模拟)

题解:直接模拟 #include <stdio.h> #include <string.h> #include <algorithm> using namespace std; const int N = 10005; long long n, m, k; long long s[N]; int main() { int t, cas = 1; scanf("%d", &t); while (t--) { scanf("%lld%l

hdu 5386 模拟

想明白以后会发现其实就是模拟... 因为每次只能给一整行或者一整列赋值,所以目标矩阵一开始一定有一行或者一列上数字都是相同的,然后找到对应的操作,把那一行或者那一列标记为访问过.然后新的矩阵也一定能找到一行或者一列数字都相同,再找到相应的操作,标记那一行或者那一列,依次类推,然后没有用到的操作随便找个顺序就好了.其实初始矩阵并没有什么用...... 1 #include <iostream> 2 #include <cstring> 3 #include <cstdio>

HDU 5071 模拟

考察英语的题 - -# 按条件模拟,一遍就行了,每个聊天对象有其价值U,数组模拟队列过程即可,若存在Top标记,则和Top标记的人聊天,否则和队列的第一个人聊天 mark记录队尾,top记录Top操作,data[i].p记录U,data[i].x记录chat数,data[i].y记录该人是否被删除 Add U:在 队尾插入价值为U的人,需要特判U人已经存在 Close U::在整个队列中查找价值为U的人,将其删除,需要特判该人不存在 Chat x:当前聊天页面的人chat+=x,特判当前队列没有

HDU 2860 (模拟+并查集)

Regroup Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1057    Accepted Submission(s): 297 Problem Description When ALPC42 got to a panzer brigade, He was asked to build software to help them r

hdu 5373 模拟

简单模拟题,可以利用一下能被11整除的数的特点:奇数位的数字和与偶数位的数字和之差能被11整除. 1 #include <iostream> 2 #include <cstring> 3 #include <cstdlib> 4 #include <cstdio> 5 using namespace std; 6 7 const int N = 1000000; 8 int s[N]; 9 int mid[N]; 10 11 int main () 12 {

hdu 5055(模拟)

Bob and math problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1481    Accepted Submission(s): 552 Problem Description Recently, Bob has been thinking about a math problem.There are N Digi