代码搜索：TJU
找到约 1,004 项符合「TJU」的源代码
代码结果 1,004
www.eeworm.com/read/339553/12225811
rar tju_a.rar
www.eeworm.com/read/339553/12225903
rar tju.rar
www.eeworm.com/read/192484/8379677
pas tju1228.pas
program tju1228;
const
maxn=10;
maxtimes=9999;//This is just an evaluated amount
//I made a test which occupies 7402 times before merging the equal ones
zero=1e-6;
type
segment=reco
www.eeworm.com/read/192483/8379694
pas tju1242.pas
{$Q-,R-}
program tju1242;
const
maxn=30000;
maxe=100000;
maxq=100000;
var
edge:array[1..maxe]of record v1,v2:word;pre1,pre2:longint;del:byte;end;
query:array[1..maxq+maxe-maxn+1]of r
www.eeworm.com/read/192477/8379781
pas tju1103.pas
Program tju1103;
Const
prime : array[1..10] of integer=(2,3,5,7,11,13,17,19,23,29);
Var
n,best,bestcount:longint;
Procedure search(number:int64;count,posi,max:longint);
var
k:
www.eeworm.com/read/192476/8379785
pas tju1127.pas
const sss='0123456789';
var
n,i,l,at,shu,yu,tt,ft:integer;
s,temp,tempx:string;
bb:boolean;
begin
readln(n);
for i:=1 to n do begin
readln(s);
write(s,' ');
if s'1'
www.eeworm.com/read/339553/12225855
rar tju_c.rar
www.eeworm.com/read/339553/12225901
rar tju_b.rar
www.eeworm.com/read/494711/6344231
txt 2009-3-7-tju2248.txt
#include
#include
#include
const int MAX=105;
const int INF=0x6fffffff;
//以下两个函数为MDST算法的模板！
int n,used[MAX],pass[MAX],eg[MAX],more,queue[MAX];
int g[MAX][MAX];//如果是整数
www.eeworm.com/read/184327/9109885
pas ac1000.pas
program tju1000;
var
a,b:byte;
begin
read(a,b);
writeln(a+b);
end.