Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /******************************************************************************
- Welcome to GDB Online.
- GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
- Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
- Code, Compile, Run and Debug online from anywhere in world.
- *******************************************************************************/
- #include <stdio.h>
- int is_prime(int n);
- int twin_primes(int number[6]);
- int main()
- {
- int arr[] = {3, 5, 7, 5, 11, 13};
- int arr2[] = {3, 5, 7, 5, 11, 43};
- printf("%d\n", is_prime(5));
- printf("%d\n", is_prime(6));
- printf("%d\n", twin_primes(arr));
- printf("%d\n", twin_primes(arr2));
- }
- int is_prime(int n)
- {
- for(int i = 2;i < n;i++)
- {
- if(n % i == 0)
- {
- return 0;
- }
- }
- return 1;
- }
- int twin_primes(int number[6])
- {
- for(int i = 0;i < 6;i++)
- {
- if(is_prime(number[i]) && is_prime(number[i + 1]) && (number[i] - number[i + 1] == -2 || number[i] - number[i + 1] == 2))
- { }else{
- return 0;
- }
- i += 1;
- }
- return 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement