fork(2) download 
  1. #include <stdio.h>
  2.  
  3.  int main() {
  4.     int dec_num, bin[32];
  5.     scanf("%d", &dec_num);
  6. 	while (dec_num) {
  7.         int bin_index = 0, sum = 1;
  8.  
  9.         for(int i=0;i<32;i++) bin[i]=2;
  10.  
  11.         while (dec_num != 1) {
  12.             bin[bin_index] = dec_num % 2;
  13.             dec_num = dec_num / 2;
  14.             bin_index++;
  15.         }
  16.  
  17.         printf("The parity of 1");
  18.  
  19.         for (int out = 31; out >= 0; out--) {
  20.             if (bin[out] != 2) {
  21.                 printf("%d", bin[out]);
  22.                 if (bin[out] == 1) {
  23.                     sum++;
  24.                 }
  25.             }
  26.         }
  27.         printf(" is %d (mod 2).\n", sum);
  28.         scanf("%d", &dec_num);
  29.     }
  30. }
Success #stdin #stdout 0.01s 5412KB
comments ()
stdin 
2
1023
4
0
stdout 
The parity of 10 is 1 (mod 2).
The parity of 1111111111 is 10 (mod 2).
The parity of 100 is 1 (mod 2).
https://ideone.com/rxwhT5
pairty
language:
C (gcc 8.3)
created:
2 years ago
visibility:
secret

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!