Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Prime check
//gcc 5.4.0 #include <stdio.h> int main(void) { int n, count=0; printf("Enter a number n \n"); scanf("%d",&n); for(int i=1; i<=n; i++) { if(n%i==0) count++; } if(count==2) printf("The number %d is prime", n); else printf("The number %d is not prime", n); return 0; }
run
|
edit
|
history
|
help
0
150108_recursividadFactorial
1/30
ex1
main.c
X=1
Fibonacci multiplos de 3 y menores que 30
summing long int
Assignment 4 v3
Lab 11 v.05
Hello world