Yusuke00

Determinate,if it's possible,p numbers of n binary digits,so any 2 of this numbers to match in exactly m positions.There must no be positions same digit to appear in all the p numbers. Restrictions 1 <= p <= 25 1 <= n <= 25 1 <= m <= n a number …

Here is your program #include<iostream.h> float s,t,ps,cs,ss,tt; char month[25],year[6]; int main() { cout<<"Introduce the year :";cin>>year;cout<<'\n'; cout<<"Introduce the month :";cin>>month;cout<<'\n'; cout<<"Introduce the total ammount collected :";cin>>s;cout<<'\n'; cs=s/53; ss=2*cs; tt=cs+ss; ps=s-tt; cout<<"Month\t"<<month<<'\n'; cout<<"Year\t"<<year<<'\n'; cout<<"------------------------------\n"; cout<<"Total collected\t\t"<<"$ "<<s<<'\n'; cout<<"Product Sales\t\t"<<"$ "<<ps<<'\n'; cout<<"County Sales tax\t"<<"$ "<<cs<<'\n'; cout<<"State Sales tax\t\t"<<"$ "<<ss<<'\n'; cout<<"Total Sales tax\t\t"<<"$ …

Hello. I'm working a bit different but i'll present you an valid algorithm void up() { char word; for(int i=0;i<=4;i++) { cin>>word; for(int j=0;j<strlen(word);j++) if(word[j]>='a'&&word[j]<='z') cout<<word[j]-32; else cout<<word[j]; } } Hope it helps.