tesajadeh

LA PAA 1

Oct 11th, 2016
143
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.07 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<conio.h>
  3. #define size 99
  4. void sort(int[], int);
  5. int jumlah = 0;
  6.  
  7. int main(){
  8. int x[size],i,n,k,uang,hasil[size];
  9. printf("\nBanyak Koin : ");
  10. scanf("%d", &n);
  11. printf("\n\nMasukkan Jenis Koin : \n");
  12. for (i=1;i<=n;i++){
  13. scanf("%d", &x[i]);
  14. }
  15. sort(x,n);
  16. printf("\nKoin yang tersedia : \n");
  17. for (i=1;i<=n;i++){
  18. printf("%d", x[i]);
  19. printf("\n");
  20. }
  21. printf("\n");
  22. printf("\nMasukkan Nilai yang dipecah : ");
  23. scanf("%d", &uang);
  24. printf("\n");
  25. for (i=1;i<=n;i++){
  26. hasil[i] = uang/x[i];
  27. uang = uang%x[i];
  28. k = uang%x[i];
  29. }
  30. for (i=1;i<=n;i++){
  31. printf("Keping %d", x[i]);
  32. printf("-an sebanyak : %d", hasil[i]);
  33. jumlah = jumlah + hasil[i];
  34. printf("\n \n");
  35. }
  36. printf("sisanya adalah %d", k);
  37. printf("\n \n");
  38. printf("jumlah koin minimum adalah %d", jumlah);
  39. getch();
  40. return 0;
  41. }
  42.  
  43. void sort (int a[], int siz){
  44. int pass, hold, j;
  45. for (pass=1;pass<=siz-1;pass++){
  46. for (j=0;j<=siz-2;j++){
  47. if (a[j+1] < a[j+2]){
  48. hold = a[j+1];
  49. a[j+1] = a[j+2];
  50. a[j+2] = hold;
  51. }
  52. }
  53. }
  54. }
Advertisement
Add Comment
Please, Sign In to add comment