#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;
}
Divide and conquer min max #include<stdio.h> #include<stdio.h> int max, min; int a[100]; void maxmin(int i, int j) { int max1, min1, mid; if(i==j) { max = min = a[i]; } else { if(i == j-1) { if(a[i] >a[j]) { max = a[i]; min = a[j]; } else { max = a[j]; min = a[i]; } } else { mid = (i+j)/2; maxmin(i, mid); max1 = max; min1 = min; maxmin(mid+1, j); if(max <max1) max = max1; if(min > min1) min = min1; } } } int main () { int i, num; printf ("\nEnter the total number of numbers : "); scanf ("%d",&num); printf ("Enter the numbers : \n"); for (i=1;i<=num;i++) ...
Comments
Post a Comment