Skip to content
Snippets Groups Projects
Commit 70735796 authored by KimTaeeun's avatar KimTaeeun
Browse files

Test

parent 18d684d0
Branches
No related tags found
No related merge requests found
//난수 프로그램
//201421110 미디어학과 김태은
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define NUM_DATA 25
int main()
{
int arr[NUM_DATA];
int num;
int val[NUM_DATA];
int index = 0;
int min_val=0;
srand(time(NULL));
for (int i = 0; i < NUM_DATA; i++) {
arr[i] = rand() % 176 + 25;
printf("%5d", arr[i]);
if (i % 10 == 9) printf("\n");
}
printf("\n숫자를 입력하세요\n");
scanf_s("%d", &num);
for (int i = 0; i < NUM_DATA; i++)
{
val[i] = arr[i] - num;
}
for (int i = 0; i < NUM_DATA; i++)
{
if (val[i] > 0)
{
min_val = val[i];
index = i;
break;
}
}
for (int i = 0; i < NUM_DATA; i++)
{
if (min_val > val[i] && val[i] > 0)
{
min_val = val[i];
index = i;
}
}
if (min_val>0)
printf("큰 수 중 제일 가까운 값 : %d", arr[index]);
else
printf("값을 찾을 수 없습니다.");
return 0;
}
\ No newline at end of file
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment