代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/348596/10883440
txt 2348.txt
#include
void main()
{
_int64 n,m;
_int64 r;
_int64 a[1000];
int k;
while(1){
scanf("%I64d %I64d",&n,&m);
if(n==0&&m==0) break;
if(n
www.eeworm.com/read/348596/10883454
txt 1150.txt
#include "stdio.h"
int main( ) {
int n, m, five, two, three, seven, nine, ans, a, b;
while( scanf( "%d%d", &n, &m ) == 2 ) {
m = n - m;
five = two = three = seven = nine = 0;
www.eeworm.com/read/348596/10883504
txt 2909.txt
Problem Id:2909 User Id:fzk
Memory:104K Time:0MS
Language:C++ Result:Accepted
Source
//#include
//#include
#include
#include
#include
www.eeworm.com/read/348596/10883587
txt 2506.txt
#include
#include
#include
#define MAX 550
class BigInteger
{
public:
int len;
char cNum[MAX];
BigInteger( int s = 0 )
{
len = 0;
memset( c
www.eeworm.com/read/348596/10883606
txt 1430.txt
#include"iostream.h"
const long big=1024*1024*1024;
long b;
long n,m;
char a[16][34]={
". . . . . . . . . . . . . . . 1",
". . . . . . . . . . . . . 1 1 .",
". . . . . . . . . . . 1 1 1 .
www.eeworm.com/read/348596/10883662
txt 1218.txt
#include"iostream.h"
int main()
{
int t,n,i,s;
cin>>t;
while(t--)
{
cin>>n;
for(i=1,s=0;i*i
www.eeworm.com/read/348596/10883726
txt 2507.txt
Memory:52K Time:0MS
Language:G++ Result:Accepted
Source
#include "stdio.h"
#include "math.h"
int main()
{
double x, y, c, a, b, w, t;
while( scanf( "%lf%lf%lf", &x, &y, &c ) ==
www.eeworm.com/read/348596/10883807
txt 2569.txt
Problem Id:2569 User Id:fzk
Memory:116K Time:15MS
Language:C++ Result:Accepted
Source
#include"stdio.h"
int ans[128][128];
bool sign[128][128];
int main()
{
int n,i,j,k,total,x,
www.eeworm.com/read/348596/10883948
txt 2424.txt
//nclude"iostream.h"
#include"queue"
#include"stdio.h"
using namespace std;
struct node
{
int time;
int dinners;
};
int a[3],ans;
queue have[3];
bool init()
{
char c,t;
www.eeworm.com/read/419116/10885563
pas prime.pas
{Input a n,Output the min prime bigger than n}
const max=1 shl 16;{max sqrt of n}
var f,g:text;
p:array[1..max div 4]of dword;
a:array[1..max]of 0..1;
i,j,l,n:dword;
function isprime