代码搜索：Random
找到约 10,000 项符合「Random」的源代码
代码结果 10,000
www.eeworm.com/read/172308/9714792
c subprogram.c
#include "stdio.h"
#include "head.h"
#include "math.h"
#include "malloc.h"
#include
//#include
#include
/*
function [n1,n2]=gngauss(m,sgma)
% [n1 n2]=gngauss
www.eeworm.com/read/172308/9714808
c subprogram.c
#include "stdio.h"
#include "head.h"
#include "math.h"
#include "malloc.h"
#include "stdlib.h"
#include "time.h"
/*
function [n1,n2]=gngauss(m,sgma)
% [n1 n2]=gngauss(m,sgma)
% [n1 n2]=gnga
www.eeworm.com/read/368025/9719151
java abstractleaderai.java
package lib;
import java.util.Random;
import java.util.Date;
import lib.*;
public class abstractLeaderAI {
static final int flagNothing = 0; // ぃ
www.eeworm.com/read/172145/9722854
java powerup.java
import java.awt.*;
public class powerup{
private int xPos;
private int yPos;
private int function;
private Rectangle Powerup;
private int display = 0;
private int displaytime;
publi
www.eeworm.com/read/172145/9722861
java enemy4.java
import java.awt.*;
public class Enemy4{
// control varibles
private final int UP = 0;
private final int DOWN = 1;
private final int LEFT = 2;
private final int RIGHT = 3;
// Physical in
www.eeworm.com/read/172145/9722869
java bigbomb.java
import java.awt.*;
public class bigBomb{
private int xPos, yPos;
private int timeofbomb = 6;
public bigBomb(int a, int b){
xPos = a;
yPos = b;
}
public void draw(Graphics g){
www.eeworm.com/read/172145/9722873
java enemy3.java
import java.awt.*;
public class Enemy3{
// control varibles
private final int UP = 0;
private final int DOWN = 1;
private final int LEFT = 2;
private final int RIGHT = 3;
// Physical in
www.eeworm.com/read/172145/9722875
java smallbomb.java
import java.awt.*;
public class smallBomb{
private int xPos, yPos;
private int timeofbomb = 3;
public smallBomb(Point a){
xPos = a.x;
yPos = a.y;
}
public void draw(Graphics g){
www.eeworm.com/read/172140/9723443
java shellsort.java
/**
* @version 1.20 27 Mar 1998
* @author Cay Horstmann
*/
public class ShellSort
{ public static void sort(int[] a)
{ int n = a.length;
int incr = n / 2;
while (incr >=