代码搜索：TLE

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

代码结果 732
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/452050/7451415

c 3007351_tle.c

#include int press[17]; int ans = 17; char str[5][5]; int valid(int x,int y) { if(x < 0 || y < 0 || x > 3 || y > 3) return 0; return 1; } void flip(int num) { int i, j
·
www.eeworm.com/read/452050/7451425

c 1862038_tle.c

# include void main() { long i, j, T; long N, S; int a[100001]; long sum, tmp, min; scanf("%ld",&T); while(T--) { scanf("%ld%ld",&N,&S); min = 100000; for(i = 0
·
www.eeworm.com/read/452050/7451432

java 3080422_tle.java

import java.util.*; public class Main { static final int inf = 2100000000; static class part { String type, name; int price, quality; int id; } public static void main(Strin
·
www.eeworm.com/read/452050/7451441

cc 2362366_tle.cc

#include #include int m, n; int map[1001][1001]; int warshall() { int i, j, m, t = 0; for(i = 0; i < n; i++) { for(j = 0; j < n; j++) if(map[j][i]) for(
·
www.eeworm.com/read/452050/7451450

c 1962367_tle.c

# include # include int main() { char ph[1000][61]; char q[61]; int i, j, M, N, c, len; scanf("%d%d",&M,&N); getchar(); for(i = 0; i < M; i++) gets(ph[i]);
·
www.eeworm.com/read/452050/7451451

c 1962402_tle.c

# include # include int main() { char ph[1000][61]; char q[61]; int mark[80]; int i, j, M, N, c, len; scanf("%d%d",&M,&N); getchar(); memset(mark,0,sizeof(mar
·
www.eeworm.com/read/452050/7451454

cpp 3146020_tle.cpp

#include #include #define INIT (Node *)malloc(sizeof(Node)) typedef struct node { int L, R; int ll, rr; struct node *l, *r; }Node; Node *root; Node *creat_seg_t
·
www.eeworm.com/read/452050/7451456

cc 3146024_tle.cc

#include #include #define INIT (Node *)malloc(sizeof(Node)) typedef struct node { int L, R; int ll, rr; struct node *l, *r; }Node; Node *root; Node *creat_seg_t
·
www.eeworm.com/read/452050/7451476

cpp 3615791_tle.cpp

#include #include #include struct node { int w, h; }doll[20001]; int cmp(const void*a,const void*b) { if((*(node*)a).w==(*(node*)b).w) return
·
www.eeworm.com/read/452050/7451482

cpp 3910012_tle.cpp

#include #include using namespace std; struct node { int st, ed; bool operator < (const node t) const { if (st != t.st) { return st < t.st; } else
·