代码搜索:TLE

找到约 732 项符合「TLE」的源代码

代码结果 732
www.eeworm.com/read/452050/7450484

cpp 2861430_tle.cpp

#include #include #include int map[1001][1001]; struct node { double x, y; }out[1001]; int que[1001]; int step[1001]; int f, r, n; int visited[1001]; v
www.eeworm.com/read/452050/7450576

c 1869176_tle.c

# include # define pass 1 int main() { long m, n; long i, r, l; while(scanf("%ld%ld",&m,&n)==2) { if(!n) {printf("1\n");continue;} n = m-n+1; l = 1; fo
www.eeworm.com/read/452050/7450585

c 1847029_tle.c

# include int main() { __int64 sum[100002], SUM, max; long i, j, n, a[100002], x, y, left[100002], right[100002]; scanf("%ld",&n); sum[0] = 0; for(i = 1; i
www.eeworm.com/read/452050/7450591

c 1846911_tle.c

# include int main() { __int64 sum[100001], SUM, max; long i, n, a[100001], x, y, mx, my; scanf("%ld",&n); sum[0] = 0; for(i = 1; i
www.eeworm.com/read/452050/7450595

cc 1846806_tle.cc

# include using namespace std; typedef long long int64; long a[100009]; int main() { long i, n, x, y, mx, my; int64 SUM, max; cin>>n; for(i = 1; i >a
www.eeworm.com/read/452050/7450596

c 1846965_tle.c

# include int main() { int mark, flag; __int64 sum[100001], SUM, max; long i, n, a[100001], x, y, mx, my; scanf("%ld",&n); sum[0] = 0; for(i = 1; i
www.eeworm.com/read/452050/7450602

cc 1846801_tle.cc

# include using namespace std; typedef long long int64; long a[100009]; int64 sum(long x, long y) { int64 s; long i; s = a[x]; for(i = x + 1; i
www.eeworm.com/read/452050/7450603

c 1847049_tle.c

# include int main() { __int64 sum[100002], SUM, max; long i, j, p, n, a[100002], x, y, left[100002], right[100002]; scanf("%ld",&n); sum[0] = 0; for(i = 1; i
www.eeworm.com/read/452050/7450604

c 1847041_tle.c

# include int main() { __int64 sum[100002], SUM, max; long i, j, n, a[100002], x, y, left[100002], right[100002]; scanf("%ld",&n); sum[0] = 0; for(i = 1; i
www.eeworm.com/read/452050/7450610

cpp 2406326_tle.cpp

#include #include #include #define INIT (Edge *)malloc(sizeof(Edge)) int n, m; int visited[40001]; typedef struct node { int adj; int w; struct node *nex