(Occurrence of max numbers) Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume that the input ends with number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4

PHOTO

Wed Oct 28 2020 20:25:40 GMT+0000 (UTC)

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;

int main()
{
    int counter = 1;
    int number = 0;
    int largest = 0;
    int n;
    cin >> n;
    int occurrence = 0;

    cout << "Please enter up to 10 numbers and I will print the largest one on the screen.\n\n";

    while (counter <= n)
    {
        cout << "Number: ";
        cin >> number;
        
        if (largest < number)
        {
            largest = number;
            occurrence = 1;
            
        }
        else if (number == largest)
        {
            occurrence++;
        }
        if (number == 0)
        {
            break;

        }
            counter++;
    }

    cout << "the largest number is "<<largest << endl;
    cout << "  the occurrence count " << largest << " is " << occurrence << " time";


	

}

COPY

http://cpp.sh/

Save snippets that work from anywhere online with our extensions

Comments

Anonymous - Sat Mar 13 2021 00:47:59 GMT+0000 (UTC)

I need to write the same program using loop, but user needs to enter only five positive integers. For example: user enters 3 5 4 1 5. The program finds “5” is largest and its occurrences are 2.. Can anyone help?

c++ loops

@mahmoud hussein

(Occurrence of max numbers) Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume that the input ends with number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4 (Fibonacci Series) The Fibonacci series is a series that begins with 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. For example, the third Fibonacci number is 1 which is sum of 0 and 1. The next is 2, which is a sum of 1 + 1. Write a program that displays the first ten numbers in a Fibonacci series **5.21 (Display numbers in a pyramid pattern) Write a nested for loop that prints the following output: (Compute the greatest common divisor) Another solution for Listing 5.10 to find the greatest common divisor (GCD) of two integers n1 and n2 is as follows: First find d to be the minimum of n1 and n2, then check whether d, d-1, d-2, . . . , 2, or 1 is a divisor for both n1 and n2 in this order. The first such common divisor is the greatest common divisor for n1 and n2. Write a program that prompts the user to enter two positive integers and displays the GCD. sorting

#c++

nqueen

#include<iostream>
using namespace std;
bool issafe(int** arr,int x,int y,int n){
    for(int row=0;row<=x;row++){
        if(arr[x][y]==1){
            return false;
        }
    }
    int row=x;
    int col=y;
    while(row>=0 && col>=0){
        if(arr[row][col]==1){
            return false;
        }
        row--;
        col--;
    }
     row=x;
     col=y;
    while(row>=0 && col<n){
        if(arr[row][col]==1){
            return false;
        }
        row--;
        col++;
    }
    return true ;
}
bool nqueen(int** arr,int x,int n){
    if(x>=n){
        return true;
    }
    for(int col=0;col<=n;col++){
        if(issafe(arr,x,col,n)){
            arr[x][col]==1;
            if(nqueen(arr,x+1,n)){
                return true;
            }
            arr[x][col]=0;  //backtracking
            
        }
    }
    return false;
}
int main(){
    int n;
    cin>>n;
    int** arr=new int*[n];
    for(int i=0;i<n;i++){
        arr[i]=new int[n];
        for(int j=0;j<n;j++){
            arr[i][j]=0;

        }
    }
    if(nqueen(arr,0,n)){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                cout<<arr[i][j]<<"";
            }cout<<endl;
        }
    }


    return 0;
}

#c++

**8.11 (Game: nine heads and tails)

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;




void decToBinary(int n)
{
    // array to store binary number 
    int binaryNum[3][3];
    
    //converting to binary 
    for (int i = 0; i < 3; i++) 
    {
        for (int j = 0; j < 3; j++)
        {
            binaryNum[i][j] = n % 2;
            n = n / 2;

        }
     }       

    // printing binary> array in reverse order 
    for (int i = 3-1; i >= 0; i--){
        for (int j = 3 - 1; j >= 0; j--)
        {
            if (binaryNum[i][j] == 0)
                cout << "H" << " ";
            else
                cout << "T" << " ";
        }
        cout << endl;
    }
    
 }

int main()
{
    int n;
    cout << "Enter a decimal number between 1 and 512 ";
    cin >> n;

    decToBinary(n);
    return 0;
}

#c++

