代码搜索结果
找到约 1,193 项符合
Q 的代码
ac1264.pas
{$Q-,R-}
program tju1264;
const
maxn=1000000;
var
d:array[1..maxn]of word;
bq,sq:array[1..maxn]of longint;
n,k,i,bf,br,sf,sr,head,ans,m:longint;
begin
repeat
read(n,k);
bf
ac1225.pas
{$Q-,R-}
program tju1225;
const
maxchange=100001;
treesize=524287;
root=treesize shr 1+1;
var
tree:array[1..treesize]of longint;
n,limit,delta{real minus stored},total,leave,i,k:long
ac1251.pas
{$Q-,R-}
program tju1251;
const
max=90;
var
key,letter:string[max];
freq:array[1..max]of longint;
sum,cost,cut:array[1..max,1..max]of longint;
k,l,i,j,e,f,x,t:longint;
procedure out
ac1250.pas
{$Q-,R-}
program tju1250;
const
maxn=1000;
bignumsize=99;
compress=15;
base=32768;
primes=42;
type
bignum=array[-1..bignumsize]of longint;
var
p:array[1..primes]of byte;
fi
ac1265.pas
{$Q-,R-}
program tju1265;
const
maxn=10000;
var
time,factor:array[0..maxn]of longint;
cost:array[0..maxn]of qword;
q:array[0..maxn]of word;
n,s,i,f,r:longint;
function slope(a,b:wor
ac1280.pas
{$Q-,R-}
program tju1280;
const
move:array[1..2,0..8]of byte=((3,0,1,6,4,2,7,8,5),(0,1,2,5,3,4,6,7,8));
fact:array[1..9]of longint=(1,2,6,24,120,720,5040,40320,362880);
fact9=362880;
type
ac1273.pas
{$Q-,R-}
program tju1273;
const
maxn=100;
maxk=(maxn-1)*maxn shr 2;
modulo=10000;
var
s:array[1..maxn,-1..maxk]of word;
count:array[1..maxn]of word;
n,k:longint;
begin
for k:=
ac1276.pas
{$Q-,R-}
program tju1276;
const
maxv=127;
var
step:array[0..3,0..maxv]of word;
//first index: 0:1st cup empty; 1:1st cup full;
// 2:2st cup empty; 3:2st cup full;
q1,
ac1258.pas
{$Q-,R-}
program tju1258;
const
move:array[1..2,0..8]of byte=((1,2,5,0,4,8,3,6,7),(0,1,2,4,5,3,6,7,8));
fact:array[1..9]of longint=(1,2,6,24,120,720,5040,40320,362880);
fact9=362880;
type
ac1254.pas
{$Q-,$R-}
//Assuming no two routes share the same cost
program tju1254;
const
maxn=50;
zero=1e-6;
type
point=record x,y:real;end;
var
dot:array[-1..maxn*4]of point;
u:array[1..maxn