CodeRace/2016/Mackerel - Revision history

165.194.17.197 at 12:17, 20 May 2016

2016-05-20T12:17:29Z

165.194.17.197 at 12:10, 20 May 2016

2016-05-20T12:10:40Z

165.194.17.197 at 11:57, 20 May 2016

2016-05-20T11:57:41Z

← Older revision		Revision as of 11:57, 20 May 2016
Line 152:		Line 152:
	== 문제 4 ==		== 문제 4 ==

			#define _CRT_SECURE_NO_WARNINGS
			#include<stdio.h>

			int reg[4];
			int mem[4];
			//int reg1, reg2, reg3, reg4;
			//int mem1, mem2, mem3, mem4;

			void load(int, int, int, int);
			void add(int x1, int x2, int y1, int y2);
			void save(int x1, int x2, int y1, int y2);
			void mul(int x1, int x2, int y1, int y2);



			int main(void){

			int list[8];
			int i;
			int flag ;
			int loadflag;


			printf("Mackerel: 최다인, 김상렬 \n");
			for (i = 0; i < 4; i++){
			scanf("%d", &reg[i]);

			}
			for (i = 0; i < 4; i++){
			scanf("%d", &mem[i]);

			}



			while (1){

			flag = 1;
			loadflag = 1;



			for (i = 0; i < 8; i++){
			scanf("%d", &list[i]);

			}



			for (i = 0; i < 4; i++){
			if (list[i] == 0){
			flag = 0;
			break;
			}
			}
			if (flag == 1){
			break;
			}
			for (i = 0; i < 4; i++){
			if (list[i] == 1){
			loadflag = 0;
			break;

			}

			}
			if (loadflag == 1){
			load(list[4], list[5], list[6], list[7]);
			}
			if ((list[0] == 0) && (list[1] == 0) && (list[2] == 1) && (list[3] == 0)){
			add(list[4], list[5], list[6], list[7]);

			}
			if ((list[0] == 0) && (list[1] == 0) && (list[2] == 1) && (list[3] == 1)){
			mul(list[4], list[5], list[6], list[7]);

			}
			if ((list[0] == 0) && (list[1] == 0) && (list[2] == 0) && (list[3] == 1)){
			save(list[4], list[5], list[6], list[7]);

			}


			}//while 끝임
			for (i = 0; i < 4; i++){
			printf("%d ", reg[i]);

			}
			for (i = 0; i < 4; i++){
			printf("%d ", mem[i]);
			}

			printf("\n");


			return 0;

			//Fail입니다


			}


			void load(int x1, int x2, int x3, int x4){

			// 4, 5 : memmory 6, 7: register
			int memorynum, regnum;
			memorynum = x1 * 2 + x2;

			regnum = x3 * 2 + x4;
			reg[regnum] = mem[memorynum];

			}
			void add(int x1, int x2, int y1, int y2){
			int reg1, reg2;

			reg1 = x1 * 2 + x2;
			reg2 = y1 * 2 + y2;

			reg[reg2] = reg[reg1] + reg[reg2];

			}
			void save(int x1, int x2, int y1, int y2){

			int memorynum, regnum;
			memorynum = y1 * 2 + y2;

			regnum = x1 * 2 + x2;


			mem[memorynum] = reg[regnum];

			}
			void mul(int x1, int x2, int y1, int y2){
			int reg1, reg2;

			reg1 = x1 * 2 + x2;
			reg2 = y1 * 2 + y2;

			reg[reg2] = reg[reg1] * reg[reg2];



			}
	== 문제 5 ==		== 문제 5 ==

165.194.17.197 at 11:32, 20 May 2016

2016-05-20T11:32:45Z

← Older revision		Revision as of 11:32, 20 May 2016
Line 133:		Line 133:
	printf("\n");		printf("\n");

	~~system("pause");~~
	return 0;		return 0;
	}		}

165.194.17.197 at 11:31, 20 May 2016

2016-05-20T11:31:17Z

