Source Code Mencari Nilai Maximum dan Minimum dari Kartu Remi Bahasa C

Follower My Blog

Source Code Mencari Nilai Maximum dan Minimum dari Kartu Remi Bahasa C

12.47 | Posted by Fatkhurrohim | | Edit Entri

Berikut adalah contoh source code bahasa C, semoga bisa membantu dalam belajar pemrogaman.

#include <stdio.h>
#include <stdlib.h>

#define max 13
#define AS 1
#define J 11
#define Q 12
#define K 13

typedef struct
{
    int Wajik[max];
    int Keriting[max];
    int Sekop[max];
    int Love[max];

}KKartu;
KKartu Kartu;

int maxi(int a[],int n);
int min(int a[],int n);

int main(void)
{
 int array[max],nwajik,nkeriting,nsekop,nlove;
 int i = 0;

/* reading the elements form the users*/
  printf("banyaknya wajik :");
  scanf("%d",&nwajik);

printf("masukan angka kartu wajik: \n");

for(i = 0; i < nwajik; i++ )
   {
    scanf("%d",&Kartu.Wajik[i]);
            if(Kartu.Wajik[i]>14 || Kartu.Wajik[i]==i)
                {
                    printf("salah input, mohon inputkan lagi \n");
                    i--;
                }
   }

printf("banyaknya keriting :");
    scanf("%d",&nkeriting);

printf("masukan angka kartu keriting: \n");

for(i = 0; i < nkeriting; i++ )
    {
    scanf("%d",&Kartu.Keriting[i]);
            if(Kartu.Keriting[i]>14)
                {
                    printf("salah input, mohon inputkan lagi \n");
                    i--;
                }
    }

printf("banyaknya sekop :");
    scanf("%d",&nsekop);

printf("masukan angka kartu sekop: \n");

for(i = 0; i < nsekop; i++ )
    {
    scanf("%d",&Kartu.Sekop[i]);
            if(Kartu.Sekop[i]>14)
                {
                    printf("salah input, mohon inputkan lagi \n");
                    i--;
                }
    }
    printf("banyaknya love :");
    scanf("%d",&nlove);

printf("masukan angka kartu love: \n");

for(i = 0; i < nlove; i++ )
    {
    scanf("%d",&Kartu.Love[i]);
            if(Kartu.Love[i]>14)
                {
                    printf("salah input, mohon inputkan lagi \n");
                    i--;
                }
    }
//------------------------------------------------------------------------------

/* array before mergesort */
printf("wajik sebelum diproses:");
    for(i = 0; i < nwajik; i++)
    printf(" %d", Kartu.Wajik[i]);
    printf("\n");

printf("keriting sebelum diproses:");
    for(i = 0; i < nkeriting; i++)
    printf(" %d", Kartu.Keriting[i]);
    printf("\n");

printf("sekop sebelum diproses:");
    for(i = 0; i < nsekop; i++)
    printf(" %d", Kartu.Sekop[i]);
    printf("\n");

printf("love Before sorting:");
    for(i = 0; i < nlove; i++)
    printf(" %d", Kartu.Love[i]);
    printf("\n");
    printf("\n");
//-------------------------------------------------------------------------------------

printf("\n\n\n\n");

//-------------------------------------------------------
    printf("nilai maximum wajik: ");
    printf("%d",maxi(Kartu.Wajik,nwajik));
    printf("\n");

printf("nilai minimum wajik: ");
    printf("%d",min(Kartu.Wajik,nwajik));
    printf("\n");
//----------------------------------------------------------
    printf("nilai maximum keriting: ");
    printf("%d",maxi(Kartu.Keriting,nkeriting));
    printf("\n");

printf("nilai minimum keriting: ");
    printf("%d",min(Kartu.Keriting,nkeriting));
    printf("\n");
//-----------------------------------------------------------
    printf("nilai maximum sekop: ");
    printf("%d",maxi(Kartu.Sekop,nsekop));
    printf("\n");

printf("nilai minimum sekop: ");
    printf("%d",min(Kartu.Sekop,nsekop));
    printf("\n");
//----------------------------------------------------------
    printf("nilai maximum love: ");
    printf("%d",maxi(Kartu.Love,nlove));
    printf("\n");

printf("nilai minimum love: ");
    printf("%d",min(Kartu.Love,nlove));
    printf("\n");
 return 0;

}

int maxi(int a[],int n)
{
    int i;
    int mak;

mak=a[0];
     for(i=1;i<= n-1;i++)
    {
        if(a[i]>mak)
        {
            mak=a[i];
        }
    }
return mak;
}

int min(int a[],int n)
{
    int i;
    int min;

min=a[0];
     for(i=1;i<= n-1;i++)
    {
        if(a[i]<min)
        {
            min=a[i];
        }
    }
return min;
}

Label: bahasa c, Campuzz, Program

0 komentar:

Posting Komentar

Mohon comment jika ada kekurang jelasan, thank u...

Label

Follower My Blog

Chat Guest