정올 - 반복제어문2

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

JUNGOL

---

자가진단1

#include <stdio.h>

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

---

자가진단2

#include <stdio.h>

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

---

자가진단3

#include <stdio.h>

int main(void) {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		if (i % 2 == 0) printf("%d ", i);
	return 0;
}

---

자가진단4

#include <stdio.h>

int main(void) {
	int n, result = 0;
	scanf("%d", &n);
	for (; n <= 100; n++)
		result += n;
	printf("%d\n", result);
	return 0;
}

---

자가진단5

#include <stdio.h>

int main(void) {
	int n,m3 = 0, m5 = 0;
	for (int i = 0; i < 10; i++) {
		scanf("%d", &n);
		if (n % 3 == 0) m3++;
		if (n % 5 == 0) m5++;
	}
	printf("Multiples of 3 : %d\n", m3);
	printf("Multiples of 5 : %d\n", m5);
	return 0;
}

---

자가진단6

#include <stdio.h>

int main(void) {
	int n, k;
	double result = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &k);
		result += k;
	}
	result /= n;
	printf("avg : %0.1f\n", result);
	result >= 80 ? printf("pass") : printf("fail");
	return 0;
}

---

자가진단7

#include <stdio.h>

int main(void) {
	for (int i = 1; i < 6; i++) {
		for (int j = 1; j < 6; j++) {
			printf("%d ", i+j);
		}
		printf("\n");
	}
	return 0;
}

---

자가진단8

#include <stdio.h>

int main(void) {
	for (int i = 2; i < 5; i++) {
		for (int j = 1; j < 6; j++) {
			printf("%d * %d =  %3d     ", i, j, i * j);
		}
		printf("\n");
	}

	return 0;
}

---

형성평가1

#include <stdio.h>

int main(void) {
	int n;
	scanf("%d", &n);
	while (n-- > 0) printf("JUNGOL\n");
}

---

형성평가2

#include <stdio.h>

int main(void) {
	int n1, n2;
	scanf("%d %d", &n1, &n2);
	if (n1 > n2)
		for (; n1 >= n2; n2++) printf("%d ", n2);
	else
		for (; n2 >= n1; n1++) printf("%d ", n1);
	return 0;
}

---

형성평가3

#include <stdio.h>

int main(void) {
	int n, result = 0;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		if (i % 5 == 0) result += i;
	printf("%d", result);
	return 0;
}

---

형성평가4

#include <stdio.h>

int main(void) {
	int n, k;
	double result = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &k);
		result += k;
	}
	printf("%0.2f", result/n);
	return 0;
}

---

형성평가5

#include <stdio.h>

int main(void) {
	int even = 0, odd = 0;
	int n;
	for (int i = 0; i < 10; i++) {
		scanf("%d", &n);
		n % 2 == 0 ? even++ : odd++;
	}
	printf("even : %d\nodd : %d\n", even, odd);
	return 0;
}

---

형성평가6

#include <stdio.h>

int main(void) {
	int n1, n2, count = 0;
	double result = 0;
	scanf("%d %d", &n1, &n2);
	for (; n1 <= n2; n1++) {
		if ((n1 % 3 == 0) || (n1 % 5 == 0)) {
			result += n1;
			count++;
		}
	}
	printf("sum : %d\navg : %0.1f\n", (int)result, result / count);
	return 0;
}

---

형성평가7

#include <stdio.h>

int main(void) {
	int n;
	scanf("%d", &n);
	for (int i = 1; i < 11; i++) {
		printf("%d ", 5 * i);
	}
	return 0;
}

---

형성평가8

#include <stdio.h>

int main(void) {
	int r, c;
	scanf("%d %d", &r, &c);
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++)
			printf("%d ", i * j);
		printf("\n");
	}
	
	return 0;
}

---

형성평가9

#include <stdio.h>

int main(void) {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			printf("(%d, %d) ", i, j);
		printf("\n");
	}
	return 0;
}

---

 

형성평가A

#include <stdio.h>

int main(void) {
	int a, b, temp;
	scanf("%d %d", &a, &b);
	
	// 결과 출력
	for (int i = 1; i < 10; i++) {
		int a2 = a;
		if (a > b) {
			for (; a2 >= b; a2--)
				printf("%d * %d = %2d   ", a2, i, a2 * i);
			printf("\n");
		}
		else {
			for (; a2 <= b; a2++)
				printf("%d * %d = %2d   ", a2, i, a2 * i);
			printf("\n");
		}
		
	}
	return 0;
}