// C++ implementation of Naive 
// method to print all divisors
#include <iostream>
using namespace std;
  
// Function to print the divisors
void printDivisors(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}
  
// Driver code
int main()
{
    cout <<"The divisors of 100 are: ";
    printDivisors(100);
    return 0;
}
  
// This code is contributed by shivanisinghss2110```  

The divisors of 100 are: 
1 2 4 5 10 20 25 50 100

// A Better (than Naive) Solution 
// to find all divisors
#include <iostream>
#include <math.h>
using namespace std;
  
// Function to print the divisors
void printDivisors(int n)
{
    // Note that this loop runs 
    // till square root
    for (int i = 1; i <= sqrt(n); i++)
    {
        if (n % i == 0)
        {
            // If divisors are equal, 
            // print only one
            if (n / i == i)
                cout <<" "<< i;
  
            // Otherwise print both
            else 
                cout << " "<< i << " " << n / i;
        }
    }
}
  
// Driver code
int main()
{
    cout <<"The divisors of 100 are: ";
    printDivisors(100);
    return 0;
}
  
// This code is contributed by shivanisinghss2110```  

The divisors of 100 are: 
1 100 2 50 4 25 5 20 10