1 Star 0 Fork 0

zhuoxue/代码学习的路途

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
zhuanhua10zhi2.c 811 Bytes
一键复制 编辑 原始数据 按行查看 历史
zhuoxue 提交于 2022-09-15 19:50 . 10zhuan2
#include<stdio.h>
int main(){
float x;
scanf("%f",&x);
int y = (int)x;
int d = y;
int count = 0;
int z;
int f = 0;
if(x < 0){
f = -1;
y = -y;
}
do{
z = d % 2;
count ++;
d /= 2;
}while(d != 0);
d = y;
int A[count];
count = 0;
do{
z = d % 2;
A[count] = z;
count ++;
d /= 2;
}while(d != 0);
float m = x - y;
if(f == -1){
y = -y;
m = -m;
}
int j = 0;
float e = m;
int g;
do{
e = e * 2;
j ++;
g = (int)e;
e = e - g;
}while(e != 0.0 && j < 7);
e = m;
int B[j];
j = 0;
do{
e = e * 2;
g = (int)e;
B[j] = g;
j ++;
e = e - g;
}while(e != 0.0 && j < 7);
if(f == -1 ){
printf("-");
}
for(int i = count - 1;i >= 0 ;i--){
printf("%d",A[i]);
}
printf(".");
for(int i = 0;i < j;i ++){
printf("%d",B[i]);
}
printf("\n");
return 0;
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/Joci-zhuoxue/the-way-of-code-learning.git
git@gitee.com:Joci-zhuoxue/the-way-of-code-learning.git
Joci-zhuoxue
the-way-of-code-learning
代码学习的路途
main

搜索帮助

344bd9b3 5694891 D2dac590 5694891