fork download
copy 
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int isPrime(int n) {
  5. 	if (n == 1 || n == 2 || n == 3)
  6. 		return 1;
  7. 	if (n % 2 == 0 || n % 3 == 0)
  8. 		return 0;
  9. 	int sqrt_n = (int)sqrt((double)n);
  10. 	int k = -1;
  11. 	do {
  12. 		k += 6;
  13. 		if (n % k == 0 || n % (k + 2) == 0)
  14. 			break;
  15. 	} while (k < sqrt_n);
  16. 	return k > sqrt_n;
  17. }
  18.  
  19. int main() {
  20. 	int n,i;
  21. 	printf ("nhap so n: ");
  22. 	scanf ("%d",&n);
  23. 	printf ("cac thua so nto: ");
  24. 	for (i = 2; i <= n; i++) {
  25. 		if (n % i == 0 && isPrime(i)) {
  26. 			printf("\n%d", i);
  27. 			n = n / i;
  28. 		}
  29. 	}
  30. 	return 0;
  31. }
  32.  
Success #stdin #stdout 0s 9424KB
comments (?)
stdin
copy 
8
stdout
copy 
nhap so n: cac thua so nto: 
2
https://ideone.com/0LYBee
language:
C (gcc 8.3)
created:
6 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!