Professional Documents
Culture Documents
Biner
#include <stdio.h>
void kebiner(int n)
{ int y;
if(n>1)
{
kebiner(n/2);
}
y = n%2;
printf ("%d",y);
}
void main()
{int a;
printf ("PROGRAM PENGKONVERSI BIL. DESIMAL KE BINER\n\n");
printf ("Masukkan bilangan desimal yang akan dikonversi : ");
scanf ("%d",&a);
printf ("\n");
printf ("%d dalam biner adalah ", a);
kebiner(a);
printf ("\n\n");
}
2. Faktorial
#include <stdio.h>
void main()
{
int n, hasil = 1, bil = 1;
printf ("Masukkan faktorial yang anda inginkan!\n");
scanf("%d",&n);
printf (" %d! = ", n);
while (bil <= n - 1)
{
hasil = hasil * bil;
printf ("%d",bil);
bil = bil + 1;
printf (" x ");
}
hasil = hasil * bil;
printf ("%d ",bil);
printf ("= %d\n",hasil);
}
3. Rata - rata
#include <stdio.h>
void main()
{
int jmldt,jmltotal,rata;
int data,n;
printf ("Masukkan Jumlah data yang anda inginkan!\n");
scanf("%d",&jmldt);
printf ("\nJumlah data yang anda inginkan adalah %d\n",jmldt);
n = 1;
jmltotal= 0 ;
printf ("\nSilahkan masukkan nilai!\n");
do { printf ("Nilai ke-%d = ",n);
scanf ("%d",&data);
jmltotal = jmltotal + data;
n++;
}
while (n <= jmldt);
rata = jmltotal/jmldt;
printf ("\nNilai rata - rata = %d / %d = %d\n", jmltotal, jmldt, rata);
}
4. Resistor paralel
#include <stdio.h>
#include <conio.h>
void main()
{
float r, rp;
int jml, n;
rp = 0;
n = 1;
printf ("PROGRAM PENGHITUNG RESISTOR PARALEL\n\n");
printf ("Masukkan banyaknya resisitor : ");
scanf ("%d", &jml);
do {printf ("Besar resisitor ke %d : ", n);
scanf ("%f", &r);
rp= rp + 1/r;
n++;}
while (jml>= n);
printf (" hasil = %f", 1/rp);
getch ();
}
5. Deret Pengali
#include <stdio.h>
void main()
{
int b1, n, x, hasil,i=0;
printf ("PROGRAM DERET PENGALI\n\n");
printf ("Masukkan banyak deret yang diinginkan (min. 3) : ");
scanf ("%d",&n);
printf ("\nMasukkan b1 : ");
scanf ("%d",&b1);
printf ("Masukkan pengali yang diinginkan : ");
scanf ("%d",&x);
printf ("\nDeret\n%d ",b1);
do {hasil = b1 * x;
b1 = hasil;
printf ("%d ",hasil);
i++;}
while (i < n - 1);
printf ("\n");
}
7. MinMax
#include <stdio.h>
void main()
{
int n, data, min, max, i=1;
printf ("PROGRAM PENCARI NILAI MIN. DAN MAX.\n\n");
printf ("Masukkan Banyaknya data : ");
scanf ("%d",&n);
printf ("\nMasukkan data ke %d : ", i);
scanf ("%d",&data);
min = data;
max = data;
do {printf ("Masukkan data ke %d : ", i + 1);
scanf ("%d",&data);
if (data > max) max = data;
else if (data < min) min = data;
i++;
} while (i < n);
printf ("\nNilai Min = %d\n",min);
printf ("Nilai Max = %d\n",max);
}
8. Deret 1,1,4,4,7,9,...
#include <stdio.h>
void main()
{
int b1 = 1, b2 = 2, n, i = 1,t=2;
printf ("PROGRAM DERET 1,1,4,4,7,9,...\n\n");
printf ("Masukkan N : ");
scanf ("%d",&n);
printf ("\nS%d = %d + %d ",n,b1,b2);
if (n%2!=0)
{while (i<n/2)
{b1 = b1 + 3;
b2 = (i+1) * (i+1);
t = t + b1 + b2;
printf ("+ %d + %d ", b1, b2);
++i;}
b1 = b1 + 3; printf ("+ %d ", b1)
;t = t + b1;}
while (i<n/2)
{b1 = b1 + 3;
b2 = (i+1) * (i+1);
t = t + b1 + b2;
printf ("+ %d + %d ", b1, b2);
++i;
}printf ("= %d\n\n",t);
if (n%2 != 0) printf ("U%d = %d\n",n,b1);
else printf ("U%d = %d\n",n,b2);
}
16. Kalender
#include <stdio.h>
void main ()
{int d, m, y, tgl, b;
printf ("Masukkan Tanggal : ");
scanf ("%d",&d);
printf ("Masukkan Bulan (Angka) : "); scanf ("%d",&m);
printf ("Masukkan Tahun : "); scanf ("%d",&y);
b = m;
if (m==1) m = 0;
else if (m==2) m = 31;
else if (m==3) m = 59;
else if (m==4) m = 90;
else if (m==5) m = 120;
else if (m==6) m = 151;
else if (m==7) m = 181;
else if (m==8) m = 112;
else if (m==9) m = 143;
else if (m==10) m = 173;
else if (m==11) m = 204;
17. Matrix
#include <stdio.h>
void main ()
{int o, x1,x2, y1,y2, j, i, a[100][100], b[100][100], c[100][100],k;
printf ("PROGRAM OPERASI 2 MATRIK (+,-,*)\n\n");
printf ("Masukkan matrik pertama\n");
printf ("Masukkan banyaknya baris : "); scanf ("%d",&x1);
printf ("Masukkan banyaknya kolom : "); scanf ("%d",&y1);
printf ("\nMasukkan matrik\n");
for (i=1;i<=x1;++i)
for (j=1;j<=y1;++j)
{printf ("Matrix ke %d%d : ",i,j);
scanf ("%d", &a[i][j]);}
printf ("\nBentuk matrix A%dx%d\n",x1,y1);
for (i=1;i<=x1;++i)
{printf ("| ");
for (j=1;j<=y1;++j)
printf ("%d ", a[i][j]);
printf ("|\n");}
printf ("\nMasukkan matrik kedua\n");
printf ("Masukkan banyaknya baris : "); scanf ("%d",&x2);
printf ("Masukkan banyaknya kolom : "); scanf ("%d",&y2);
printf ("\nMasukkan matrik\n");
for (i=1;i<=x2;++i)
for (j=1;j<=y2;++j)
{printf ("Matrix ke %d%d :",i,j);
scanf ("%d", &b[i][j]);}
printf ("\nBentuk matrix B%dx%d\n",x2,y2);
for (i=1;i<=x2;++i)
{printf ("| ");
for (j=1;j<=y2;++j)
printf ("%d ", b[i][j]);
printf ("|\n");}
printf ("\nPilih operasi yang diinginkan\n");
printf ("1) Penjumlahan\n");
printf ("2) Pengurangan\n");
printf ("3) Perkalian\n");
printf ("Masukkan nomor : "); scanf ("%d",&o);
printf ("\nHasil dari\n");
for (i=1;i<=x1;++i)
{printf ("| ");
for (j=1;j<=y1;++j)
printf ("%d ", a[i][j]);
printf ("|\n");}
printf ("\n");
for (i=1;i<=x2;++i)
{printf ("| ");
for (j=1;j<=y2;++j)
printf ("%d ", b[i][j]);
printf ("|\n");}
printf ("---------------- ");
// RUMUS PENJUMLAHAN
if (o==1)
{printf ("(+)\n"); if (x1==x2&&y1==y2)
{for (i=1;i<=x1;++i)
{printf ("\n| ");
for (j=1;j<=y1;++j)
{c[i][j] = a[i][j] + b[i][j];
printf ("%d ", c[i][j]);} printf ("|");
}}
else printf ("Ordo Tidak Sesuai");
}
// RUMUS PENGURANGAN
if (o==2)
{printf ("(-)\n"); if (x1==x2&&y1==y2)
{for (i=1;i<=x1;++i)
{printf ("\n| ");
for (j=1;j<=y1;++j)
{c[i][j] = a[i][j] - b[i][j];
printf ("%d ", c[i][j]);} printf ("|");
}}
else printf ("Ordo Tidak Sesuai");
}
// RUMUS PERKALIAN
if (o==3)
{printf ("(x)\n");if (y1==x2)
{for (i=1;i<=x1;++i)
{printf ("\n| ");
for (j=1;j<=y2;++j)
{c[i][j]=0; for (k=1;k<=y1;++k) c[i][j] = c[i][j] + a[i][k] * b[k][j];
printf ("%d\t", c[i][j]);} printf ("|");
}}
else printf ("Ordo Tidak Sesuai");
}
printf ("\n\n");
}
19. Pascal
#include <stdio.h>
void main()
{int n, a [100][100], i, j,s, c;
printf ("PROGRAM PASCAL\n\n");
printf ("Masukkan N : "); scanf ("%d",&n);
a[1][1]=1;
for (c=1;c<n;++c) printf (" ");
printf ("%d\n",a[1][1]);
for (i=2;i<=n;++i)
{for (s=1;s<=(n-i);++s) printf (" ");
a[i][1]=1;
printf ("%d ", a[i][1]);
for (j=2;j<i;++j)
{a[i][j]=a[i-1][j-1]+a[i-1][j];
printf ("%d ",a[i][j]);}
a[i][j] = 1;
printf ("%d",a[i][j]);
printf ("\n"); }}
{s= a[i];
a[i]= a[b];
a[b]=s;}
else a[i]=a[i];
for (j=i;j<=n;++j)
{printf ("%d",a[j]);}
printf ("\n");
}
printf ("%d\n",a[n]);
}