Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<conio.h>
- #define size 99
- void sort(int[], int);
- int jumlah = 0;
- int main(){
- int x[size],i,n,k,uang,hasil[size];
- printf("\nBanyak Koin : ");
- scanf("%d", &n);
- printf("\n\nMasukkan Jenis Koin : \n");
- for (i=1;i<=n;i++){
- scanf("%d", &x[i]);
- }
- sort(x,n);
- printf("\nKoin yang tersedia : \n");
- for (i=1;i<=n;i++){
- printf("%d", x[i]);
- printf("\n");
- }
- printf("\n");
- printf("\nMasukkan Nilai yang dipecah : ");
- scanf("%d", &uang);
- printf("\n");
- for (i=1;i<=n;i++){
- hasil[i] = uang/x[i];
- uang = uang%x[i];
- k = uang%x[i];
- }
- for (i=1;i<=n;i++){
- printf("Keping %d", x[i]);
- printf("-an sebanyak : %d", hasil[i]);
- jumlah = jumlah + hasil[i];
- printf("\n \n");
- }
- printf("sisanya adalah %d", k);
- printf("\n \n");
- printf("jumlah koin minimum adalah %d", jumlah);
- getch();
- return 0;
- }
- void sort (int a[], int siz){
- int pass, hold, j;
- for (pass=1;pass<=siz-1;pass++){
- for (j=0;j<=siz-2;j++){
- if (a[j+1] < a[j+2]){
- hold = a[j+1];
- a[j+1] = a[j+2];
- a[j+2] = hold;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment