void prime( int num )
{
int counter = 0;
for( int i = 1; i <= num; ++i)
{
if( num % i == 0 ) counter++;
}
if(counter == 2) printf("%d ", num);
}
-
Notifications
You must be signed in to change notification settings - Fork 0
TANRIninResulu/is_prime
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Basic Prime Checker
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published