代码搜索：Carry
找到约 8,060 项符合「Carry」的源代码
代码结果 8,060
www.eeworm.com/read/371177/9563570
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/174794/9573759
eqn vga.map.eqn
-- Copyright (C) 1991-2005 Altera Corporation
-- Your use of Altera Corporation's design tools, logic functions
-- and other software and tools, and its AMPP partner logic
-- functions, and any o
www.eeworm.com/read/169651/9848070
s lbnalpha.s
/*
* DEC Alpha 64-bit math primitives. These use 64-bit words
* unless otherwise noted.
*
* Copyright (c) 1995, Colin Plumb.
* For licensing and other legal details, see the file legal.c.
*
*
www.eeworm.com/read/363596/9943707
c xp.c
static char rcsid[] = "$Id: xp.c 6 2007-01-22 00:45:22Z drhanson $";
#include
#include
#include "assert.h"
#include "xp.h"
#define T XP_T
#define BASE (1
www.eeworm.com/read/362971/9973183
c hw_xpcu_i.c
/*-----------------------------------------------------------------------------
*
* Hardware-dependent code for usb_jtag
*---------------------------------------------------------------------------
www.eeworm.com/read/362791/9980809
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/362107/10018890
txt myindex.txt
aardvark 1
aback 2
abacus 3
abalone 4
abandoned 5
abase 6
abash 7
abate 8
abatement 9
abatis 10
abattoir 11
abbacy 12
abbe 13
abbess 14
abbey 15
abbot 16
abbreviate 17
abbreviation 18
abdicate 19
abdo
www.eeworm.com/read/360365/10100630
cpp 大数计算器.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,l
www.eeworm.com/read/359577/10136208
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/357357/10211874
java bigint.java
public class BigInt
{
private int big[];
public BigInt(int a[]){big=a;}
public BigInt(String s)
{
big=new int[36];
int n=s.length()-1;
for(int i=big.length-1;i>=0;i--)
{
if(n