Programming/C

C언어 예제 (짝수홀수구분) (10진수에서2진수) (회문) (내림차순정렬)

fishersheep 2021. 8. 14. 02:49
반응형

짝수 홀수 구분

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

void evennumber(int * arr,int len)
{	
	
	for (int i = 0; i < len; i++)
	{
		if (arr[i] % 2 == 0)
			printf("%d ", arr[i]);
	}
	
}

void oddnumber(int* arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		if (arr[i] % 2 != 0)
			printf("%d ", arr[i]);
	}

}

int main()
{
	int arr[10];
	for (int i = 0; i < sizeof(arr) / sizeof(int); i++)
		scanf("%d",&arr[i]);

	printf("짝수출력:");
	evennumber(arr,sizeof(arr)/sizeof(int));
	
	printf("\n");

	printf("홀수출력:");
	oddnumber(arr, sizeof(arr) / sizeof(int));



	return 0;
}

10진수에서 2진수

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main()
{
	int num=0;
	scanf("%d", &num);
	int x[100];
	int y=0;

	while (1)
	{
		x[y] = num % 2;
		num = num / 2;
		y++;

		if (num == 0)
			break;
	}
	
	for (int i = y - 1; i >= 0; i--)
	{
		printf("%d", x[i]);
	}


	return 0;
}

회문

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

void Palindrome(char* word,int length)
{

	for (int i =0; i < length / 2; i++)
	{
		if (word[i] == word[length-1-i])
			printf("회문입니다.");
		else
			printf("회문이아닙니다.");
	}
}
int main()
{
	char word[20];
	scanf("%s", word);
	int length = strlen(word);

	Palindrome(word,length);


	return 0;
}

내림차순 정렬

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

void DesSort(int* arr, int len)
{	
	int temp;
	for (int i = 0; i < len-1; i++)
	{
		for (int j = 0; j < len - 1; j++)
		{
			if (arr[j] < arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;

			}
		}
	}
}

int main()
{
	int arr[7];
	for (int i = 0; i < sizeof(arr) / sizeof(int); i++)
		scanf("%d", &arr[i]);

	DesSort(arr, sizeof(arr) / sizeof(int));

	for (int i = 0; i < sizeof(arr) / sizeof(int); i++)
		printf("%d ", arr[i]);


	return 0;
}
반응형