정올 - 배열1

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&sca=1090

JUNGOL

---

자가진단1

#include <stdio.h>

int main(void) {
	char arr[10];
	for (int i = 0; i < 10; i++)
		scanf(" %c", &arr[i]);
	for (int i = 0; i < 10; i++)
		printf("%c", arr[i]);
	return 0;
}

---

자가진단2

#include <stdio.h>

int main(void) {
	int arr[10];
	for (int i = 0; i < 10; i++)
		arr[i] = i+1;
	for (int i = 0; i < 10; i++)
		printf("%d ", arr[i]);
	return 0;
}

---

자가진단3

#include <stdio.h>

int main(void) {
	char arr[10];
	for (int i = 0; i < 10; i++)
		scanf(" %c", &arr[i]);
	printf("%c %c %c", arr[0], arr[3], arr[6]);
	return 0;
}

---

자가진단4

#include <stdio.h>

int main(void) {
	int arr[100], i;
	for (i = 0; i < 100; i++) {
		scanf("%d", &arr[i]);
		if (arr[i] == 0) break;
	}
	for (int k = i-1; k >= 0; k--)
		printf("%d ", arr[k]);
	return 0;
}

---

자가진단5

#include <stdio.h>

int main(void) {
	float arr[] = { 85.6, 79.5, 83.1, 80.0, 78.2, 75.0 };
	int n1, n2;
	float result;
	scanf("%d %d", &n1, &n2);
	result = arr[n1 - 1] + arr[n2 - 1];
	printf("%0.1f", result);
	return 0;
}

---

자가진단6

#include <stdio.h>

int main(void) {
	int arr[10], min;
	for (int i = 0; i < 10; i++)
		scanf("%d", &arr[i]);
	min = arr[0];
	for (int i = 0; i < 10; i++)
		min = min < arr[i] ? min : arr[i];
	printf("%d", min);
	return 0;
}

---

자가진단7

#include <stdio.h>

int main(void) {
	int arr[10], max1 = 1, min2 = 10000;
	for (int i = 0; i < 10; i++)
		scanf("%d", &arr[i]);
	for (int i = 0; i < 10; i++) {
		if (arr[i] < 100)
			max1 = max1 > arr[i] ? max1 : arr[i];
		else
			min2 = min2 < arr[i] ? min2 : arr[i];
	}
	printf("%d %d", max1, min2);
	return 0;
}

---

자가진단8

#include <stdio.h>

int main(void) {
	int arr[10];
	float odd = 0, even = 0;
	for (int i = 0; i < 10; i++) {
		scanf("%d", &arr[i]);
		if ((i+1) % 2 == 0) even += arr[i];
		else odd += arr[i];	
	}
	printf("sum: %d\n", (int)even);
	printf("avg: %0.1f\n", odd / 5);
	
	return 0;
}

---

자가진단9

#include <stdio.h>

int main(void) {
	int arr[10], temp;
	for (int i = 0; i < 10; i++) scanf("%d", &arr[i]);
	for (int i = 0; i < 10; i++) {
		for (int j = i+1; j < 10; j++) {
			if (arr[i] < arr[j]) {
				temp = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;
			}
		}
	}
	for (int i = 0; i < 10; i++) printf("%d ", arr[i]);
	return 0;
}

---

형성평가1

#include <stdio.h>

int main(void) {
	char arr[10];
	for (int i = 0; i < 10; i++) scanf(" %c", &arr[i]);
	for (int i = 9; i >= 0; i--) printf("%c ", arr[i]);
	return 0;
}

---

형성평가2

#include <stdio.h>

int main(void) {
	int arr[5], result = 0;
	for (int i = 0; i < 5; i++)
		scanf("%d", &arr[i]);
	result += arr[0] + arr[2] + arr[4];
	printf("%d", result);
	return 0;
}

---

형성평가3

#include <stdio.h>

int main(void) {
	int arr[10], odd = 0, even = 0;
	for (int i = 0; i < 10; i++) {
		scanf("%d", &arr[i]);
		if ((i + 1) % 2 == 0) even += arr[i];
		else odd += arr[i];
	}
	printf("odd : %d\neven : %d\n", odd, even);
	return 0;
}

---

형성평가4

#include <stdio.h>

int main(void) {
	int arr[100], i;
	for (i = 0; i < 100; i++) {
		scanf("%d", &arr[i]);
		if (arr[i] == -1) {
			printf("%d %d %d", arr[i - 3], arr[i - 2], arr[i - 1]);
			break;
		}
	}
	return 0;
}

---

형성평가5

#include <stdio.h>

int main(void) {
	float arr[6];
	float result = 0;
	for (int i = 0; i < 6; i++) {
		scanf("%f", &arr[i]);
		result += arr[i];
	}
	printf("%0.1f", result / 6);
	return 0;
}

---

형성평가6

#include <stdio.h>

int main(void) {
	char arr[] = { 'J', 'U', 'N', 'G', 'O', 'L' };
	char c;
	scanf("%c", &c);
	switch (c) {
	case 'J':
		printf("0"); break;
	case 'U': 
		printf("1"); break;
	case 'N':
		printf("2"); break;
	case 'G':
		printf("3"); break;
	case 'O':
		printf("4"); break;
	case 'L':
		printf("5"); break;
	default:
		printf("none"); break;
	}
	return 0;
}

---

형성평가7

#include <stdio.h>

int main(void) {
	int arr[100], max, min, i;
	for (i = 0; i < 100; i++) {
		scanf("%d", &arr[i]);
		if (arr[i] == 999) break;
	}
	max = min = arr[0];
	for (int j = 0; j < i; j++) {
		max = max > arr[j] ? max : arr[j];
		min = min < arr[j] ? min : arr[j];
	}
	printf("max : %d\nmin : %d\n", max, min);
	return 0;
}

---

형성평가8

#include <stdio.h>

int main(void) {
	int arr[100],M = 0;
	float sum = 0;
	for (int i = 0; i < 100; i++) {
		scanf("%d", &arr[i]);
		if (arr[i] == 0) {
			printf("Multiples of 5: %d\n", M);
			printf("sum : %d\n", (int)sum);
			printf("avg: %0.1f\n", sum/M);
			break;
		}
		if (arr[i] % 5 == 0) {
			sum += arr[i];
			M++;
		}
			
	}
	return 0;
}

---

형성평가9

#include <stdio.h>

int main(void) {
	int arr[100], i;
	for (i = 0; i < 100; i++) {
		scanf("%d", &arr[i]);
		if (arr[i] == 0) {
			printf("%d\n", i);
			for (int j = 0; j < i; j++) {
				if (arr[j] % 2 == 0) printf("%d ", arr[j] / 2);
				else printf("%d ", arr[j] * 2);
			}
			break;
		}
	}
	return 0;
}

---

형성평가A

#include <stdio.h>

int main(void) {
	int n, arr[20], temp;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &arr[i]);
	}
	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			if (arr[i] < arr[j]) {
				temp = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;
			}
		}
	}
	for (int i = 0; i < n; i++)printf("%d\n", arr[i]);
	return 0;
}