代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/405983/11451955
pas kmp.pas
program zju1073;
const
maxn=70;
cans:array[false..true] of string=(' is not cyclic',' is cyclic');
type
num=array[0..maxn] of longint;
var
s,st:string;
sn:num;
pre
www.eeworm.com/read/405904/11455166
txt chekongzhi.txt
/*
第一阶段，方向可控，速度恒定
P1口的前7个（0-7）为方向输入（光电管的输入，单片机收到高电平认为有信号）
P2的1口为舵机的pwm
P2的0口为后电机的pwm
*/
#include
#define uint unsigned int
uint a,c; /*timer0用，调整占空比舵机用基本不用改动
www.eeworm.com/read/405872/11455370
c ti_cc_spi.c
#include "include.h"
#include "myinlcude.h"
// Delay function. # of CPU cycles delayed is similar to "cycles". Specifically,
// it's ((cycles-15) % 6) + 15. Not exact, but gives a sense of the
www.eeworm.com/read/405817/11456296
cpp let it bead(polya).cpp
//Necklace of Beads是他的特殊情况
#include
#include
#include
using namespace std;
int s,c;
int gcd(int x,int y)
{
if(x > y) {
std::swap(x,y);
}
www.eeworm.com/read/405817/11456338
cpp xyzzy(bellman ford).cpp
//中间不能死
//有正权环的话，得找出终点是否受环影响
#include
#include
#include
#include
#include
using namespace std;
#define MAX 110
int n,m;
int v[MAX],dist[MAX],
www.eeworm.com/read/405817/11456387
txt 1560.txt
#include
#include
#include
#define MAX 1000001
using namespace std;
char str[10][10];
int n,d[8]={1},g[MAX];
bool f[MAX];
struct Node
{
char ps[8];
int de
www.eeworm.com/read/405817/11456389
txt 1555.txt
#include
int main()
{
int n,m,k,i,sum;
while(scanf("%d %d",&m,&k)==2)
{
sum=0;
if(m==0 && k==0)
break;
sum=m;n=0;
while(m>=k
www.eeworm.com/read/405698/11459308
m deci22bin.m
%deci22bin.m
function y=deci22bin(x,t)
%十进制数x转化为二进制数，二进制数至少表示为t位
y=zeros(size(x,1),t);
for j=1:size(x,1)
i=1;
while x(j)>=0&i
www.eeworm.com/read/405687/11459382
c framebuffer.c
/*
* FILE: framebuffer.c
* 实现在framebuffer上画点、画线、画同心圆、清屏的函数
*/
#include "framebuffer.h"
extern unsigned int fb_base_addr;
extern unsigned int bpp;
extern unsigned int xsize;
extern unsig
www.eeworm.com/read/405601/11460292
txt result.txt
main main
( (
) )
{ {
int int
ID a
, ,
ID b
, ,
ID c
; ;
read read
ID a
; ;
read read
ID b
; ;
ID c
= =
NUM 0
; ;
do do
{ {
ID c
= =
ID a
* *
ID b
; ;
ID b
= =
ID b
+ +