代码搜索：Carry
找到约 8,060 项符合「Carry」的源代码
代码结果 8,060
www.eeworm.com/read/270554/11032840
cpp p7_11.cpp
/*****************************
* p7_11.cpp *
* 计算火车旅途时间的友元类 *
*****************************/
#include
using namespace std;
class TrainTrip; //前向引用声明
class C
www.eeworm.com/read/270554/11033084
cpp p7_8.cpp
/*****************************
* p7_8.cpp *
* 计算火车旅途时间的组合类 *
*****************************/
#include
using namespace std;
class Clock {
private:
int H,
www.eeworm.com/read/470662/6905586
txt luxury.f90.txt
MODULE luxury
! Subtract-and-borrow random number generator proposed by
! Marsaglia and Zaman, implemented by F. James with the name
! RCARRY in 1991, and later improved by Martin Lue
www.eeworm.com/read/466944/7024091
java binomialqueue.java
package DataStructures;
// BinomialQueue class
//
// CONSTRUCTION: with a negative infinity sentinel
//
// ******************PUBLIC OPERATIONS*********************
www.eeworm.com/read/464873/7061615
asm clearview007.asm
; DTMF PWM GENERATOR v1.0
; (c) 2004 Radu Constantinescu
; constantinescuradu at yahoo.com
; Free for Noncomercial use.
;
;
; DTMF SOFTWARE DECODER v2.0
; (c) 2003-2004 Radu Constantinescu
;
www.eeworm.com/read/463988/7171112
c bigintfactoria.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 *
www.eeworm.com/read/458438/7296595
c longint .c
#include
#include
typedef struct Node{
int data ; /* 数据域 */
struct Node *prior; /* 前驱 */
struct Node *next ; /* 后继 */
}LNode, *LinkList;
v
www.eeworm.com/read/454375/7392898
eqn segment7.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/452050/7450072
java 3206585_tle.java
import java.util.*;
import java.math.*;
public class Main
{
int n, k;
int [] num;
String [] str;
String [] al;
public static void main(String [] args)
{
new Main().run();
}
www.eeworm.com/read/452050/7450073
cc 3206826_ac_172ms_4768k.cc
#include
#include
#include
int n, k;
int num[100001];
char *str[100001], al[100001][26];
void add(int a[],int b[], int c[])
{
int carry;
carry = 0;
f