Find Prime Factor of number

/*Program to find out prime factors of a given number.*/

#include<stdio.h>

#include<conio.h>

void main()

{

int number;

printf("Enter a number ");

scanf("%d",&number);

printf("\nThe prime factors of %d are:",number);

for(int num=2;num<32767;num++)

{

int i=2;

while(i<=num-1)

{

if(num%i==0)

{

break;

}

i++;

}

if(i==num)

{

if(number%num==0)

{

number=number/num;

printf("\t%d",num);

num=1;

}

else

{

continue;

}

}

}

getch();

clrscr();

}

Find Generic root of number

#include <stdio.h>

int main()

{        

int num,i;

printf("Enter any number: ");

scanf("%d",&num);

printf("Generic root: %d", (i = num % 9) ? i : 9);

return 0;

}

Add Two numbers without using operator

#include<stdio.h>

int main(){

  

    int a,b;

    int sum;

    printf("Enter any two integers: ");

    scanf("%d%d",&a,&b);

    //sum = a - (-b);

    sum = a - ~b -1;

    printf("Sum of two integers: %d",sum);

    return 0;

}