代码搜索：Sign
找到约 10,000 项符合「Sign」的源代码
代码结果 10,000
www.eeworm.com/read/348596/10882311
txt 1228.txt
#include"iostream.h"
#include
#include
using namespace std;
#define Type long
struct point
{long x,y;};
point p[1001];
int cheng(point &a,point &b,point &c)
{return
www.eeworm.com/read/348596/10882330
txt 2680.txt
Problem Id:2680 User Id:fzk
Memory:2124K Time:46MS
Language:C++ Result:Accepted
Source
#include
#include
#include
class BigInteger
{
public:
enu
www.eeworm.com/read/348596/10882350
txt 1422.txt
#include
#include
bool e[120][120];
int son[120], n;
bool sign1[120];
bool sign2[120];
bool flag[120];
bool search( int a )
{
int i;
sign1[a] = true;
f
www.eeworm.com/read/348596/10882361
txt 2553.txt
#include"stdio.h"
#include"memory.h"
#include"list"
using namespace std;
long sign[5010];
long st[5010],s;
long ok[5010];
long v;
list out[5000],in[5000];
void find(int a)
{list:
www.eeworm.com/read/348596/10882493
txt 2400.txt
#include"iostream.h"
#include"string.h"
#include"stdio.h"
#define valuetype int
#define null 0
const int size=20;
bool maxmatch(int n,int m,bool w[size][size],int *p,bool *setn,bool
www.eeworm.com/read/348596/10882572
txt 2186.txt
#include
#include
#include
using namespace std;
vector e[10000];
vector h[10000];
bool sign[10000];
int n, m, reach;
void search( int s,vector
www.eeworm.com/read/348596/10882854
txt 2669.txt
Problem Id:2669 User Id:fzk
#include
#include
#include
#include
using namespace std;
double dis[100][100];
int n, m;
bool e[100][100];
int son[100]
www.eeworm.com/read/348596/10882929
txt 2446.txt
#include
#include
const int dx[] = { 0, 1, 0, 0, -1 };
const int dy[] = { 0, 0, 1,-1, 0 };
int n, m;
inline bool inmap( int x, int y ) {
return 0
www.eeworm.com/read/348596/10882936
txt 2184.txt
#include
#include
#include
#include
using namespace std;
bool mem[200100],*sign = mem+100000;
int mem2[200100],*ans = mem2+100000;
typedef
www.eeworm.com/read/348596/10883026
txt 2435.txt
#include
#include
using namespace std;
typedef pair point;
int dx[] = { 0, 1,-1, 0};
int dy[] = { 1, 0, 0,-1};
char way[] = { '-','|','|','-'};
char to[] = { 'E','S