2.1-4
来源:互联网 发布:js获取file真实路径 编辑:程序博客网 时间:2024/05/16 10:42
#pragma warning(disable:4996)#include <stdio.h>#include <stdlib.h>int main(){int i, j;int A[6] = { 1, 0, 1, 1, 0, 1 };int B[6] = { 1, 1, 1, 1, 1, 0 };int C[7] = { 0 }; //保证在次高位没有进位时C[0]为0for (i = 5; i >= 0; i--){if (A[i] + B[i] < 2){C[i + 1] = A[i] + B[i];}else if (A[i] + B[i] >= 2){if (i > 0){A[i - 1]++;C[i + 1] = A[i] + B[i] - 2;}else{C[i + 1] = A[i] + B[i] - 2;C[i] = 1;}}}for (j = 0; j < 7; j++){printf("%d ", C[j]);}printf("\n");system("pause");return 0;}
0 0
- 2.1-4
- 2.1-4
- 2.1-4
- 2.1.4
- WinMount 2.1.4 简体中文正式版
- Exercise 2.1-4
- 2.1.4 基本概念
- usaco 2.1.4
- 2.1.4 实例讲解
- SICP Section 2.1.4
- USCAO 2.1.4
- 2.1.4---Healthy Holsteins
- 算法导论 2.1-4
- USACO 2.1.4
- 算法导论2.1-4
- 2.1-4习题总结
- sphinx-release 2.1.4
- 2.1.10 4Sum
- LeetCode:Flatten Binary Tree to Linked List
- spring装配Bean
- (笔记)在地图上添加大头针
- rabbitmq安装
- Mybatis-Mapper代理
- 2.1-4
- shell编程指令演示
- 一个女人跳楼的全过程
- android studio jni.h 红色报错
- 访问表单控件
- jdbc工具类介绍
- 349. Intersection of Two Arrays
- unity利用c#读写xml
- [leetcode] 17. Letter Combinations of a Phone Number ,python实现【medium】