check ham`

#include<iostream>
using namespace std;

int sum(int arr[], int a);

int main() {
    int arr[1000], n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        cout << sum(arr, n);
    }
}
int sum(int arr[], int a) {
    int i;
    sum = 0;
    for (i=0; i<n; ++i) {
        sum += arr[i];
    }
    return sum;
}#include<iostream>
using namespace std;

int sum(int arr[], int a);

int main() {
    int arr[1000], n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        cout << sum(arr, n);
    }
}
int sum(int arr[], int a) {
    int i;
    sum = 0;
    for (i=0; i<n; ++i) {
        sum += arr[i];
    }
    return sum;
}

#c++

(Display calendars) Write a program that prompts the user to enter the year and first day of the year and displays the calendar table for the year on the console. For example, if the user entered the year 2013 and 2 for Tuesday, January 1, 2013, your program should display the calendar for each month in the year, as follows:

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;

int main()
{
	cout << "enter the year ";
	int year;
	cin >> year;
	
	cout << "Enter The First Day Of The year ";
	int FirstDay;
	cin >> FirstDay;
	int count = 1;
	int days = 1;
	for (int month = 1; month <= 12; month++)
	{
		cout << "             ";
		switch (month)
		{
		case 1: cout << "January " << year<<endl;
			break;
		case 2: cout << "February " << year << endl;
			break;
		case 3: cout << "March  " << year << endl;
			break;
		case 4: cout << "April  " << year << endl;
			break;
		case 5: cout << "May " << year << endl;
			break;
		case 6: cout << "June  " << year << endl;
			break;
		case 7: cout << "July  " << year << endl;
			break;
		case 8: cout << "August " << year << endl;
			break;
		case 9: cout << "September " << year << endl;
			break;
		case 10: cout << "October " << year << endl;
			break;
		case 11: cout << "November " << year << endl;
			break;
		case 12: cout << "December " << year << endl;
			break;
		}
		cout << " --------------------------------------------------------- "<<endl;
		cout << "  Sun Mon Tue Wed Thu Fri Sat"<<endl;
		for (int i = 0; i < FirstDay; i++)
		{
			cout << "    ";
		}
		for (int i = 1; i < 31; i++)
		{
			if (i < 10) {
				cout<<"   " <<i;
			}
			else {
				cout<<"  " << i;
			}
			if ((i + FirstDay) % 7 == 0) {
				cout << endl;
			}
		}
		cout << endl;

		FirstDay = (FirstDay + 31) % 7;
		
	}
	
	
}

#c++

(Display the Sundays in a month) Write a program that prompts the user to enter the month and first day of the month, and displays all the Sundays in that month. For example, if the user entered the month 7 for July, and the first day 4 for Wednesday, your program should display the following output: The first day of this month is Wednesday! ... Next Sunday of this month is on 26

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;

int main()
{
	cout << "enter the month ";
	int month;
	cin >> month;
	cout << "Enter The First Day Of The Month ";
	int firstDay;
	cin >> firstDay;
	int nextSunday = 1;
	
		switch (firstDay)
		{
			
		case 1: nextSunday += 7;
			cout << "The first day of this month is sunday "<<endl;
			while (nextSunday < 30)
			{
					cout << "Next Sunday of this month is on " << nextSunday << endl;
									nextSunday += 7 ;
			}
			break;

		case 2: nextSunday += 6;
			cout << "The first day of this month is monday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 3: nextSunday += 5;
			cout << "The first day of this month is tuesday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 4: nextSunday += 4;
			cout << "The first day of this month is wednesday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 5: nextSunday += 3;
			cout << "The first dayof this month is thursday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 6: nextSunday += 2;
			cout << "The first day of this month is friday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 7: nextSunday += 1;
			cout << "The first day of this month is saturday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;

		}
		
}

#c++ #algorithms #interviewquestions #arrays

Kadane’s Algorithm

int maxSubArraySum(int a[], int size) 
{ 
int max_so_far = 0, max_ending_here = 0; 
for (int i = 0; i < size; i++) 
{ 
	max_ending_here = max_ending_here + a[i]; 
	if (max_ending_here < 0) 
		max_ending_here = 0; 

	/* Do not compare for all elements. Compare only 
		when max_ending_here > 0 */
	else if (max_so_far < max_ending_here) 
		max_so_far = max_ending_here; 
} 
return max_so_far; 
}

#c++

selection_sort

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin>>n;
    
    int arr[n];
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    
    for(int i=0;i<n-1;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(arr[j]<arr[i]){
                int temp=arr[j];
                arr[j]=arr[i];
                arr[i]=temp;
            }
        }
    }
    
    for(int i=0;i<n;i++)
    {
        cout<<arr[i]<<" ";
    }cout<<endl;
    
    return 0;
    
}

#c++

Convert char to int in C and C++ - Stack Overflow

char a = 'a';
int ia = (int)a; 
/* note that the int cast is not necessary -- int ia = a would suffice */

#c++

Insertion Sort

void insertionsort(int A[], int size){
  int i, j;
  for(i=1; i<size; i++){
    key= A[i];
    j=i-1;
    
    while(j>=0 && A[j]> key){
      A[j+1]= A[j];
      j=j-1;
    }
    A[j+1]= key;
  }
}

#c++

Binary Search

#include<bits/stdc++.c>

int binarysearch(int arr[], int l, int r, int x){
  if(r>=l){
     int mid= l+(r-1)/2;
     if(arr[mid]== x){
       return mid;
     }
    if(x<arr[mid]){
      return binarysearch(arr, l ,mid-1, x);
    }
    if(x>arr[mid]){
      return binarysearch(arr, mid+1, r, x);
    }
  }
  return -1;
  
}

int main(){
  int arr[]= {10, 20, 30, 40, 50};
  int x= 30;
  int n= sizeof(arr)/ sizeof(arr[0]);
  int result= binarysearch(arr, 0, 1, n-1m, x);
  (result==-1)? cout<<"Element is not present" : cout<<"Element is present at"<<result;
  return 0;
  
}

#c++

Even Or Odd CodeWars

#include <string>
using namespace std; 
std::string even_or_odd(int number) 
{
  string EvenOrOdd;
  if (number %2 == 0){
  EvenOrOdd = "Even"; 
  }else{
  EvenOrOdd = "Odd"; 
  }
  return EvenOrOdd;
}

#c++

Basic Data Types HackerRank

#include <iostream>
#include <cstdio>
using namespace std;

int main() {
    int d; 
    long ld; 
    char ch; 
    float f; 
    double lf; 
    
    
    scanf("%d %ld %c %f %lf",&d,&ld,&ch,&f,&lf);
    printf("%d\n%ld\n%c\n%f\n%lf",d,ld,ch,f,lf);
    return 0;
}

#c++

Pointers

#include <stdio.h>

void update(int *a,int *b) {
     
    
    int ans = *a; 
    *a = *a + *b;
    *b = ans - *b; 
    if (*b <0){
        *b = -(*b);
    }
    
    //printf("*pb %d\n", *pb);
    //printf("*a %d\n",*a);
    //printf("*b %d\n",*b);
    //printf("*pa %d\n",*pa);
    //printf("\n"); 
    //    
}

int main() {
    int a, b;
    int *pa = &a, *pb = &b;
    
    scanf("%d %d", &a, &b);
    update(pa, pb);
    printf("%d\n%d", a, b);

    return 0;
}

#c++

Class Math Bugs??

// Online C++ compiler to run C++ program online
#include <iostream>
//#include <cstdio>
//#include <vector>
//#include <iostream>
//#include <algorithm>
#include <list> // for arra list list<foodIdeams>....
using namespace std;

class Maths {
public:
    int oneQty; 
    int twoQty;
    int sumTotal; 
    
    int width;
    int height; 
    int length;
    int areaTotal; 
    Maths(int Width, int Height, int Length, int OneQty, int TwoQty){
        width = Width; 
        height = Height; 
        length = Length;
        oneQty = OneQty; 
        twoQty = TwoQty; 
    }
    int MakeArea(int width, int height, int length) {
        areaTotal = width * height * length;
        return areaTotal;
    }
    void printArea() {
        cout << "Wigth: " << width << endl; 
        cout << "Height: " << height << endl; 
        cout << "length: " << length << endl; 
        cout << "" << endl;
        cout << "Total: "<< areaTotal << endl;
    }
    int subtraction(int oneQty, int twoQty) {
        sumTotal = oneQty - twoQty;
        return sumTotal; 
    }
    void printSum() {
        cout << "First Qty: " << oneQty << endl; 
        cout << "Second Qty: " << twoQty << endl; 
        cout << "" << endl; 
        cout << "Subtarction Totle: " << sumTotal << endl; 
    }

};

int main() {
    Maths One(4, 10, 13,3,4);
    One.MakeArea(3,1,1);
    One.subtraction(10, 7);
    One.printArea(); 
    
    One.printSum(); 
    
    return 0;
}

#c++

not using namespace exsample

#include <iostream>
//#include <cstdio>
//#include <vector>
//#include <iostream>
//#include <algorithm>
#include <list> // for arra list list<foodIdeams>....
//using namespace std;
//std:: not using namespace exsample 
namespace Happy {
    int num = 32; 
    std::string name = "Jarod";
    
}
namespace Sad {
    int num = 42; 
    std::string name = "Sid"; 
}
int main() {
    std::cout << Happy::name << std::endl;
    std::cout << Happy::num << std::endl; 
    std::cout << "" << std::endl; 
    std::cout << Sad::name << std::endl; 
    std::cout << Sad::num << std::endl;
    return 0;
}

(Occurrence of max numbers) Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume that the input ends with number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4

Save snippets that work from anywhere online with our extensions

Comments

More like this

c++ loops

Browse more snippets >>

(Occurrence of max numbers) Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume that the input ends with number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4

Save snippets that work from anywhere online with our extensions

Comments

More like this

c++ loops

Browse more snippets >>

Embed code snippet