代码搜索：Carry
找到约 8,060 项符合「Carry」的源代码
代码结果 8,060
www.eeworm.com/read/363500/9949141
txt 3000!.txt
#include
#include
#include
/* make sure BASE * NN < 2^32 */
#define BASE 1000000UL
#define NN 3000UL
static unsigned int a[2048]={0};
static char
www.eeworm.com/read/167664/9956150
c rtc.c
#include
#include "defs.h"
#include "mem.h"
#include "rtc.h"
struct rtc rtc;
static int syncrtc = 1;
void rtc_latch(byte b)
{
if ((rtc.latch ^ b) & b & 1)
{
rtc.regs[0] = rtc.s;
www.eeworm.com/read/363342/9958174
c 大加数.c
/*这是一个大正数加法问题TC中应该完全可以运行。 */
#include
#include
#define HUN 10000
typedef struct node
{
int data;
struct node *next;
}NODE;
NODE *insert(NODE *u,int num) /*声
www.eeworm.com/read/363342/9958184
c 大整数.c
#include
#include
#define HUN 10000
typedef struct node
{
int data;
struct node *next;
}NODE; //定义链表结构
NODE *insert(u,num)//在u节点之后插入一个新的NODE，其值为NUM
NODE *u;
int num;
www.eeworm.com/read/167117/9980371
cpp 大数的阶乘.cpp
//vl_app.cpp
//calculates factorrials of larger numbers using verylong class
#include"verylong.h"
void verylong::putvl() const
{
char temp[SZ];
strcpy(temp,vlstr);
cout
www.eeworm.com/read/360615/10084714
cpp dsa.cpp
// dsa.cpp - written and placed in the public domain by Wei Dai
#include "pch.h"
#ifndef CRYPTOPP_IMPORTS
#include "dsa.h"
#include "nbtheory.h"
NAMESPACE_BEGIN(CryptoPP)
size_t DSACon
www.eeworm.com/read/360543/10088637
f90 ex1107.f90
module time_util
implicit none
type :: time
integer :: hour,minute
end type time
interface operator(+) ! 让type(time)类型变量能够相加
module procedure add
end interface
contains
www.eeworm.com/read/356126/10236254
s rand.s
AREA |subr|, CODE, READONLY
EXPORT randomnumber
randomnumber
; on exit:
; a1 = low 32-bits of pseudo-random number
; a2 = high bit (if you want to know it)
LDR ip, |seedpointer|
www.eeworm.com/read/355936/10241166
v lastrow.v
module lastrow(part,cin,s,cout);
/* Last row of adders with full carry chain. */
input [6:0] part;
input [6:0] cin;
output [6:0] s;
output cout;
wire [5:0] carry;
ass
www.eeworm.com/read/281000/10274137
cpp fig06_55.cpp
/**
* Merge rhs into the priority queue.
* rhs becomes empty. rhs must be different from this.
*/
void merge( BinomialQueue & rhs )
{
if( this == &rhs ) //