Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Primes
using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { #include <stdio.h> int main() { int n, i, flag = 0; printf("Enter a positive integer: "); scanf("%d", &n); for (i = 2; i <= n / 2; ++i) { // condition for non-prime if (n % i == 0) { flag = 1; break; } } if (n == 1) { printf("1 is neither prime nor composite."); } else { if (flag == 0) printf("%d is a prime number.", n); else printf("%d is not a prime number.", n); } return 0; }
run
|
edit
|
history
|
help
0
asxasxasd
Chest Interaction Unity
scanf1
6.3 Parallelism: job-pattern
<script>alert(document.cookie)</script>
test
Set Get
A
1
Test equality