代码搜索:while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/348596/10883114
txt 2785.txt
#include
#include
#include
using namespace std;
int a[4002][4];
int b1[4001*4001] ,b2[4001*4001];
int n;
_int64 s ;
main()
{
int i,j;
// freopen("
www.eeworm.com/read/348596/10883159
txt 2773.txt
Problem Id:2773 User Id:fzk
Memory:4160K Time:125MS
Language:G++ Result:Accepted
Source
#include "stdio.h"
#include "memory.h"
int s[1000010];
bool sign[1000010];
int gcd( int a, in
www.eeworm.com/read/348596/10883166
txt 2029.txt
#include"stdio.h"
int sum[1025][1025],n, m;
inline int lowbit(int a)
{
return a&(a^(a-1));
}
void init()
{
int i,j;
scanf("%d %d", &n, &m);
for(i=1;i
www.eeworm.com/read/348596/10883221
txt 2864.txt
Source
Problem Id:2864 User Id:fzk
Memory:24K Time:15MS
Language:C++ Result:Accepted
Source
#include
#include
int main( ) {
int n, d, i, t, sign[101];
whil
www.eeworm.com/read/348596/10883285
txt 1674.txt
#include "stdio.h"
int a[10000], ans;
bool sign[10000];
int main()
{
int cas, n, i, j;
scanf( "%d\n", &cas );
while( cas-- )
{
scanf( "%d", &n );
for( i=0; i
www.eeworm.com/read/348596/10883304
txt 1825.txt
#include"stdio.h"
#include"iostream.h"
#include"memory.h"
int x[20],y[20],m;
int s[2000],len;
void cheng(int a)
{int i,t;
for(i=0,t=0;i
www.eeworm.com/read/348596/10883311
txt 2584.txt
Problem Id:2584 User Id:fzk
#include"iostream"
#include"algorithm"
using namespace std;
char *size="SMLXT";
int find( char c )
{
char *q = size;
while( *q != c )
q++;
return q - s
www.eeworm.com/read/348596/10883334
txt 2415.txt
#include"iostream.h"
#include"queue"
#include"algorithm"
using namespace std;
char edge[51][51];
int sign[51][51][51],n,p1,p2,p3;
struct node
{
int p[3];
int steps;
};
queue q
www.eeworm.com/read/348596/10883341
txt 1465.txt
#include
#include
#include
#define MAX 2000
class BigInteger
{
public:
int len;
char cNum[MAX];
BigInteger( int s = 0 )
{
len = 0;
www.eeworm.com/read/348596/10883376
txt 3126.txt
Source
Problem Id:3126 User Id:fzk
Memory:80K Time:0MS
Language:C++ Result:Accepted
Source
#include
#include
int s[10000];
bool sign[10000];
int q[10000];
v