K. Divisors Using C

🔍 Problem Solving from Codeforces using C language

This is a problem-solving post from Codeforces. Below is the problem with a short explanation and its solution.

This example is solved using C language.

🧩 Main Problem:Given a number N. Print all the divisors of N in ascending order.

🔗 Problem Link: Codeforces Problem

💡 Solution:

#include<stdio.h>
int main()
{
    int n;
    scanf("%d", &n);
    for (int i =1; i<=n; i++)
    {
        if (n%i==0) // here, input n is checking by all numbers of "i" is that divisible or not
        {
            printf("%d\n", i);
        }
    }
    return 0;
}

✅ This solution reads an integers “n” from user and then find the divisors of “n” in ascending order.

📝 Input:

6

📄 Output:

1
2
3
6

📝 Input:

7

📄 Output:

1
7

🔗 Find Similar Problems from Codeforces– Click Here

🤔 More Problem Solving – Click Here

📘 Learn C Programming – Click Here