代码搜索：TLE
找到约 732 项符合「TLE」的源代码
代码结果 732
www.eeworm.com/read/469371/6973986
cc 2760368_tle.cc
#include
using namespace std;
int num[100];
int k=0,sum=0;
void fenjie(int n)
{
int i=2,sign=0;
while(i
www.eeworm.com/read/469371/6973987
cc 2760396_tle.cc
#include
using namespace std;
int num[100];
int k=0,sum=0;
void fenjie(int n)
{
int i=2,sign=0;
while(i
www.eeworm.com/read/469371/6974008
cc 2745122_tle.cc
#include
using namespace std;
int sum;
void tback(int n,int k)
{
if(n==k || k==0)
{
printf("1\n");
return;
}
int x1=0,x2=0;
for(int i=1;i
www.eeworm.com/read/469371/6974010
cc 2745162_tle.cc
#include
using namespace std;
int sum;
void tback(int n,int k)
{
if(n==k || k==0)
{
printf("1\n");
return;
}
int x1=0,x2=0;
for(int i=2;i
www.eeworm.com/read/469371/6974011
cc 2745132_tle.cc
#include
using namespace std;
int sum;
void tback(int n,int k)
{
if(n==k || k==0)
{
printf("1\n");
return;
}
int x1=0,x2=0;
for(int i=1;i
www.eeworm.com/read/469371/6974019
cc 2752386_tle.cc
#include
using namespace std;
int fen(int n)
{
int i,p=0;
for(i=2;i
www.eeworm.com/read/469371/6974020
cc 2284415_tle.cc
#include
using namespace std;
int main()
{
int n,m;
cin>>n;
cin>>m;
int c=0;
for(int i=2;i
www.eeworm.com/read/469371/6974021
cc 2752435_tle.cc
#include
using namespace std;
int fen(int n)
{
int i,p=0;
for(i=2;i
www.eeworm.com/read/469371/6974023
cc 2790708_tle.cc
#include
using namespace std;
typedef struct
{
int start;
int stop;
int people;
}node;
node order[8];
int n,m,max_people,maxs=0,num[8];
void traceback(int t)
{
www.eeworm.com/read/469371/6974024
cc 2790706_tle.cc
#include
using namespace std;
typedef struct
{
int start;
int stop;
int people;
}node;
node order[8];
int n,m,max_people,maxs=0,num[8];
void traceback(int t)
{