codeforces Divisors soultion in c++

 K. Divisors

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

--------------------------------------------------------------------------------------------------------------------------------

Given a number N. Print all the divisors of N in ascending order.

Input

Only one line containing a number N (1 ≤ N ≤ 10⁴).

Output

Print all positive divisors of N, one number per line.

Examples

Example	Input	Output
Ex(1)	6	1
		2
		3
		6
Ex(2)	7	1
		7
Ex(3)	4	1
		2
		4

-----------------------------------------------------------------------------------------------------------------------------

program:

-----------------------------------------------------------------------------------

#include <iostream>

#include <iomanip>

#include <cmath>

using namespace std;

int main()

{

    int n;

    cin>>n;

    for(int i=1;i<=n;i++)

    {

        for(int j=1;j<=i;j++)

        {

            if(n%i==0)

            {

                cout<<i<<endl;

            }

            break;

        }

    }

    return 0;

}

*******************************************************