代码搜索：TLE
找到约 732 项符合「TLE」的源代码
代码结果 732
www.eeworm.com/read/452050/7451499
java 3128614_tle.java
import java.util.*;
public class Main
{
class node
{
int pos;
int num1, num2;
String exp;
}
public static void main(String [] args)
{
new Main().solve();
}
private
www.eeworm.com/read/452050/7451504
cc 3160675_tle.cc
#include
#include
#include
int from[257][100000];
char dp[257][100000];
int add[257][100000];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451511
c 3160645_tle.c
#include
#include
#include
int from[300][100010];
char dp[300][100010];
int add[300][100010];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451513
cc 3160647_tle.cc
#include
#include
#include
int from[300][100010];
char dp[300][100010];
int add[300][100010];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451518
cpp 2598662_tle.cpp
#include
using namespace std;
#define MAX 1000
int main()
{
int N, P, M, is;
int i, j, k;
int A[MAX][MAX], B[MAX][MAX], x = 0, y = 0;
long C, Bp[MAX], Ap[MAX];
www.eeworm.com/read/452050/7451543
cc 3129703_tle.cc
#include
#include
#include
using namespace std;
int x[701], y[701];
typedef pair type;
map h;
int gcd(int a,int b)
{
return a==0?b:gc
www.eeworm.com/read/452050/7451544
cpp 3129705_tle.cpp
#include
#include
#include
using namespace std;
int x[701], y[701];
typedef pair type;
map h;
int gcd(int a,int b)
{
return a==0?b:gc
www.eeworm.com/read/452050/7451586
cc 3182039_tle.cc
#include
#include
#include
#include
#define MAXN 50010
#define inf 2100000000
using namespace std;
struct point
{
double x, y;
};
struct node
{
www.eeworm.com/read/452050/7451609
c 1807596_tle.c
# include
void main()
{
int i, j, tmp, mark, value;
for(i = 1; i
www.eeworm.com/read/452050/7451624
c 1786855_tle.c
# include
main()
{
int i,j,std[7];
char temp[20];
long k,l,no,li,num[100000][2];
for(li = 0; li < 100000; li++)
num[li][0] = num[li][1] = 0;
scanf("%ld\r",&