代码搜索：TLE
找到约 732 项符合「TLE」的源代码
代码结果 732
www.eeworm.com/read/469371/6974027
cc 3269867_tle.cc
#include
using namespace std;
typedef struct
{
int value;
int maxvalue;
bool sign;
}node;
node mg[200000];
int cmp(const void *a,const void *b)
{
return (*(node *
www.eeworm.com/read/469371/6974028
cc 3269704_tle.cc
#include
using namespace std;
typedef struct
{
int value;
int maxvalue;
int sign;
}node;
node mg[200000];
int main()
{
int i,j,t,n,m;
scanf("%d",&t);
www.eeworm.com/read/469371/6974030
cc 3269698_tle.cc
#include
using namespace std;
typedef struct
{
int value;
int maxvalue;
int sign;
}node;
node mg[200000];
int main()
{
int i,j,t,n,m;
scanf("%d",&t);
www.eeworm.com/read/469371/6974032
cc 3269701_tle.cc
#include
using namespace std;
typedef struct
{
int value;
int maxvalue;
int sign;
}node;
node mg[200000];
int main()
{
int i,j,t,n,m;
scanf("%d",&t);
www.eeworm.com/read/469371/6974033
cc 3270019_tle.cc
#include
using namespace std;
int card[100001];
long m,n;
void heapify(int i)
{
int l,r,small=i,temp;
l=2*i;
r=2*i+1;
if(l
www.eeworm.com/read/469371/6974034
cc 3270068_tle.cc
#include
using namespace std;
int mg[100000];
int cmp(const void *a,const void *b)
{
return (*(int *)a)-(*(int *)b);
}
int main()
{
int i,j,t,n,m,x;
scanf("%d",&t
www.eeworm.com/read/469371/6974054
cc 2871836_tle.cc
#include
using namespace std;
typedef struct
{
int m;
int count;
}node;
node mg[26];
void init()
{
int i;
for(i=0;i
www.eeworm.com/read/469371/6974059
cc 2789162_tle.cc
#include
using namespace std;
int num[6],ok=0,sum=0,c=1;
void getresult(int t,int x)
{
if(ok==1)
return;
if(x==sum)
{
ok=1;
return;
www.eeworm.com/read/469371/6974061
cc 2789096_tle.cc
#include
using namespace std;
int num[6],ok=0,sum=0,c=1;
void getresult(int t,int x)
{
if(ok==1 || t
www.eeworm.com/read/469371/6974072
cpp 2706631_tle.cpp
#include
using namespace std;
typedef struct
{
int len;
int num[101][2];
int sign[101];
}node;
node mg[101];
float maxs=0.0;
int n;
int partion(int row,int