← Older revision		Revision as of 11:31, 20 May 2016
Line 61:		Line 61:
	== 문제 3 ==		== 문제 3 ==

			#define _CRT_SECURE_NO_WARNINGS
			#include<stdio.h>

			int reg[4];
			int mem[4];
			//int reg1, reg2, reg3, reg4;
			//int mem1, mem2, mem3, mem4;

			void load(int, int, int, int);

			int main(void){

			int list[8];
			int i;
			int flag ;
			int loadflag;


			printf("Mackerel: 최다인, 김상렬 \n");
			for (i = 0; i < 4; i++){
			scanf("%d", &reg[i]);

			}
			for (i = 0; i < 4; i++){
			scanf("%d", &mem[i]);

			}



			while (1){

			flag = 1;
			loadflag = 1;


			for (i = 0; i < 8; i++){
			scanf("%d", &list[i]);

			}
			for (i = 0; i < 4; i++){
			if (list[i] == 0){
			flag = 0;
			break;
			}
			}
			if (flag == 1){
			break;
			}
			for (i = 0; i < 4; i++){
			if (list[i] == 1){
			loadflag = 0;
			break;

			}

			}
			if (loadflag == 1){
			load(list[4], list[5], list[6], list[7]);
			}

			}
			for (i = 0; i < 4; i++){
			printf("%d ", reg[i]);

			}
			for (i = 0; i < 4; i++){
			printf("%d ", mem[i]);
			}

			printf("\n");

			system("pause");
			return 0;
			}


			void load(int x1, int x2, int x3, int x4){

			// 4, 5 : memmory 6, 7: register
			int memorynum, regnum;
			memorynum = x1 * 2 + x2;

			regnum = x3 * 2 + x4;
			reg[regnum] = mem[memorynum];



			}
	== 문제 4 ==		== 문제 4 ==

imported>ksl970330 at 11:03, 20 May 2016

2016-05-20T11:03:06Z

← Older revision		Revision as of 11:03, 20 May 2016
Line 57:		Line 57:


	return 0;		return 0;
	}		}
	== 문제 3 ==		== 문제 3 ==

imported>ksl970330 at 11:02, 20 May 2016

2016-05-20T11:02:30Z

← Older revision		Revision as of 11:02, 20 May 2016
Line 17:		Line 17:
	== 문제 2 ==		== 문제 2 ==

			#define _CRT_SECURE_NO_WARNINGS
			#include<stdio.h>



			int main(void){

			int list[8];
			int i;
			int flag ;


			printf("Mackerel: 최다인, 김상렬 \n");

			while (1){

			flag = 1;
			for (i = 0; i < 8; i++){
			scanf("%d", &list[i]);

			}
			for (i = 0; i < 4; i++){
			if (list[i] == 0){
			flag = 0;
			break;
			}
			}
			if (flag == 1){
			break;
			}
			for (i = 0; i < 8; i++){
			printf("%d ", list[i]);
			}
			printf("\n");

			}




			return 0;
			}
	== 문제 3 ==		== 문제 3 ==

imported>ksl970330 at 10:26, 20 May 2016

2016-05-20T10:26:19Z

← Older revision		Revision as of 10:26, 20 May 2016
Line 11:		Line 11:


	printf("~~Team~~:최다인, 김상렬");		printf("Mackerel:최다인, 김상렬");

	return 0;		return 0;

imported>ksl970330 at 10:25, 20 May 2016

2016-05-20T10:25:23Z

← Older revision		Revision as of 10:25, 20 May 2016
Line 3:		Line 3:

	== 문제 1 ==		== 문제 1 ==
			#define _CRT_SECURE_NO_WARNINGS
			#include<stdio.h>



			int main(void){


			printf("Team:최다인, 김상렬");

			return 0;
			}
	== 문제 2 ==		== 문제 2 ==

imported>ksl970330: {CREATE}

2016-05-20T10:17:21Z

{CREATE}

New page

강사: 최다인
새싹: 김상렬

== 문제 1 ==

== 문제 2 ==

== 문제 3 ==

== 문제 4 ==

== 문제 5 ==

== 문제 6 ==

-----------------------------------------------------------------------
[[CodeRace]] [[CodeRace/2016]]