代码搜索结果
找到约 1,193 项符合
Q 的代码
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
ac1246.pas
{$Q-,R-}
program tju1246;
const
maxn=20;
var
a,s:array[0..maxn]of word;
cut,min:array[1..maxn,1..maxn]of word;
n,i,j,k,t:longint;
procedure dfs1(l,r:byte);
begin
if l=r then
q.m
function [y]=Qfunct(x)
%函数文件Qfunct.m用于求出理论误码率
y=(1/2)*erfc(x/sqrt(2));
q.txt
//***********************************程序设计者:028064107欧建斌******************************************//
import java.applet.*;
import java.lang.*;
import java.awt.*;
import java.util.*;
import java.aw
q.h
#define INIT_COUNTER 300
#define __KERNEL_CS 1