Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* HOW MANY DIGITS HAS A NUMBER - CUÁNTOS DIGITOS TIENE UN NÚMERO */
- int digits(int n) {
- int d=1;
- while (n/10!=0) {
- n/=10;
- d++;
- }
- return d;}
- /* EVEN NUMBER - NÚMERO PAR */
- bool isEven(int n) {
- if(n%2==0) return true;
- else return false;}
- /* PRIME NUMBER - NÚMERO PRIMO */
- bool prime(int num){
- if(num==0 or num==1)
- return 0;
- for (int i=2;i*i<=num;++i){
- if (num%i==0)
- return false;
- }
- return true;}
- /* CONVERT DECIMAL TO BINARY */
- int dec_to_bin(int n)
- {
- int binaryNumber = 0;
- int remainder, i = 1, step = 1;
- while (n!=0)
- {
- remainder = n%2;
- n /= 2;
- binaryNumber += remainder*i;
- i *= 10;
- }
- return binaryNumber;
- }
- /* CONVERT DECIMAL TO BINARY IN Ca2 (6 bits) */
- int dec_to_ca2_6bits(int n)
- {
- int n2=n;
- if (n<0) n2=64+n;
- int binaryNumber = 0;
- int remainder, i = 1, step = 1;
- while (n2!=0)
- {
- remainder = n2%2;
- n2 /= 2;
- binaryNumber += remainder*i;
- i *= 10;
- }
- return binaryNumber;
- }
- /* CONVERT BINARY TO DECIMAL */
- int bin_to_dec(int n)
- {
- int decimalNumber = 0, i = 0, remainder;
- while (n!=0)
- {
- remainder = n%10;
- n /= 10;
- decimalNumber += remainder*pow(2,i);
- ++i;
- }
- return decimalNumber;
- }
Advertisement
Add Comment
Please, Sign In to add comment