Kamis, 02 Juni 2011

DERET GEOMETRI

#include <cstdlib>
#include <iostream>

using namespace std;
class geometri{
friend istream& operator>>(istream&, geometri&);
friend ostream& operator<<(ostream&, geometri&);
public:
geometri();
void cetak();
private:
int x[100];
int a,b,n,un,sn;
int jumlah;
};
istream& operator>>(istream& mlebu, geometri& s){
cout<<”Masukkan Suku Pertama :”; mlebu>>s.a; cout<<endl;
cout<<”Masukkan r :”; mlebu>>s.b; cout<<endl;
cout<<”Masukkan Jumlah Suku :”; mlebu>>s.n; cout<<endl;
return mlebu;
}
ostream& operator<<(ostream& metu, geometri& v){
metu<<”Suku Pertama :”<<v.a<<endl;
metu<<”r :”<<v.b<<endl;
metu<<”Jumlah Suku :”<<v.n<<endl;
metu<<”Deret Geometri :”;
for(int i=0; i<v.n; i++){
metu<<v.x[i]<<”,”;
}
metu<<endl;
metu<<”Jumlah Seluruh Deret : “<<v.jumlah<<endl;
return metu;}
geometri::geometri(){
cout<<”\t\t<< PROGRAM DERET GEOMETRI >>”<<endl;
}
void geometri::cetak(){
x[0]=a;
x[1]=a*b;
x[2]=a*b*b;
for(int i=2; i<n; i++){
x[i]=x[1]*x[i-1];
}
jumlah=0;
for(int i=0; i<n; i++){
jumlah=jumlah+x[i];
}
}
int main(int argc, char *argv[])
{
geometri arif;
cin>>arif;
arif.cetak();
cout<<arif;
system(“PAUSE”);
return EXIT_SUCCESS;
}

INSERTION SORT

#include <cstdlib>
#include <iostream>
using namespace std;
class sisip{
static int A[10];
public:
void pengurutan_sisip();
void tampil();
};
int sisip::A[10]={54,23,12,56,78,50,12,89,10,12};
void sisip::pengurutan_sisip()
{
int i,j,y;
bool ketemu;
for(i=1;i<=9;i++)
{
y=A[i];
j=i-1;
ketemu=false;
while((j>=0)&&(!ketemu))
{
if(y<A[j])
{
A[j+1]=A[j];
j–;
}
else ketemu=true;
}A[j+1]=y;
}
}

void sisip::tampil(){
for(int a=0;a<10;a++)
{
cout<<A[a]<<” “;
}
cout<<endl<<endl;
}
int main(int argc, char *argv[])
{
sisip x;
cout<<”PENGURUTAN SISIP”<<endl<<endl;
cout<<”Sebelum diurut : “<<endl<<”A = “;
x.tampil();
x.pengurutan_sisip();
cout<<”Setelah diurut : “<<endl<<”A = “;
x.tampil();
system(“PAUSE”);
return EXIT_SUCCESS;
}

DERET ARITMATIKA

#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int nilai[100];
int i;
int size;
cout<<”Masukkan jumlah nilai : “;
cin>>size;
for(i=1;i<=size;i++){
cout<<”masukkan nilai “<<i<<” =”;
cin>>nilai[i];
}
for(i=1;i<=size;i++){
cout<<”nilai “<<i<<” =”<<nilai[i]<<endl;
}
system(“PAUSE”);
return EXIT_SUCCESS;
}

ARRAY 1 DIMENSI

#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int nilai[100];
int i;
int size;
cout<<”Masukkan jumlah nilai : “;
cin>>size;
for(i=1;i<=size;i++){
cout<<”masukkan nilai “<<i<<” =”;
cin>>nilai[i];
}
for(i=1;i<=size;i++){
cout<<”nilai “<<i<<” =”<<nilai[i]<<endl;
}
system(“PAUSE”);
return EXIT_SUCCESS;
}

Rabu, 01 Juni 2011

MENGHAPUS DATA YANG MEMILIKI KESAMAAN PADA ARRAY

#include <cstdlib>
#include <iostream>
using namespace std;
class hapus{
public:
void data();
void rumus();
private:
int count1, count2, count3, num, ans;
float vec[20];
};
void hapus::data(){
cout<<”\nMasukkan jumlah angka (MAX. 20) : “;
cin>>num;
cout<<”\nMasukkan angka lalu enter : \n”;
}

void hapus::rumus(){
ans=0;
for(count1=0; count1<num; count1++)
cin>>vec[count1];
cout<<”\nAngka yang anda masukkan :\n”;
for(count1=0; count1<num; count1++)
cout<<”\n”<<vec[count1];
for(count1=0; count1<num; count1++)
{
for(count2=count1+1; count2<num; count2++)
{
if(vec[count1]==vec[count2])
{
num=num-1;
for(count3=count2; count3<num; count3++)
vec[count3] =vec [count3+1];
ans=1;
count2–;
}
}
}
if(ans==0)
cout<<”\nAngka yang anda masukkan tidak ada yang sama :\n”;
else
{
cout<<”\n\nAngka sesudah yang sama dihapus : \n”;
for(count2=0; count2<num; count2++)
cout<<”\n”<<vec[count2];
}
}
int main(int argc, char *argv[])
{
hapus a;
a.data();
cout<<endl;
a.rumus();
cout<<endl;
system(“PAUSE”);
return EXIT_SUCCESS;
}

GRAFF

#include <iostream.h>
#include <conio.h>
int main(){
int i,j,n;
char a[10];
cout<<”Program Graf\n”;
cout<<”Banyak simpul: “;
cin>>n;
for(i=0;i<n;i++){
cout<<”Simpul ke-”<<i+1<<” : “;
cin>>a[i];}
cout<<”Hasilnya : “;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
cout<<a[i]<<a[j];
cout<<”, “;}}
getch();
return 0;}

ENKRIPSI SEDERHANA

#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main(int argc, char *argv[])
{
char plain[100];
char chiper[100];
int key;
cout<<”masukkan kata :”;
cin>>plain;
cout<<”masukkan jumlah enkripsi :”;
cin>>key;
cout<<endl;
for(int i=0;i<strlen(plain);i++)
{
//ut<<plain[i]<<”(“<<int(plain[i])<<”)”;
chiper[i]=(plain[i]+key)%128;
}

for(int i=0;i<strlen(chiper);i++)
{
cout<<endl;
cout<<chiper[i];
}
cout<<endl;
cout<<”deskripsi”;
for(int i=0;i<strlen(chiper);i++)
{
//cout<<plain[i]<<”(“<<int(plain[i])<<”)”;
plain[i]=(chiper[i]-key)%128;
}
for(int i=0;i<strlen(plain);i++)
{
cout<<endl;
cout<<plain[i];
}
cout<<endl;
system(“PAUSE”);
return EXIT_SUCCESS;
}