代码搜索:while

找到约 10,000 项符合「while」的源代码

代码结果 10,000
www.eeworm.com/read/456367/7351039

cpp textin1.cpp

// textin1.cpp -- reading chars with a while loop #include int main() { using namespace std; char ch; int count = 0; // use basic input cout
www.eeworm.com/read/456099/7358730

c mystring.c

//********************************************************************************** //杨屹 2002/08/20 第一版 //字符串操作函数 //联系方法:gdtyy@ri.gdt.com.cn(2003/07/31以前有效) //******************************
www.eeworm.com/read/455981/7360150

c 44blib.c

#include "44b.h" #include "44blib.h" //#include "def.h" #include "option.h" #include #include #include #include #include #define STACK
www.eeworm.com/read/455891/7362134

pl maxseg.pl

#!/usr/bin/perl -w # Purpose: maximum matching segmentation program # Usage: program dictionary inputfile # # # Author: S
www.eeworm.com/read/455677/7368993

java quicksorter.java

// // This class sorts an array using the QuickSort method. public class QuickSorter { private int[] a; public QuickSorter(int[] anArray) { a=anArray; } public void sort(int fr
www.eeworm.com/read/455673/7369073

java quicksorter.java

// // This class sorts an array using the QuickSort method. public class QuickSorter { private int[] a; public QuickSorter(int[] anArray) { a=anArray; } public void sort(int fr
www.eeworm.com/read/455590/7369768

cpp p1363.cpp

#include #include using namespace std; stack s; int main(){ int n,m,x; while(cin >> n && n){ while(1){ while(!s.empty()) s.pop();
www.eeworm.com/read/455590/7369778

cpp p1207.cpp

#include using namespace std; int F(int x){ int res = 1; while(x != 1){ if(x & 1) x = 3 * x + 1; else x >>= 1; ++res; } return res; } int
www.eeworm.com/read/455590/7369811

cpp p2352szsz.cpp

#include using namespace std; const int MAXN = 32010; int c[MAXN],ans[MAXN]; inline int lowbit(int x){ return x & (-x); } void change(int x){ while(x
www.eeworm.com/read/455590/7369824

cpp p1281.cpp

#include #include using namespace std; const int MAXN = 10001; int main(){ int m,n; while(cin >> m >> n){ list q; int a[MAXN]; for(int