fork download
copy 
  1. // C Program to Check if a Number is Prime
  2. //  using Square Root
  3. #include <stdint.h>
  4. #include <stdbool.h>
  5. #include <stdio.h>
  6.  
  7. _Bool isPrime(uint32_t* var)
  8. {
  9.     if (*var == 0 || *var == 1) return false;
  10.  
  11.     for(int i = 2; i <= ((*var)/2); ++i)
  12.     {
  13.         printf("\ni to :%d \n", i);
  14.         if(*var % i == 0) return false;
  15.     }
  16.  
  17.     return true;
  18. }
  19.  
  20.  
  21. int main() {
  22.  
  23.     uint32_t x = 0xDEADBEEF;
  24.     uint8_t* y = (uint8_t*)&x;
  25.  
  26.     uint32_t arr[] = {7};
  27.  
  28.     printf("%x\n", *y);
  29.     if(*y != 0xDE) puts("little");
  30.     else puts("big");
  31.  
  32.     for(int j = 0; j < (sizeof(arr) / sizeof(arr[0])); j++) 
  33.     {
  34.         printf("%d ", isPrime(&arr[j]));
  35.     }
  36.  
  37.     {
  38.         uint32_t x = 0xDEADBEEF;
  39.         uint8_t* y = (uint8_t*)&x;
  40.         printf("%d ", x);
  41.     }
  42.  
  43.     return 0;
  44. }
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin
copy 
123
stdout
copy 
ef
little

i to :2 

i to :3 
1 -559038737
https://ideone.com/3kI7yq
language:
C (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!