algorithm Study/2014/Hard_Disk_Drive

Difference between r1.2 and the current

@@ -1,6 +1,7 @@

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=595&page=show_problem&problem=4553
권준혁 소스코드

{{{{

{{{

#pragma warning(disable : 4996)

@@ -8,23 +9,24 @@

#include<string.h>
#define LOSS 125/128
int main(){

int repeat_num; ~~//입력받을~~ 개수

int repeat_num;

int i = 0;

int j = 0;

char data_case[9] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E', 'Z', 'Y'}; ~~//데이터 단위 배열~~

char test_string[10]; ~~//입력받는것~~

char data_input;~~// 데이터 단위 저장~~

float temp = 1;

char data_case[9] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E', 'Z', 'Y'};

char test_string[10];

char data_input;

float temp = 1;

float loss = 1;
scanf("%d", &repeat_num);

for (~~int~~ i = 1; i <= repeat_num; i++)

for (i = 1; i <= repeat_num; i++)

{
temp = 1;
loss = 0;
j = 0;

scanf("%s", test_string); ~~// 입력 받음~~

scanf("%s", test_string);

while (test_string[j++] != '[');

~~//찾음~~

data_input = test_string[j];
j = 0;
while (data_case[j++] != data_input) {

@@ -39,5 +41,4 @@

}

}}}}

}}}

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=595&page=show_problem&problem=4553
권준혁 소스코드

#pragma warning(disable : 4996)


#include<stdio.h>
#include<string.h>
#define LOSS 125/128
int main(){
	int repeat_num; 
	int i = 0;
	int j = 0;
	char data_case[9] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E', 'Z', 'Y'};
	char test_string[10]; 
	char data_input;
	float temp = 1;
	float loss = 1;
	scanf("%d", &repeat_num);
	for (i = 1; i <= repeat_num; i++)
	{
		temp = 1;
		loss = 0;
		j = 0;
		scanf("%s", test_string); 

		while (test_string[j++] != '[');
		
		data_input = test_string[j];
		j = 0;
		while (data_case[j++] != data_input) {
			temp = temp * ((float)125/(float)128);
		}

		loss = 1 - temp;
		printf("Case #%d = %.2f\%\n", i,  100 * loss);
				

	}

}