`luc045.c`¶

Problem Statement

A position integer is entered through the keyboard. Write a Function to obtain the prime factors of this number. For example, prime factors of 24 are 2, 2, 2 and 3, whereas prime factors of 35 are 5 and 7

Metadata¶

Property	Detail
Author	Amit Dutta amitdutta4255@gmail.com
Date	12 Dec 2025
License	MIT License (See the LICENSE file for details)
Difficulty	Beginner (index: 3 / 10)

Concepts¶

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

Recursion
Iteration

Actions¶

Raw View on GitHub

You can print or save this file by opening Raw and using your browser.

Source Code¶

#include <stdio.h>
#include <math.h>

void findPrimeFactors(int n)
{
    int temp_n = n;

    if (temp_n == 1)
    {
        printf("Prime factors of %d are: None.\n", n);
        return;
    }

    printf("Prime factors of %d are:", n);

    while (temp_n % 2 == 0)
    {
        printf(" %d", 2);
        temp_n = temp_n / 2;
    }

    for (int i = 3; i <= (int)sqrt(temp_n); i = i + 2)
    {
        while (temp_n % i == 0)
        {
            printf(" %d", i);
            temp_n = temp_n / i;
        }
    }

    if (temp_n > 2)
    {
        printf(" %d", temp_n);
    }

    printf("\n");
}

int main()
{
    int n;
    printf("Enter a positive integer to get the prime factors: ");
    if (scanf("%d", &n) != 1)
    {
        printf("Error: Invalid input. Please enter an integer.\n");
        return 1;
    }
    if (n <= 0)
    {
        printf("Error: Please enter a POSITIVE integer.\n");
        return 1;
    }
    findPrimeFactors(n);
    return 0;
}

Explanation¶

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (luc045.c):

    #include <stdio.h>
    #include <math.h>

    void findPrimeFactors(int n)
    {
        int temp_n = n;

        if (temp_n == 1)
        {
            printf("Prime factors of %d are: None.\n", n);
            return;
        }

        printf("Prime factors of %d are:", n);

        while (temp_n % 2 == 0)
        {
            printf(" %d", 2);
            temp_n = temp_n / 2;
        }

        for (int i = 3; i <= (int)sqrt(temp_n); i = i + 2)
        {
            while (temp_n % i == 0)
            {
                printf(" %d", i);
                temp_n = temp_n / i;
            }
        }

        if (temp_n > 2)
        {
            printf(" %d", temp_n);
        }

        printf("\n");
    }

    int main()
    {
        int n;
        printf("Enter a positive integer to get the prime factors: ");
        if (scanf("%d", &n) != 1)
        {
            printf("Error: Invalid input. Please enter an integer.\n");
            return 1;
        }
        if (n <= 0)
        {
            printf("Error: Please enter a POSITIVE integer.\n");
            return 1;
        }
        findPrimeFactors(n);
        return 0;
    }

luc045.c¶