代码搜索：TLE

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

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

java 3561300_tle.java

import java.util.*; public class Main { private Scanner in; private int n; private boolean[][] map; private final boolean BLACK = false; private final boolean WHITE = true; private bool
·
www.eeworm.com/read/452050/7450743

cpp 3238135_tle.cpp

#include #include #include using namespace std; int n; struct node { __int64 a, r; }; vector num; __int64 extend_gcd(__int64 a,__int64 b,__int6
·
www.eeworm.com/read/452050/7450764

cc 3020097_tle.cc

#include int n; int mtr[201][201]; int ans[201][201]; int abs(int num) { if(num < 0) return -num; else return num; } int find_nearest(int a,int b) { int i, j, dis,
·
www.eeworm.com/read/452050/7450765

cpp 3020112_tle.cpp

#include #include #include using namespace std; int n; int mtr[201][201]; int abs(int num) { if(num < 0) return -num; else return num; } bool v
·
www.eeworm.com/read/452050/7450769

java 3020105_tle.java

import java.util.*; public class Main { static int n; static int mtr[][] = new int [201][201]; static int abs(int num) { if(num < 0) return -num; else return num; }
·
www.eeworm.com/read/452050/7450770

c 3020093_tle.c

#include #include int n; int mtr[201][201]; int ans[201][201]; int find_nearest(int a,int b) { int i, j, dis, num, ret; int max = 2100000000; num = 0; for(i = 0;
·
www.eeworm.com/read/452050/7450799

c 1950515_tle.c

# include # include int main() { int n, i, k; int a[205]; char code[201], encode[201]; while(scanf("%d",&n)==1&&n) { for(i = 0; i < n; i++) scanf("%d",&a[i
·
www.eeworm.com/read/452050/7450804

java 3067441_tle.java

import java.util.*; import java.math.*; public class Main { static int num[] = new int [10001]; static int cnt[] = new int [10001]; public static void main(String[] args) {
·
www.eeworm.com/read/452050/7450854

c 1858878_tle.c

# include # include void main() { long n; double i, N; double M; scanf("%d",&n); while(n--) { scanf("%lf",&N); M = 0; for(i = 1; i
·
www.eeworm.com/read/452050/7450856

c 1858881_tle.c

# include # include void main() { long n; double i, N; double M; scanf("%d",&n); while(n--) { scanf("%lf",&N); M = 0; for(i = 1; i
·