/* 1���� �迭
#include <stdio.h>
int main()
{
int i, arr[5] = {1, 2, 3, 4, 5};
for( i = 0;i < 5;i++)
{
printf("%d", arr[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int i, arr[5];
for( i = 0;i < 5;i++)
{
arr[i] = i + 1;
}
for(i = 0;i < 5;i++)
{
printf("%d", arr[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[5] = {1, 2, 3, 4, 5};
int i;
for( i = 0;i < 5;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[] = {1, 2, 3, 4, 5};
int i;
for (i = 4;i >= 0;i--)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[5] = {0};
int i;
for( i = 0;i < 5;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[5] = {1};
int i;
for ( i = 0;i < 5;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[5] = {1, 2, 3, 4, 5};
int i;
for (i = 1;i <= 5;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[5] = {1, 2, 3, 4, 5};
int i;
for(i = 5;i >= 1;i--)
{
printf("%d" ,ar[i]e);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[] = {1, 2, 3, 4, 5};
int i, n = 5;
for(i = n-1;i >= 0;i--)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[10];
int i;
for(i = 0;i < 10;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[5] ={};
int i;
for(i = 0;i < 5;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int i;
for (i = 0;i < 10;i++)
{
if( ar[i] % 2== 0)
{
printf("%d", ar[i]);
}
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[10] = {1, 2, 3,4 ,5, 6, 7, 8, 9, 10};
int i;
for( i = 1;i < 10;i++)
{
if (ar[i] % 2 == 1)
{
printf("%d", ar[i]);
}
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int a[] = {2, 7, 1, 5, 3}, k, i;
k = 5;
for( i = 0;i < k;i++)
{
printf("%d", a[i]);
}
printf("\n");
for(i = 0;i < k;i++)
{
printf("%d", a[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int a[] = {2, 7, 1, 5, 3};
int k = 5, i;
for(i = 0; i < k;i++)
{
printf("%d", a[i]);
}
printf("\n");
for(i = 0;i < k;i++)
{
printf("%d", a[i]);
}
return 0;
}
*/
/*
#include <stdio.h>
int sum;
int main()
{
int ar[5] = {1, 2, 3, 4, 5};
int i;
for( i = 0;i < 5; i++)
{
sum += ar[i];
}
printf("%d", sum);
return 0;
}
*/
/* ???
#include <stdio.h>
#define M 5
int main()
{
int i, t[M + 1] = {},ar[M - 1] = {1, 5, 4, 2};
for(i = 0;i < 4;i++)
{
t[ar[i]] = 1;
}
for(i = 1;i <= 5;i++)
{
if(t[i] == 0)
{
printf("%d", i);
break;
}
}
return 0;
}
*/
/*
#include <stdio.h>
#define M 5
int main()
{
int i, j, ar[M] = {2 ,7, 1, 5, 3}, tmp;
for(i = 0;i < 4; i++)
{
for(j = i + 1;j < 5;j++ )
{
if( ar[i]> 0)
{
tmp = ar[i];
ar[i] = ar[j];
ar[j] = tmp;
}
}
}
for(i = 0;i < 5;i++)
{
printf("%d", ar[i]);
}
return 0;
}
*/
/*
/*
#include <stdio.h>
int main()
{
int ar[] = { 1, 2, 3, 4, 5, 6 ,7};
int i, sum = 0;
for(i = 0;i < 7;i++)
{
if( ar [i] % 3 == 0)
{
sum += ar[i];
}
}
printf("%d", sum );
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int ar[7] = {2, 7, 4, 9, 5, 1, 3};
int i, min, max;
min = max = ar[0];
for (i = 1; i < 7;i++)
{
if(ar[i] < min)
{
min = ar[i];
}
if (ar[i] > max)
{
max = ar[i];
}
}
printf("%d %d", max, min);
return 0;
}
*/
/*
#include <stdio.h>
#define M 7
int main()
{
int i, j, ar[M] = {2, 1, 8, 10, 5, 3, 15};
int search, flag = 0;
scanf("%d", &search );
for(i = 0;i < 7;i++)
{
if(ar[i] == search )
{
printf("%d Find!!",ar[i] );
flag = 1;
break;
}
}
if (flag == 0)
{
printf("Not Find!!");
}
return 0;
}
*/
/*
#include <stdio.h>
int data[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int main()
{
int low = 0, k, high = 10, mid;
int search, time = 0, f = 0;
k = 3;
while (1)
{
time++;
mid = ( low + high) / 2;
if( k == data[mid] )
{
f = 1;
printf("%d time",time );
break;
}
else if ( k > data[mid])
{
high = mid - 1;
}
else if (k <data[mid])
{
low = mid + 1;
}
if (low == mid || mid == high)
{
break;
}
}
if (f == 0)
{
printf("Not find!!");
}
return 0;
}
*/
/* 2���� �迭
#include <stdio.h>
int main()
{
int i, j, array[3][4];
for (i = 0; i < 3;i++)
{
for(j = 0;j < 4;j++)
{
scanf("%d ", &array[i][j]);
}
}
for(i = 0;i < 3;i++)
{
for( j = 0;j < 3;j++)
{
printf("%d", array[i][j]);
}
printf("\n");
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int i, j, n, a[101][101];
int k = 1;
scanf("%d", &n );
for( i = 1;i <= n;i++)
{
for(j = 1;j <= n;j++)
{
a[i][j] = k++;
}
}
for(i = 1; i <= n;i++)
{
for(j =1; j <=n;j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int i, j, n, a[101][101];
int k = 1;
scanf("%d", &n );
for( i = 1;i <= n;i++)
{
for(j = 1;j <= n;j++)
{
a[i][j] = k++;
}
}
for( i = 1;i <= n;i++)
{
for(j = 1;j <= n;j++)
{
printf("%3d", a[i][j]);
}
printf("\n");
}
return 0;
}
*/
#include <stdio.h>
int main()
{
int i, j;
int ar[2][3] = {{1, 2, 3}, {4, 5, 6}};
`
for(i = 0;i < 2;i++)
{
for(j = 0;j < 3;j++)
{
printf("%2d", ar[i][j]);
}
printf("\n");
}
return 0;
}
'컴퓨터 과학 > C Language' 카테고리의 다른 글
2022-01-17 2차원 배열 연습 (0) | 2022.01.18 |
---|---|
2022-01-16 1차원/ 2차원 배열 (0) | 2022.01.16 |
2022-01-13 중첩 반복문 (0) | 2022.01.13 |
2021-01-12 중첩 반복문 (0) | 2022.01.13 |
2022-01-11 조건문 연습 (0) | 2022.01.13 |