2022-01-16 1차원/ 2차원 배열

 

---

배열, 2진수 변환, 피보나치 수열

/*
#include <stdio.h>

int main()
{
    int a[51][51], i, j, n = 3, k = 1;

    for (i = 1;i <= n;i++)
    {
        for( j = 1; j <= n;j++)
        {
            a[j][i] = k++;
        }
    }
    for( i = 1;i <= n;i++)
    {
        for(j = 1;j <= n;j++)
        {
            printf("%d", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}
*/
/*
#include <stdio.h>

int main()
{

    int n, i, j, arr[105][105], count = 1;
    n = 3;

    for(i = 0;i < n;i++)
    {
        if ( i % 2 == 0)
        {
            for(j = 0; j < n;j++)
            {
                arr[j][i] = count;
                count++;
            }
        }
        else
        {
            for ( j = n-1;j >= 0; j-- )
            {
                arr[j][i] = count;
                count++;
            }
        }
    }
    for ( i = 0; i < n;i++)
    {


        for ( j = 0;j < n;j++)
        {
            printf("%d", arr[i][j]);
        }
        printf("\n");

    }
    return 0;
}
*/
/*
#include <stdio.h>

int main()
{
    int n, i, j, c = 1, a[50][50];
    n = 3;

    for(i = 0;i < n;i++)
    {
        if( i % 2 == 0)
        {
            for(j = 0; j < n;j++)
            {
                a[i][j] = c;
                c++;
            }
        }
        else
        {
            for(j = n-1;j >= 0; j--)
            {
                a[i][j] = c;
                c++;
            }
        }
    }
    for ( i = 0; i < n; i++)
    {
        for(j = 0; j < n; j++)
        {


            printf("%d", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}
*/
/*

#include <stdio.h>

int main()
{
    int n, i, j, k, l;
    int cnt = 1;
    int ar[10][10];
    n = 3;

    for(i = 1;i <= n;i++)
    {
        if( i % 2 == 1)
        {
            for(j = n;j >= 1;j--)
            {
                ar[i][j] = cnt++;
            }
        }
        else
        {
            for ( j = 1; j <= n;j++)
            {
                ar[i][j] = cnt++;
            }
        }
    }
    for (i = 1; i <= n; i++)
    {
        for(j = 1; j <= n; j++)
        {
        printf("%d", ar[i][j] );
        }
        printf("\n");
    }
    return 0;
}
*/
/*
#include <stdio.h>
#define LIM 105

int main()
{
    int n,i, j, k, flag;
    int cnt = 1, m;
    int ar[LIM][LIM];

    m = 4, n = 3;
    flag = 0;

    for( i = m; i >= 1; i--)
    {
        flag++;
        for( j =1;j <= n;j++)
        {
            if( flag % 2 == 0)
            {
                ar[n-j+1][i] = cnt++;
            }
            else
            {
                ar[j][i] = cnt++;
            }
        }
    }
    for( i = 1;i <= n;i++)
    {
        for(j = 1;j <= m;j++)
        {
            printf("%d", ar[i][j]);
        }
        printf("\n");
    }
    return 0;
}

*/
/*
#include <stdio.h>
#define R 2
#define C 3


int main()
{
        int i , j , sum = 0;

        int a[R][C] = {{1 ,2 , 3 }, { 4, 5 ,6 }};
        int b[R][C] = {{3, 6, 1}, {2, 9, 1}};
        int c[R][C] = {};

        for (i = 0;i < R;i++)
        {
            for(j = 0;j < C;j++)
            {
                c[i][j] = a[i][j] +b[i][j];
            }
        }
        for (i = 0; i < R;i++)
        {
            for( j = 0;j < C;j++)
            {
                printf("%d", c[i][j]);
            }
            printf("\n");

        }
    return 0;
}

*/
/* �Ǻ���ġ ����

#include <stdio.h>

int main()
{
    int n, i, j, map[21][21] = {};
    map[1][1] = 1;
    n = 5;

    for(i = 2;i <= n;i++)
    {
        for( j = 1; j <= i;j++)
        {
            map[i][j] = map[i-1][j] + map[i-1][j-1];
        }
    }
    for ( i = 1;i <= n;i++)
    {
        for(j = 1;j <= i;j++)
        {
            printf("%d", map[i][j] ) ;
        }
        printf("\n");
    }
    return 0;
}
*/
/*

#include <stdio.h>

int main()
{
    int n, i, j, map[21][21] = {};
    n = 5;
    for(i = 1; i <= n;i++)
    {
        map[i][1] = 1;
    }
    for (i = 2; i <= n;i++)
    {
        for( j = 2; j <= i;j++)
        {
            map[i][j] = map[i][j-1] + map[i-1][j-1];
        }

    }
    for(i = 1; i <= n;i++)
    {
        puts("");
        for(j = 1; j <= n;j++)
        {
            printf("%d", map[i][j]);
        }
    }
    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 = n; j >= 1; j--)
        {
            printf("%d ", a[i][j]);
        }
        printf("\n");
    }

    return 0;
}

*/
/*
#include <stdio.h>

int main()
{
    int i, j , n, m, a[101][101];

    int  k = 1;

    scanf("%d %d", &n, &m );

    for ( i = 1; i <= n;i++)
    {
        for( j = 1; j <= m;j++)
        {
            a[i][j] = k++;
        }
    }
    for ( i = n; i >= 1; i--)
    {
        for(j = m ; j >= 1;j--)
        {
            printf("%d ", a[i][j]);
        }
        printf("\n");
    }

    return 0;
}
*/
/* 132p �ڵ� 5
#include <stdio.h>

int main()
{
    int i, j, n, a[101][101], 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 = n; j >= 1; j--)
        {
            printf("%d ", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}

*/
/*
#include <stdio.h>

int main()
{
    int i, j, n, k ,l;
    int cnt = 1;
    int ar[10][10];
    n = 3;

    scanf("%d", &n);


    for( i = 1; i <= n;i++)
    {
        if( i % 2== 1)
        {
            for(j = n;j >= 1;j--)
            {
                ar[i][j] = cnt++;
            }
        }
        else
        {
            for(j = 1;j <= n;j++)
            {
                ar[i][j] = cnt++;
            }
        }
    }
    for( i =1; i <= n;i++)
    {
        for(j = 1;j <= n;j++)
        {
            printf("%d", ar[i][j]);
        }
        printf("\n");
    }
    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 105

int main()
{
    int i, j, ar[M]= {}, n;
    n = 100;

    for( i = 2;i <= n;i++)
    {
        if( ar[i] == 0)
        {
            printf("%d" ,i);
        }
        for(j = 2 * i;j <= n;j++)
        {
            ar[j] = 1;
        }
    }
    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 (data[mid] > k )
        {
            high = mid - 1;
        }
        else if ( data[mid] < k )
        {
            low = mid +1;
        }
        if ( low == mid || mid == high )
        {
            break;
        }
    }
    if( f == 0)
    {
        printf("Not Find!!");
    }
    return 0;
}

*/
/* ���� ���ϱ�
#include <stdio.h>
#define M 5

int ar[M] = {85, 79, 92, 70, 88};
int main()
{
    int i, j, rank[M + 1] = {};

    for(i = 0;i < 5;i++)
    {
        rank[i] = 1;
    }
    for ( i = 0; i < 5;i++)
    {
        for( j = 0; j < 5; j++)
        {
            if( ar[i] < ar[j] )
            {
                rank[i]++;
            }
        }
    }
    for ( i = 0; i < 5;i++)
    {
        printf("%d %d\n", ar[i], rank[i] ) ;
    }
    return 0;
}

*/
/*
#include <stdio.h>

int main()
{
    int i, b = 0;
    int a[11] = { 10, -2, 3, 4, 8, 6, -9, 0, 12, 1, -3};

    for( i = 0;i < 11;i++)
    {
        if (i % 3 == 1)
        {
            b = b - a[i];
        }
        else if(i % 3 == 2)
        {
            b = b + a[i];
        }

    }
    printf( "%d \n",b );

    return 0;
}
*/
/* self test
#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++)
    {
        ar[i] = i + 1;
    }
    for( i = 0; i < 10;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 = 9; i >= 0;i--)
    {
        printf("%d ", ar[i] );
    }
    return 0;
}
*/
/* 1094�� ����

#include <stdio.h>

int main()
{
    int n, i;
    int a[1000] = {};

    scanf("%d", &n );

    for(i = 0;i < n;i++)
    {
        scanf("%d", &a[i]);
    }

    for( i = n-1;i >= 0;i--)
{
    printf("%d ", a[i]);
}

    return 0;
}
*/
/*

#include <stdio.h>

int main()

{
   int i, n, t;
   int a[24] = {};


    scanf("%d", &n );

    for(i = 1;i <= n;i++)
    {
        scanf("%d", &t );
        a[t] = a[t] + 1;
    }
    for(i = 1;i <= 23;i++)
    {
        printf("%d ", a[i]);
    }

    return 0;
}
*/
/*
#include <stdio.h>

int main()
{
    int n, i;
    int a[10000]= {};

    scanf("%d", &n );

    for(i = 1;i <= n; i++)
   {
       scanf("%d", &a[i]);
   }
   for( i = n;i >= 1;i--)
    {
        printf("%d ",a[i] );
    }
    return 0;
}
*/
/*
#include <stdio.h>

int main()
{
    int i, n;
    int a[1000] = {};

    scanf("%d", &n);

    for(i = 1;i <= n;i++)
    {
        scanf("%d", &a[i]);
    }

    for( i = n;i >= 1;i--)
    {
        printf("%d ",a[i]);

    }

    return 0;
}
*/
/*
#include <stdio.h>

int main()
{
    int n, i, k;
    int a[100]={};

    scanf("%d", &n);


    for ( i = 1;i <= n;i++)
    {
        scanf("%d", &a[i]);
    }

    for(i = 1;i <= n;i++ )
    {
        printf("%d\n", a[i]);
    }
     for(i = 1;i <= n;i++ )
    {
        printf("%d\n", a[i]);
    }
    return 0;
}
*/
/* 1405�� ����


#include <stdio.h>

int main()
{
    int n, i, j, k;
    int a[i] = {};

    scanf("%d", &n);

    for( i = 1;i <= n;i++)
    {
        scanf("%d", &a[i]);
    }

    for(i = 1; i <= n;i++)
    {
        for(j = 1;j <= n;j++)
        {

        }
    }
    return 0;
}
*/
/* 1407 ���ڿ� ����� ����
#include <stdio.h>

int main()
{
    int i, n;
    int a[100]={};
    char t;


    for( i = 1;i <= n;i++)
    {
        scanf("%c", &a[i] );
    }

    for(i = 1;i <= n;i++)
    {
        if()


        printf("%c", a[i] );

    }
    return 0;
}
*/
/* 1409 ����

#include <stdio.h>

int main()
{
    int i,  k ;
    int a[10]={};

    for(i = 1;i <= 10;i++)
    {
        scanf("%d", &a[i]);
    }
    scanf("%d", &k);

    for( i = 1;i <= 10;i++)
    {
        if ( a[i] == k )
        {
            printf("%d", i);
            break;
        }
    }
    return 0;
}
*/
/* 2���� ��ȭ ( 10�� �ƴ� "33"���� �ؾ� �˳���)

#include <stdio.h>

int main()
{
   int q, r, i,n, c = 0;
   int ar[33] = {};

   scanf("%d", &n);

   do
   {
       q = n / 2;
       r = n - q * 2;
       ar[c++] = r;
       n = q;
   } while (q != 0);

   for( i = c - 1;i >= 0;i--)
   {
       printf("%d", ar[i]);

   }

    return 0;
}
*/