Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Prime
#include<stdio.h> main( ) { int n,i,count = 0; printf("Enter the value of n "); scanf("%d",&n ); for(i=1 ; i<=n ; i++ ) { if( n%i == 0 ) { count ++ ; } } if( count == 2 ) printf("Prime number"); else printf("Not prime number"); }
run
|
edit
|
history
|
help
0
a1
CONTADOR DE PALABRAS
150108_recursividadFactorial
PREGUNTA 2, GUÍA 4, MÓDULO 3 FINALIZADA
sphere
assignment5
18BCE2182 ASSESS_1 Q1-3
Fibonacci multiplos de 3 y menores que 30
Class #2, data types
Star 1,3