fork download
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int main(){
  5. int num, sr, num2;
  6. int isPrime = 1;
  7. printf("Prime\t | Binary\n");
  8. printf("============================\n");
  9. for(num=2; num<=100; num++){
  10. sr = (int) sqrt(num);
  11. for(num2=2; num2 <= sr; num2++){
  12. //num2 <== sr to stop the innner loop
  13. if(num%num2 == 0){
  14. isPrime = 0;
  15. break;
  16. }
  17. }
  18. if(isPrime){
  19. int quotient = num;
  20. int binaryNumber[100],i=1,j;
  21.  
  22. printf("%d\t |", num);
  23.  
  24. while(quotient!=0){
  25. binaryNumber[i++]= quotient % 2;
  26. quotient = quotient / 2;
  27. }
  28.  
  29. for(j = i -1 ;j> 0;j--)
  30. printf("%d",binaryNumber[j]);
  31.  
  32. printf("\n");
  33. isPrime = 1;
  34. }else{
  35. isPrime = 1;
  36. }
  37. }
  38. return 0;
  39. }
  40.  
  41.  
Success #stdin #stdout 0s 1788KB
stdin
Standard input is empty
stdout
Prime	    | Binary
============================
2	    |10
3	    |11
5	    |101
7	    |111
11	    |1011
13	    |1101
17	    |10001
19	    |10011
23	    |10111
29	    |11101
31	    |11111
37	    |100101
41	    |101001
43	    |101011
47	    |101111
53	    |110101
59	    |111011
61	    |111101
67	    |1000011
71	    |1000111
73	    |1001001
79	    |1001111
83	    |1010011
89	    |1011001
97	    |1100001