Number of Divisors Hackerrank Solution in C++ & Geeksforgeeks

Two friends are playing a game. One gives an integer N to the other and asks: What is the number of divisors of N that are divisible by 3? The task is to help the other friend in finding the number of divisors. A number of divisors hackerrank solutions.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of an integer N.

Output:
For each test case in a new line print the number of divisors.

Number of Divisors Hackerrank Solution in C++

#include <iostream>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, i, count = 0;
		cin >> n;
		for (i = 1; i <= n; i++)
		{
			if (n % i == 0)
			{
				if (i % 3 == 0)
				{
					count++;
				}
			}
		}

		cout << count << endl;
	}

	return 0;

}

The Output of Number of Divisors Hackerrank Solution

Similar to the Number of Divisors

• Functions in C++ Hackerrank Solution
• Attribute Parser Hackerrank Solution in C++
• Mini-Max Sum Hackerrank Solution in C++
• Birthday Cake Candles Hackerrank Solution in C & C++
• Pointer Hackerrank Solution in C++