代码搜索：sequence
找到约 10,000 项符合「sequence」的源代码
代码结果 10,000
www.eeworm.com/read/388569/8600010
c 1005 number sequence.c
/*
1005 Number Sequence
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 1024 K
VC
*/
//此题难度在于大规模时的运算时间
//当a的值和b的值够大时会造成数据溢出
//使用数学归纳法可以总结出规律
//对大规模数据的题目得考虑是否有规律
#include
www.eeworm.com/read/388251/8622677
hpp x2sequence.hpp
#pragma ident "$Id: X2Sequence.hpp 70 2006-08-01 18:36:21Z ehagen $"
// X2Sequence.hpp - GPS X2 Sequencer
#ifndef X2SEQUENCE_HPP
#define X2SEQUENCE_HPP
//=========================================
www.eeworm.com/read/388251/8623283
hpp x1sequence.hpp
#pragma ident "$Id: X1Sequence.hpp 70 2006-08-01 18:36:21Z ehagen $"
// X1Sequence.cpp - GPS X1 Seqeuncer
#ifndef X1SEQUENCE_HPP
#define X1SEQUENCE_HPP
//==========================================
www.eeworm.com/read/385265/8810904
cpp [1005]nunber sequence.cpp
// [1005]Nunber Sequence.cpp : 定义控制台应用程序的入口点。
//
#include
using namespace std;
int mark[9][9];
int stack[51];
int stacktop;
int a, b, n;
int find()
{
int i, begin, loop;
www.eeworm.com/read/427643/8927362
doc the generation of random sequence.doc
www.eeworm.com/read/381109/9109744
h agg_vertex_sequence.h
//----------------------------------------------------------------------------
// Anti-Grain Geometry (AGG) - Version 2.5
// A high quality rendering engine for C++
// Copyright (C) 2002-2006 Maxim
www.eeworm.com/read/281344/9161563
h socket_sequence_manager.h
// SOCKET_Sequence_Manager.h: interface for the SOCKET_Sequence_Manager class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_SOCKET_SEQUENCE_MANAGER_H
www.eeworm.com/read/281344/9161642
cpp socket_sequence_manager.cpp
// SOCKET_Sequence_Manager.cpp: implementation of the SOCKET_Sequence_Manager class.
//
//////////////////////////////////////////////////////////////////////
#include "SOCKET_Sequence_Manager.h"
www.eeworm.com/read/281344/9161648
o socket_sequence_manager.o
www.eeworm.com/read/179335/9360802
cpp sequence_test_file.cpp
/*
* Copyright (C) 2005 M.J. Zaki Rensselaer Polytechnic Institute
* Written by parimi@cs.rpi.edu
* Updated by chaojv@cs.rpi.edu, alhasan@cs.rpi.edu, salems@cs.rpi.edu
* Modi