代码搜索:TLE
找到约 732 项符合「TLE」的源代码
代码结果 732
www.eeworm.com/read/452050/7451676
cc 3962222_tle.cc
#include
#include
#include
#include
#include
using namespace std;
char alphaset[] = "1234567890. ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnop
www.eeworm.com/read/452050/7451692
cpp 2954676_tle.cpp
#include
#include
#include
#define MaxV 20011
#define Inf 2100000000
using namespace std;
int n, m, ans;
int S, T;
int L, R;
int d[MaxV], op[MaxV], st[MaxV]
www.eeworm.com/read/452050/7451694
cc 2954678_tle.cc
#include
#include
#include
#define MaxV 20011
#define Inf 2100000000
using namespace std;
int n, m, ans;
int S, T;
int L, R;
int d[MaxV], op[MaxV], st[MaxV]
www.eeworm.com/read/452050/7451695
cpp 2945536_tle.cpp
#include
#include
#include
#define MaxV 20011
using namespace std;
int n, m, ans;
struct edge
{
int id;
int c;
};
vector graph[MaxV];
int que[
www.eeworm.com/read/452050/7451696
cc 2945532_tle.cc
#include
#include
#include
#define MaxV 20011
using namespace std;
int n, m, ans;
struct edge
{
int id;
int c;
};
vector graph[MaxV];
int que[
www.eeworm.com/read/452050/7451725
java 3136362_tle.java
import java.util.*;
import java.math.*;
public class Main
{
public static void main(String [] args)
{
Scanner cin = new Scanner (System.in);
BigInteger sum, min, max, tmp, mid, tt;
B
www.eeworm.com/read/452050/7451726
java 3136384_tle.java
import java.util.*;
import java.math.*;
public class Main
{
public static void main(String [] args)
{
Scanner cin = new Scanner (System.in);
BigInteger sum, min, max, tmp, mid, tt;
B
www.eeworm.com/read/452050/7451749
cpp 2832187_tle.cpp
#include
#include
#include
#define INF 2100000000
#define MaxV 201
int n, p, m;
int q[201];
int ans;
int map[200][200];
struct node
{
int a[11];
};
node
www.eeworm.com/read/452050/7451752
cpp 3294239_tle.cpp
#include
#include
#define INF 2100000000
struct node
{
int c, w, f;
}net[110][110];
struct Node
{
int v, fa;
}best[110];
int n, s, t;
int minc;
int N, M, K;
www.eeworm.com/read/452050/7451758
c 1832356_tle.c
# include
# include
void main()
{
int n, mark;
long i, count, NO, t, len;
char str[1000001], tmp[1000001];
while(1)
{
scanf("%s",str);
if(strcmp(str,".") =