Euler Problem - Finding prime factors of numbers (C language)

Finding prime factors of numbers .

 /*The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?*/

#include <stdio.h>

int main()

{

    int prime, num;

    num = 13195;

    for (prime = 2; prime <= num / 2; prime++)

    {

        int count = 0;

        for (int i = 2; i <= prime / 2; i++)

        {

            if (prime % i == 0)

            {

                count++;

            }

        }

        if (count == 0 && num % prime == 0)

        {

            // num = num / prime;

            printf("%d\n", prime);

        }

    }

    return 0;

}