代码搜索：杨辉三角
找到约 115 项符合「杨辉三角」的源代码
代码结果 115
www.eeworm.com/read/193041/8256749
cpp 队列打印杨辉三角.cpp
#include
#include
#include
using namespace std;
//******************************
class Queue {
int front, rear;
int *elements;
int maxsize;
public:
Qu
www.eeworm.com/read/113568/15453182
dsp 队列解决杨辉三角.dsp
# Microsoft Developer Studio Project File - Name="队列解决杨辉三角" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86)
www.eeworm.com/read/113568/15453183
opt 队列解决杨辉三角.opt
www.eeworm.com/read/113568/15453184
ncb 队列解决杨辉三角.ncb
www.eeworm.com/read/113568/15453185
dsw 队列解决杨辉三角.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/113568/15453186
plg 队列解决杨辉三角.plg
Build Log
--------------------Configuration: 队列解决杨辉三角 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\zhan
www.eeworm.com/read/113568/15453189
cpp 队列解决杨辉三角.cpp
// 队列解决杨辉三角.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "stdio.h"
#include "stdlib.h"
#define MAXSIZE 100
typedef struct {
int data[MAXSI
www.eeworm.com/read/289579/8542342
c 杨辉三角形.c
#include
int c(x,y);
main()
{
int i,j,n=13;
printf("N=");
while(n>12)
scanf("%d",&n);
for(i=0;i
www.eeworm.com/read/376627/9311901
c 杨辉三角形.c
#include
int c(x,y);
main()
{
int i,j,n=13;
printf("N=");
while(n>12)
scanf("%d",&n);
for(i=0;i
www.eeworm.com/read/363342/9958334
c 杨辉三角形.c
#include
int c(x,y);
main()
{
int i,j,n=13;
printf("N=");
while(n>12)
scanf("%d",&n);
for(i=0;i