Regarding JAR files.

Question

Dear sir,
I have given the following coding as an assignment from my college.Please help me to solve it.I have to submit in few days. please reply me as soon as possible.
And assignment is:
h3. Problem Statement
You are trapped in a room full of zombies. Luckily the room is pitch black and, while the zombies can't see, you have night vision goggles. To get out though you will have to be careful, since bumping into a zombie is hazardous to your health.
More specifically, each zombie will have x and y coordinates between 0 and 99 inclusive. You start at (0,0). If you can get to (99,99), you can take an elevator to safety. You may not leave the room any other way. Get there as fast as you can!
You must implement a method move. This method takes two int[]s, zx and zy, giving the locations of all the zombies, along with ints x and y giving your location. Your method should return "S" to stand still, or "R", "L", "U", or "D" for the four cardinal directions, and "RU", "RD", "LU", or "LD" for the four diagonal directions: {noformat} LU U RU
L S R
LD D RD
{noformat}Moving right increases your x coordinate, while moving down increases your y coordinate.
After each of your moves, the zombies will all move randomly. Each zombie will chose a random direction (from the 9 including no move) and attempt to move in that direction. If a zombie wants to move outside of the box defined by (0,0)-(99,99) it will stay where it is instead. Note that while the initial locations of all the zombies are distinct, they will not stay that way -- multiple zombies may occupy the same location.
Each test case will be generated by first choosing a zombie density in [0.05,0.15]. All locations with x or y at least 5 will then contain one initial zombie with probability equal to the density.
The simulation will be run for a maximum of 10,000 time steps. You may run into zombies at most 10 times -- the 11th one will kill you. If you fail to reach the exit but you manage to stay alive for T time steps, your score will be T. If you make it to the exit at time T, your score will be 30000 - 2 * T plus 1000 per unused life. In other words, you have 10,000 steps to escape, and you get a bonus of 2 points for each time step you don't need to use. Your final score will simply be the average of your individual scores.
A simple is provided . To use it you need to write a program which communicates via standard IO. Your main method should first read in N, the number of zombies. For each call to move, you should read in N integers for zx, then N integers for zy, and finally two integers for x and y. You should simply output the move you would return. You can run it with something like: {noformat}java -jar Zombie.jar "java Zombie" -delay 1 -seed 1
{noformat}"java Zombie" is the executable, and should be replaced with whatever command will run your program. The -delay parameter sets the delay in milliseconds between moves. The -seed parameter specifies the random number generator seed (the examples are 1-10). There is also a -novis parameter which causes the simulation to be run with the visualization. Be careful not to output anything other than your moves to standard out. Standard error may be used for debugging purposes"
"CODING PROVIDED BY COLLEGE"
import java.util.*;
import javax.swing.*;
import java.io.*;
import java.security.*;
import java.awt.*;
import java.awt.event.*;
public class BrownianZombies extends JFrame{
int[] zx, zy;
int x, y;
int[] idx;
boolean[][] visited;
double p;
Random r;
int delay = 100;
boolean novis, history;
void generate(String seed){
try{
r = SecureRandom.getInstance("SHA1PRNG");
r.setSeed(Integer.parseInt(seed));
} catch (Exception e) {
e.printStackTrace();
int[] tx = new int[10000];
int[] ty = new int[10000];
idx = new int[10000];
visited = new boolean[100][100];
int ptr = 0;
p = r.nextDouble()*0.1+0.05;
for(int i = 0; i<idx.length; i++)idx[i] = i;
for(int i = 0; i<100; i++)for(int j = 0; j<100; j++){
if(i >= 5 || j >= 5)if(r.nextDouble() < p){
tx[ptr] = i;
ty[ptr] = j;
ptr++;
zx = new int[ptr];
zy = new int[ptr];
for(int i = 0 ;i<ptr; i++){
zx[i] = tx;
zy[i] = ty[i];
public void move(){
for(int i = 0; i<zx.length; i++){
int s = r.nextInt(i+1);
int t = idx[i];idx[i] = idx[s];idx[s] = t;
for(int i = 0; i<zx.length; i++){
int xx = zx[idx[i]] + r.nextInt(3) - 1;
int yy = zy[idx[i]] + r.nextInt(3) - 1;
if(xx < 100 && yy < 100 && xx >= 0 && yy >= 0){
zx[idx[i]] = xx;
zy[idx[i]] = yy;
int lives = 10;
int T;
public boolean ok(){
for(int i = 0; i<zx.length; i++)if(x == zx[i] && y == zy[i])lives--;
return lives >= 0;
public String checkData(String s){return "";}
public double runTest(String lt){
try{
int time = 10000;
generate(lt);
StringBuffer sb = new StringBuffer();
sb.append(zx.length).append('\n');
os.write(sb.toString().getBytes());
os.flush();
int score = 30000; T = 0;
if(history)visited[0][0] = true;
while((x != 99 || y != 99) && T < 10000){
T++;
sb.delete(0,sb.length());
sb.append(zx[0]);
for(int i = 1; i<zx.length; i++)
sb.append(' ').append(zx[i]);
sb.append('\n');
sb.append(zy[0]);
for(int i = 1; i<zy.length; i++)
sb.append(' ').append(zy[i]);
sb.append('\n').append(x).append(' ').append(y).append('\n');
os.write(sb.toString().getBytes());
os.flush();
String dir = input.next();
if(dir.equals("S")){
}else if(dir.equals("R")){
x++;
}else if(dir.equals("L")){
x--;
}else if(dir.equals("U")){
y--;
}else if(dir.equals("D")){
y++;
}else if(dir.equals("RU")){
x++;
y--;
}else if(dir.equals("LU")){
x--;
y--;
}else if(dir.equals("RD")){
x++;
y++;
}else if(dir.equals("LD")){
x--;
y++;
}else{
System.out.println("Invalid Direction: "+dir);
return 0;
if(x < 0)x = 0;
if(y < 0)y = 0;
if(x == 100)x = 99;
if(y == 100)y = 99;
if(!ok()){
System.out.println("Brains... Score = "+T);
return T;
move();
if(!ok()){
System.out.println("Brains... Score = "+T);
return T;
score -= 2;
if(!novis){
if(history)visited[x][y] = true;
repaint();
Thread.sleep(delay);
System.out.println("Score: "+(score + lives * 1000));
return score + (x != 99 || y != 99 ? 0 : lives * 1000);
}catch(Exception e){
e.printStackTrace();
return 0;
class Vis extends JPanel{
public void paint(Graphics g){
if(zx == null)return;
Graphics2D g2 = (Graphics2D)g;
g2.setColor(new Color(200,200,200));
g2.fillRect(0,0,getWidth(),getHeight());
Font f = new Font(g2.getFont().getName(),Font.PLAIN,20);
g2.setFont(f);
FontMetrics fm = g2.getFontMetrics();
int th = fm.getAscent();
int mul = Math.max(1,Math.min((getWidth()-1)/100,(getHeight()-1-2*th)/100));
int[][] cnt = new int[100][100];
for(int i = 0; i<zx.length; i++){
cnt[zx[i]][zy[i]]++;
for(int i = 0; i<100; i++){
for(int j = 0; j<100; j++){
if(cnt[i][j] == 1)g.setColor(Color.red);
else if(cnt[i][j] > 1)g.setColor(Color.magenta);
else if(visited[i][j])g.setColor(Color.cyan);
else g.setColor(Color.white);
if(i == x && j == y)g.setColor(Color.blue);
g.fillRect(mul*i+1,2*th+mul*j+1,mul,mul);
g2.setRenderingHint(RenderingHints.KEY_ANTIALIASING,RenderingHints.VALUE_ANTIALIAS_ON);
String txt = "Moves Made: "+T;
g.setColor(Color.black);
g.drawString(txt,0,th);
txt = "Lives left : "+lives;
g.drawString(txt,0,2*th);
static Process pr;
static Scanner input;
static InputStream error;
static DataOutputStream os;
public static void main(String[] args) throws IOException{
BrownianZombies b = new BrownianZombies();
String exec = null;
String seed = "1";
for(int i = 0; i<args.length; i++){
if(args[i].equals("-delay")){
b.delay = Integer.parseInt(args[++i]);
}else if(args[i].equals("-seed")){
seed = args[++i];
}else if(args[i].equals("-novis")){
b.novis = true;
}else if(args[i].equals("-history")){
b.history = true;
}else{
exec = args[i];
if(exec == null){
System.out.println("Please enter an executable");
System.exit(1);
//for(int i = 0; i<b.zx.length; i++){
//System.out.println(i+" "+b.zx[i]+" "+b.zy[i]);
if(!b.novis){
b.add(b.new Vis());
b.setSize(450,450);
b.setVisible(true);
b.addWindowListener(new Closer());
pr = Runtime.getRuntime().exec(args[0]);
input = new Scanner(pr.getInputStream());
error = pr.getErrorStream();
os = new DataOutputStream(pr.getOutputStream());
new ErrorReader().start();
b.runTest(seed);
pr.destroy();
public String displayTestCase(String s){
generate(s);
return "p = "+p;
public double[] score(double[][] d){
double[] ret = new double[d.length];
for(int i = 0; i<ret.length; i++)
for(int j = 0; j<d[0].length; j++)
ret[i] += d[i][j];
return ret;
static class ErrorReader extends Thread{
public void run(){
try{
byte[] ch = new byte[50000];
int read;
while((read = error.read(ch)) > 0){
String s = new String(ch,0,read);
//System.out.println("err: "+s+" "+s.endsWith("\n"));
System.out.print(s);
System.out.println();
}catch(Exception e){
//System.err.println("Failed to read from stderr");
static class Closer implements WindowListener{
public void windowActivated(WindowEvent e){}
public void windowDeactivated(WindowEvent e){}
public void windowOpened(WindowEvent e){}
public void windowClosing(WindowEvent e){
pr.destroy();
System.exit(0);
public void windowClosed(WindowEvent e){}
public void windowIconified(WindowEvent e) {}
public void windowDeiconified(WindowEvent e) {}

Answer 1

haytony, let me give you a word of advice. The more work you show, the more work the volunteers are often willing to give. For instance, if you've done a ton of research, wrote most of your own code but were stuck on specific points and posted this, the folks here will bend over backwards to lend you a strong hand to help you as much as possible.
If on the other hand, you simply post your entire assignment and don't show that you've done one speck of work, often we ignore you at best or ridicule you at worst.
C'mon, it's up to you. Step up to the plate and show us your work, and your worthiness for help. If you can prove yourself to be a hard-working studious type, then I personally will do all in my upmost to help you. If on the other hand you repeatedly spam these forums with pathetic attempts at getting others to do homework where there is absolutely no evidence that you have done a lick of work yourself, then I will ridicule, flame, and bother you to know end.
So which is it to be? Again, it's all up to you. Time to go to bat.