Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- long readNumber();
- long isPrime(long num);
- void primeFactors(long zahl);
- int main()
- {
- long x;
- long y;
- char yesno;
- do
- {
- x = readNumber();
- printf("\nX: %ld", x);
- y = isPrime(x);
- printf("\nPrimzahl: %ld\n", y);
- primeFactors(x);
- printf("\nNochmal?: ");
- scanf("%c", &yesno);
- yesno = getchar();
- }
- while (yesno == 'y');
- return 0;
- }
- long readNumber()
- {
- long a;
- printf("Geben Sie eine ganze Zahl ein: ");
- scanf("%ld", &a);
- return a;
- }
- long isPrime(long num)
- {
- int i;
- for(i = 2; i*i<=num; i++)
- if(!(num%i))
- {
- return 0; //kein Primzahl
- }
- else if(num<=0)
- {
- return -1;
- }
- else
- {
- return 1; //Primzahl
- }
- }
- void primeFactors(long zahl)
- {
- int i;
- if(isPrime(zahl))
- {
- printf("\n%ld ist Primzahl.", zahl);
- }
- else
- {
- for(i = 2; i*i<=zahl; i++)
- { printf("%ld = ", zahl);
- if(!(zahl%2))
- {
- zahl = zahl / i;
- printf("%ld* ", i);
- i--;
- }
- }
- printf("%ld ", zahl);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement