#include <iostream>
using namespace std;
int main()
{
// 500,100,50,20,10,5,2,1
int n;
int count1,count2,count3,count4,count5,count6,count7,count8;
count1=count2=count3=count4=count5=count6=count7=count8=0;
cin>>n;
if(n>=500){
count1=n/500;
n=n%500;
}
if(n>=100){
count2=n/100;
n=n%100;
}
if(n>=50){
count3=n/50;
n=n%50;
}
if(n>=20){
count4=n/20;
n=n%20;
}
if(n>=10){
count5=n/10;
cout<<"10: "<<count5<<endl;
n=n%10;
}
if(n>=5){
count6=n/5;
n=n%5;
}
if(n>=2){
count7=n/2;
n=n%2;
}
if(n>=1){
count8=n/1;
n=n%1;
}
cout<<"500: "<<count1<<endl;
cout<<"100: "<<count2<<endl;
cout<<"50: "<<count3<<endl;
cout<<"20: "<<count4<<endl;
cout<<"10: "<<count5<<endl;
cout<<"5: "<<count6<<endl;
cout<<"2: "<<count7<<endl;
cout<<"1: "<<count8<<endl;
return 0;
}
How to Write Merge Sort in C #include<stdio.h> /// Merge Sort void merge(int arr[],int l,int m,int r); void merge_sort(int arr[],int l,int r); void print_arr(int arr[],int size); void merge_sort(int arr[],int l,int r){ if(l<r){ int m=(l+r)/2; merge_sort(arr,l,m); merge_sort(arr,m+1,r); merge(arr,l,m,r); } } void merge(int arr[],int l,int m,int r){ int i,j,k; int n1=m-l+1; int n2=r-m; int L[n1]; int R[n2]; for(int i=0;i<n1;i++){ L[i]=arr[l+i]; } for(int j=0;j<n2;j++){ R[j]=arr[m+1+j]; } i=0; j=0; k=l; while(i<n1 &...
Comments
Post a Comment