代码搜索：Carry
找到约 8,060 项符合「Carry」的源代码
代码结果 8,060
www.eeworm.com/read/360365/10100614
cpp pollard p-1.cpp
#include
#include
using namespace std;
int Max(int x, int y)//求最大值
{
if(x>y)
return x;
else return y;}
int compare(string A,string B)///比较字符串形式的数的大小
{
int lenA
www.eeworm.com/read/349103/10851670
scr cla.scr
/************************************************************************/
/* Carry-lookahead Adder */
/************************************************************************/
/* This examples
www.eeworm.com/read/348596/10883366
txt 2562.txt
main()
{char a[110],b[110];
int i,at,bt,temp;
while(1)
{scanf("%s",a);scanf("%s",b);
if(a[0]=='0'&&b[0]=='0')exit(0);
at=0;bt=0;i=0;temp=0;
while(a[at+1]!=0)at++;
while(b[bt+1]!=0)bt++
www.eeworm.com/read/452050/7451485
c 1808204_ac_0ms_44k.c
# include
main()
{
char a[10],b[10],c[10],d[10];int i,carry;
while(1)
{
scanf("%s %s",&a,&b);getchar();
if(a[0]=='0'&&b[0]=='0')
break;
if(strlen(a)==strlen(b)) {st
www.eeworm.com/read/452050/7451486
c 1808156_re.c
# include
# include
void main()
{
char a[20],b[20],c[20],d[20];int i,carry;
while(1)
{
scanf("%s %s",&a,&b);getchar();
if(a[0]=='0'&&b[0]=='0')
break;
www.eeworm.com/read/452050/7451487
c 1808145_re.c
# include
main()
{
char a[10],b[10],c[10],d[10];int i,carry;
while(1)
{
scanf("%s %s",&a,&b);getchar();
if(a[0]=='0'&&b[0]=='0')
break;
if(strlen(a)==strlen(b)) {st
www.eeworm.com/read/196815/8058286
v bit4_2comp.v
//////////////////////////////////////////////////////////
// module describe
// name: 4-2 compressor(1 bit)
// function: reduce the delay time for the add function
// writer: zy
// data: 2006/
www.eeworm.com/read/144402/12796616
c log2classic.c
/*
** Pascal Sebah : July 1999
**
** Subject:
**
** A very easy program to compute Log(2) with many digits.
** No optimisations, no tricks, just a basic program to learn how
** to com
www.eeworm.com/read/144401/12796625
c piclassic.c
/*
** Pascal Sebah : September 1999
**
** Subject:
**
** A very easy program to compute Pi with many digits.
** No optimisations, no tricks, just a basic program to learn how
** to co
www.eeworm.com/read/325933/13173773
cpp big.cpp
#include
#include
#include
#define max 2002
using namespace std;
typedef struct
{
short add[max+1];//最大运算位数
int n; //记录是几位数
}num;
//串的比较大小
s