Selasa, 17 Juli 2012

STUCK C++

TUGAS MODUL 7.1 STUCK

INPUT :
//============================================================================
// Name        : 1_stuck.cpp
// Author      : agust
// Version     :
// Copyright   :
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <conio.h>
#include <string.h>
using namespace std;
#define MAX_STACK 10
struct STACK
{
int top;
   char data[10][10];
   };STACK tumpuk;
void inisialisasi()
{
tumpuk.top = -1;
}
int IsFull()
{
if(tumpuk.top ==MAX_STACK-1) return 1; else return 0;
   }
int IsEmpty()
{
if(tumpuk.top == -1) return 1; else return 0;
   }
   void Push (char d [10])
{
tumpuk.top++;
   strcpy(tumpuk.data[tumpuk.top],d);
   }
void Pop()
{
cout<<"data yang terambil = "<<tumpuk.data[tumpuk.top]<<endl;
tumpuk.top--;
}
void TampilStack()
{
for(int i =tumpuk.top;i>=0;i--)
{
cout<<"data : "<<tumpuk.data[i]<<endl;
   }
   }
void Clear()
{
tumpuk.top=-1;
   }
int main(){
int pil;
   inisialisasi();
   char dt[10];
   do{
    cout<<"\n1. push\n";
      cout<<"2. pop\n";
      cout<<"3. print\n";
      cout<<"4. clear\n";
      cout<<"5. exit\n";
      cout<<"pilihan : "; cin>>pil;
      switch(pil){
      case 1: if (IsFull() !=1){
          cout<<"data = ";cin>>dt;
                  Push(dt);
                  }
                  else cout<<"\n Stact penuh!\n";
                  break;
         case 2 : if (IsEmpty() != 1)
          Pop();
                  else
                  cout<<"\n Stack kosong!\n";
                  break;
         case 3 : if (IsEmpty() !=1)
          TampilStack();
                  else
                  cout<<"Stact kosong!\n";
                  break;
         case 4 : Clear();
         cout<<"\n Stack sudah kosong !\n ";
         break;
         }
         //getch();
         } while (pil !=5);
   return main();
   return 0;
}

OUTPUT :
Gambar 1. Tampilan Code

Gambar 2. Hasil Output

LINKED LIST C++

TUGAS MODUL 6.2 LINKED LIST 

input :
//============================================================================
// Name        : 2_linkedList.cpp
// Author      : agust
// Version     :
// Copyright   :
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <stdlib.h>
#include <malloc.h>
//#include <conio.h>

using namespace std;

#define nil NULL
#define info(P) P->info
#define next(P) P->next
#define first(L) (L)

typedef int infotype;
typedef struct telmlist *alamat;
typedef struct telmlist
{
infotype info;
   alamat next;
}elmtlist;

typedef alamat list;;

void buatsenarai (list*L)
{
first(*L) = nil;
}
list nodbaru(int m)
{
list n;
   n = (list) malloc(sizeof(elmtlist));
   if (n!=NULL)
   {
    info(n) =m;
      next(n) =nil;
   }
   return n;
}
void sisipsenarai (list *L,list t, list p)
{
if (p==nil)
{
    t->next=*L;
      *L=t;
   }
   else
   {
    t->next=p->next;
      p->next=t;
   }
}

void cetaksenarai (list L)
{
list ps;

for (ps=L; ps!=nil; ps=ps->next)
{
cout<<" "<<info(ps)<<" -->";
   }
   cout<<"NULL\n";
}
int main()
{
list pel;
   list n;
   int i,k,nilai;

   buatsenarai(&pel);
   cout<<"masukkan banyak data = ";
   cin>>k;
   for (i=1;i<=k;i++)
   {
   cout<<"masukkan data senarai ke-"<<i<<" = ";
   cin>>nilai;
   n=nodbaru(nilai);
   sisipsenarai (&pel,n,NULL);
}

cetaksenarai(pel);
return 0;
}

output :




TUGAS MODUL 6.1 LINKED LIST

input : 
//============================================================================
// Name        : 1_LinkedList.cpp
// Author      : agust
// Version     :
// Copyright   :
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
//#include <conio.h>
#include <malloc.h>
using namespace std;

