- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# C++ Program to count number of teams can be formed for coding challenge

Suppose we have two numbers a and b. In a coding challenge, there are 4 slots for participants in a team. There are a number of programmers and b number of mathematicians. We have to count how many teams can be formed, if: each team must have at lease one programmer and at least one mathematician.

## Problem Category

Various problems in programming can be solved through different techniques. To solve a problem, we have to devise an algorithm first, and to do that we have to study the particular problem in detail. A recursive approach can be used if there is a recurring appearance of the same problem over and over again; alternatively, we can use iterative structures also. Control statements such as if-else and switch cases can be used to control the flow of logic in the program. Efficient usage of variables and data structures provides an easier solution and a lightweight, low-memory-requiring program. We have to look at the existing programming techniques, such as Divide-and-conquer, Greedy Programming, Dynamic Programming, and find out if they can be used. This problem can be solved by some basic logic or a brute-force approach. Follow the following contents to understand the approach better.

So, if the input of our problem is like a = 17; b = 3, then the output will be 3.

## Steps

To solve this, we will follow these steps −

return minimum of [(a + b) / 4], a and b

## Example

Let us see the following implementation to get better understanding −

#include <bits/stdc++.h> using namespace std; int solve(int a, int b){ return min((a + b) / 4, min(a, b)); } int main(){ int a = 17; int b = 3; cout << solve(a, b) << endl; }

## Input

17, 3

## Output

3

- Related Questions & Answers
- Count Number of Teams in C++
- C++ program to find number of groups can be formed from set of programmers
- Program to count number of palindromes of size k can be formed from the given string characters in Python
- C++ Program to count minimum problems to be solved to make teams
- Program to count number of unique binary search tree can be formed with 0 to n values in Python
- Maximum number of 3-person teams formed from two groups in C++
- C++ code to check phone number can be formed from numeric string
- Find maximum number that can be formed using digits of a given number in C++
- Count of alphabets whose ASCII values can be formed with the digits of N in C++
- C++ code to count number of times stones can be given
- Program to count number of horizontal brick pattern can be made from set of bricks in Python
- C++ program to count number of problems can be solved from left or right end of list
- Program to find length of longest word that can be formed from given letters in python
- Find the largest number that can be formed with the given digits in C++
- Count of strings that can be formed from another string using each character at-most once in C++