Exercise: Turn decimal to binary and find 1’s

Question

Exercise: Turn decimal to binary and find 1’s

Asked 7 years, 10 months ago

Viewed 478 times

-1

#include<stdio.h>

int main()
{
int k,repeticao;
int valor, numero;
int paridade = 0;
scanf("%d", &repeticao);

for( k = 0; k < repeticao; k++ ){
    int numero,sequencia;
    scanf("%lld", &numero);
    valor = numero/2;
    while( valor != 0 ){
        sequencia = numero%2;
        if( sequencia == 1)
        {
            paridade++;
        }
        numero = valor;
        valor = numero/2;
        if (valor == 0)
    {
        paridade++;
    } 

    }

    printf("%d\n", paridade);
    paridade = 0;
}
return 0;

}

My code is working for the two entries given in the example: 3 and 21, but in the third entry it returns 15, instead of 50. this third entry is the repetition from 1 to 9 (3 times), and when I repeat it twice(123456789123456789) my output is 1( wrong too) when I put only one repetition(123456789) my output comes out correct ( 16). Can you help me, please?

Do you just want to count bits 1 of an integer? I think the code to do this is much simpler. Just make successive divisions and count when there is rest.

– mau humor

2017/01/31 at 02:54
But I am making successive divisions and when the rest is 1 I am increasing the variable "parity". There must be a simpler way, but I can’t see, I’d also like to know why it doesn’t work for all cases the way it is there.

– Vitor Matos

2017/01/31 at 02:57
I’ll post my solution.

– mau humor

2017/01/31 at 03:03
In Python it would be very easy to do this because the variables have no set size, already in C I believe it is not possible, nor the double supports a number with so many digits, the largest number supported has 16/17 digits since it is a variable of 8 bytes. Then it would not be possible to solve this case.

– Luan Prado

2017/02/02 at 12:45
@Luanprado: Don’t say "in C is not possible", no; just do as Python does and use an arbitrary precision library, like the GMP and the MPFR. Incidentally, here is a list.

– Wtrmute

2017/02/06 at 17:16

1 answer

Browser other questions tagged c algorithm

You are not signed in. Login or sign up in order to post.

by mau humor • **1,991** points · Answer 1 · 2017-01-31T03:07:00+00:00

Here is a simplified and properly commented solution to determine the number of bits of an integer. As it is an exercise and not a practical problem. I recommend that you study the code and understand how it works.

#include<stdio.h>

int main()
{
//variavel que recebera o inteiro
int a;
scanf("%d", &a);
//contador de bits setados como 1
int p = 0;

//enquanto a for maior que zero...
while (a > 0) {
    //verifica se a é impar
    if (a%2!=0) {
        p++;
    }
    //realiza divisões sucessivas 
    a = a/2;

}    

printf("Saída:%d",p);

}

Updating:

The calculation does not work for the third case as the value extrapolates the storage capacity of int, long, long int....

Prog.cpp:7:32: Warning: integer Constant is Too large for its type unsigned long long int a = 123456789123456789123456789;