HDU 5083

最新推荐文章于 2016-07-10 13:05:00 发布

acmer29

最新推荐文章于 2016-07-10 13:05:00 发布

阅读量434

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/u013621913/article/details/41048129

版权

模拟专栏收录该内容

11 篇文章 0 订阅

订阅专栏

字符串用sscanf处理就好了，然后用了atoi，只是没有用map，这个数据下时间复杂度也不会太高。

//HDU-5083.cpp
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <queue>
#include <utility>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
//const double pai = acos(-1.0);
const double pai = 3.14159265358979323846;
const int INF = 0x3f3f3f3f;
typedef long long love_live;

void ins_operation_to_code_print(char op_array[]){
	if(!strcmp("ADD", op_array)) { printf("000001"); }
	else if(!strcmp("SUB", op_array)) { printf("000010"); }
	else if(!strcmp("DIV", op_array)) { printf("000011"); }
	else if(!strcmp("MUL", op_array)) { printf("000100"); }
	else if(!strcmp("MOVE", op_array)) { printf("000101"); }
return ;
}

int code_operation_to_ins_print(char bin_op_array[])
{
	if(!strcmp("000001", bin_op_array)) { printf("ADD "); return 0;}
	else if(!strcmp("000010", bin_op_array)) { printf("SUB "); return 0;}
	else if(!strcmp("000011", bin_op_array)) { printf("DIV "); return 0;}
	else if(!strcmp("000100", bin_op_array)) { printf("MUL "); return 0;}
	else if(!strcmp("000101", bin_op_array)) { printf("MOVE "); return 0;}
	else printf("Error!\n");
return -1;
}

void char_num_to_int_print(char ch_array[])
{
	int num, i = 2, j = 0;
	int num_array[6] = {0, 0, 0, 0, 0, 0};
	num = atoi(ch_array);
	while(num)
	{
		num_array[j++] = num % i;
		num /= i;
	}
	for(i = 4; i >= 0; --i)
	{
		printf("%d", num_array[i]);
	}
return ;
}

int bin_num_to_int(char bin_num_array[])
{
    int i, j, k = 1, x = 0;
    for(i = 4; i >= 0; --i)
    {
        x += (bin_num_array[i] - '0') * k;
        k <<= 1;
    }
    // printf("%d", x);
return x;
}

void instruction_to_code()
{
	char ins_operation[12], reg_num[12];
	scanf("%s%*c%s", ins_operation, reg_num);
	char reg_code_in_char1[6], reg_code_in_char2[6];
	if(!strcmp("SET", ins_operation))
	{
		printf("000110");
		sscanf(reg_num, "R%[0-9]", reg_code_in_char1);
		char_num_to_int_print(reg_code_in_char1);
		printf("00000");
	}
	else
	{
		ins_operation_to_code_print(ins_operation);
		sscanf(reg_num, "R%[0-9],R%[0-9]", reg_code_in_char1, reg_code_in_char2);
		char_num_to_int_print(reg_code_in_char1);
		char_num_to_int_print(reg_code_in_char2);
	}
	printf("\n");
return ;
}

void code_to_instruction()
{
	char code_overall[24], code_operation[10], code_reg_num1[10], code_reg_num2[10];
	int flag;
	int reg_int_num1, reg_int_num2;
	scanf("%s", code_overall);
	for(int i = 0; i < strlen(code_overall); ++i)
	{
		if(code_overall[i] != '0' && code_overall[i] != '1'){
			printf("Error!\n");
			return ;
		}
	}
	sscanf(code_overall, "%6s%5s%5s", code_operation, code_reg_num1, code_reg_num2);
	reg_int_num1 = bin_num_to_int(code_reg_num1), reg_int_num2 = bin_num_to_int(code_reg_num2);
	if(!strcmp(code_operation, "000110"))
	{
		if(reg_int_num2 != 0 || reg_int_num1 == 0)
		{
			printf("Error!\n");
			return ;
		}
		else
		{
			printf("SET ");
			printf("R%d", reg_int_num1);
		}
	}
	else
	{
		if(reg_int_num1 == 0 || reg_int_num2 == 0)
		{
			printf("Error!\n");
			return ;
		}
		flag = code_operation_to_ins_print(code_operation);
		if(flag == -1)
		{
			return ;
		}
		printf("R%d,R%d", reg_int_num1, reg_int_num2);
	}
	printf("\n");
return ;
}

int main(int argc, char const *argv[]) 
{
#ifndef ONLINE_JUDGE
//	freopen("output", "w", stdout);
	freopen("input", "r", stdin);
#endif
	int n, m, i, j, k;
	int t;
	while(scanf("%d", &t) != EOF)
	{
		t == 1 ? instruction_to_code() : code_to_instruction();
	}
return 0;
}