代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/347848/11632051
java whiledemo.java
public class WhileDemo
{
public static void main(String[] args)
{
int countDown;
System.out.println("First while loop:");
countDown = 3;
while (count
www.eeworm.com/read/155903/11839885
txt 例3.11.txt
例3.11 用do-while语句求1+2+3+…+100。
先画出流程图，见图3.12。
可编写出下面的程序：
#include
using namespace std;
int main( )
{int i=1,sum=0;
do
{ sum=sum+i;
i++;
}while (i
www.eeworm.com/read/132098/14110426
java dowhileop.java
//DoWhileOp.java
//用do-while语句计算10的阶乘
public class DoWhileOp
{
public static void main(String args[])
{
int n=10;
long result=1;
do
result*=n--;
while(n>=1);
System.out.print
www.eeworm.com/read/127960/14325223
cpp dowhilex.cpp
//这个程序在本书所带软盘中，文件名为DOWHILEX.CPP
//这个程序用来演示do-while循环语句。
#include
void main(void)
{
int count;
count = 1; //循环控制变量初始值
do
{
cout
www.eeworm.com/read/116936/14948349
java dowhileop.java
//DoWhileOp.java
//用do-while语句计算10的阶乘
public class DoWhileOp
{
public static void main(String args[])
{
int n=10;
long result=1;
do
result*=n--;
while(n>=1);
System.out.print
www.eeworm.com/read/114697/15041568
java dowhileop.java
//DoWhileOp.java
//用do-while语句计算10的阶乘
public class DoWhileOp
{
public static void main(String args[])
{
int n=10;
long result=1;
do
result*=n--;
while(n>=1);
System.out.print
www.eeworm.com/read/114188/15066981
htm 00000004.htm
BBS水木清华站∶精华区
BBS水木清华站∶精华区
发信人: ax.bbs@bbs.ee.nthu.edu.tw. (athena)
www.eeworm.com/read/166250/5475908
java dowhileop.java
//DoWhileOp.java
//用do-while语句计算10的阶乘
public class DoWhileOp
{
public static void main(String args[])
{
int n=10;
long result=1;
do
result*=n--;
while(n>=1);
System.out.print
www.eeworm.com/read/160131/5576839
java dowhileop.java
//DoWhileOp.java
//用do-while语句计算10的阶乘
public class DoWhileOp
{
public static void main(String args[])
{
int n=10;
long result=1;
do
result*=n--;
while(n>=1);
System.out.print
www.eeworm.com/read/159030/5588658
legal-7
class Program
{
void test_while()
{
int i;
i = 0;
while(true)
{
while(false)
{
callout("printf","should never be here\n");
}
i = i + 1;