代码搜索：TLE
找到约 732 项符合「TLE」的源代码
代码结果 732
www.eeworm.com/read/469371/6973851
cc 2633439_tle.cc
#include
using namespace std;
int n;
int frag[64];
bool used[64];
int cmp(const void *i, const void *j)
{
return *(int *)j - *(int *)i;
}
//尝试用剩下的num个碎片构造长度为left 的木棒
bool
www.eeworm.com/read/469371/6973859
cc 2640809_tle.cc
#include
using namespace std;
int num[20];
int maxs=10000000;
void next(int a[20],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973860
cc 2641356_tle.cc
#include
using namespace std;
int num[20];
int maxs=10000000;
void next(int a[20],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973862
cc 2635473_tle.cc
#include
using namespace std;
int num[100];
int maxs=10000000;
void next(int a[100],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973863
cc 2641338_tle.cc
#include
using namespace std;
int num[20];
int maxs=10000000;
void next(int a[20],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973864
cc 2871040_tle.cc
#include
using namespace std;
int n,m,bests=10000000;
void f(int r,int h,int x,int v,int s)
{
if(s>=bests)
return;
if(x==0)
{
if(s
www.eeworm.com/read/469371/6973865
cc 2871014_tle.cc
#include
using namespace std;
int n,m,bests=10000000;
void f(int r,int h,int x,int v,int s)
{
if(s>=bests)
return;
if(x==0)
{
if(s
www.eeworm.com/read/469371/6973877
cc 2540538_tle.cc
#include
using namespace std;
struct
{
int sum;
int counts;
int com[160]; //以空间换时间
int father;
int lev;
}node[30001];
void init()
{
for(i
www.eeworm.com/read/469371/6973878
cpp 2556617_tle.cpp
#include
#include
using namespace std;
struct
{
int rank;
int father;
int son;
}node[30001];
void init()
{
for(int i=1;i
www.eeworm.com/read/469371/6973880
cpp 2539853_tle.cpp
#include
using namespace std;
struct
{
int rank;
int father;
int son;
}node[30001];
void init()
{
for(int i=1;i