代码搜索：Carry
找到约 8,060 项符合「Carry」的源代码
代码结果 8,060
www.eeworm.com/read/134636/13979356
htm aas.htm
80386 Programmer's Reference Manual -- Opcode AAS
up:
Chapter 17 -- 80386 Instr
www.eeworm.com/read/133019/14057793
h words.h
#ifndef CRYPTOPP_WORDS_H
#define CRYPTOPP_WORDS_H
#include "misc.h"
NAMESPACE_BEGIN(CryptoPP)
inline unsigned int CountWords(const word *X, unsigned int N)
{
while (N && X[N-1]==0)
N--
www.eeworm.com/read/133019/14060692
h words.h
#ifndef CRYPTOPP_WORDS_H
#define CRYPTOPP_WORDS_H
#include "misc.h"
NAMESPACE_BEGIN(CryptoPP)
inline unsigned int CountWords(const word *X, unsigned int N)
{
while (N && X[N-1]==0)
N--
www.eeworm.com/read/113029/15472313
cpp hugeint1.cpp
// Fig. 8.19: hugeint1.cpp
// HugeInt member-function and friend-function definitions.
#include // isdigit function prototype
#include // strlen function prototype
www.eeworm.com/read/112509/15484148
c xp.c
static char rcsid[] = "$Id: H:/drh/idioms/book/RCS/xp.doc,v 1.10 1996/06/26 23:02:01 drh Exp $";
#include
#include
#include "assert.h"
#include "xp.h"
#define T XP_T
#define
www.eeworm.com/read/112064/15494312
txt 大整数运算.txt
// Information Security Term Project
// Public-Key Cryptography (RSA Implementation)
// Student: NTUIM-11 B90705048 Huang, Shu-chun
// < RSA SYSTEM >
//
www.eeworm.com/read/111545/15510291
h words.h
#ifndef CRYPTOPP_WORDS_H
#define CRYPTOPP_WORDS_H
#include "misc.h"
NAMESPACE_BEGIN(CryptoPP)
inline unsigned int CountWords(const word *X, unsigned int N)
{
while (N && X[N-1]==0)
N--
www.eeworm.com/read/110239/15538245
cpp packetcrc.cpp
#include "../../../include/kdndis.h"
#include "ne2000.h"
/*++
Routine Description:
Runs the AUTODIN II CRC algorithm on buffer Buffer of
length Length.
Arguments:
Buffer - the
www.eeworm.com/read/110014/15543616
cpp stairs.cpp
//用数组的方法解决大数、巨数的阶乘结果越界的问题。
#include
int main()
{ int n,i; //阶乘大小
printf("请输入n的大小:");
scanf("%d",&n);
www.eeworm.com/read/109319/15559371
c pnextcalc.c
#include
#include
#define MAXN 1000
void pnext(int a[],int k)/*已知a[]中的(k-1)!,求k!*/
{
int *b,m=a[0],i,j,r,carry;
b=(int *)malloc(sizeof(int)*(m+1));
for(i=1;i