代码搜索：TLE
找到约 732 项符合「TLE」的源代码
代码结果 732
www.eeworm.com/read/405817/11456288
cpp farey sequence(朴素构造).cpp
//TJU 2798. Farey Sequence
//TLE
#include
#include
#include
using namespace std;
const int NMAX = 3000000;
int total;
int temp1[NMAX],temp2[NMAX],farey1[NMAX],
www.eeworm.com/read/233075/4694818
vhd vhdl.vhd
-- generated by newgenasym Thu Mar 22 14:43:11 2001
library ieee;
use ieee.std_logic_1164.all;
use work.all;
entity TLE2037 is
port (
\in+\: INOUT STD_LOGIC;
\in-\: INO
www.eeworm.com/read/2252/13430
vhd vhdl.vhd
-- generated by newgenasym Thu Oct 23 15:07:18 2008
library ieee;
use ieee.std_logic_1164.all;
use work.all;
entity tle2037a is
port (
M: IN STD_LOGIC;
N1: OU
www.eeworm.com/read/2252/14850
vhd vhdl.vhd
-- generated by newgenasym Thu Oct 23 15:07:18 2008
library ieee;
use ieee.std_logic_1164.all;
use work.all;
entity tle2037a is
port (
M: IN STD_LOGIC;
N1: OU
www.eeworm.com/read/388100/8635925
txt shiyan6.txt
// 利用增广矩阵解最小二乘问题
public class AugmentedSystem {
public double[][] constructA(double[] t,double[] y,int n)
{
int tLength=t.length;
double[][] aa=new double[tLength][n];
for(int i=0;i
www.eeworm.com/read/388100/8635928
java augmentedsystem.java
// 利用增广矩阵解最小二乘问题
public class AugmentedSystem {
public double[][] constructA(double[] t,double[] y,int n)
{
int tLength=t.length;
double[][] aa=new double[tLength][n];
for(int i=0;i
www.eeworm.com/read/184327/9110087
pas 1225spl.pas
//Splay tree, TLE
{$Q-,R-}
program tju1225;
const
maxn=100000;
var
val,size,lchild,rchild,parent,free:array[0..maxn]of longint;
freep,n,limit,delta{real minus stored},i,k,leave:longint;
www.eeworm.com/read/246404/12728790
pas 1225spl.pas
//Splay tree, TLE
{$Q-,R-}
program tju1225;
const
maxn=100000;
var
val,size,lchild,rchild,parent,free:array[0..maxn]of longint;
freep,n,limit,delta{real minus stored},i,k,leave:longint;
www.eeworm.com/read/246404/12729341
pas 1225spl.pas
//Splay tree, TLE
{$Q-,R-}
program tju1225;
const
maxn=100000;
var
val,size,lchild,rchild,parent,free:array[0..maxn]of longint;
freep,n,limit,delta{real minus stored},i,k,leave:longint;
www.eeworm.com/read/469754/6926282
cpp 2674.cpp
//老实算的 TLE
#include
#include
using namespace std;
char s[1000];
void sw(char *list,int n)
{
int i,j;
for(i=0,j=n-1;i