Cluster telephone interview

本文详细介绍了如何将十进制整数和浮点数转换为二进制表示,包括负数和小数部分的处理。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

First,  convert  decimal into binary.

#include<stdio.h>
#include<string.h>
#include<math.h>
void binary(int num){   // convert decimal into binary
	int bit[33];
    memset(bit,0,sizeof(bit));
    bool flag = 0;    //  positve number
    if(num < 0){
      flag = 1;
      num = -num;
    }  
	int pos = 0;
    while(num){
       bit[pos++] = num % 2;
	   num = num / 2;
    }
    if(flag == 1){       // if it is negtive, reverse the binary and plus 1
		for(int i = 0; i <= 31; i++){
			bit[i] = 1 - bit[i];	
		}	
		for(int i = 0; i <= 31; i++){
			if(bit[i] == 0) {
			   bit[i] = 1 - bit[i];	
			   break;
			}else{
			   bit[i] = 1 - bit[i];	
			}	

		}
		
	}   

    for(int i = 31; i >= 0; i--){
	    printf("%d",bit[i]);
	}
	printf("\n");
}

int main(){
  int num;
  scanf("%d", &num);
  binary(num);
}


Second, convert double into binary.

#include<stdio.h>
#include<string.h>
#include<math.h>
void binary(int num){
	int bit[33];
    memset(bit,0,sizeof(bit));
    bool flag = 0;    //  positve number
    if(num < 0){
      flag = 1;
      num = -num;
    }  
	int pos = 0;
    while(num){
       bit[pos++] = num % 2;
	   num = num / 2;
    }
    if(flag == 1){
		for(int i = 0; i <= 31; i++){
			bit[i] = 1 - bit[i];	
		}	
		for(int i = 0; i <= 31; i++){
			if(bit[i] == 0) {
			   bit[i] = 1 - bit[i];	
			   break;
			}else{
			   bit[i] = 1 - bit[i];	
			}	

		}
		
	}   
    for(int i = 31; i >= 0; i--){
	    printf("%d",bit[i]);
	}
}
#define eps 1e-6
void fraction(double num){   
	int bit[33];
	memset(bit,0,sizeof(bit));
	int pos = 0;
	while(fabs(num) > eps && pos < 32){
		num = num * 2;
		bit[pos++] = (int)floor(num);
		num -= 1;
	}
	for(int i = 0; i < 32; i++){
		printf("%d",bit[i]);	
	}
	printf("\n");
}
void dot(){
	printf(".");
}
int main(){
  double num;
  scanf("%lf", &num);
  double fractpart;
  double intpart;
  fractpart = modf(num, &intpart);  // divide into two parts, deciaml part and fraction part.
  binary((int)intpart);
  dot();
  fraction(fabs(fractpart));
}


Thrid, easy hash function.

#include<iostream>
#include<string>
using namespace std;
int hash(string s){     // add all the ASCII code of each character of the string and calclate the index.
	int sum = 0, table_size = 200;
	for(int i = 0 ;i < s.length();i++){
		sum += (int)s[i];	
	}
	return sum % table_size;
}


int main(){
	cout <<"please input a string." << endl;
	string s;
	cin >> s;
    cout << "index is " << hash(s) << endl;
}






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值