int main()
{
int i;

struct ListEntry
{
int number;
struct ListEntry *next;
}   start, *node;

start.next=NULL;
node=&start;
for (i=1; i<=10; i++)
{
node->next=(struct ListEntry *) malloc(sizeof(struct ListEntry));
   node=node->next;
   node->number=i;
   node->next=NULL;
}

node=start.next;

while (node)
{
   cout<<node->number;
   node=node->next;
   }
return 0;
}

output :


Selasa, 05 Juni 2012

Senin, 04 Juni 2012

array nama dengan perintah (while) menggunakan eclipse

input :

#include <iostream>
using namespace std;

int main() {
int pilih;
int agus[8][32]=
{
{0,1,1,1,1,1,0,0, 0,1,1,1,1,1,0,0, 1,1,0,0,0,0,1,0, 0,1,1,1,1,1,1,0},
   {0,1,0,0,0,1,0,0, 1,1,0,0,0,1,1,0, 1,1,0,0,0,0,1,0, 1,1,0,0,0,0,0,0},
   {0,1,0,0,0,1,0,0, 1,1,0,0,0,0,0,0, 1,1,0,0,0,0,1,0, 1,1,0,0,0,0,0,0},
{1,1,1,1,1,1,1,0, 1,1,0,0,0,0,0,0, 1,1,0,0,0,0,1,0, 0,1,1,1,1,1,0,0},
{1,1,0,0,0,0,1,0, 1,1,0,0,0,1,1,0, 1,1,0,0,0,0,1,0, 0,0,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0, 1,1,0,0,0,0,1,0, 1,1,1,1,1,1,1,0, 0,0,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0, 0,1,1,1,1,1,1,0, 0,1,1,1,1,1,0,0, 1,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0},
};
int a, s;
int agust [4][8][8]=
{
{{0,1,1,1,1,1,0,0},
{0,1,0,0,0,1,0,0},
{0,1,0,0,0,1,0,0},
{1,1,1,1,1,1,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{0,0,0,0,0,0,0,0}},

{{0,1,1,1,1,1,0,0},
{1,1,0,0,0,1,1,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0},
{0,1,1,1,1,1,1,0},
{0,0,0,0,0,0,0,0}},

{{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,1,1,1,1,1,0},
{0,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0}},

{{0,1,1,1,1,1,1,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0},
{0,1,1,1,1,1,0,0},
{0,0,0,0,0,1,1,0},
{0,0,0,0,0,1,1,0},
{1,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0}}
};
int h,i,j;

cout<<"pilihan";
cout<<"\n1 = Array 2D";
cout<<"\n2 = Array 3D";
cout<<"\n3 = Exit\n";
cout<<"Pilih Untuk Menampilkan Nama: ";
cin>>pilih;
cout<<endl;

while(1)
{
if(pilih==1){
for(a=0;a<8;a++)
{
for(s=0;s<32;s++)
if(agus[a][s]==1)
cout<<"0";
else
cout<<'\x20';
cout<<endl;
}
}
break;

}
while(1)
{
if(pilih==2){
for(h=0;h<4;h++)
{
for(i=0;i<8;i++)
{
for(j=0;j<8;j++)

if (agust [h] [i] [j]==1)
cout<<"0";
else
cout<<"\x20";
cout<<endl;
}
cout<<endl;
}

}
break;
}
while(1)
{
if(pilih==3)
{
cout<<"terimakasih menggunakan program ini!";
}
break;
}
return 0;
}

output :
saat memilih pilihan nomor 1 maka akan muncul :


jika memilih nomor 2 maka akan muncul :


jika memilih nomor 3 maka akan muncul :


silahkan dicoba semoga berhasil
GBU

array nama dengan perintah (case) menggunakan eclipse

input :

#include <iostream>
using namespace std;

int main() {
int pilih;
cout<<"pilihan array";
cout<<"\n1 = array 2D";
cout<<"\n2 = array 3D";
cout<<"\n3 = exit";
cout<<"\npilih : ";
cin>>pilih;
cout<<"\n";
switch (pilih)
{
case 1 :
{
int hrf[8][32]=
{
{0,1,1,1,1,1,0,0, 0,1,1,1,1,1,0,0, 1,1,0,0,0,0,1,0, 0,1,1,1,1,1,1,0},
   {0,1,0,0,0,1,0,0, 1,1,0,0,0,1,1,0, 1,1,0,0,0,0,1,0, 1,1,0,0,0,0,0,0},
   {0,1,0,0,0,1,0,0, 1,1,0,0,0,0,0,0, 1,1,0,0,0,0,1,0, 1,1,0,0,0,0,0,0},
{1,1,1,1,1,1,1,0, 1,1,0,0,0,0,0,0, 1,1,0,0,0,0,1,0, 0,1,1,1,1,1,0,0},
{1,1,0,0,0,0,1,0, 1,1,0,0,0,1,1,0, 1,1,0,0,0,0,1,0, 0,0,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0, 1,1,0,0,0,0,1,0, 1,1,1,1,1,1,1,0, 0,0,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0, 0,1,1,1,1,1,1,0, 0,1,1,1,1,1,0,0, 1,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0},
};
 int i,j;
  for(i=0;i<8;i++)
  {
  for(j=0; j<32; j++)
  if (hrf[i][j]==1)
  cout<<"0";
  else
  cout<<"\x20";
  cout<<endl;
}
  return 0;
break;
}
case 2 :
{
int huruf[4][8][8]=
{
{{0,1,1,1,1,1,0,0},
{0,1,0,0,0,1,0,0},
{0,1,0,0,0,1,0,0},
{1,1,1,1,1,1,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{0,0,0,0,0,0,0,0}},

{{0,1,1,1,1,1,0,0},
{1,1,0,0,0,1,1,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0},
{0,1,1,1,1,1,1,0},
{0,0,0,0,0,0,0,0}},

{{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,1,1,1,1,1,0},
{0,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0}},

{{0,1,1,1,1,1,1,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0},
{0,1,1,1,1,1,0,0},
{0,0,0,0,0,1,1,0},
{0,0,0,0,0,1,1,0},
{1,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0}}

};

int i,j,k;
for(i=0;i<4;i++)
{
for(j=0;j<8;j++)
{
for(k=0;k<8;k++)
if(huruf[i][j][k]==1)
cout<<"0";
else
cout<<"\x20";
cout<<endl;
}
}
return 0;
break;
}
case 3 :
{
{
cout<<"terimakasih menggunakan program ini!";
}
return 0;
break;
}

return 0;
}
}

output :
saat memilih pilihan nomor 1 maka akan muncul :

dan jika input nomor 2 maka akan muncul :


input nomor 3 maka akan muncul :

silahkan di coba, semoga bermanfaat
GBU


Senin, 28 Mei 2012

Jumat, 25 Mei 2012

tugas praktikum 5 membuat program nama 2 dimensi


#include <iostream>
using namespace std;

int main() {
int hrf[8][32]=
{
{0,1,1,1,1,1,0,0, 0,1,1,1,1,1,0,0, 1,1,0,0,0,0,1,0, 0,1,1,1,1,1,1,0},
 {0,1,0,0,0,1,0,0, 1,1,0,0,0,1,1,0, 1,1,0,0,0,0,1,0, 1,1,0,0,0,0,0,0},
 {0,1,0,0,0,1,0,0, 1,1,0,0,0,0,0,0, 1,1,0,0,0,0,1,0, 1,1,0,0,0,0,0,0},
{1,1,1,1,1,1,1,0, 1,1,0,0,0,0,0,0, 1,1,0,0,0,0,1,0, 0,1,1,1,1,1,0,0},
{1,1,0,0,0,0,1,0, 1,1,0,0,0,1,1,0, 1,1,0,0,0,0,1,0, 0,0,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0, 1,1,0,0,0,0,1,0, 1,1,1,1,1,1,1,0, 0,0,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0, 0,1,1,1,1,1,1,0, 0,1,1,1,1,1,0,0, 1,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0},
};
 int i,j;
  for(i=0;i<8;i++)
  {
  for(j=0; j<32; j++)
  if (hrf[i][j]==1)
  cout<<"0";
  else
  cout<<"\x20";
  cout<<endl;
  }

return 0;
}
OUTPUT :

tugas praktikum 5 membuat program nama 3 dimensi

INPUT :

#include <iostream>
using namespace std;

int main() {
int huruf[4][8][8]=
{
{{0,1,1,1,1,1,0,0},
{0,1,0,0,0,1,0,0},
{0,1,0,0,0,1,0,0},
{1,1,1,1,1,1,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{0,0,0,0,0,0,0,0}},

{{0,1,1,1,1,1,0,0},
{1,1,0,0,0,1,1,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,1,1,0},
{1,1,0,0,0,0,1,0},
{0,1,1,1,1,1,1,0},
{0,0,0,0,0,0,0,0}},

{{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,0,0,0,0,1,0},
{1,1,1,1,1,1,1,0},
{0,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0}},

{{0,1,1,1,1,1,1,0},
{1,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0},
{0,1,1,1,1,1,0,0},
{0,0,0,0,0,1,1,0},
{0,0,0,0,0,1,1,0},
{1,1,1,1,1,1,0,0},
{0,0,0,0,0,0,0,0}}

};

int i,j,k;
for(i=0;i<4;i++)
{
for(j=0;j<8;j++)
{
for(k=0;k<8;k++)
if(huruf[i][j][k]==1)
cout<<"*";
else
cout<<"\x20";
cout<<endl;
}
}
return 0;
}

OUTPUT :

Minggu, 15 April 2012

tugas praktikum 3.4 searching eclipse

sintak program :


#include <iostream>
using namespace std;

int string_kar(char st[], char k)
{
int i, posisi, panjang;

i=0;
posisi =-1;
panjang = strlen (st);
while ((i<panjang-1) && posisi ==-1)
{
if (st[i] == k)
posisi=i;
i++;
}
return posisi;
}
int main()
{
char kalimat[]="hallo stikom yos";
char dicari ='y';

cout<<"posisi "<<dicari<<" didalam string "<<kalimat<<" : "<<string_kar(kalimat, dicari)<<"\n";

return 0;
}

hasil program :

tugas praktikum 3.3 searching eclipse

sintak program :


#include <iostream>
using namespace std;


int caribiner (int data [], int n, int k)
{
int ada, atas, bawah, tengah, posisi;
ada =0;
bawah=0;
atas=n-1;
while (atas>=bawah)
{
tengah= (atas+bawah)/2;
if (k>data[tengah])
bawah=tengah+1;
else
if (k<data [tengah])
atas=tengah-1;
else
{
ada=1;
posisi=tengah;
bawah=atas+1;
}
}
if(!ada)
posisi=-1;
return posisi;
}


int main()
{


int data[]={10, 9, 7,6, 5, 4, 3, 1};
int dicari=6;
cout<<"posisi "<<dicari <<" dalam larik data : " <<caribiner(data,8,dicari)<<"\n";
return 0;
}


hasil program :

tugas praktikum 3.2 searching eclipse

sintak program :


#include <iostream>
using namespace std;


int cari(int data [], int n, int k, int m)
{
int posisi, i, ketemu;
int pencacah=0;


if (n<=0)
posisi=-1;
else
{
ketemu=0;
i=1;
while ((i<n-1) && !ketemu)
if (data [i] == k)
{
pencacah++;
cout<<"pencacah \n"<< pencacah;
if (pencacah==m)
{
cout<<"ketemu "<<pencacah;
posisi=i;
ketemu=1;
}
else
i++;
}
else
i++;
if(!ketemu)
posisi=-1;
}
return posisi;
}
int main()
{
int data [8]={10,9,6,4,7,5,4,1};
int dicari;
int ke;


dicari=4;
ke =2;
cout<<"posisi "<<dicari<<"yang ke "<<ke<<"dalam larik data :"<<cari (data,8,dicari,ke)<<"\n";


ke=1;
cout<<"posisi "<<dicari<<"yang ke "<<ke<<"dalam larik data :"<<cari (data,8,dicari,ke)<<"\n";


ke=2;
dicari=5;
cout<<"posisi "<<dicari<<"yang ke "<<ke<<"dalam larik data :"<<cari (data,8,dicari,ke)<<"\n";






return 0;
}


hasil program :

tugas praktikum 3.1 searching eclipse

masukan sintak program :


#include <iostream>
using namespace std;

int cari (int data[], int n, int k)
{
int posisi, i, ketemu;
if (n<=0)
posisi=-1;
else
{
ketemu=0;
i=-1;
while ((i<n-1) && !ketemu)
if (data [i] == k)
{
posisi = i;
ketemu = i;
}
else
i++;
if (!ketemu)
posisi =-1;
}
return posisi;

}
int main()
{
int data [8] = {10, 9, 6, 4, 7, 5, 4, 1};
int dicari = 4;
cout<<"posisi "<<dicari<<"ada dalam larik data ke : "<<cari (data,8,dicari)<<"\n";

return 0;
}

hasil program :

Selasa, 10 April 2012

STIKOM YOS SUDARSO ( 3 cahaya )

mahasiswa Stikom Yos purwokerto angkatan 2011. agus triantoro, jenjang ambar, sujenk 


smk pgri 1 ngawi (TKJ A 2008-2011)

SMK PGRI 1 Ngawi yang memiliki julukan GRISA, dan foto ini adalah siswa TKJ A foto bersama Pak Hary Susanto, guru pengajar  komputer jaringan. dengan tujuan menjalin hubungan antar guru dengan murid dan membuat kenangan saat bersama di GRISA
   

Minggu, 08 April 2012

tugas praktikum 2.5 typedef struct eclipse

sintak program :



#include <iostream>
using namespace std;


typedef struct mahasiswa
{
       char NIM[9];
       char nama[30];
       float ipk;


};


int main ()
{
       mahasiswa mhs;


       cout<<"NIM : ";
       cin>>mhs.NIM;
       cout<<"Nama : ";
       cin>>mhs.nama;
       cout<<"IPK : ";
       cin>>mhs.ipk;
       cout<<"Data Anda : ";
       cout<<"\n\nNIM = "<<mhs.NIM<<"\n";
       cout<<"Nama = "<<mhs.nama<<"\n";
       cout<<"IPK = "<<mhs.ipk<<"\n";


       return 0;
}


hasil program :

tugas praktikum 2.3 menghitung luas lingkaran eclipse

sintak program :



#include <iostream>
using namespace std;
#define phi 3.14


struct 
{
       float jari2;
       float keliling;
       float luas;
}lingkaran;


void luasLingkaran ()
{
       lingkaran.luas=lingkaran.jari2*lingkaran.jari2*phi;
       cout<<"Luas lingkaran = "<<lingkaran.luas<<endl;
}


float kelLingkaran (float jari2)
{
       return 2*phi*lingkaran.jari2;
}


int main ()
{
       cout<<"Jari jari : ";
       cin>>lingkaran.jari2;
       luasLingkaran () ;
       lingkaran.keliling = kelLingkaran (lingkaran.jari2)
                    ;
       cout<<"Keliling Lingkaran = "<<lingkaran.keliling;
       return 0;
}


hasil program :

tugas praktikum 2.2 type data struct

sintak program :



#include <iostream>
#include <string.h>
using namespace std;
int main ()
{
struct data_tanggal
{
       int tanggal;
       int bulan;
       int tahun;
};


struct data_teman
{
       char nama[50];
       struct data_tanggal tgl_lahir;
};


struct data_teman info_teman;


strcpy (info_teman.nama,"STIKOMWATI");
info_teman.tgl_lahir.tanggal = 12;
info_teman.tgl_lahir.bulan = 3;
info_teman.tgl_lahir.tahun = 1981;


cout<<"Nama : "<<info_teman.nama;
cout<<"\nTanggal lahir : "<<info_teman.tgl_lahir.tanggal
<<"-"<<info_teman.tgl_lahir.bulan
<<"-"<<info_teman.tgl_lahir.tahun;
       return 0;
}


hasil program :

tugas praktikum 2 program zodiak eclipse

sintak program :



#include <iostream>
using namespace std;


int main()
{
struct zodiak
   {
   char nama[15];
   int tgl_awal,bln_awal,tgl_akhir,bln_akhir;
   };


struct zodiak aries = {"Aries",21,3,19,4};
struct zodiak taurus = {"Taurus",20,4,20,5};
struct zodiak gemini = {"Gemini",21,5,20,6};
struct zodiak cancer         = {"Cancer",21,6,22,7};
struct zodiak leo             = {"Leo",23,7,22,8};
struct zodiak virgo           = {"Virgo",23,8,22,9};
struct zodiak libra           = {"Libra",23,9,22,10};
struct zodiak scropio         = {"Scropio",23,10,21,11};
struct zodiak sagitarius     = {"Sagitarius",22,11,21,12};
struct zodiak capriconus   = {"Capriconus",22,12,19,1};
struct zodiak aquarius       = {"Aquarius",20,1,18,2};
struct zodiak pisces           = {"Pisces",19,2,20,3};


int tgl_lahir,bln_lahir,th_lahir;
//clrscr();


cout<<"tanggal lahir anda (ii-ii-iiii) : ";
cin>>tgl_lahir>>bln_lahir>>th_lahir;


if ((tgl_lahir>=aries.tgl_awal&&bln_lahir==aries.bln_awal) ||
    (tgl_lahir<=aries.tgl_akhir && bln_lahir==aries.bln_akhir))
    cout<<"bintang anda adalah \n"<<aries.nama;


if ((tgl_lahir>=taurus.tgl_awal&&bln_lahir==taurus.bln_awal) ||
    (tgl_lahir<=taurus.tgl_akhir && bln_lahir==taurus.bln_akhir))
    cout<<"bintang anda adalah %s\n"<<taurus.nama;


if ((tgl_lahir>=gemini.tgl_awal&&bln_lahir==gemini.bln_awal) ||
    (tgl_lahir<=gemini.tgl_akhir && bln_lahir==gemini.bln_akhir))
    cout<<"bintang anda adalah \n"<<gemini.nama;


if ((tgl_lahir>=cancer.tgl_awal&&bln_lahir==cancer.bln_awal) ||
    (tgl_lahir<=cancer.tgl_akhir && bln_lahir==cancer.bln_akhir))
    cout<<"bintang anda adalah \n"<<cancer.nama;


if ((tgl_lahir>=leo.tgl_awal&&bln_lahir==leo.bln_awal) ||
    (tgl_lahir<=leo.tgl_akhir && bln_lahir==leo.bln_akhir))
    cout<<"bintang anda adalah \n"<<leo.nama;


if ((tgl_lahir>=virgo.tgl_awal&&bln_lahir==virgo.bln_awal) ||
    (tgl_lahir<=virgo.tgl_akhir && bln_lahir==virgo.bln_akhir))
    cout<<"bintang anda adalah \n"<<virgo.nama;


if ((tgl_lahir>=libra.tgl_awal&&bln_lahir==libra.bln_awal) ||
    (tgl_lahir<=libra.tgl_akhir && bln_lahir==libra.bln_akhir))
    cout<<"bintang anda adalah \n"<<libra.nama;


if ((tgl_lahir>=scropio.tgl_awal&&bln_lahir==scropio.bln_awal) ||
    (tgl_lahir<=scropio.tgl_akhir && bln_lahir==scropio.bln_akhir))
    cout<<"bintang anda adalah \n"<<scropio.nama;


if ((tgl_lahir>=sagitarius.tgl_awal&&bln_lahir==sagitarius.bln_awal) ||
    (tgl_lahir<=sagitarius.tgl_akhir && bln_lahir==sagitarius.bln_akhir))
    cout<<"bintang anda adalah \n"<<sagitarius.nama;


if ((tgl_lahir>=capriconus.tgl_awal&&bln_lahir==capriconus.bln_awal) ||
    (tgl_lahir<=capriconus.tgl_akhir && bln_lahir==capriconus.bln_akhir))
    cout<<"bintang anda adalah \n"<<capriconus.nama;


if ((tgl_lahir>=aquarius.tgl_awal&&bln_lahir==aquarius.bln_awal) ||
    (tgl_lahir<=aquarius.tgl_akhir && bln_lahir==aquarius.bln_akhir))
    cout<<"bintang anda adalah \n"<<aquarius.nama;


if ((tgl_lahir>=pisces.tgl_awal&&bln_lahir==pisces.bln_awal) ||
    (tgl_lahir<=pisces.tgl_akhir && bln_lahir==pisces.bln_akhir))
    cout<<"bintang anda adalah \n "<<pisces.nama;


   return 0;
}


hasil program :