代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/461485/7226808
txt 随机+回溯求八皇后.txt
#include
#include
#include
using namespace std;
const int N = 100;
int x[N];
int ok[N];
int result[14] = {0,1,0,0,2,10,4,40,92,352,724,2680,14200,73712};
double Rand
www.eeworm.com/read/461469/7226993
cpp tx1050.cpp
#include
#include
#include
int S[201];
int i,m,j,testcase,a,b,t;
int M;
int main()
{
while(scanf("%d",&testcase)!=EOF)
{
while(testcase--)
{
scanf
www.eeworm.com/read/461196/7232082
cpp soj2993nim变形.cpp
#include
int main(void)
{
int num[1000];
int n;
while(scanf("%d",&n)&&n)
{
int i;
for(i=0;i
www.eeworm.com/read/461196/7232086
cpp soj2704快速分解组合数.cpp
#include
#include
const int MAX = 1000001;
int a[MAX];
int next(int i)
{
int j=i+1;
while(a[j]==1&&j
www.eeworm.com/read/461196/7232087
cpp soj2427floyed算法.cpp
#include
#define NIL 99999999
int main(void)
{
int n,m;
while(scanf("%d%d",&n,&m)==2&&(n||m))
{
int num[101][101]={0};
int i;
for(i=1;i
www.eeworm.com/read/461196/7232092
cpp soj1748快速求解两数的公因数的个数.cpp
#include
#include
const int MAX = 1000001;
int a[MAX];
int next(int i)
{
int j=i+1;
while(a[j]==1&&j
www.eeworm.com/read/461087/7234554
c main.c
#define uchar unsigned char //定义一下方便使用
#define uint unsigned int
#define ulong unsigned long
#include //包括一个52标准内核的头文件
sbit P10 = P1^0; //头文件中没有定义的IO就要自己来定义了
sbit P11 = P1^1;
sb
www.eeworm.com/read/461087/7234765
c main.c
#define uchar unsigned char //定义一下方便使用
#define uint unsigned int
#define ulong unsigned long
#include //包括一个52标准内核的头文件
char code dx516[3] _at_ 0x003b;//这是为了仿真设置的
sbit P10=P1^