file_id
int64 1
250k
| content
stringlengths 0
562k
| repo
stringlengths 6
115
| path
stringlengths 1
147
|
|---|---|---|---|
446 | package multipleInheretance;
public interface A {
void color();
void price();
void model();
}
| prasiddhineupane/CoreJavaCode- | A.java |
447 | // Swapping 2 numbers
import java.util.Scanner;
public class A {
private static int num1;
private static int num2;
public static void main(String[] args) {
Scanner scannerObject = new Scanner(System.in);
try {
System.out.print("Enter a number...");
num1 = scannerObject.nextInt();
System.out.print("Enter another number...");
num2 = scannerObject.nextInt();
System.out.println("\nBefore swapping, the values are " + num1 + ", " + num2);
System.out.println("After swapping...");
firstWay(num1, num2);
secondWay(num1, num2);
thirdWay(num1, num2);
fourthWay(num1, num2);
fifthWay(num1, num2);
} catch(Exception e) {
System.out.println("\nError Occurred!!\n\n" + e + "\n\nEnter Integer Only and try again.\n");
main(args);
}
scannerObject.close();;
}
static void firstWay(int a, int b) {
int c = a; // c = 5
a = b; // a = 10
b = c; // b = 5
System.out.println(a + ", " + b);
}
static void secondWay(int a, int b) {
a = a + b; // a = 5 + 10 = 15
b = a - b; // b = 15 - 10 = 5
a = a - b; // a = 15 - 5 = 10
System.out.println(a + ", " + b);
}
static void thirdWay(int a, int b) {
a = a * b; // a = 5 * 10 = 50
b = a / b; // b = 50 / 10 = 5
a = a / b; // a = 50 / 5 = 10
System.out.println(a + ", " + b);
}
static void fourthWay(int a, int b) {
a = a ^ b; // a = 5 ^ 10 = 15
b = a ^ b; // b = 15 ^ 10 = 5
a = a ^ b; // a = 15 ^ 5 = 10
System.out.println(a + ", " + b);
}
static void fifthWay(int a, int b) {
b = a + b - ( a = b); // b = 5 + 10 - ( a = 10)
System.out.println(a + ", " + b);
}
} | Bishal-9/SDET-Java | A.java |
448 | import java.util.*;
class A{
A(){
System.out.println("A");
}
}
class B extends A{
B(){
System.out.println("B");
}
}
class C extends B {
int arr[]=new int[5];
IntArr(){
for(int i:arr){
i=0;
}
System.out.println("C");
}
void display(){
java.util.Arrays.sort(arr);
}
public static void main(String[] args){
C arr=new C();
arr.display();
}
}
| Annihilator544/bug-free-robot | C.java |
449 | package october100;
public class A
{
public static void main(String []args)
{
System.out.println("vishal rai");
}
}
| v900rai/BasicJavaProgram | A.java |
450 | public class A{
int ivar = 7;
void m1(){
System.out.print("A's m1, ");
}
void m2(){
System.out.print("A's m2, ");
}
void m3(){
System.out.print("A's m3, ");
}
}
class B extends A{
void m1(){
System.out.print("B's m1, ");
}
}
class C extends B{
void m3(){
System.out.print("C's m3, " + (ivar + 6));
}
}
public class Mixed2{
public static void main(String[] args){
A a = new();
B b = new B();
C c = new C();
A a2 = new C();
}
} | zinakalu/inheritance-polymorphism | A.java |
451 | import net.minecraft.client.Minecraft;
import org.lwjgl.opengl.GL11;
public class n {
private Minecraft a;
private dk b;
private float c;
private float d;
private acr e;
private sg f;
private int g;
public n(Minecraft minecraft) {
this.b = null;
this.c = 0.0F;
this.d = 0.0F;
this.e = new acr();
this.g = -1;
this.a = minecraft;
this.f = new sg(minecraft.q, minecraft.A, minecraft.p);
}
public void a(nq entityliving, dk itemstack, int i) {
GL11.glPushMatrix();
if (itemstack.c < 256 && acr.a(yy.k[itemstack.c].c())) {
GL11.glBindTexture(3553, this.a.p.b("/terrain.png"));
this.e.a(yy.k[itemstack.c], itemstack.i(), 1.0F);
} else {
if (itemstack.c < 256) {
GL11.glBindTexture(3553, this.a.p.b("/terrain.png"));
} else {
GL11.glBindTexture(3553, this.a.p.b("/gui/items.png"));
}
cv tessellator = cv.a;
int j = entityliving.a(itemstack, i);
float f = ((j % 16 * 16) + 0.0F) / 256.0F;
float f1 = ((j % 16 * 16) + 15.99F) / 256.0F;
float f2 = ((j / 16 * 16) + 0.0F) / 256.0F;
float f3 = ((j / 16 * 16) + 15.99F) / 256.0F;
float f4 = 0.0F;
float f5 = 0.3F;
GL11.glEnable(32826);
GL11.glTranslatef(-f4, -f5, 0.0F);
float f6 = 1.5F;
GL11.glScalef(f6, f6, f6);
GL11.glRotatef(50.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(335.0F, 0.0F, 0.0F, 1.0F);
GL11.glTranslatef(-0.9375F, -0.0625F, 0.0F);
a(tessellator, f1, f2, f, f3);
if (itemstack != null && itemstack.r() && i == 0) {
GL11.glDepthFunc(514);
GL11.glDisable(2896);
this.a.p.b(this.a.p.b("%blur%/misc/glint.png"));
GL11.glEnable(3042);
GL11.glBlendFunc(768, 1);
float f7 = 0.76F;
GL11.glColor4f(0.5F * f7, 0.25F * f7, 0.8F * f7, 1.0F);
GL11.glMatrixMode(5890);
GL11.glPushMatrix();
float f8 = 0.125F;
GL11.glScalef(f8, f8, f8);
float f9 = (float)(System.currentTimeMillis() % 3000L) / 3000.0F * 8.0F;
GL11.glTranslatef(f9, 0.0F, 0.0F);
GL11.glRotatef(-50.0F, 0.0F, 0.0F, 1.0F);
a(tessellator, 0.0F, 0.0F, 1.0F, 1.0F);
GL11.glPopMatrix();
GL11.glPushMatrix();
GL11.glScalef(f8, f8, f8);
f9 = (float)(System.currentTimeMillis() % 4873L) / 4873.0F * 8.0F;
GL11.glTranslatef(-f9, 0.0F, 0.0F);
GL11.glRotatef(10.0F, 0.0F, 0.0F, 1.0F);
a(tessellator, 0.0F, 0.0F, 1.0F, 1.0F);
GL11.glPopMatrix();
GL11.glMatrixMode(5888);
GL11.glDisable(3042);
GL11.glEnable(2896);
GL11.glDepthFunc(515);
}
GL11.glDisable(32826);
}
GL11.glPopMatrix();
}
private void a(cv tessellator, float f, float f1, float f2, float f3) {
float f4 = 1.0F;
float f5 = 0.0625F;
tessellator.b();
tessellator.b(0.0F, 0.0F, 1.0F);
tessellator.a(0.0D, 0.0D, 0.0D, f, f3);
tessellator.a(f4, 0.0D, 0.0D, f2, f3);
tessellator.a(f4, 1.0D, 0.0D, f2, f1);
tessellator.a(0.0D, 1.0D, 0.0D, f, f1);
tessellator.a();
tessellator.b();
tessellator.b(0.0F, 0.0F, -1.0F);
tessellator.a(0.0D, 1.0D, (0.0F - f5), f, f1);
tessellator.a(f4, 1.0D, (0.0F - f5), f2, f1);
tessellator.a(f4, 0.0D, (0.0F - f5), f2, f3);
tessellator.a(0.0D, 0.0D, (0.0F - f5), f, f3);
tessellator.a();
tessellator.b();
tessellator.b(-1.0F, 0.0F, 0.0F);
for (int i = 0; i < 16; i++) {
float f6 = i / 16.0F;
float f10 = f + (f2 - f) * f6 - 0.001953125F;
float f14 = f4 * f6;
tessellator.a(f14, 0.0D, (0.0F - f5), f10, f3);
tessellator.a(f14, 0.0D, 0.0D, f10, f3);
tessellator.a(f14, 1.0D, 0.0D, f10, f1);
tessellator.a(f14, 1.0D, (0.0F - f5), f10, f1);
}
tessellator.a();
tessellator.b();
tessellator.b(1.0F, 0.0F, 0.0F);
for (int j = 0; j < 16; j++) {
float f7 = j / 16.0F;
float f11 = f + (f2 - f) * f7 - 0.001953125F;
float f15 = f4 * f7 + 0.0625F;
tessellator.a(f15, 1.0D, (0.0F - f5), f11, f1);
tessellator.a(f15, 1.0D, 0.0D, f11, f1);
tessellator.a(f15, 0.0D, 0.0D, f11, f3);
tessellator.a(f15, 0.0D, (0.0F - f5), f11, f3);
}
tessellator.a();
tessellator.b();
tessellator.b(0.0F, 1.0F, 0.0F);
for (int k = 0; k < 16; k++) {
float f8 = k / 16.0F;
float f12 = f3 + (f1 - f3) * f8 - 0.001953125F;
float f16 = f4 * f8 + 0.0625F;
tessellator.a(0.0D, f16, 0.0D, f, f12);
tessellator.a(f4, f16, 0.0D, f2, f12);
tessellator.a(f4, f16, (0.0F - f5), f2, f12);
tessellator.a(0.0D, f16, (0.0F - f5), f, f12);
}
tessellator.a();
tessellator.b();
tessellator.b(0.0F, -1.0F, 0.0F);
for (int l = 0; l < 16; l++) {
float f9 = l / 16.0F;
float f13 = f3 + (f1 - f3) * f9 - 0.001953125F;
float f17 = f4 * f9;
tessellator.a(f4, f17, 0.0D, f2, f13);
tessellator.a(0.0D, f17, 0.0D, f, f13);
tessellator.a(0.0D, f17, (0.0F - f5), f, f13);
tessellator.a(f4, f17, (0.0F - f5), f2, f13);
}
tessellator.a();
}
public void a(float f) {
float f1 = this.d + (this.c - this.d) * f;
di entityplayersp = this.a.h;
float f2 = ((vi)entityplayersp).B + (((vi)entityplayersp).z - ((vi)entityplayersp).B) * f;
GL11.glPushMatrix();
GL11.glRotatef(f2, 1.0F, 0.0F, 0.0F);
GL11.glRotatef(((vi)entityplayersp).A + (((vi)entityplayersp).y - ((vi)entityplayersp).A) * f, 0.0F, 1.0F, 0.0F);
rt.b();
GL11.glPopMatrix();
if (entityplayersp instanceof di && ((Boolean)mod_noBiomesX.NoItemSway.get()).booleanValue()) {
di entityplayersp1 = entityplayersp;
float f3 = entityplayersp1.i + (entityplayersp1.g - entityplayersp1.i) * f;
float f5 = entityplayersp1.h + (entityplayersp1.f - entityplayersp1.h) * f;
GL11.glRotatef((((vi)entityplayersp).z - f3) * 0.1F, 1.0F, 0.0F, 0.0F);
GL11.glRotatef((((vi)entityplayersp).y - f5) * 0.1F, 0.0F, 1.0F, 0.0F);
}
dk itemstack = this.b;
float f4 = this.a.f.c(me.c(((vi)entityplayersp).s), me.c(((vi)entityplayersp).t), me.c(((vi)entityplayersp).u));
f4 = 1.0F;
int i = this.a.f.a(me.c(((vi)entityplayersp).s), me.c(((vi)entityplayersp).t), me.c(((vi)entityplayersp).u), 0);
int k = i % 65536;
int l = i / 65536;
adx.a(adx.b, k / 1.0F, l / 1.0F);
GL11.glColor4f(1.0F, 1.0F, 1.0F, 1.0F);
if (itemstack != null) {
int j = acy.d[itemstack.c].c(itemstack.i());
float f9 = (j >> 16 & 0xFF) / 255.0F;
float f14 = (j >> 8 & 0xFF) / 255.0F;
float f20 = (j & 0xFF) / 255.0F;
GL11.glColor4f(f4 * f9, f4 * f14, f4 * f20, 1.0F);
} else {
GL11.glColor4f(f4, f4, f4, 1.0F);
}
if (itemstack != null && itemstack.c == acy.bc.bM) {
GL11.glPushMatrix();
float f6 = 0.8F;
float f10 = entityplayersp.d(f);
float f15 = me.a(f10 * 3.141593F);
float f21 = me.a(me.c(f10) * 3.141593F);
GL11.glTranslatef(-f21 * 0.4F, me.a(me.c(f10) * 3.141593F * 2.0F) * 0.2F, -f15 * 0.2F);
f10 = 1.0F - f2 / 45.0F + 0.1F;
if (f10 < 0.0F)
f10 = 0.0F;
if (f10 > 1.0F)
f10 = 1.0F;
f10 = -me.b(f10 * 3.141593F) * 0.5F + 0.5F;
GL11.glTranslatef(0.0F, 0.0F * f6 - (1.0F - f1) * 1.2F - f10 * 0.5F + 0.04F, -0.9F * f6);
GL11.glRotatef(90.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(f10 * -85.0F, 0.0F, 0.0F, 1.0F);
GL11.glEnable(32826);
GL11.glBindTexture(3553, this.a.p.a(this.a.h.ad, this.a.h.I()));
for (f15 = 0.0F; f15 < 2.0F; f15++) {
f21 = f15 * 2.0F - 1.0F;
GL11.glPushMatrix();
GL11.glTranslatef(-0.0F, -0.6F, 1.1F * f21);
GL11.glRotatef(-45.0F * f21, 1.0F, 0.0F, 0.0F);
GL11.glRotatef(-90.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(59.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(-65.0F * f21, 0.0F, 1.0F, 0.0F);
rg render1 = wb.a.a((ia)this.a.h);
zr renderplayer1 = (zr)render1;
float f32 = 1.0F;
GL11.glScalef(f32, f32, f32);
renderplayer1.b();
GL11.glPopMatrix();
}
f15 = entityplayersp.d(f);
f21 = me.a(f15 * f15 * 3.141593F);
float f27 = me.a(me.c(f15) * 3.141593F);
GL11.glRotatef(-f21 * 20.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(-f27 * 20.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(-f27 * 80.0F, 1.0F, 0.0F, 0.0F);
f15 = 0.38F;
GL11.glScalef(f15, f15, f15);
GL11.glRotatef(90.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(180.0F, 0.0F, 0.0F, 1.0F);
GL11.glTranslatef(-1.0F, -1.0F, 0.0F);
f21 = 0.015625F;
GL11.glScalef(f21, f21, f21);
this.a.p.b(this.a.p.b("/misc/mapbg.png"));
cv tessellator = cv.a;
GL11.glNormal3f(0.0F, 0.0F, -1.0F);
tessellator.b();
byte byte0 = 7;
tessellator.a((0 - byte0), (128 + byte0), 0.0D, 0.0D, 1.0D);
tessellator.a((128 + byte0), (128 + byte0), 0.0D, 1.0D, 1.0D);
tessellator.a((128 + byte0), (0 - byte0), 0.0D, 1.0D, 0.0D);
tessellator.a((0 - byte0), (0 - byte0), 0.0D, 0.0D, 0.0D);
tessellator.a();
kl mapdata = acy.bc.a(itemstack, this.a.f);
this.f.a((vi)this.a.h, this.a.p, mapdata);
GL11.glPopMatrix();
} else if (itemstack != null) {
GL11.glPushMatrix();
float f7 = 0.8F;
if (entityplayersp.ay() > 0) {
ps enumaction = itemstack.m();
if (enumaction == ps.b || enumaction == ps.c) {
float f16 = entityplayersp.ay() - f + 1.0F;
float f22 = 1.0F - f16 / itemstack.l();
float f28 = f22;
float f30 = 1.0F - f28;
f30 = f30 * f30 * f30;
f30 = f30 * f30 * f30;
f30 = f30 * f30 * f30;
float f33 = 1.0F - f30;
GL11.glTranslatef(0.0F, me.e(me.b(f16 / 4.0F * 3.141593F) * 0.1F) * ((f28 <= 0.2D) ? false : true), 0.0F);
GL11.glTranslatef(f33 * 0.6F, -f33 * 0.5F, 0.0F);
GL11.glRotatef(f33 * 90.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(f33 * 10.0F, 1.0F, 0.0F, 0.0F);
GL11.glRotatef(f33 * 30.0F, 0.0F, 0.0F, 1.0F);
}
} else {
float f11 = entityplayersp.d(f);
float f17 = me.a(f11 * 3.141593F);
float f23 = me.a(me.c(f11) * 3.141593F);
GL11.glTranslatef(-f23 * 0.4F, me.a(me.c(f11) * 3.141593F * 2.0F) * 0.2F, -f17 * 0.2F);
}
GL11.glTranslatef(0.7F * f7, -0.65F * f7 - (1.0F - f1) * 0.6F, -0.9F * f7);
GL11.glRotatef(45.0F, 0.0F, 1.0F, 0.0F);
GL11.glEnable(32826);
float f12 = entityplayersp.d(f);
float f18 = me.a(f12 * f12 * 3.141593F);
float f24 = me.a(me.c(f12) * 3.141593F);
GL11.glRotatef(-f18 * 20.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(-f24 * 20.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(-f24 * 80.0F, 1.0F, 0.0F, 0.0F);
f12 = 0.4F;
GL11.glScalef(f12, f12, f12);
if (entityplayersp.ay() > 0) {
ps enumaction1 = itemstack.m();
if (enumaction1 == ps.d) {
GL11.glTranslatef(-0.5F, 0.2F, 0.0F);
GL11.glRotatef(30.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(-80.0F, 1.0F, 0.0F, 0.0F);
GL11.glRotatef(60.0F, 0.0F, 1.0F, 0.0F);
} else if (enumaction1 == ps.e) {
GL11.glRotatef(-18.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(-12.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(-8.0F, 1.0F, 0.0F, 0.0F);
GL11.glTranslatef(-0.9F, 0.2F, 0.0F);
float f25 = itemstack.l() - entityplayersp.ay() - f + 1.0F;
float f29 = f25 / 20.0F;
f29 = (f29 * f29 + f29 * 2.0F) / 3.0F;
if (f29 > 1.0F)
f29 = 1.0F;
if (f29 > 0.1F)
GL11.glTranslatef(0.0F, me.a((f25 - 0.1F) * 1.3F) * 0.01F * (f29 - 0.1F), 0.0F);
GL11.glTranslatef(0.0F, 0.0F, f29 * 0.1F);
GL11.glRotatef(-335.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(-50.0F, 0.0F, 1.0F, 0.0F);
GL11.glTranslatef(0.0F, 0.5F, 0.0F);
float f31 = 1.0F + f29 * 0.2F;
GL11.glScalef(1.0F, 1.0F, f31);
GL11.glTranslatef(0.0F, -0.5F, 0.0F);
GL11.glRotatef(50.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(335.0F, 0.0F, 0.0F, 1.0F);
}
}
if (itemstack.a().b())
GL11.glRotatef(180.0F, 0.0F, 1.0F, 0.0F);
if (itemstack.c == acy.br.bM) {
a((nq)entityplayersp, itemstack, 0);
GL11.glColor4f(f4, f4, f4, 1.0F);
a((nq)entityplayersp, itemstack, 1);
} else {
a((nq)entityplayersp, itemstack, 0);
}
GL11.glPopMatrix();
} else {
GL11.glPushMatrix();
float f8 = 0.8F;
float f13 = entityplayersp.d(f);
float f19 = me.a(f13 * 3.141593F);
float f26 = me.a(me.c(f13) * 3.141593F);
GL11.glTranslatef(-f26 * 0.3F, me.a(me.c(f13) * 3.141593F * 2.0F) * 0.4F, -f19 * 0.4F);
GL11.glTranslatef(0.8F * f8, -0.75F * f8 - (1.0F - f1) * 0.6F, -0.9F * f8);
GL11.glRotatef(45.0F, 0.0F, 1.0F, 0.0F);
GL11.glEnable(32826);
f13 = entityplayersp.d(f);
f19 = me.a(f13 * f13 * 3.141593F);
f26 = me.a(me.c(f13) * 3.141593F);
GL11.glRotatef(f26 * 70.0F, 0.0F, 1.0F, 0.0F);
GL11.glRotatef(-f19 * 20.0F, 0.0F, 0.0F, 1.0F);
GL11.glBindTexture(3553, this.a.p.a(this.a.h.ad, this.a.h.I()));
GL11.glTranslatef(-1.0F, 3.6F, 3.5F);
GL11.glRotatef(120.0F, 0.0F, 0.0F, 1.0F);
GL11.glRotatef(200.0F, 1.0F, 0.0F, 0.0F);
GL11.glRotatef(-135.0F, 0.0F, 1.0F, 0.0F);
GL11.glScalef(1.0F, 1.0F, 1.0F);
GL11.glTranslatef(5.6F, 0.0F, 0.0F);
rg render = wb.a.a((ia)this.a.h);
zr renderplayer = (zr)render;
f26 = 1.0F;
GL11.glScalef(f26, f26, f26);
renderplayer.b();
GL11.glPopMatrix();
}
GL11.glDisable(32826);
rt.a();
}
public void b(float f) {
GL11.glDisable(3008);
if (this.a.h.V()) {
int i = this.a.p.b("/terrain.png");
GL11.glBindTexture(3553, i);
d(f);
}
if (this.a.h.L()) {
int j = me.c(this.a.h.s);
int l = me.c(this.a.h.t);
int i1 = me.c(this.a.h.u);
int j1 = this.a.p.b("/terrain.png");
GL11.glBindTexture(3553, j1);
int k1 = this.a.f.a(j, l, i1);
if (this.a.f.g(j, l, i1)) {
a(f, yy.k[k1].b(2));
} else {
for (int l1 = 0; l1 < 8; l1++) {
float f1 = (((l1 >> 0) % 2) - 0.5F) * this.a.h.M * 0.9F;
float f2 = (((l1 >> 1) % 2) - 0.5F) * this.a.h.N * 0.2F;
float f3 = (((l1 >> 2) % 2) - 0.5F) * this.a.h.M * 0.9F;
int i2 = me.d(j + f1);
int j2 = me.d(l + f2);
int k2 = me.d(i1 + f3);
if (this.a.f.g(i2, j2, k2))
k1 = this.a.f.a(i2, j2, k2);
}
}
if (yy.k[k1] != null)
a(f, yy.k[k1].b(2));
}
if (this.a.h.a(p.g)) {
int k = this.a.p.b("/misc/water.png");
GL11.glBindTexture(3553, k);
c(f);
}
GL11.glEnable(3008);
}
private void a(float f, int i) {
cv tessellator = cv.a;
float f1 = this.a.h.b(f);
f1 = 0.1F;
GL11.glColor4f(f1, f1, f1, 0.5F);
GL11.glPushMatrix();
float f2 = -1.0F;
float f3 = 1.0F;
float f4 = -1.0F;
float f5 = 1.0F;
float f6 = -0.5F;
float f7 = 0.0078125F;
float f8 = (i % 16) / 256.0F - f7;
float f9 = ((i % 16) + 15.99F) / 256.0F + f7;
float f10 = (i / 16) / 256.0F - f7;
float f11 = ((i / 16) + 15.99F) / 256.0F + f7;
tessellator.b();
tessellator.a(f2, f4, f6, f9, f11);
tessellator.a(f3, f4, f6, f8, f11);
tessellator.a(f3, f5, f6, f8, f10);
tessellator.a(f2, f5, f6, f9, f10);
tessellator.a();
GL11.glPopMatrix();
GL11.glColor4f(1.0F, 1.0F, 1.0F, 1.0F);
}
private void c(float f) {
cv tessellator = cv.a;
float f1 = this.a.h.b(f);
GL11.glColor4f(f1, f1, f1, 0.5F);
GL11.glEnable(3042);
GL11.glBlendFunc(770, 771);
GL11.glPushMatrix();
float f2 = 4.0F;
float f3 = -1.0F;
float f4 = 1.0F;
float f5 = -1.0F;
float f6 = 1.0F;
float f7 = -0.5F;
float f8 = -this.a.h.y / 64.0F;
float f9 = this.a.h.z / 64.0F;
tessellator.b();
tessellator.a(f3, f5, f7, (f2 + f8), (f2 + f9));
tessellator.a(f4, f5, f7, (0.0F + f8), (f2 + f9));
tessellator.a(f4, f6, f7, (0.0F + f8), (0.0F + f9));
tessellator.a(f3, f6, f7, (f2 + f8), (0.0F + f9));
tessellator.a();
GL11.glPopMatrix();
GL11.glColor4f(1.0F, 1.0F, 1.0F, 1.0F);
GL11.glDisable(3042);
}
private void d(float f) {
cv tessellator = cv.a;
GL11.glColor4f(1.0F, 1.0F, 1.0F, 0.9F);
GL11.glEnable(3042);
GL11.glBlendFunc(770, 771);
float f1 = 1.0F;
for (int i = 0; i < 2; i++) {
GL11.glPushMatrix();
int j = yy.ar.bL + i * 16;
int k = (j & 0xF) << 4;
int l = j & 0xF0;
float f2 = k / 256.0F;
float f3 = (k + 15.99F) / 256.0F;
float f4 = l / 256.0F;
float f5 = (l + 15.99F) / 256.0F;
float f6 = (0.0F - f1) / 2.0F;
float f7 = f6 + f1;
float f8 = 0.0F - f1 / 2.0F;
float f9 = f8 + f1;
float f10 = -0.5F;
GL11.glTranslatef(-(i * 2 - 1) * 0.24F, -0.3F, 0.0F);
GL11.glRotatef((i * 2 - 1) * 10.0F, 0.0F, 1.0F, 0.0F);
tessellator.b();
tessellator.a(f6, f8, f10, f3, f5);
tessellator.a(f7, f8, f10, f2, f5);
tessellator.a(f7, f9, f10, f2, f4);
tessellator.a(f6, f9, f10, f3, f4);
tessellator.a();
GL11.glPopMatrix();
}
GL11.glColor4f(1.0F, 1.0F, 1.0F, 1.0F);
GL11.glDisable(3042);
}
public void a() {
this.d = this.c;
di entityplayersp = this.a.h;
dk itemstack = ((vi)entityplayersp).by.a();
dk itemstack1 = itemstack;
boolean flag = (this.g == ((vi)entityplayersp).by.c && itemstack1 == this.b);
if (this.b == null && itemstack1 == null)
flag = true;
if (itemstack1 != null && this.b != null && itemstack1 != this.b && itemstack1.c == this.b.c && itemstack1.i() == this.b.i()) {
this.b = itemstack1;
flag = true;
}
float f = 0.4F;
float f1 = flag ? 1.0F : 0.0F;
float f2 = f1 - this.c;
if (f2 < -f)
f2 = -f;
if (f2 > f)
f2 = f;
this.c += f2;
if (this.c < 0.1F) {
this.b = itemstack1;
this.g = ((vi)entityplayersp).by.c;
}
}
public void b() {
this.c = 0.0F;
}
public void c() {
this.c = 0.0F;
}
}
| JohnCartoonist/The-Nostalgia-Project-src | n.java |
452 | import java.util.Collections;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import net.minecraft.server.MinecraftServer;
public class q
extends i
{
public static final Pattern a = Pattern.compile("^([01]?\\d\\d?|2[0-4]\\d|25[0-5])\\.([01]?\\d\\d?|2[0-4]\\d|25[0-5])\\.([01]?\\d\\d?|2[0-4]\\d|25[0-5])\\.([01]?\\d\\d?|2[0-4]\\d|25[0-5])$");
public String c()
{
return "ban-ip";
}
public int a()
{
return 3;
}
public boolean a(MinecraftServer ☃, m ☃)
{
return (☃.al().i().b()) && (super.a(☃, ☃));
}
public String b(m ☃)
{
return "commands.banip.usage";
}
public void a(MinecraftServer ☃, m ☃, String[] ☃)
throws bz
{
if ((☃.length < 1) || (☃[0].length() <= 1)) {
throw new cf("commands.banip.usage", new Object[0]);
}
eu ☃ = ☃.length >= 2 ? a(☃, ☃, 1) : null;
Matcher ☃ = a.matcher(☃[0]);
if (☃.matches())
{
a(☃, ☃, ☃[0], ☃ == null ? null : ☃.c());
}
else
{
lr ☃ = ☃.al().a(☃[0]);
if (☃ == null) {
throw new cd("commands.banip.invalid", new Object[0]);
}
a(☃, ☃, ☃.A(), ☃ == null ? null : ☃.c());
}
}
public List<String> a(MinecraftServer ☃, m ☃, String[] ☃, cj ☃)
{
if (☃.length == 1) {
return a(☃, ☃.J());
}
return Collections.emptyList();
}
protected void a(MinecraftServer ☃, m ☃, String ☃, String ☃)
{
mk ☃ = new mk(☃, null, ☃.h_(), null, ☃);
☃.al().i().a(☃);
List<lr> ☃ = ☃.al().b(☃);
String[] ☃ = new String[☃.size()];
int ☃ = 0;
for (lr ☃ : ☃)
{
☃.a.c("You have been IP banned.");
☃[(☃++)] = ☃.h_();
}
if (☃.isEmpty()) {
a(☃, this, "commands.banip.success", new Object[] { ☃ });
} else {
a(☃, this, "commands.banip.success.players", new Object[] { ☃, a(☃) });
}
}
}
| MCLabyMod/LabyMod-1.9 | q.java |
453 | package keyword;
//this is about this keyword in java
//this is calling by current object inside a method and constructor
/*class C {
void show() {
System.out.println(this);
}
public static void main(String[] args) {
C r = new C();
System.out.println(r);
r.show();
}
}*/
//this is doing with the help of instance and local variable....
class A {
int a;
A(int a) {
this.a = a;
// System.out.println(a);
}
void show() {
System.out.println(a);
}
public static void main(String[] args) {
A r = new A(100);
r.show();
}
}
| NaveenRaghav1/JAVA-PROGRAMS....2023 | C.java |
454 | class A
{
public static void main(String[] args)
{
System.out.println("hey");
}
}
public class B
{
public static void main(String[] args)
{
System.out.println("hi");
}
}
class C
{
public static void main(String[] args)
{
System.out.println("what");
}
} | puneethegde72/basics | B.java |
455 | class a
{
public static void main(String []arg)
{
System.out.println("hello world");
}
} | Vikash151098/java-program | a.java |
456 | class A{
float a;
int b;
void show()
{
a=27;
b=28;
}
A(A ref)
{
a=ref.a;
b=ref.b;
system.out.println("a");
system.out.println("b");
}
}
class B{
public static void main(string[] args){
A r=new A();
A r2=new A(r);
}
}
| ashie188/ashie188 | A.java |
457 | //ACHILLE Sagang Tanwouo AND Diane Niyibaruta
// In the first part I import the modul for enter the varaibles that we need for IMC
import java.util.Scanner;
// And I creat the class that we need for our method
public class A{
//creation of our method
public static void main(String[] args)
{
// we create an input which neccesaire to introduice the vraiable neccesary for IMC calcul
Scanner clavier = new Scanner(System.in);
System.out.println("enter your name here:");
String name= clavier.nextLine();
//we ask to the system to print to the user the information
System.out.println("enter your weight please :");
float weight= clavier.nextFloat();
System.out.println("enter your height in cm please:");
float height= clavier.nextFloat();
//Here we use the IMC formula .
float division= weight / (height * height);
System.out.println( name+ " your MBI is "+ division );
//we make a condition here because when someone have a BMI> 30 He consider obesy
//so if during the calcul the person have a BMI>30 we have a print which indicate or not
if(division>=30)
{
System.out.println(" you are obesy");
}
else if (division < 30)
System.out.println("you have a good BMI");
//this methode is neccesary or is consisted to main class so is necesary to make work the class p.java
P pp= new P();
}
}
| alu-rwa-prog-2/assignment1-achille_diane | A.java |
458 | package constructor_Chaining;
public class A {
A(){
System.out.println("Constructor of A");
}
}
| amitkumar123456789/Java_project | A.java |
459 | public class A{
public static String s="Testing Junit 4.12";
public static void main (String[] args){
System.out.println(s);
}
}
/*
C:\Runner>javac -cp c:\Runner;junit-4.12.jar;hamcrest-core-1.3.jar;A.java ATest.java TestRunner.java
C:\Runner>java -cp c:\Runner;junit-4.12.jar;hamcrest-core-1.3.jar; TestRunner
Expected String: Testing Junit 4.12; Actual String: Testing Junit 4.12
All tests finished successful...
C:\Runner>
*/ | mtnview101/JUnit_TestRunner | A.java |
460 | public class j {
public String a;
public String b;
public String c;
public String d;
public String e;
public String f;
public String g;
public String h;
public String toString() {
return this.e + " " + this.g + " " + this.h + " " + this.c;
}
}
| GigaDroid/Decompiled-Whatsapp | j.java |
462 | class F {
int a;
double b;
String c;
F(){
a =10;
b = 45.56;
c = "learn";
}
F(int x){
a = x;
}
F(double y,String z){
b=y;
c = z;
}
}
class G{
public static void main(String[] args) {
F r = new F();
F r2 = new F(10);
F r3 = new F(23.89,"learn");
System.out.println(r.a+" "+r.b+" "+r.c);
System.out.println(r2.a);
System.out.println(r3.b+" "+r3.c);
}
}
| nagu18/Java | G.java |
463 | import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
public class A {
//This problem consisted of 20 nodes
// Time window violation costs:
int[] penalties = {40, 8, 7, 8, 9, 9, 9, 6, 8, 8, 9, 8, 7, 8, 7, 9, 7, 7, 6, 9};
//Time window settings used
int[] easyEarly = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int[] easyLate = {480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480, 480};
int[] mediumEarly = {0, 300, 0, 300, 300, 300, 0, 0, 0, 0, 300, 300, 300, 0, 300, 0, 300, 300, 300, 0};
int[] mediumLate = {480, 480, 180, 480, 480, 480, 180, 180, 180, 180, 480, 480, 480, 180, 480, 180, 480, 480, 480, 180};
int[] hardEarly = {0, 0, 300, 0, 60, 60, 360, 300, 300, 300, 0, 360, 0, 360, 360, 360, 0, 360, 360, 300};
int[] hardLate = {480, 120, 420, 120, 180, 180, 480, 420, 420, 420, 120, 480, 120, 480, 480, 480, 120, 480, 480, 420};
// cost of traveling using a taxi between pair nodes
double [][] taxiCost = {{1000.00,7.00,6.10,3.24,5.12,3.24,3.24,7.32,5.00,6.00,6.83,9.60,7.00,8.81,11.00,10.22,10.49,11.30,12.40 ,1000.00},
{7.00,1000.00,2.41,5.12,3.24,8.28,6.39,3.00,8.21,8.81,6.83,6.10,9.49,7.08,7.32,10.85,10.49,10.06,10.06 ,1000.00},
{6.10,2.41,1000.00,4.61,3.24,7.71,6.00,4.16,8.07,8.81,7.32,7.32,9.60,8.00,8.62,11.44,11.20,11.00,11.20 ,1000.00},
{3.24,5.12,4.61,1000.00,3.00,4.16,2.41,5.12,4.61,5.47,5.12,7.40,6.39,6.83,8.81,9.00,9.06,9.54,10.43 ,1000.00},
{5.12,3.24,3.24,3.00,1000.00,6.10,4.16,3.24,6.00,6.66,5.12,6.00,7.40,6.10,7.40,9.25,9.06,9.06,9.54 ,1000.00},
{3.24,8.28,7.71,4.16,6.10,1000.00,3.00,8.00,3.24,4.16,6.00,9.54,5.12,8.21,10.85,8.62,9.06,10.22,11.63 ,1000.00},
{3.24,6.39,6.00,2.41,4.16,3.00,1000.00,6.00,3.24,4.16,4.61,7.71,5.12,6.66,9.06,8.07,8.28,9.06,10.22 ,1000.00},
{7.32,3.00,4.16,5.12,3.24,8.00,6.00,1000.00,7.32,7.71,5.24,4.16,8.21,5.12,5.47,9.06,8.62,8.07,8.07 ,1000.00},
{5.00,8.21,8.07,4.61,6.00,3.24,3.24,7.32,1000.00,2.00,4.16,8.07,3.00,6.39,9.25,6.39,6.83,8.07,9.60 ,1000.00},
{6.00,8.81,8.81,5.47,6.66,4.16,4.16,7.71,2.00,1000.00,4.00,8.00,2.00,6.10,9.06,5.47,6.00,7.40,9.06 ,1000.00},
{6.83,6.83,7.32,5.12,5.12,6.00,4.61,5.24,4.16,4.00,1000.00,5.00,4.16,3.24,6.10,5.12,5.00,5.47,6.66 ,1000.00},
{9.60,6.10,7.32,7.40,6.00,9.54,7.71,4.16,8.07,8.00,5.00,1000.00,8.07,3.24,2.41,7.40,6.66,5.47,5.00 ,1000.00},
{7.00,9.49,9.60,6.39,7.40,5.12,5.12,8.21,3.00,2.00,4.16,8.07,1000.00,6.00,9.00,4.61,5.24,6.83,8.62 ,1000.00},
{8.81,7.08,8.00,6.83,6.10,8.21,6.66,5.12,6.39,6.10,3.24,3.24,6.00,1000.00,4.00,5.24,4.61,4.00,4.61 ,1000.00},
{11.00,7.32,8.62,8.81,7.40,10.85,9.06,5.47,9.25,9.06,6.10,2.41,9.00,4.00,1000.00,7.71,6.83,5.24,4.16 ,1000.00},
{10.22,10.85,11.44,9.00,9.25,8.62,8.07,9.06,6.39,5.47,5.12,7.40,4.61,5.24,7.71,1000.00,2.00,4.00,6.00 ,1000.00},
{10.49,10.49,11.20,9.06,9.06,9.06,8.28,8.62,6.83,6.00,5.00,6.66,5.24,4.61,6.83,2.00,1000.00,3.00,5.00 ,1000.00},
{11.30,10.06,11.00,9.54,9.06,10.22,9.06,8.07,8.07,7.40,5.47,5.47,6.83,4.00,5.24,4.00,3.00,1000.00,3.00 ,1000.00},
{12.40,10.06,11.20,10.43,9.54,11.63,10.22,8.07,9.60,9.06,6.66,5.00,8.62,4.61,4.16,6.00,5.00,3.00,1000.00 ,1.00},
{13.04,10.22,11.44,11.00,9.94,12.40,10.90,8.28,10.43,9.94,7.40,5.12,9.54,5.24,4.00,7.00,6.00,4.00,2.00 ,1000.00},
} ;
// time it takes to travel using a taxi between pair nodes
double [][] taxiTime = {{1000.00,35.00,29.74,13.04,24.05,13.04,13.04,36.89,23.33,29.17,34.01,50.18,35.00,45.56,58.33,53.78,55.34,60.06,66.51,70.24},
{35.00,1000.00,8.25,24.05,13.04,42.47,31.41,11.67,42.06,45.56,34.01,29.74,49.50,35.48,36.89,57.45,55.34,52.82,52.82,53.78},
{29.74,8.25,1000.00,21.03,13.04,39.13,29.17,18.45,41.25,45.56,36.89,36.89,50.18,40.83,44.43,60.90,59.49,58.33,59.49,60.90},
{13.04,24.05,21.03,1000.00,11.67,18.45,8.25,24.05,21.03,26.09,24.05,37.35,31.41,34.01,45.56,46.67,47.03,49.84,55.03,58.33},
{24.05,13.04,13.04,11.67,1000.00,29.74,18.45,13.04,29.17,33.00,24.05,29.17,37.35,29.74,37.35,48.10,47.03,47.03,49.84,52.17},
{13.04,42.47,39.13,18.45,29.74,1000.00,11.67,40.83,13.04,18.45,29.17,49.84,24.05,42.06,57.45,44.43,47.03,53.78,62.01,66.51},
{13.04,31.41,29.17,8.25,18.45,11.67,1000.00,29.17,13.04,18.45,21.03,39.13,24.05,33.00,47.03,41.25,42.47,47.03,53.78,57.75},
{36.89,11.67,18.45,24.05,13.04,40.83,29.17,1000.00,36.89,39.13,24.75,18.45,42.06,24.05,26.09,47.03,44.43,41.25,41.25,42.47},
{23.33,42.06,41.25,21.03,29.17,13.04,13.04,36.89,1000.00,5.83,18.45,41.25,11.67,31.41,48.10,31.41,34.01,41.25,50.18,55.03},
{29.17,45.56,45.56,26.09,33.00,18.45,18.45,39.13,5.83,1000.00,17.50,40.83,5.83,29.74,47.03,26.09,29.17,37.35,47.03,52.17},
{34.01,34.01,36.89,24.05,24.05,29.17,21.03,24.75,18.45,17.50,1000.00,23.33,18.45,13.04,29.74,24.05,23.33,26.09,33.00,37.35},
{50.18,29.74,36.89,37.35,29.17,49.84,39.13,18.45,41.25,40.83,23.33,1000.00,41.25,13.04,8.25,37.35,33.00,26.09,23.33,24.05},
{35.00,49.50,50.18,31.41,37.35,24.05,24.05,42.06,11.67,5.83,18.45,41.25,1000.00,29.17,46.67,21.03,24.75,34.01,44.43,49.84},
{45.56,35.48,40.83,34.01,29.74,42.06,33.00,24.05,31.41,29.74,13.04,13.04,29.17,1000.00,17.50,24.75,21.03,17.50,21.03,24.75},
{58.33,36.89,44.43,45.56,37.35,57.45,47.03,26.09,48.10,47.03,29.74,8.25,46.67,17.50,1000.00,39.13,34.01,24.75,18.45,17.50},
{53.78,57.45,60.90,46.67,48.10,44.43,41.25,47.03,31.41,26.09,24.05,37.35,21.03,24.75,39.13,1000.00,5.83,17.50,29.17,35.00},
{55.34,55.34,59.49,47.03,47.03,47.03,42.47,44.43,34.01,29.17,23.33,33.00,24.75,21.03,34.01,5.83,1000.00,11.67,23.33,29.17},
{60.06,52.82,58.33,49.84,47.03,53.78,47.03,41.25,41.25,37.35,26.09,26.09,34.01,17.50,24.75,17.50,11.67,1000.00,11.67,17.50},
{66.51,52.82,59.49,55.03,49.84,62.01,53.78,41.25,50.18,47.03,33.00,23.33,44.43,21.03,18.45,29.17,23.33,11.67,1000.00,5.83},
{70.24,53.78,60.90,58.33,52.17,66.51,57.75,42.47,55.03,52.17,37.35,24.05,49.84,24.75,17.50,35.00,29.17,17.50,5.83,1000.00},
};
// cost of traveling using a bus between pair nodes
double busCost[][] ={{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1.00,1000.00,1.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1.00,1.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1.00,1000.00},
};
// time it takes to travel using a taxi between pair nodes
double [][] busTime = {{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,26.09,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,16.50,1000.00,26.09,1000.00,1000.00,23.33,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,16.50,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,23.33,1000.00,1000.00,48.10,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,26.09,1000.00,23.33,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,23.33,1000.00,26.09,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{26.09,1000.00,1000.00,1000.00,1000.00,23.33,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,23.33,1000.00,48.10,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,26.09,1000.00,1000.00,1000.00,11.67,1000.00,1000.00,23.33,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,11.67,1000.00,1000.00,1000.00,11.67,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,46.67,1000.00,1000.00,59.49,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,46.67,1000.00,1000.00,1000.00,16.50,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,23.33,11.67,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,35.00,42.06,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,59.49,16.50,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,11.67,35.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,11.67,1000.00,23.33,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,35.00,1000.00,35.00,23.33,1000.00,1000.00,1000.00},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,42.06,1000.00,1000.00,1000.00,1000.00,1000.00,11.67},
{1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,1000.00,11.67,1000.00},
} ;
}
| AhmadBassaleh/Java-code-for-Data-for-the-Turkish-Cashier-Problem-with-Time-Windows-TCPwTW | A.java |
464 | public interface A{
int VAL = 12;
void foo();
void bar();
default void go(){
System.out.println("A: go");
}
static void printNameAndId(X x){
System.out.println(x.getId() + " : " + x.getName());
}
}
| thieryw/java-interface-demo | A.java |
465 | package inheritanceBasics;
public class A {
int i;
int j;
void showij() {
System.out.println("i and j is " + i + " " + j);
}
}
| drranjinips/Week5 | A.java |
466 | /*
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
*/
public class A {
private static long sum = 0;
public static void main(String[] args) {
for (int i = 3; i < 1000; i++) {
if (i % 3 == 0 || i % 5 == 0) sum += i;
}
System.out.println("The sum is " + sum);
}
} | Bishal-9/Project-Euler | A.java |
467 | class B {
public void p(double i) {
System.out.println(i * 2);
}
}
public class A extends B {
public void p(double i) {
System.out.println(i);
}
public static void main(String[] args) {
A a = new A();
a.p(10);
a.p(10.0);
}
}
| admvl/ESCOM_24-2_Compiladores | A.java |
468 | import java.io.ByteArrayInputStream;
import java.io.DataInputStream;
import java.awt.Image;
import java.awt.Graphics;
import java.awt.Rectangle;
import java.awt.Color;
import javax.imageio.ImageIO;
public class c {
public final int a;
public final int b;
private Image c;
private short[] d;
private short[] e;
private byte[] f;
private int[][] g = new int[16][];
private static int h = 43;
public static int[] i = null;
public c(String paramString) {
try {
DataInputStream localDataInputStream = new DataInputStream(getClass().getResourceAsStream(paramString));
localDataInputStream.readByte();
int j = localDataInputStream.readByte();
int k = localDataInputStream.readByte();
int m = localDataInputStream.readByte();
this.a = m;
this.b = (k >> 1);
char[] arrayOfChar = localDataInputStream.readUTF().toCharArray();
int n = arrayOfChar.length;
this.d = new short[n];
this.e = new short[n];
int[] arrayOfInt1 = new int[16];
for (int i1 = 0; i1 < n; i1++) {
char i2 = arrayOfChar[i1];
arrayOfInt1[(i2 & 0xF)] += 1;
}
for (int i2 = 0; i2 < 16; i2++)
this.g[i2] = new int[arrayOfInt1[i2] << 1];
arrayOfInt1 = new int[16];
for (int i3 = 0; i3 < n; i3++) {
char i4 = arrayOfChar[i3];
this.d[i3] = ((short)(i3 % j * k));
this.e[i3] = ((short)(i3 / j * m));
int i5 = i4 & 0xF;
int[] arrayOfInt2 = this.g[i5];
int i6 = arrayOfInt1[i5];
arrayOfInt2[i6] = i4;
arrayOfInt2[(i6 + 1)] = i3;
arrayOfInt1[i5] += 2;
}
this.f = new byte[n];
localDataInputStream.readFully(this.f);
int i4 = localDataInputStream.readInt();
byte[] arrayOfByte = new byte[i4];
localDataInputStream.readFully(arrayOfByte);
this.c = ImageIO.read(new ByteArrayInputStream(arrayOfByte));
localDataInputStream.close();
}
catch (Exception localException) {
localException.printStackTrace();
throw new IllegalArgumentException();
}
}
public String[] a(String paramString, int paramInt) {
String[] localObject = new String[10];
int j = 0;
int k = 10;
char[] arrayOfChar = paramString.toCharArray();
int m = 0;
int n = 0;
int i1 = 0;
int i2 = 0;
int i3 = 0;
int i4 = 0;
int i5 = 0;
int i6 = 0;
int i7 = 0;
label413:
while (i4 == 0) {
if (m == arrayOfChar.length) {
n = m;
i5 = 1;
i4 = 1;
if (i1 > m)
break label413;
}
else {
char c1 = arrayOfChar[m];
if (i6 != 0) {
if (c1 == 'n') {
i1 = m + 1;
}
else {
i5 = 1;
i7 = 1;
if ((c1 == 'i') || (c1 == 'g')) {
n = m + 3;
i1 = m - 1;
}
else {
n = m + 1;
i1 = m - 1;
}
i3 = 0;
}
i6 = 0;
}
else if (c1 == '\n') {
i5 = 1;
n = m;
i3 = 0;
}
else if (c1 == '\\') {
i6 = 1;
if ((i1 < m) || (arrayOfChar[(m + 1)] == 'n')) {
i5 = 1;
n = m;
i3 = 0;
}
}
else if (c1 == ' ') {
i2 += this.b;
n = m;
i3 = 0;
}
else {
int i9 = a(c1) + 0;
i3 += i9;
i2 += i9;
if (i2 > paramInt)
i5 = 1;
}
}
if (i5 != 0) {
if (j >= k) {
k += 5;
String[] arrayOfString1 = new String[k];
int i9 = localObject.length;
do {
i9--;
arrayOfString1[i9] = localObject[i9];
}
while (i9 > 0);
localObject = arrayOfString1;
}
int i8 = n <= i1 ? 1 : 0;
if (i8 != 0)
n = m;
localObject[j] = new String(arrayOfChar, i1, n - i1);
if ((i8 != 0) || (i7 != 0)) {
i1 = n;
i2 = 0;
}
else {
i1 = n + 1;
i2 = i3;
}
i5 = 0;
i7 = 0;
j++;
}
m++;
}
String[] arrayOfString2 = new String[j];
int i9 = j;
do {
i9--;
arrayOfString2[i9] = localObject[i9];
}
while (i9 > 0);
return arrayOfString2;
}
public int a(String paramString) {
return a(paramString.toCharArray(), 0, paramString.length());
}
public int a(char[] paramArrayOfChar, int paramInt1, int paramInt2) {
int j = 0;
int k = paramInt2;
do {
k--;
char c1 = paramArrayOfChar[paramInt1];
j += a(c1);
if ((c1 != ' ') && (k != 0))
j += 0;
paramInt1++;
}
while (k > 0);
return j;
}
public int a(char paramChar) {
if (paramChar == ' ')
return this.b;
int j = a((int)paramChar);
if (j == -1)
return 0;
return this.f[j];
}
private int a(int paramInt) {
int j = -1;
int[] arrayOfInt = this.g[(paramInt & 0xF)];
for (int k = arrayOfInt.length - 2; k >= 0; k -= 2) {
int m = arrayOfInt[k];
if (m == paramInt) {
j = arrayOfInt[(k + 1)];
break;
}
}
return j;
}
public void a(Graphics paramGraphics, String[] paramArrayOfString, int paramInt1, int paramInt2, int paramInt3) {
int j = paramArrayOfString.length;
for (int k = 0; k < j; k++) {
a(paramGraphics, paramArrayOfString[k].toCharArray(), paramInt1, paramInt2, paramInt3);
paramInt2 += this.a + 0;
}
}
public void a(Graphics paramGraphics, String paramString, int paramInt1, int paramInt2, int paramInt3) {
a(paramGraphics, paramString.toCharArray(), paramInt1, paramInt2, paramInt3);
}
public void a(Graphics paramGraphics, char[] paramArrayOfChar, int paramInt1, int paramInt2, int paramInt3) {
if ((paramInt3 & h) > 0) {
int j = a(paramArrayOfChar, 0, paramArrayOfChar.length);
if ((paramInt3 & 0x8) > 0)
paramInt1 -= j;
else if ((paramInt3 & 0x1) > 0)
paramInt1 -= j / 2;
if ((paramInt3 & 0x20) > 0)
paramInt2 -= this.a;
else if ((paramInt3 & 0x2) > 0)
paramInt2 -= this.a / 2;
}
a(paramGraphics, paramArrayOfChar, paramInt1, paramInt2);
}
private void a(Graphics paramGraphics, char[] paramArrayOfChar, int paramInt1, int paramInt2) {
Rectangle tmp = paramGraphics.getClipBounds();
int j = tmp.x;
int k = tmp.y;
int m = tmp.width;
int n = tmp.height;
int i1 = paramArrayOfChar.length;
int i2 = 0;
paramGraphics.setClip(j, k, m, n);
for (int i3 = 0; i3 < i1; i3++) {
int i4 = paramArrayOfChar[i3];
if (i != null)
i2 = i[i3];
if (i4 == 32) {
paramInt1 += this.b;
}
else {
int i5 = a(i4);
if (i5 != -1) {
int i6 = this.f[i5];
int i7 = paramInt2 + i2;
paramGraphics.clipRect(paramInt1, i7, i6, this.a);
paramGraphics.drawImage(this.c, paramInt1 - this.d[i5], i7 - this.e[i5], null); // Anchor: 20
paramGraphics.setClip(j, k, m, n);
paramInt1 += i6 + 0;
}
}
}
paramGraphics.setClip(j, k, m, n);
}
}
/* Location: /Users/ilya/4fun/Biplanes/Bluetooth_Biplanes.jar
* Qualified Name: c
* JD-Core Version: 0.6.2
*/ | TheRealPinkie/BT_Biplanes_src | c.java |
469 | package aboutObject01.object01.marchsixth;
public interface A {
void aboutA();
}
| Yxj00/Mytest1 | A.java |
470 | public class A extends null implements E {
private byte g = 1;
private long b = 1234;
public java.util.Set<Integer> ll() {
return new java.util.LinkedList<Integer>;
}
public void aa() {
return;
}
public java.util.Random mm() {
return new java.util.Random();
}
public java.lang.Class qq() {
return getClass();
}
public int af() {
return -1;
}
public byte oo() {
return 2;
}
public int cc() {
return 13;
}
public void ab() {
return;
}
public int af() {
return -1;
public void bb() {
System.out.println(42);
}
public long ac() {
return 111;
}
public String nn() {
"".>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.;
public long dd() {
return 100500;
}
public double ee() {
return 0.000001;
}
public Object gg() {
return return getClass().getClassLoader();
}
}
| Rvze/mispi-lab2 | A.java |
471 | public class A extends B{
private int data;
public A(int data){
//super(data);
this.data = data;
}
} | tran0095/MakeNoSense | A.java |
472 | package pck1.pck2.pck3;
public class A {
public static void main(String[] args){
Calculator c = new Calculator();
c.Cal();
}
}
| shaukat01/MyDailyProblemSolved | A.java |
473 | public class A {
public static void main(String[] args){
System.out.print(" \t****");
}
} | kasiaskrz/Software-Development-1 | A.java |
474 | class abc {
static int a = 10;
static void display() {
System.out.println("Hello world!" + a);
}
}
class n {
public static void main(String[] args) {
abc objAbc = new abc();
objAbc.display();
}
}
| Harsh-21-Vaghasiya/CodingQuestionsForPlacement | n.java |
475 | //Copy constructor
class D {
int a;
String b;
D() {
a = 10;
b = "Hello";
System.err.println(a + " " + b);
}
D(D ref) {
a = ref.a;
b = ref.b;
System.out.println(a + " " + b);
}
}
class E {
public static void main(String[] args) {
D r = new D();
D r2 = new D(r);
}
}
| priyanka2156/PracticeJava | E.java |
476 | // Sort array using built-in methods
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class W {
private static int arrayLength;
private static int[] array;
private static Integer[] a;
public static void main(String[] args) {
Scanner scannerObject = new Scanner(System.in);
try {
System.out.print("Enter array length: ");
arrayLength = scannerObject.nextInt();
a = new Integer[arrayLength];
array = new int[arrayLength];
for(int i = 0; i < arrayLength; i++) {
System.out.print("Enter array element: ");
a[i] = array[i] = scannerObject.nextInt();
}
System.out.print("\nYour entered array is " + Arrays.toString(array));
firstWay();
secondWay();
thirdWay();
} catch (Exception e) {
System.out.println("Error occurred!!\n" + e + "\nPlease enter valid number and try again.");
main(args);
}
scannerObject.close();
}
static void firstWay() {
Arrays.parallelSort(array);
System.out.print("\nSorted array using ParallelSort: " + Arrays.toString(array));
}
static void secondWay() {
Arrays.sort(array);
System.out.print("\nSorted array using Sort: " + Arrays.toString(array));
}
static void thirdWay() {
Arrays.sort(a, Collections.reverseOrder());
System.out.print("\nSorted array in descending order using Sort: " + Arrays.toString(a));
}
}
| Bishal-9/SDET-Java | W.java |
477 | class P{
int a = 1;
void show(){
System.out.println("P Show");
}
}
class C extends P{
int a = 2;
@Override
void show(){
System.out.println("C Show");
}
}
abstract class demo{
int a = 10;
demo(){
a = 20;
}
//abstract final void disp(); // Compile Fail
}
public class D {
public static void main(String[] args) {
//C c = new C();
P c = new C(); // Upcasting
System.out.println(c.a); // Variable Access
c.show(); // Fn Access
}
}
| brainmentorspvtltd/DIT-Java-Batch3 | D.java |
478 | class A {
int xyz;
void kali(int xyz) {
int mn;
this.xyz = xyz;
System.out.println(this.xyz);
}
public static void main(String[] args) {
A obj1 = new A();
obj1.kali(23);
}
}
| rohitsingh45/Java-Codes | A.java |
479 | import com.mojang.authlib.GameProfile;
import java.util.List;
import net.minecraft.server.MinecraftServer;
public class r
extends i
{
public String c()
{
return "ban";
}
public int a()
{
return 3;
}
public String c(m ☃)
{
return "commands.ban.usage";
}
public boolean a(m ☃)
{
return (MinecraftServer.N().ap().h().b()) && (super.a(☃));
}
public void a(m ☃, String[] ☃)
throws bz
{
if ((☃.length < 1) || (☃[0].length() <= 0)) {
throw new cf("commands.ban.usage", new Object[0]);
}
MinecraftServer ☃ = MinecraftServer.N();
GameProfile ☃ = ☃.aF().a(☃[0]);
if (☃ == null) {
throw new bz("commands.ban.failed", new Object[] { ☃[0] });
}
String ☃ = null;
if (☃.length >= 2) {
☃ = a(☃, ☃, 1).c();
}
md ☃ = new md(☃, null, ☃.e_(), null, ☃);
☃.ap().h().a(☃);
lf ☃ = ☃.ap().a(☃[0]);
if (☃ != null) {
☃.a.c("You are banned from this server.");
}
a(☃, this, "commands.ban.success", new Object[] { ☃[0] });
}
public List<String> a(m ☃, String[] ☃, cj ☃)
{
if (☃.length >= 1) {
return a(☃, MinecraftServer.N().K());
}
return null;
}
}
| Tominous/LabyMod-1.8 | r.java |
480 | package PraciseGit;
public class A {
// public int a;
// public int b;
public A()
{
}
public int addition(int a,int b)
{
return a+b;
}
public int multiplication(int a, int b)
{
return a*b;
}
public int subtraction(int a,int b)
{
return a-b*b;
}
public double division(int a, int b)
{
return a/b;
}
}
| MANOJSB5112/June10th_2024 | A.java |
481 | public class l extends agu {
public l(int i, int j) {
super(i, j, false);
h(1);
}
public dk a(dk itemstack, ry world, vi entityplayer) {
super.a(itemstack, world, entityplayer);
return new dk(acy.D);
}
public dk c(dk itemstack, ry world, vi entityplayer) {
if (!((Boolean)mod_noBiomesX.HungerSystem.get()).booleanValue()) {
itemstack.a--;
entityplayer.a_(this.healthHealAmount);
return new dk(acy.D);
}
if (entityplayer.b(this.bT))
entityplayer.c(itemstack, b(itemstack));
return itemstack;
}
}
| JohnCartoonist/The-Nostalgia-Project-src | l.java |
482 | //{ Driver Code Starts
//Initial Template for Java
import java.io.*;
import java.util.*;
class GfG
{
public static void main (String[] args)
{
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t-- > 0)
{
String s = sc.next ();
int k = sc.nextInt();
System.out.println (new Solution().substrCount (s, k));
}
}
}
// } Driver Code Ends
class Solution {
long substrCount (String S, int K) {
return atmost(S,K)-atmost(S,K-1);
}
long atmost(String s, int k){
int arr[] = new int[26];
int dist = 0, left = 0;
long res = 0;
for(int i=0; i<s.length(); i++){
arr[s.charAt(i) - 'a']++;
if(arr[s.charAt(i) - 'a'] == 1) dist++;
while(dist > k){
arr[s.charAt(left)-'a']--;
if(arr[s.charAt(left)-'a'] == 0) dist--;
left++;
}
res = res + (i-left+1);
}
return res;
}
}
| dhruvabhat24/geek-4-geeks-october | 7.java |
483 | public class A {
public static void main(String[] args) {
String str = "Hello Java Coding";
var a = str.split("\\s+");
System.out.println(a.length);
for(int i = a.length-1; i>=0; i--){
System.out.print(a[i]+" ");
}
}
}
| brainmentorspvtltd/RD-JAVA_DSA-MIX | A.java |
484 | abstract class A
{
public void f1()
{
System.out.println("hrash");
}
abstract public void f2();
}
abstract class B extends A
{
}
class C extends B
{
public static void main(String... harsh)
{
C obj=new C();
obj.f1();
}
} | harshgangwar/JAVA-CODE | B.java |
485 | public class Stack
{
static final int MAX = 1000;
int top;
int a[] = new int[MAX];
boolean isEmpty()
{
return (top < 0);
}
Stack()
{
top = -1;
}
boolean push(int x)
{
if (top >= (MAX-1))
{
System.out.println("Stack Overflow");
return false;
}
else
{
a[++top] = x;
System.out.println(x + " pushed into stack");
return true;
}
}
int pop()
{
if (top < 0)
{
System.out.println("Stack Underflow");
return 0;
}
else
{
int x = a[top--];
return x;
}
}
public static void main(String args[])
{
Stack s = new Stack();
s.push(10);
s.push(20);
s.push(30);
System.out.println(s.pop() + " Popped from stack");
}
}
| Aisha-383/Java-fsd | Stack/src/Stack.java |
486 | class A{
private int B;
private int C;
private int D;
} | ankitvns19/scaler_git_demo1 | A.java |
487 | 404: Not Found | Kirand2407/Scaler | A.java |
488 | public class A {
private int A1;
private float A2;
public void setA1(int A1){
this.A1 = A1;
}
public int getA1(){
return A1;
}
public void setA2(Float A2){
this.A2 = A2;
}
public float getA2(){
return A2;
}
public void MA1(){
System.out.println("MA1");
}
public void MA2(){
System.out.println("MA2");
}
public void MA3(){
System.out.println("Alteração a classe A partir do clone");
}
}
| vinicius-caputo/Projeto_Vinicius_caputo | A.java |
489 | import java.util.Calendar;
import java.util.Date;
import javax.microedition.lcdui.Graphics;
import javax.microedition.lcdui.Image;
public final class e {
public static int g = 0;
public static int Q = 0;
public static Image ap;
public static boolean L;
public static final int D;
public static final int a;
public static int I;
public static boolean x;
public static int aU;
public static int be;
public static int aP;
public static boolean X;
public static int N;
public static boolean az;
public static final int[] aG;
public static int aM;
public static int bb;
public static int aQ;
public static int[] B;
public static int[] h;
public static int d;
public static int aW;
public static boolean u;
public static int t;
public static int f;
public static int y;
public static int aH;
public static int aL;
public static int bc;
public static int o;
public static int aa;
public static int ak;
public static int H;
public static int E;
public static int am;
public static int aZ;
public static int ar;
public static int aT;
public static int ax;
public static int M;
public static boolean Y;
public static int ai;
public static long P;
public static int V;
public static int aK;
public static int aw;
public static int an;
public static int aB;
public static int au;
public static boolean aI;
public static int r;
public static long m;
public static boolean i;
public static int aO;
public static boolean aJ;
public static boolean aS;
public static boolean ad;
public static boolean aX;
public static int aj;
public static int G;
public static int T;
public static int F;
public static int v;
public static int A;
public static int b;
public static int aY;
public static int[] j;
public static int[] n;
public static int R;
public static int k;
public static String[] J;
public static String[] W;
public static String[] aA;
public static String[] w;
public static int aV;
public static int aD;
public static int aq;
public static char[] aN;
public static int as;
public static int ah;
public static int ab;
public static int ae;
public static String ag;
public static int av;
public static int ao;
public static int q;
public static String z;
public static Image C;
public static Image s;
public static Image e;
public static Image l;
public static Image O;
public static Image S;
public static long U;
public static boolean c;
public static int af;
public static int aR;
public static int bd;
public static int ba;
public static int Z;
public static int ac;
public static int al;
public static int K;
public static String[] aF;
public static int at;
public static int ay;
public static int aC;
public static final int[] p;
public static boolean aE;
public static final void k() {
byte[] var0 = a.a("/large.png", (int)0);
aG[2] = d.a((byte)2, (byte[])var0, (String)"/large.dat");
Object var2 = null;
var0 = a.a("/medium.png", (int)0);
aG[1] = d.a((byte)1, (byte[])var0, (String)"/medium.dat");
var2 = null;
var0 = a.a("/small.png", (int)0);
aG[0] = d.a((byte)0, (byte[])var0, (String)"/small.dat");
var2 = null;
B = new int[4];
h = new int[4];
d = 2;
aW = d.al - 2 - d.b(aG[0], 2);
aQ = d.a(aG[1], 1) + 2;
l();
n();
d();
I = D - (d.b(aG[0], 15) + d.b(aG[0], 11));
for(int var1 = 0; var1 < 7; ++var1) {
d.e[var1] = false;
}
}
public static final void p() {
O = null;
S = null;
l = null;
e = null;
}
private static final void l() {
O = a.b("/smallStar.png");
S = a.b("/smallStarEmpty.png");
l = a.b("/bigStar.png");
e = a.b("/certStamp.png");
}
public static final void e(Graphics var0) {
var0.setClip(0, 0, d.al, d.au);
int var1;
int var2;
switch(d.s) {
case 0:
case 1:
case 2:
case 3:
case 18:
case 19:
case 20:
case 21:
case 22:
case 25:
case 26:
default:
break;
case 4:
case 10:
case 11:
case 13:
d(var0);
break;
case 5:
f(var0);
break;
case 6:
case 7:
c(var0);
break;
case 8:
case 17:
g(var0);
break;
case 9:
byte var4;
if (aM != 0) {
if (aM != 3) {
var2 = d.a(aG[1], 1) - d.a(aG[0], 0) >> 1;
var4 = 0;
if (ad) {
ad = false;
var4 = 1;
}
d.b(var0, aG[0], d, 1 + var2, var4);
var4 = 2;
if (aX) {
aX = false;
var4 = 3;
}
d.b(var0, aG[0], aW, 1 + var2, var4);
}
var4 = 1;
if (bb == 0) {
var4 = 0;
}
d.b(var0, aG[1], B[0], h[0], var4);
var4 = 2;
if (bb == 1) {
var4 = 3;
}
d.b(var0, aG[1], B[1], h[1], var4);
var4 = 4;
if (bb == 2) {
var4 = 5;
}
d.b(var0, aG[1], B[2], h[2], var4);
var4 = 6;
if (bb == 3) {
var4 = 7;
}
d.b(var0, aG[1], B[3], h[3], var4);
} else if (c.bH == 0 && c.cr != 4) {
byte var7 = -1;
byte var5 = -1;
switch(c.cr) {
case 0:
case 5:
var7 = -1;
break;
case 1:
case 4:
var7 = 0;
var5 = 1;
break;
case 2:
var7 = 3;
var5 = 1;
break;
case 3:
var7 = 7;
var5 = 1;
}
if (var7 != -1) {
d.b(var0, aG[var5], d.al - (d.b(aG[var5], var7) + 1), 1, var7);
}
}
if ((aM == 0 || aM == 3) && Y) {
d.b(var0, aG[aT], ax, M, ar);
f var10000 = c.C;
if (f.aN - P < 2000L && V != -1) {
a(var0, 0, V, aK, aw);
}
if (an != -1) {
a(var0, 0, an, aB, au);
}
}
if (g != 0) {
switch(g) {
case 1:
case 2:
case 4:
case 5:
case 7:
case 9:
case 11:
case 13:
case 14:
case 16:
case 19:
case 20:
case 22:
case 24:
case 25:
case 26:
case 27:
case 28:
case 29:
case 30:
case 31:
case 32:
case 40:
case 41:
case 42:
case 43:
case 45:
case 46:
case 47:
case 48:
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
case 60:
case 61:
case 62:
case 63:
case 64:
case 65:
case 66:
case 80:
case 81:
case 82:
case 83:
case 84:
case 85:
if ((g == 11 || g == 13 || g == 22) && System.currentTimeMillis() < d.I) {
return;
}
if (g == 28 || g == 29) {
c.d(var0);
}
var4 = 0;
byte var6 = 30;
var0.setClip(0, 0, d.al, d.au);
var0.drawImage(ap, var4, var6, 20);
var1 = var4 + (3 * (ap.getWidth() >> 2) - 2);
var6 = 75;
d.b(var0, aG[0], var1, var6, 19);
var1 = 0 + ap.getWidth();
var6 = 30;
a(var0, var1, var6, d.al - 2 - var1, aU, -1, true);
break;
case 3:
case 6:
case 8:
case 10:
case 12:
case 15:
case 17:
case 18:
case 21:
case 23:
case 44:
case 70:
case 71:
if (g == 23 && c.at >= 2) {
return;
}
var2 = d.au - 5 - aU;
if (g == 6 || g == 70 || g == 71) {
var2 -= d.aI[1];
}
boolean var3 = true;
a(var0, a, var2, I, aU, -1, var3);
case 33:
case 34:
case 35:
case 36:
case 37:
case 38:
case 39:
case 49:
case 59:
case 67:
case 68:
case 69:
case 72:
case 73:
case 74:
case 75:
case 76:
case 77:
case 78:
case 79:
}
}
b(var0);
break;
case 12:
case 14:
case 15:
case 23:
case 24:
h(var0);
break;
case 16:
case 27:
var1 = bc;
var2 = aa;
i(var0);
a(var0, var1, var2, E, be, -1, false);
aI = false;
b(var0);
}
}
public static final void b(Graphics var0) {
if (am != -1) {
a(var0, true);
}
if (aZ != -1) {
a(var0, false);
}
}
private static void a(Graphics var0, boolean var1) {
int var2 = d.au - d.aI[1];
int var3 = 2;
int var4;
if (var1) {
var4 = am;
} else {
var4 = aZ;
}
if (d.aD) {
var1 = !var1;
}
if (!var1) {
var3 = d.al - (2 + d.a((String)d.Z[var4], 1));
}
d.a(var0, (String)d.Z[var4], 1, var3, var2);
}
private static void a(int var0, int var1, int var2) {
int var3 = var0;
if (var0 == 71) {
var3 = -1;
}
if (var3 != -1) {
int var4 = d.a((String)d.Z[var3], 0) + 3 + 3;
int var5 = d.aI[0] + 3 + 3;
if (var1 < 0) {
var1 = 0;
}
if (var1 + var4 > d.al) {
var1 = d.al - var4;
}
if (var2 < 0) {
var2 = 0;
}
int var6 = d.au - d.aI[1];
if (var2 + var5 > var6) {
var2 = var6 - var5;
}
}
an = -1;
V = var3;
aK = var1;
aw = var2;
}
public static final void b(int var0, int var1, int var2) {
a(var0, var1, var2);
if (var0 != ai) {
f var10000 = c.C;
P = f.aN;
ai = var0;
}
}
public static final void a(Graphics var0, int var1, int var2, int var3, int var4) {
int var5 = d.a(d.Z[var2], var1);
int var6 = d.aI[var1];
if (var3 < 2) {
var3 = 2;
}
if (var3 + var5 > d.al - 2) {
var3 = d.al - (var5 + 2);
}
if (var4 < 2) {
var4 = 2;
}
if (var4 + var6 > d.au - 2) {
var4 = d.au - (var6 + 2);
}
d.a(var0, d.Z[var2], var1, var3, var4);
}
public static final void s() {
int[] var10000;
switch(aM) {
case 1:
default:
break;
case 2:
var10000 = h;
var10000[0] += 6;
var10000 = h;
var10000[1] += 6;
var10000 = h;
var10000[2] += 6;
var10000 = h;
var10000[3] += 6;
if (h[0] >= 2) {
h[0] = 2;
h[1] = 2;
h[2] = 2;
h[3] = 2;
aM = 1;
if (g == 0) {
am = 3;
}
}
break;
case 3:
for(int var0 = 0; var0 < 4; ++var0) {
if ((c.cr != var0 + 1 || var0 == 2) && (var0 != 3 || c.cr != 3)) {
h[var0] = -aQ;
} else {
var10000 = B;
var10000[var0] += 10;
if (B[var0] > d.al - d.b(aG[1], 1)) {
aM = 0;
if (g == 0) {
am = 0;
}
}
}
}
}
}
public static final void a() {
int var0 = -1;
f var3;
switch(d.s) {
case 0:
case 2:
case 3:
case 18:
case 19:
case 20:
case 21:
break;
case 1:
d.g(1);
d.g(2);
d.g(5);
break;
case 4:
case 22:
case 25:
default:
if (d.s == 4) {
if (d.e(1)) {
i();
}
if (d.e(2)) {
g();
}
if (d.e(6) || d.e(5) || d.e(8)) {
aI = true;
if (j != null) {
var0 = j[aV];
}
switch(var0) {
case 20:
d.ad = 1;
break;
case 21:
d.ad = 2;
break;
case 22:
d.ad = 3;
break;
case 23:
d.ad = 4;
break;
case 24:
d.ad = 5;
}
d.j(d.ad);
d.q();
if (!d.C) {
d.U = 8;
d.i(18);
} else {
d.i(2);
}
}
}
break;
case 5:
f var10001;
if (d.e(3)) {
if (aE) {
}
aI = true;
ad = true;
var3 = c.C;
--f.ba;
var3 = c.C;
if (f.ba < 0) {
var3 = c.C;
var10001 = c.C;
f.ba += f.cq;
}
var3 = c.C;
f.bd = true;
var3 = c.C;
var10001 = c.C;
f.U = 32 + (f.k(14) - 7);
var3 = c.C;
var10001 = c.C;
d.Y = f.bp[f.ba];
}
if (d.e(4)) {
if (aE) {
}
aI = true;
aX = true;
var3 = c.C;
++f.ba;
var3 = c.C;
var10001 = c.C;
if (f.ba >= f.cq) {
var3 = c.C;
var10001 = c.C;
f.ba -= f.cq;
}
var3 = c.C;
f.bd = true;
var3 = c.C;
var10001 = c.C;
f.U = 32 + (f.k(14) - 7);
var3 = c.C;
var10001 = c.C;
d.Y = f.bp[f.ba];
}
if (d.e(6) || d.e(5) || d.e(8)) {
var3 = c.C;
d.aq = f.ba;
z = " ";
c.b();
b(6);
ap = null;
}
if (d.e(7)) {
z = d.ah + " ";
z = z.substring(0, 10);
b(7);
}
break;
case 6:
case 7:
aI = true;
if (d.e(3)) {
--ae;
if (ae < 0) {
ae = 7;
}
for(ah = 8 * ab + ae; ah >= ag.length(); ah = 8 * ab + ae) {
--ae;
}
}
if (d.e(4)) {
++ae;
if (ae >= 8) {
ae = 0;
}
ah = 8 * ab + ae;
if (ah >= ag.length()) {
ae = 0;
}
ah = 8 * ab + ae;
}
if (d.e(1)) {
--ab;
if (ab < 0) {
ab = 3;
}
for(ah = 8 * ab + ae; ah >= ag.length(); ah = 8 * ab + ae) {
--ab;
}
}
if (d.e(2)) {
++ab;
if (ab >= 4) {
ab = 0;
}
ah = 8 * ab + ae;
if (ah >= ag.length()) {
ab = 0;
}
ah = 8 * ab + ae;
}
if (d.e(6) || d.e(5) || d.e(8)) {
label702:
switch(ag.charAt(ah)) {
case '^':
if (as > 0) {
--as;
aN[as] = ' ';
}
break;
case '{':
if (ag == "0123456789_^~{}") {
ag = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_^~}¬";
ae = 7;
ab = 3;
ah = 8 * ab + ae;
while(true) {
if (ah < ag.length()) {
break label702;
}
--ae;
if (ae < 0) {
ae = 7;
--ab;
}
ah = 8 * ab + ae;
}
} else {
ag = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_^~}¬";
break;
}
case '}':
if (ag == "0123456789_^~{}") {
ag = "abcdefghijklmnopqrstuvwxyz_^~{¬";
ae = 7;
ab = 3;
ah = 8 * ab + ae;
while(true) {
if (ah < ag.length()) {
break label702;
}
--ae;
if (ae < 0) {
ae = 7;
--ab;
}
ah = 8 * ab + ae;
}
} else {
ag = "abcdefghijklmnopqrstuvwxyz_^~{¬";
break;
}
case '~':
String var1 = (new String(aN)).substring(0, as);
if (var1.trim().length() > 0) {
if (d.s == 6) {
d.P = var1;
d.f();
C = null;
s = null;
var3 = c.C;
f.aN = d.t();
var3 = c.C;
var3 = c.C;
f.cE = f.aN;
var3 = c.C;
var3 = c.C;
f.Q = f.aN;
var3 = c.C;
f.aX = 0L;
c.av = 0;
c.ad = 0;
c.bc = 0;
c.aV = 0;
c.T = 0;
c.g = true;
d.v = 20;
d.as = true;
System.gc();
b(8);
aI = true;
} else if (d.s == 7) {
d.ah = var1;
d.f();
b(5);
}
} else {
m = System.currentTimeMillis() + 3000L;
as = 0;
}
break;
case '¬':
ag = "0123456789_^~{}";
ae = 7;
ab = 3;
ah = 8 * ab + ae;
while(true) {
if (ah < ag.length()) {
break label702;
}
--ae;
if (ae < 0) {
ae = 7;
--ab;
}
ah = 8 * ab + ae;
}
default:
if (as < aN.length) {
aN[as++] = ag.charAt(ah);
}
}
ah = 8 * ab + ae;
}
if (d.e(7) && d.s == 6) {
b(5);
}
break;
case 8:
if (d.e(6) || d.e(5) || d.e(8)) {
if (aC > 6) {
d.n = true;
c.bH = 0;
c.d(c.C.cp, c.C.cp);
b(21);
if (!d.i) {
Q = 1;
}
} else {
a(true);
}
}
break;
case 9:
if (g == 0) {
if (d.b(3) && aM == 1) {
d.g(3);
o();
}
if (d.b(4) && aM == 1) {
d.g(4);
r();
}
if (d.b(6)) {
switch(c.bH) {
case 1:
case 2:
case 3:
break;
default:
if (c.cr != 4) {
d.g(6);
if (aM == 1) {
h();
} else if (aM == 0) {
c();
}
}
}
}
if (d.b(7)) {
switch(c.bH) {
case 1:
if (c.cr != 4) {
d.g(7);
b(10);
}
case 2:
case 3:
break;
default:
d.g(7);
b(10);
}
}
if (d.b(5) || d.b(8)) {
switch(c.bH) {
case 1:
case 2:
case 3:
return;
default:
if (aM == 1) {
h();
d.g(5);
d.g(8);
}
}
}
} else {
d.g(9);
d.g(10);
d.g(11);
d.g(12);
d.g(15);
d.g(16);
d.g(17);
d.g(18);
switch(g) {
case 1:
case 2:
case 4:
case 5:
case 7:
case 9:
case 11:
case 13:
case 14:
case 16:
case 19:
case 20:
case 22:
case 24:
case 25:
case 26:
case 27:
case 28:
case 29:
case 30:
case 31:
case 32:
d.g(3);
d.g(4);
d.g(5);
d.g(8);
d.g(13);
d.g(14);
break;
case 3:
d.g(3);
d.g(4);
d.g(5);
d.g(8);
d.g(14);
break;
case 6:
case 40:
case 41:
case 42:
case 43:
case 45:
case 46:
case 47:
case 48:
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
case 60:
case 61:
case 62:
case 63:
case 64:
case 65:
case 66:
case 80:
case 81:
case 82:
case 83:
case 84:
case 85:
d.g(3);
d.g(4);
d.g(5);
d.g(7);
d.g(8);
d.g(13);
d.g(14);
break;
case 8:
case 10:
case 17:
case 21:
d.g(6);
d.g(7);
d.g(13);
d.g(14);
break;
case 12:
case 18:
case 23:
case 44:
d.g(6);
d.g(7);
d.g(13);
d.g(14);
break;
case 15:
d.g(3);
d.g(4);
d.g(5);
d.g(6);
d.g(7);
d.g(8);
d.g(13);
case 33:
case 34:
case 35:
case 36:
case 37:
case 38:
case 39:
case 49:
case 59:
case 67:
case 68:
case 69:
case 70:
case 71:
case 72:
case 73:
case 74:
case 75:
case 76:
case 77:
case 78:
case 79:
}
if ((g == 11 || g == 13 || g == 22) && System.currentTimeMillis() < d.I) {
d.g(6);
return;
}
switch(g) {
case 1:
case 2:
case 4:
case 5:
case 6:
case 7:
case 9:
case 11:
case 13:
case 14:
case 16:
case 19:
case 20:
case 22:
case 24:
case 25:
case 26:
case 27:
case 28:
case 29:
case 30:
case 31:
if (d.e(6)) {
c(g + 1);
if (g != 7 && g != 20 && g != 26) {
if (g == 28) {
aM = 0;
}
} else {
c();
}
if (g == 7) {
bb = 2;
}
if (g == 26) {
bb = 1;
} else if (g == 27) {
bb = 3;
}
}
if (d.e(7) && g != 6) {
c(32);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 3:
if (d.b(13)) {
c(g + 1);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 8:
case 21:
if (d.e(3) && aM == 1) {
o();
}
if (d.e(4) && aM == 1) {
r();
}
if (d.e(5) || d.e(8)) {
h();
if (aM == 3) {
c(g + 1);
if (g == 22) {
d.I = System.currentTimeMillis() + 2000L;
}
}
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 10:
case 17:
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 12:
case 18:
case 23:
case 33:
case 34:
case 35:
case 36:
case 37:
case 38:
case 39:
case 44:
case 49:
case 59:
case 67:
case 68:
case 69:
case 72:
case 73:
case 74:
case 75:
case 76:
case 77:
case 78:
case 79:
default:
return;
case 15:
if (d.b(14)) {
c(g + 1);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 32:
if (U < System.currentTimeMillis()) {
b.a(0);
long var10000 = System.currentTimeMillis();
f var10002 = c.C;
U = var10000 + (long)(500 + f.k(2000));
}
if (d.e(6)) {
c(0);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 40:
case 41:
case 42:
case 43:
case 45:
case 46:
case 47:
case 48:
if (d.e(6)) {
if (g == 48) {
d.f = true;
c.l();
c(0);
} else {
c(g + 1);
}
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
if (d.e(6)) {
if (g == 58) {
d.W = true;
c(0);
} else {
c(g + 1);
}
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 60:
case 61:
case 62:
case 63:
case 64:
case 65:
case 66:
if (d.e(6)) {
if (g == 60) {
d.e[g - 60] = true;
c(g + 1);
} else {
d.e[g - 60] = true;
c(0);
d(c.bH);
}
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 70:
case 71:
if (d.e(6)) {
c(0);
b(17);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 80:
case 81:
case 82:
case 84:
if (d.e(6)) {
c(0);
d(c.bH);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 83:
if (d.e(6)) {
f.ab();
c(0);
d(c.bH);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
return;
case 85:
if (d.e(6)) {
c(0);
d.u();
d.i(3);
}
if (d.e(1) && X) {
m();
}
if (d.e(2) && X) {
b();
}
}
}
break;
case 10:
if (d.e(3)) {
aI = true;
if (j != null) {
var0 = j[aV];
}
switch(var0) {
case 8:
d.j = !d.j;
b.a(0);
break;
case 19:
--d.ad;
if (d.ad < 1) {
d.ad = 5;
}
}
}
if (d.e(4)) {
aI = true;
if (j != null) {
var0 = j[aV];
}
switch(var0) {
case 8:
d.j = !d.j;
b.a(0);
break;
case 19:
++d.ad;
if (d.ad > 5) {
d.ad = 1;
}
}
}
if (d.e(1)) {
i();
}
if (d.e(2)) {
g();
}
if (d.e(6) || d.e(5) || d.e(8)) {
if (j != null) {
var0 = j[aV];
}
switch(var0) {
case 6:
b(17);
return;
case 8:
aI = true;
d.j = !d.j;
b.a(0);
return;
case 10:
b(16);
b.a(7);
return;
case 11:
b(11);
return;
case 14:
aI = true;
d.j(d.ad);
b(9);
am = d.ax;
aZ = d.aB;
d.ax = -4;
d.aB = -4;
return;
case 26:
b(13);
return;
case 68:
b(27);
return;
default:
if (var0 == 19) {
aI = true;
c = true;
d.j(d.ad);
}
}
}
break;
case 11:
if (d.e(1)) {
i();
}
if (d.e(2)) {
g();
}
if (d.e(6) || d.e(5) || d.e(8)) {
if (j != null) {
var0 = j[aV];
}
switch(var0) {
case 15:
try {
d.i = true;
c.f();
c.K();
d.l();
d.Q.destroyApp(true);
} catch (Throwable var2) {
}
return;
case 16:
b(10);
return;
case 68:
d.a(d.g, (String)null);
}
}
break;
case 12:
case 14:
case 15:
case 23:
case 24:
if (d.e(3)) {
aI = true;
--k;
if (k < 0) {
k = 0;
}
}
if (d.e(4)) {
aI = true;
++k;
if (k >= R) {
k = R - 1;
}
}
if (d.e(6) || d.e(5) || d.e(8)) {
aI = true;
++k;
if (k >= R) {
k = R - 1;
}
}
am = 262;
if (k >= R - 1) {
am = -1;
}
if (d.e(7)) {
b(13);
}
break;
case 13:
if (d.e(1)) {
i();
}
if (d.e(2)) {
g();
}
if (d.e(6) || d.e(5) || d.e(8)) {
if (j != null) {
var0 = j[aV];
}
switch(var0) {
case 9:
b(12);
break;
case 27:
b(14);
break;
case 28:
b(15);
break;
case 37:
b(23);
break;
case 39:
b(24);
}
}
if (d.e(7)) {
b(10);
}
break;
case 16:
if (d.e(6)) {
d.u();
d.i(3);
} else if (d.e(7) && d.s == 16) {
b(10);
}
if (d.e(1) && X) {
m();
aI = true;
}
if (d.e(2) && X) {
b();
aI = true;
}
break;
case 17:
if (d.e(6) || d.e(5) || d.e(8)) {
a(true);
}
if (d.e(7)) {
b(10);
}
break;
case 26:
if (d.e(6)) {
b(0);
}
break;
case 27:
if (d.e(6)) {
d.a(d.g, (String)null);
b(10);
}
if (d.e(7)) {
b(10);
}
if (d.e(1) && X) {
m();
aI = true;
}
if (d.e(2) && X) {
b();
aI = true;
}
}
}
public static final void b() {
if (az) {
++N;
}
}
public static final void m() {
--N;
if (N < 0) {
N = 0;
}
}
private static final void i() {
aI = true;
aJ = true;
--aV;
if (aV < 0) {
aV = aq - 1;
aD = aq - aY;
if (aD < 0) {
aD = 0;
}
int var0 = aD + aY;
if (var0 > aq) {
var0 = aq;
}
for(int var1 = aD; var1 < var0; ++var1) {
if (n[var1] > 1) {
++aD;
}
}
} else if (aV < aD) {
--aD;
}
}
private static final void g() {
aI = true;
aS = true;
++aV;
if (aV >= aq) {
aV = 0;
aD = 0;
} else {
int var0 = 0;
int var1 = 0;
for(int var2 = aD; var2 < aq && var1 + n[var2] <= aY; ++var2) {
var1 += n[var2];
++var0;
}
if (aV >= aD + var0) {
++aD;
}
}
}
private static void o() {
--bb;
if (bb < 0) {
bb = 3;
}
ad = true;
}
private static void r() {
++bb;
if (bb == 4) {
bb = 0;
}
aX = true;
}
private static void h() {
if ((g != 8 || bb == 0) && (g != 21 || bb == 2)) {
byte var0 = 0;
Y = true;
switch(bb) {
case 0:
var0 = 1;
if (var0 != c.cr || c.bE == -1) {
c.k();
}
if (c.bE != -1) {
c.e(c.bE, c.C.aE, 8, 1);
}
Y = true;
break;
case 1:
var0 = 2;
ar = 9;
aT = 1;
break;
case 2:
c.bH = 1;
c.j();
break;
case 3:
var0 = 3;
Y = false;
}
c.b(var0);
e();
}
}
private static void c() {
aM = 2;
int var0 = d + d.b(aG[0], 0) + 2;
int var1 = aW - 2;
int var2 = (var1 - var0) / 4;
B[0] = var0;
B[1] = B[0] + var2;
B[2] = B[1] + var2;
B[3] = B[2] + var2;
h[0] = -d.a(aG[1], 1);
h[1] = h[0];
h[2] = h[0];
h[3] = h[0];
}
private static void e() {
aM = 3;
}
public static final void a(byte var0, byte var1, int var2, int var3) {
ar = var0;
aT = var1;
ax = var2;
M = var3;
}
private static final void f() {
r = -1;
J = null;
j = null;
aV = 0;
aD = 0;
w = null;
System.gc();
}
private static final void j() {
if (W != null) {
for(int var0 = 0; var0 < W.length; ++var0) {
W[var0] = null;
}
W = null;
System.gc();
}
}
public static final void d(int var0) {
switch(var0) {
case 1:
break;
case 2:
case 3:
if (g == 0) {
am = -1;
aZ = 1;
}
break;
default:
if (g == 0) {
am = 0;
aZ = 1;
}
if (aM == 1 && g != 7 && g != 8 && g != 20 && g != 21 && g != 26 && g != 27) {
am = 3;
}
}
}
public static final void b(int var0) {
d.q = var0;
f var10000;
switch(d.s) {
case 5:
var10000 = c.C;
f.ac();
default:
switch(var0) {
case 5:
var10000 = c.C;
f.p();
aE = true;
break;
case 8:
case 17:
if (O == null) {
l();
}
at = 15;
if (var0 == 8) {
at = 7;
}
aF = new String[at];
aF[0] = d.Z[44] + " " + d.P;
String[] var11 = aF;
StringBuffer var10002 = (new StringBuffer()).append(d.Z[45]).append(" ");
f var10005 = c.C;
var11[1] = var10002.append(d.Z[98 + f.ba]).toString();
String var1;
if (!d.Y) {
var1 = d.Z[35];
} else {
var1 = d.Z[36];
}
aF[2] = d.Z[46] + " " + var1;
Calendar var2 = Calendar.getInstance();
var2.setTime(new Date(d.aC));
int var4 = var2.get(1) % 100;
String var3;
if (var4 == 0) {
var3 = "00";
} else if (var4 < 10) {
var3 = "0" + var4;
} else {
var3 = "" + var4;
}
var1 = "" + var2.get(5) + "-" + d.Z[338 + var2.get(2)] + "-" + var3;
aF[3] = d.Z[47] + " " + var1;
int var5 = 215;
if (c.av > 30) {
++var5;
}
if (c.av > 60) {
++var5;
}
if (c.av > 120) {
++var5;
}
var1 = "" + c.av + " " + d.Z[49];
aF[4] = d.Z[48] + " " + var1;
aF[5] = d.Z[50] + " " + d.Z[var5];
aF[6] = d.Z[51] + " " + d.ah;
if (var0 != 8) {
aF[7] = d.Z[52] + " " + d.J;
aF[8] = d.Z[53] + " " + "$" + d.v;
aF[9] = d.Z[328] + " ";
aF[10] = d.Z[329] + " ";
aF[11] = d.Z[330] + " ";
aF[12] = d.Z[331] + " ";
aF[13] = "";
aF[14] = "";
}
int var6 = d.aI[0];
int var7 = d.aI[1];
byte var8 = 2;
boolean var9 = true;
K = 0;
int var10 = ba - var7 - var8 - 0;
K = 9;
ay = 0;
}
}
}
public static final void a(int var0) {
if (d.q == 10 && d.ax == -4 && d.aB == -4) {
d.ax = am;
d.aB = aZ;
}
f();
if (g == 0) {
j();
am = 3;
aZ = -1;
}
j = new int[20];
int var1 = 0;
aI = true;
f var10000;
String var2;
switch(d.q) {
case 5:
ap = a.b("/avatar_vet.png");
I = d.al - (0 + ap.getWidth()) - (d.b(aG[0], 15) + d.b(aG[0], 11));
L = false;
int var9 = d.al - (5 + ap.getWidth() + 4 + 10);
var2 = a.a(d.Z[41], d.aK);
aA = a.a(var2, 0, var9);
aU = aA.length * (d.aI[0] + 2) + d.a(aG[0], 9) + d.a(aG[0], 13);
if (aU < 45) {
aU = 45;
}
var10000 = c.C;
f.ba = 0;
var10000 = c.C;
f var12 = c.C;
d.Y = f.bp[f.ba];
am = 3;
aZ = 25;
break;
case 6:
r = 42;
aN = z.toCharArray();
as = a.a(z).length();
ag = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_^~}¬";
ab = 0;
ae = 0;
ah = 0;
am = 3;
aZ = 25;
break;
case 7:
r = 43;
aN = z.toCharArray();
as = a.a(z).length();
ag = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_^~}¬";
ab = 0;
ae = 0;
ah = 0;
am = 3;
break;
case 8:
am = 262;
aZ = -1;
break;
case 9:
j = null;
d(c.bH);
break;
case 10:
al = 0;
j[var1++] = 14;
j[var1++] = 6;
j[var1++] = 26;
if (d.C) {
j[var1++] = 8;
}
if (!d.an) {
j[var1++] = 19;
}
j[var1++] = 10;
j[var1++] = 11;
if (d.g != null) {
j[var1++] = 68;
}
am = 3;
aZ = -1;
break;
case 11:
J = a.a(d.Z[13], 0, E);
j[var1++] = 16;
j[var1++] = 15;
am = 3;
aZ = -1;
break;
case 12:
r = 9;
j = null;
W = a.a(d.Q.getAppProperty("MIDlet-Name") + "\n\n" + d.Z[60] + " " + d.aM + "\n\n" + d.Z[61] + " " + d.Q.getAppProperty("MIDlet-Vendor") + "\n\n" + d.Z[62] + "\n" + d.Z[63] + "\n\n" + d.Z[64] + " " + d.Z[65] + "\n\n" + d.Z[66] + "\n" + d.Z[67], 0, E);
am = 262;
aZ = 25;
break;
case 13:
r = 26;
j[var1++] = 27;
j[var1++] = 28;
j[var1++] = 37;
j[var1++] = 39;
j[var1++] = 9;
am = 3;
aZ = 25;
break;
case 14:
r = 27;
j = null;
var2 = a.a(d.Z[58], d.aK);
W = a.a(var2, 0, E);
am = 262;
aZ = 25;
break;
case 15:
r = 28;
j = null;
byte var6 = 0;
byte var7 = 1;
if (d.aD) {
var6 = 1;
var7 = 0;
}
String[] var8 = new String[2];
var8[var6] = d.Z[332];
var8[var7] = d.Z[333];
var2 = a.a(d.Z[59], var8);
W = a.a(var2, 0, E);
am = 262;
aZ = 25;
break;
case 16:
var10000 = c.C;
long var3 = (long)d.a(f.aN);
byte var5;
if (var3 >= 30L) {
var5 = 57;
} else if (var3 >= 7L) {
var5 = 56;
} else if (var3 >= 3L) {
var5 = 55;
} else {
var5 = 54;
}
var2 = a.a(d.Z[var5], d.aK);
w = a.a(var2, 0, E - 2 * d.b(aG[0], 10));
aP = ak - aa;
be = be = w.length * (d.aI[0] + 2) + d.a(aG[0], 9) + d.a(aG[0], 13);
X = be > aP;
if (X) {
be = aP;
}
N = 0;
az = true;
am = 15;
aZ = 16;
break;
case 17:
k = 0;
R = 2;
al = 0;
am = 262;
aZ = 25;
break;
case 18:
d.aw = false;
am = -1;
aZ = -1;
break;
case 19:
case 20:
case 22:
case 25:
default:
if (d.q == 4) {
j[var1++] = 20;
j[var1++] = 21;
j[var1++] = 22;
j[var1++] = 23;
j[var1++] = 24;
am = 4;
}
break;
case 21:
d.aw = false;
if (c.cr == 0 && g == 0) {
c.b(1);
}
j = null;
am = 0;
aZ = 1;
break;
case 23:
r = 37;
j = null;
W = a.a(d.Z[38], 0, E);
am = 262;
aZ = 25;
break;
case 24:
r = 39;
j = null;
W = a.a(d.Z[40], 0, E);
am = 262;
aZ = 25;
break;
case 26:
J = a.a(d.Z[12], 0, E);
am = 4;
aZ = -1;
break;
case 27:
var2 = d.Z[350];
w = a.a(var2, 0, E - 2 * d.b(aG[0], 10));
aP = ak - aa;
be = be = w.length * (d.aI[0] + 2) + d.a(aG[0], 9) + d.a(aG[0], 13);
X = be > aP;
if (X) {
be = aP;
}
N = 0;
az = true;
am = 15;
aZ = 16;
}
if (j != null) {
int[] var10 = j;
j = new int[var1];
System.arraycopy(var10, 0, j, 0, var1);
Object var11 = null;
System.gc();
aq = j.length;
}
q();
}
private static final void q() {
aj = aa;
G = aj;
if (r != -1) {
String[] var0 = a.a(d.Z[r], 1, E);
G += (d.aI[1] + 2) * var0.length;
var0 = null;
G += d.aI[1] >> 1;
}
switch(d.q) {
case 4:
k();
case 10:
case 11:
case 13:
case 101:
case 102:
case 110:
case 118:
T = G;
if (J != null) {
T += (d.aI[0] + 2) * J.length;
}
F = T + d.a(aG[0], 4);
v = ak - d.a(aG[0], 6);
b = v - F;
aY = b / (d.aI[1] + 2);
if (aY == aq - 1) {
F = T;
v = ak;
++aY;
}
n = new int[aq * 2];
int var4 = 0;
String var1 = null;
for(int var2 = 0; var2 < aq; ++var2) {
if (j[var2] != -1) {
var1 = d.Z[j[var2]];
if (j[var2] == 8) {
if (d.C) {
var1 = var1 + ": < ";
if (d.j) {
var1 = var1 + d.Z[17];
} else {
var1 = var1 + d.Z[18];
}
var1 = var1 + " >";
}
} else if (j[var2] == 19) {
var1 = var1 + " : < " + d.Z[19 + d.ad] + " >";
}
}
if (d.a((String)var1, 1) <= E) {
n[var2] = 1;
} else {
String[] var3 = a.a(var1, 1, E);
n[var2] = var3.length;
}
var4 += n[var2];
}
i = var4 > aY;
aO = bc + (o - bc - d.b(aG[0], 4) >> 1);
case 5:
case 8:
case 9:
case 16:
case 17:
case 18:
case 19:
case 20:
case 21:
case 22:
case 25:
case 26:
case 27:
case 28:
case 29:
case 30:
case 31:
case 32:
case 33:
case 34:
case 35:
case 36:
case 37:
case 38:
case 39:
case 40:
case 41:
case 42:
case 43:
case 44:
case 45:
case 46:
case 47:
case 48:
case 49:
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
case 59:
case 60:
case 61:
case 62:
case 63:
case 64:
case 65:
case 66:
case 67:
case 68:
case 69:
case 70:
case 71:
case 72:
case 73:
case 74:
case 75:
case 76:
case 77:
case 78:
case 79:
case 80:
case 81:
case 82:
case 83:
case 84:
case 85:
case 86:
case 87:
case 88:
case 89:
case 90:
case 91:
case 92:
case 93:
case 94:
case 95:
case 96:
case 97:
case 98:
case 99:
case 108:
case 109:
case 111:
case 114:
case 117:
case 120:
case 121:
default:
break;
case 6:
case 7:
case 103:
A = ak - (d.aI[0] << 1);
av = t * y / 9;
ao = aL + av;
q = G;
break;
case 12:
case 14:
case 15:
case 23:
case 24:
case 100:
case 104:
case 105:
case 106:
case 107:
case 112:
case 113:
case 115:
case 116:
case 119:
case 122:
A = ak;
b = A - F;
aY = b / (d.aI[0] + 2);
R = W.length / aY;
if (W.length % aY != 0) {
++R;
}
k = 0;
}
}
private static final void d(Graphics var0) {
if (aI) {
if (d.s == 4) {
d.aJ = true;
d.a(var0, 7967429);
}
byte var1 = 0;
if (d.s == 4) {
var1 = 10;
}
i(var0);
b(var0);
if (r != -1) {
a(var0);
}
int var2;
if (J != null) {
for(var2 = 0; var2 < J.length; ++var2) {
d.a(var0, (String)J[var2], 0, bc, G + var2 * (d.aI[0] + 2));
}
}
if (i) {
var2 = 4;
if (aJ) {
aJ = false;
++var2;
}
d.b(var0, aG[0], aO, T, var2);
var2 = 6;
if (aS) {
aS = false;
++var2;
}
d.b(var0, aG[0], aO, v, var2);
}
String var9 = "";
int var3 = 0;
int var4 = aD;
for(int var5 = F + var1; var3 < aY && var4 < aq; var3 += n[var4++]) {
if (j[var4] != -1) {
var9 = d.Z[j[var4]];
if (j[var4] == 8) {
if (d.C) {
var9 = var9 + " : < ";
if (d.j) {
var9 = var9 + d.Z[17];
} else {
var9 = var9 + d.Z[18];
}
var9 = var9 + " >";
}
} else if (j[var4] == 19) {
var9 = var9 + " : < " + d.Z[19 + d.ad] + " >";
}
}
boolean var6 = false;
if (var4 == aV) {
var6 = true;
}
var0.setClip(0, 0, d.al, d.au);
var0.setColor(16744703);
if (n[var4] == 1) {
if (var6) {
var0.fillRect(bc, var5, o - bc, d.aI[1]);
}
d.a(var0, (String)var9, 1, bc + 2, var5);
var5 += d.aI[1] + 2;
} else {
String[] var7 = a.a(var9, 1, E);
if (var6) {
var0.fillRect(bc, var5 - 1, o - bc, var7.length * d.aI[1] + 2);
}
for(int var8 = 0; var8 < var7.length; ++var8) {
d.a(var0, (String)var7[var8], 1, bc + 2, var5);
var5 += d.aI[1] + 2;
}
}
}
aI = false;
}
}
private static final void h(Graphics var0) {
if (aI) {
d.a(var0, 7967429);
i(var0);
b(var0);
if (r != -1) {
a(var0);
}
int var1 = G;
for(int var2 = aY * k; var2 < aY * (k + 1) && var2 < W.length; ++var2) {
d.a(var0, (String)W[var2], 0, bc + 2, var1);
var1 += d.aI[0] + 2;
}
if (R > 1 && d.s < 100) {
StringBuffer var4 = new StringBuffer();
if (k > 0) {
var4.append("< ");
}
var4.append(k + 1 + "/" + R);
if (k < R - 1) {
var4.append(" >");
}
int var3 = d.au - d.aI[1];
d.a(var0, (String)var4.toString(), 1, d.al - d.a((String)var4.toString(), 1) >> 1, var3);
}
aI = false;
}
}
private static final void c(Graphics var0) {
if (aI) {
d.a(var0, 7967429);
i(var0);
boolean var1 = true;
if (r != -1) {
if (System.currentTimeMillis() < m && System.currentTimeMillis() % 1000L < 500L) {
var1 = false;
}
if (var1) {
a(var0);
}
}
int var2 = q + 0;
for(int var3 = 0; var3 < ag.length(); var2 += d.aI[1] + 1) {
int var4 = 0;
for(int var5 = ao; var4 < 8 && var3 < ag.length(); ++var4) {
char var6 = ag.charAt(var3);
if (var3 == ah) {
d.b(var0, aG[0], var5 - (d.b(aG[0], 18) >> 1), var2 - (d.a(aG[0], 18) >> 1), 18);
}
d.a(var0, (char)var6, 1, var5 - (d.a((String)("" + var6), 1) >> 1), var2 - (d.aI[1] >> 1));
var5 += av;
++var3;
}
}
var1 = true;
if (System.currentTimeMillis() % 1000L < 500L) {
var1 = false;
}
char[] var7 = new char[aN.length];
int var8;
for(var8 = 0; var8 < var7.length; ++var8) {
var7[var8] = '_';
}
var8 = d.al - (d.t[1] + 1) * var7.length >> 1;
int var9 = A + 0;
int var10 = var8 + (d.t[1] - d.r[1]["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzÂÊÎÔÛÁÉÍÓÚÀÈÌÒÙÄËÏÖÜÇÑßâêîôûáéíóúàèìòùäëïöüçñ0123456789 ',()-\\?@.:\"+_!©%/#$&;¡£®¿«»°<>^~¬{}".indexOf(95)] >> 1);
int var11;
for(var11 = 0; var11 < var7.length; ++var11) {
if (var11 == as) {
if (var1) {
d.a(var0, (char)var7[var11], 1, var10, var9 + 3);
}
} else {
d.a(var0, (char)var7[var11], 1, var10, var9 + 3);
}
var10 += d.t[1] + 1;
}
for(var11 = 0; var11 < aN.length; ++var11) {
var10 = var8 + (d.t[1] + 1) * var11 + (d.t[1] - d.r[1]["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzÂÊÎÔÛÁÉÍÓÚÀÈÌÒÙÄËÏÖÜÇÑßâêîôûáéíóúàèìòùäëïöüçñ0123456789 ',()-\\?@.:\"+_!©%/#$&;¡£®¿«»°<>^~¬{}".indexOf(aN[var11])] >> 1);
d.a(var0, (char)aN[var11], 1, var10, var9);
}
b(var0);
}
}
private static final void f(Graphics var0) {
if (C == null) {
C = a.b("/choose_puppy.png");
s = a.b("/choose_puppy_overlay.png");
}
int var1 = d.al - C.getWidth() >> 1;
int var2 = d.al - s.getWidth() >> 1;
int var3 = d.au - (d.aI[0] + C.getHeight() + 5);
d.a(var0, (Image)C, var1, var3, 20);
var0.setColor(7967429);
var0.fillRect(0, 0, d.al, var3);
var3 += C.getHeight();
var0.setColor(16168324);
var0.fillRect(0, var3, d.al, d.au - var3);
if (d.u) {
c.C.a(var0);
}
var3 -= C.getHeight();
d.a(var0, (Image)s, var2, var3 + 208, 20);
if (aE) {
}
int var4 = 0;
if (ad) {
ad = false;
++var4;
}
d.b(var0, aG[0], 2, var3 + 208, var4);
var4 = 2;
if (aX) {
aX = false;
++var4;
}
d.b(var0, aG[0], d.al - (2 + d.b(aG[0], 2)), var3 + 208, var4);
byte var11 = 35;
if (d.Y) {
var11 = 36;
}
var1 = d.al - d.a((String)d.Z[var11], 0) >> 1;
var3 += C.getHeight() - (d.aI[0] >> 1);
if (aE) {
}
d.a(var0, (String)d.Z[var11], 0, var1, var3);
if (aE) {
try {
byte var9 = 0;
byte var10 = 30;
var0.setClip(0, 0, d.al, d.au);
var0.drawImage(ap, var9, var10, 20);
var1 = var9 + (3 * (ap.getWidth() >> 2) - 2);
var10 = 75;
d.b(var0, aG[0], var1, var10, 19);
var1 = 0 + ap.getWidth();
int var5 = 30 + aU;
int var6 = var10 + d.a(aG[0], 19);
int var7 = var6 - var5;
if (var7 > 0) {
var3 = 30 + var7 * 2;
} else {
var3 = 30;
}
a(var0, var1, var3, d.al - 2 - var1, aU, -1, true);
} catch (Throwable var8) {
}
}
b(var0);
}
private static final void d() {
af = d.al * 90 / 100 - (d.b(aG[0], 31) + d.b(aG[0], 27));
aR = d.al - af >> 1;
bd = 2 + d.a(aG[0], 25);
ba = d.au - d.aI[1] - (d.b(aG[0], 25) + d.b(aG[0], 29));
}
public static final void a(Graphics var0, int var1, int var2, int var3, int var4, boolean var5) {
int var7 = var2;
int var8 = var1 + var3 - 6;
var0.setColor(16777185);
var0.setClip(0, 0, d.al, d.au);
var0.fillRect(var1 - 6, var2 - 6, var3 + 12, var4 + 12);
var0.setColor(15645576);
var0.drawRect(var1 - 3, var2 - 3, var3 + 6, var4 + 6);
var0.setColor(16772812);
var0.drawRect(var1 - 3 - 1, var2 - 3 - 1, var3 + 6 + 2, var4 + 6 + 2);
Z = var1;
ac = var2;
if (var5) {
String[] var9 = a.a(d.Z[7], 1, var3);
var0.setColor(0);
boolean var10000;
if (false & var9.length > 1) {
var10000 = true;
} else {
var10000 = false;
}
for(int var10 = 0; var10 < var9.length; ++var10) {
int var11 = d.a((String)var9[var10], 1);
d.a(var0, (String)var9[var10], 1, var1 + (var3 - var11 >> 1), var7);
var7 += d.aI[1];
}
int var6 = var8 - e.getWidth();
if (al == 0) {
d.a(var0, (Image)e, var6, var7, 20);
}
ac = var7 + 2;
}
}
private static final void g(Graphics var0) {
if (aI) {
d.a(var0, 7967429);
a(var0, aR, bd, af, ba, true);
int var1 = Z;
int var2 = ac;
int var3 = var1 + 2;
int var4 = ac - 0;
var0.setColor(16711680);
switch(d.s) {
case 8:
case 17:
int var5 = 0;
int var6 = ay;
boolean var7 = true;
for(int var8 = 0; var5 < K && var6 < at && var7; ++var8) {
String[] var9 = a.a(aF[var6], 0, af);
if (var9.length - 1 + var5 >= K) {
var7 = false;
} else {
int var10;
int var11;
int var12;
if (var6 == 9 || var6 == 10 || var6 == 11 || var6 == 12) {
var10 = var3 + d.a((String)var9[var9.length - 1], 0);
var11 = d.b(aG[0], 20);
var12 = 5 * var11 + 8;
if (var10 + var12 > aR + af && var9.length - 1 + var5 + 1 > K) {
var7 = false;
}
}
if (var7) {
for(var10 = 0; var10 < var9.length; ++var10) {
d.a(var0, (String)var9[var10], 0, var3, var4);
if (var10 == var9.length - 1) {
int var15;
int var16;
if (var6 != 9 && var6 != 10 && var6 != 11 && var6 != 12) {
if (var7 && var6 == 13 || var6 == 14) {
if (var6 == 13 && var5 + 2 > K) {
var7 = false;
} else {
var11 = var3;
var12 = var4;
byte var17 = 0;
byte var18 = 4;
if (var6 == 14) {
var17 = 4;
var18 = 7;
var11 = var3 + 11;
var12 = var4 + 5;
}
for(var15 = var17; var15 < var18; ++var15) {
if ((d.H & 1 << var15) != 0) {
var0.drawImage(O, var11, var12, 20);
} else {
var0.drawImage(S, var11, var12, 20);
}
var11 += 23;
}
if (var6 == 13) {
var11 += 4;
var0.drawImage(l, var11, var4, 20);
var15 = var11 + (l.getWidth() - d.a((String)("" + d.B), 0) >> 1);
var16 = var4 + (l.getHeight() - d.aI[0] >> 1);
d.a(var0, (String)("" + d.B), 0, var15, var16);
}
}
}
} else {
var11 = var3 + d.a((String)var9[var9.length - 1], 0) + 10;
var12 = d.b(aG[0], 20);
int var13 = 5 * var12 + 8;
if (var11 + var13 > aR + af) {
++var5;
var11 = var3 + 20;
var4 += 2 + d.aI[0];
}
int var14 = 0;
switch(var6) {
case 9:
var14 = f.c;
break;
case 10:
var14 = f.aG;
break;
case 11:
var14 = f.aP;
break;
case 12:
var14 = f.D;
}
var15 = var14 * 6 / 32767;
if (var15 > 5) {
var15 = 5;
}
var11 = aR + af - var13;
for(var16 = 0; var16 < var15; ++var16) {
d.b(var0, aG[0], var11, var4, 20);
var11 += var12 + 2;
}
var0.setClip(0, 0, d.al, d.au);
}
}
++var5;
var4 += 2 + d.aI[0];
}
if (var7) {
++var6;
}
}
}
}
aC = var6;
default:
b(var0);
aI = false;
}
}
}
private static final void n() {
if (!u) {
t = d.b(aG[0], 16);
f = d.a(aG[0], 16);
y = d.al / t;
aH = d.au - (d.aI[1] + f);
aL = d.al - t * y >> 1;
bc = aL + 2;
o = aL + t * y - 2;
aa = 5 + f + 2;
ak = aH - 2;
H = aa + 2;
u = true;
E = o - bc - 4;
}
}
private static final void i(Graphics var0) {
byte var1 = 5;
int var2 = aL;
var0.setColor(15132386);
var0.setClip(0, 0, d.al, d.au);
var0.fillRect(var2, var1 + d.a(aG[0], 16), y * t, aH - (var1 + d.a(aG[0], 16)));
++var2;
for(int var3 = 0; var3 < y; ++var3) {
d.b(var0, aG[0], var2, var1, 16);
d.b(var0, aG[0], var2, aH, 17);
var2 += t;
}
int var4 = H;
var0.setClip(0, 0, d.al, d.au);
var0.setColor(14606046);
while(var4 < ak) {
var0.drawLine(bc, var4, o - 1, var4);
var4 += 10;
}
}
private static final void a(Graphics var0) {
String[] var1 = a.a(d.Z[r], 1, E);
int var3 = aj;
var0.setColor(0);
for(int var5 = 0; var5 < var1.length; ++var5) {
int var4 = d.a((String)var1[var5], 1);
int var2 = bc + (o - bc - var4 >> 1);
d.a(var0, (String)var1[var5], 1, var2, var3);
var3 += d.aI[1];
var0.setClip(0, 0, d.al, d.au);
var0.drawLine(var2, var3, var2 + var4, var3);
var3 += 2;
}
}
public static final void a(Graphics var0, int var1, int var2, int var3, int var4, int var5, boolean var6) {
boolean var7 = false;
byte var8 = 2;
byte var9 = 0;
boolean var10 = false;
boolean var11 = false;
boolean var12 = false;
byte var13 = 0;
int var25;
int var26;
int var27;
if (!x) {
if (c.ah) {
var9 = 1;
}
var25 = var3 + var8;
var26 = var1;
var27 = var2;
if (0 < d.b(aG[0], 9)) {
var13 = 0;
}
} else {
var25 = var3 + 14;
var26 = var1 - 7 + -3;
var27 = var2 + 0;
if (0 < d.b(aG[0], 9)) {
var13 = 0;
}
}
int var15 = var27;
int var16 = var26 + var25 - d.b(aG[0], 10);
int var17 = var27 + var4 - d.a(aG[0], 14);
int var14;
if (var6) {
var14 = var26 + d.b(aG[0], 8);
for(var17 = var27 + var4 - d.a(aG[0], 13); var14 < var16; var14 += d.b(aG[0], 9) - var13) {
d.b(var0, aG[0], var14, var15, 9);
d.b(var0, aG[0], var14, var17, 13);
}
var17 = var27 + var4 - d.a(aG[0], 14);
d.b(var0, aG[0], var26, var15, 8);
d.b(var0, aG[0], var26, var17, 14);
d.b(var0, aG[0], var16 + var9, var15, 10);
d.b(var0, aG[0], var16 + var9, var17, 12);
var14 = var26;
var16 = var26 + var25 - d.b(aG[0], 11);
var15 += d.a(aG[0], 8);
for(var17 = var27 + var4 - d.a(aG[0], 14); var15 < var17; var15 += d.a(aG[0], 15)) {
d.b(var0, aG[0], var14, var15, 15);
d.b(var0, aG[0], var16 + var9, var15, 11);
}
}
var16 = var26 + var25 - d.b(aG[0], 10);
var17 = var27 + var4 - d.a(aG[0], 14);
int var18 = var25 - (d.b(aG[0], 15) + d.b(aG[0], 11));
var14 = var26 + d.b(aG[0], 15) - var8;
var15 = var27 + d.a(aG[0], 9);
if (var6) {
int var19 = var4 - (d.a(aG[0], 9) + d.a(aG[0], 13));
var0.setColor(16777215);
var0.setClip(0, 0, d.al, d.au);
var0.fillRect(var14 - 1, var15, var18 + 1 + var9 + var8, var19);
}
int var20;
String[] var28;
if (d.s != 16 && d.s != 27) {
var28 = aA;
var20 = aU;
} else {
var28 = w;
var20 = be;
}
int var22 = var28.length - var5;
int var23 = var15 + var20 - (d.aI[0] + 2) - 0;
boolean var24 = false;
int var29;
for(var29 = N; var29 < var28.length && var15 < var23; ++var29) {
int var21 = var14;
if (var29 == var22) {
var0.setClip(0, 0, d.al, d.au);
var0.setColor(16744703);
var0.fillRect(var14, var15, var18, d.aI[0]);
}
if (x) {
if (d.s == 16 && d.s != 27) {
var21 = var14 + bc;
} else {
var21 = var14 + (var18 - d.a((String)var28[var29], 0) >> 1);
}
}
d.a(var0, (String)var28[var29], 0, var21, var15);
if (x) {
}
var15 += d.aI[0] + 2;
}
az = var29 < var28.length;
if (N > 0) {
var0.setClip(var16, var27, d.b(aG[0], 10), d.a(aG[0], 10));
var0.setColor(0);
var0.drawLine(var16 + 2, var27 + 7, var16 + 2, var27 + 7);
var0.drawLine(var16 + 1, var27 + 8, var16 + 3, var27 + 8);
var0.drawLine(var16, var27 + 9, var16 + 4, var27 + 9);
}
if (az) {
var0.setClip(var16, var17, d.b(aG[0], 12), d.a(aG[0], 12));
var0.setColor(0);
var0.drawLine(var16, var17 + 5, var16 + 4, var17 + 5);
var0.drawLine(var16 + 1, var17 + 6, var16 + 3, var17 + 6);
var0.drawLine(var16 + 2, var17 + 7, var16 + 2, var17 + 7);
}
}
public static final void c(int var0) {
int var2 = g;
g = var0;
Q = var0;
x = false;
int var3 = -1;
Y = false;
switch(g) {
case 0:
d.i = true;
Y = true;
ap = null;
f var10000;
if (var2 != 0) {
if (c.cr == 4) {
c.b(0);
}
var10000 = c.C;
f.H();
}
System.gc();
if (var2 != 48 && var2 != 58 && var2 != 0 && var2 != 70 && var2 != 71) {
if ((var2 < 80 || var2 > 85) && (var2 < 60 || var2 > 66)) {
if (var2 <= 32) {
c.j(0);
if (var2 == 32) {
Y = true;
var10000 = c.C;
var10000 = c.C;
f.C(3);
var10000 = c.C;
var10000 = c.C;
f.at = 128;
var10000 = c.C;
f.l = 0;
var10000 = c.C;
var10000 = c.C;
f.aT = 80;
c.x = null;
c.bI = null;
}
}
d.d(20);
f var10001 = c.C;
c.C.cp = f.bH;
}
} else {
b(9);
}
break;
case 1:
case 2:
case 4:
case 5:
case 7:
case 9:
case 11:
case 13:
case 14:
case 16:
case 19:
case 20:
case 22:
case 24:
case 25:
case 26:
case 27:
case 28:
case 29:
case 30:
case 31:
case 32:
am = 262;
aZ = 263;
if (g != 1) {
if (g == 32) {
aZ = -1;
}
} else {
c.cr = 0;
if (ap == null || L) {
ap = null;
L = false;
System.gc();
ap = a.b("/avatar_vet.png");
}
am = 15;
aZ = 16;
}
var3 = 264 + (g - 1);
aP = d.au - d.aI[1] - 30;
break;
case 3:
case 6:
case 8:
case 10:
case 12:
case 15:
case 17:
case 18:
case 21:
case 23:
am = -1;
if (g == 6) {
am = 0;
}
aZ = -1;
x = true;
var3 = 264 + (g - 1);
if (g != 10 && g != 12 && g != 17 && g != 18) {
if (g == 23) {
c.at = 0;
}
} else {
Y = true;
}
aP = d.au;
case 33:
case 34:
case 35:
case 36:
case 37:
case 38:
case 39:
case 49:
case 59:
case 67:
case 68:
case 69:
case 72:
case 73:
case 74:
case 75:
case 76:
case 77:
case 78:
case 79:
default:
break;
case 40:
case 41:
case 42:
case 43:
case 45:
case 46:
case 47:
case 48:
am = 262;
aZ = -1;
if (g == 40 && ap == null) {
ap = c.ct;
L = false;
}
var3 = 296 + (g - 40);
aP = d.au - d.aI[1] - 30;
break;
case 44:
am = -1;
aZ = -1;
x = true;
var3 = 296 + (g - 40);
aP = d.au;
break;
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
am = 262;
aZ = -1;
if (g == 50 && ap == null) {
L = false;
ap = c.ct;
}
var3 = 305 + (g - 50);
aP = d.au - d.aI[1] - 30;
break;
case 60:
case 61:
case 62:
case 63:
case 64:
case 65:
case 66:
am = 4;
aZ = -1;
if (g == 60) {
am = 262;
}
if (ap == null || L) {
ap = null;
L = false;
ap = a.b("/avatar_vet.png");
}
var3 = 314 + (g - 60);
aP = d.au - d.aI[1];
break;
case 70:
case 71:
if (d.s != 17) {
am = 4;
aZ = -1;
}
x = true;
var3 = 321;
if (g == 71) {
var3 = 322;
}
aP = d.au - d.aI[1] - 30;
if (ap == null) {
ap = a.b("/avatar_vet.png");
}
break;
case 80:
case 81:
case 82:
case 83:
case 84:
case 85:
if (ap == null || !L) {
ap = null;
L = true;
ap = a.b("/avatar_vet_angry.png");
}
am = 4;
aZ = -1;
x = false;
var3 = 323;
if (g == 82) {
var3 = 326;
} else if (g == 83) {
var3 = 324;
} else if (g == 84) {
var3 = 325;
} else if (g == 85) {
var3 = 327;
}
aP = d.au - d.aI[1] - 30;
}
if (g != 0) {
r = -1;
j = null;
String var1 = a.a(d.Z[var3], d.aK);
if (x) {
I = d.al - (d.b(aG[0], 15) + d.b(aG[0], 11));
} else {
I = d.al - (0 + ap.getWidth()) - (d.b(aG[0], 15) + d.b(aG[0], 11));
}
aA = a.a(var1, 0, I);
aU = aA.length * (d.aI[0] + 2) + d.a(aG[0], 9) + d.a(aG[0], 13);
X = aU > aP;
if (X) {
aU = aP;
}
N = 0;
az = true;
if (aU < 45) {
aU = 45;
}
}
}
public static void a(boolean var0) {
if (var0) {
if (aC != 15) {
p[al] = ay;
++al;
ay = aC;
} else {
al = 0;
ay = 0;
}
aI = true;
} else if (al > 0) {
--al;
ay = p[al];
aI = true;
}
}
static {
D = d.al * 90 / 100;
a = d.al - D >> 1;
x = false;
X = false;
N = 0;
az = true;
aG = new int[3];
aM = 0;
bb = 0;
u = false;
am = 0;
aZ = 1;
ar = 8;
aT = 1;
ax = d.al >> 1;
M = d.au >> 1;
Y = true;
ai = -1;
P = -1L;
V = -1;
aK = -1;
aw = -1;
an = -1;
aB = -1;
au = -1;
aI = false;
m = 0L;
i = false;
aJ = false;
aS = false;
ad = false;
aX = false;
aV = 0;
aD = 0;
C = null;
s = null;
U = 0L;
c = false;
boolean var10000 = false;
p = new int[15];
aE = true;
}
}
| Gamr13/MyDogDecomp | e.java |
490 |
public class A {
int a=40;
public static void main(String[] args) {
System.out.print(a);
}
}
| Nikitapande/BasicJava | A.java |
491 | public class A {
protected int num;
String name;
int[] arr;
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public A(int num, String name) {
this.num = num;
this.name = name;
this.arr = new int[num];
}
} | RGcoderA/JavaOOP | A.java |
492 | import java.util.Scanner;
public class a {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Ingresa el numero n: ");
int n = sc.nextInt();
// imprimir los numeros primos entre 1 y n
for (int i = 2; i <= n; i++) {
System.out.print(((i == 1 && i != 1)|| (i % 2 == 0 && i != 2) || (i % 3 == 0 && i != 3) || (i % 5 == 0 && i!= 5) || (i % 7 == 0 && i != 7)) ? "" : i + " ");
}
}
} | AlexGrim12/POO | a.java |
493 | package com.ums;
import org.springframework.boot.autoconfigure.gson.GsonProperties;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
public class A {
//predicate
public static void main(String[] args) {
List<Integer> data = Arrays.asList(10, 20, 34, 54, 45, 67, 66, 44, 78, 98);
List<Integer> newData = data.stream().filter(n -> n % 2 != 0).collect(Collectors.toList());
System.out.println(newData);
}
}
| Khirasagar/StreamAPI-Problems | A.java |
494 | class A
{
public static void main(String [] args)
{
System.out.println("Inside class A");
}
}
class B
{
public static void main(String [] args)
{
System.out.println("Inside class B");
}
}
class C
{
public static void main(String [] args)
{
System.out.println("Inside class C");
}
} | amitdubeyup/program | B.java |
495 | public class A{
public A(){}
public static int test(){
boolean b = true;
boolean e = false;
Object a = new A();
boolean c = e || a instanceof A;
boolean d = b && a instanceof A;
if (c && d){
return 123;
}
else {
return 12378;
}
}
}
| WeiqiangYu0528/cs644 | A.java |
496 | import java.util.Scanner;
public class mAritimetica {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Informe um número: ");
double numero1 = scanner.nextDouble();
System.out.print("Informe outro número: ");
double numero2 = scanner.nextDouble();
scanner.close();
double media = (numero1 + numero2) / 2;
System.out.println("A média aritmética é: " + media);
}
}
| Pedro-HCM/una-lista-02-java-202302 | 1.java |
497 | import java.util.Collection;
import java.util.Collections;
import java.util.List;
import net.minecraft.server.MinecraftServer;
public class z
extends i
{
public String c()
{
return "effect";
}
public int a()
{
return 2;
}
public String b(m ☃)
{
return "commands.effect.usage";
}
public void a(MinecraftServer ☃, m ☃, String[] ☃)
throws bz
{
if (☃.length < 2) {
throw new cf("commands.effect.usage", new Object[0]);
}
sa ☃ = (sa)a(☃, ☃, ☃[0], sa.class);
if (☃[1].equals("clear"))
{
if (☃.bO().isEmpty()) {
throw new bz("commands.effect.failure.notActive.all", new Object[] { ☃.h_() });
}
☃.bN();
a(☃, this, "commands.effect.success.removed.all", new Object[] { ☃.h_() }); return;
}
rk ☃;
try
{
☃ = rk.a(a(☃[1], 1));
}
catch (cb ☃)
{
☃ = rk.b(☃[1]);
}
if (☃ == null) {
throw new cb("commands.effect.notFound", new Object[] { ☃[1] });
}
int ☃ = 600;
int ☃ = 30;
int ☃ = 0;
if (☃.length >= 3)
{
☃ = a(☃[2], 0, 1000000);
if (☃.b()) {
☃ = ☃;
} else {
☃ = ☃ * 20;
}
}
else if (☃.b())
{
☃ = 1;
}
if (☃.length >= 4) {
☃ = a(☃[3], 0, 255);
}
boolean ☃ = true;
if ((☃.length >= 5) &&
("true".equalsIgnoreCase(☃[4]))) {
☃ = false;
}
if (☃ > 0)
{
rl ☃ = new rl(☃, ☃, ☃, false, ☃);
☃.c(☃);
a(☃, this, "commands.effect.success", new Object[] { new fb(☃.f(), new Object[0]), Integer.valueOf(rk.a(☃)), Integer.valueOf(☃), ☃.h_(), Integer.valueOf(☃) });
return;
}
if (☃.a(☃))
{
☃.d(☃);
a(☃, this, "commands.effect.success.removed", new Object[] { new fb(☃.a(), new Object[0]), ☃.h_() });
}
else
{
throw new bz("commands.effect.failure.notActive", new Object[] { new fb(☃.a(), new Object[0]), ☃.h_() });
}
}
public List<String> a(MinecraftServer ☃, m ☃, String[] ☃, cj ☃)
{
if (☃.length == 1) {
return a(☃, ☃.J());
}
if (☃.length == 2) {
return a(☃, rk.b.c());
}
if (☃.length == 5) {
return a(☃, new String[] { "true", "false" });
}
return Collections.emptyList();
}
public boolean b(String[] ☃, int ☃)
{
return ☃ == 0;
}
}
| MCLabyMod/LabyMod-1.9 | z.java |
498 | import java.util.Collections;
import java.util.List;
import net.minecraft.server.MinecraftServer;
public class s
extends i
{
public String c()
{
return "blockdata";
}
public int a()
{
return 2;
}
public String b(m ☃)
{
return "commands.blockdata.usage";
}
public void a(MinecraftServer ☃, m ☃, String[] ☃)
throws bz
{
if (☃.length < 4) {
throw new cf("commands.blockdata.usage", new Object[0]);
}
☃.a(n.a.b, 0);
cj ☃ = a(☃, ☃, 0, false);
aht ☃ = ☃.e();
if (!☃.e(☃)) {
throw new bz("commands.blockdata.outOfWorld", new Object[0]);
}
arc ☃ = ☃.o(☃);
apv ☃ = ☃.r(☃);
if (☃ == null) {
throw new bz("commands.blockdata.notValid", new Object[0]);
}
dn ☃ = new dn();
☃.b(☃);
dn ☃ = (dn)☃.b();
dn ☃;
try
{
☃ = ed.a(a(☃, ☃, 3).c());
}
catch (ec ☃)
{
throw new bz("commands.blockdata.tagError", new Object[] { ☃.getMessage() });
}
☃.a(☃);
☃.a("x", ☃.p());
☃.a("y", ☃.q());
☃.a("z", ☃.r());
if (☃.equals(☃)) {
throw new bz("commands.blockdata.failed", new Object[] { ☃.toString() });
}
☃.a(☃);
☃.v_();
☃.a(☃, ☃, ☃, 3);
☃.a(n.a.b, 1);
a(☃, this, "commands.blockdata.success", new Object[] { ☃.toString() });
}
public List<String> a(MinecraftServer ☃, m ☃, String[] ☃, cj ☃)
{
if ((☃.length > 0) && (☃.length <= 3)) {
return a(☃, 0, ☃);
}
return Collections.emptyList();
}
}
| MCLabyMod/LabyMod-1.9 | s.java |
499 | import java.io.*;
import java.util.*;
class A
{
int a,m; int sum;
double addi(int a,int m)
{
sum = a+m;
return sum;
}
double sqrtl(int am)
{
double num;
double s = am /2;
do{
num = s;
s = (num + (am/num))/2;
}while ((num -s) != 0);
return s;
}
}
class B
{
public static void main(String[] args)
{
A obj = new A();
System.out.println(obj.addi(2,4));
A obj1 = new A();
System.out.println(obj1.sqrtl(16));
}
} | abhijeet090102/Concept_java | B.java |
500 | class Demo
{
public static void main(String[] args)
{
A x=new A();
A y=new A();
x.add(10,2);
y.add(3,5);
}
}
class A
{
void add(int a,int b)
{
int s;
s=a+b;
System.out.println(s);
}
}
| tamalbarman/Java | A.java |
501 | // BFS algorithm in Java
import java.util.*;
public class Graph {
private int V;
private LinkedList<Integer> adj[];
// Create a graph
Graph(int v) {
V = v;
adj = new LinkedList[v];
for (int i = 0; i < v; ++i)
adj[i] = new LinkedList();
}
// Add edges to the graph
void addEdge(int v, int w) {
adj[v].add(w);
}
// BFS algorithm
void BFS(int s) {
boolean visited[] = new boolean[V];
LinkedList<Integer> queue = new LinkedList();
visited[s] = true;
queue.add(s);
while (queue.size() != 0) {
s = queue.poll();
System.out.print(s + " ");
Iterator<Integer> i = adj[s].listIterator();
while (i.hasNext()) {
int n = i.next();
if (!visited[n]) {
visited[n] = true;
queue.add(n);
}
}
}
}
public static void main(String args[]) {
Graph g = new Graph(4);
g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);
System.out.println("Following is Breadth First Traversal " + "(starting from vertex 2)");
g.BFS(2);
}
}
| AkashMarkad/Hacktoberfest-2022 | BFS Algorithm in Graph.java |
502 | import java.applet.*;
import java.awt.*;
public class Main extends Applet{
public void paint(Graphics g){
g.drawString("Welcome in Java Applet.",40,20);
}
}
| CODEMASTERSTACK/Hi.com | main |
503 | // Recursive Java program for insertion sort
import java.util.Arrays;
public class GFG
{
// Recursive function to sort an array using
// insertion sort
static void insertionSortRecursive(int arr[], int n)
{
// Base case
if (n <= 1)
return;
// Sort first n-1 elements
insertionSortRecursive( arr, n-1 );
// Insert last element at its correct position
// in sorted array.
int last = arr[n-1];
int j = n-2;
/* Move elements of arr[0..i-1], that are
greater than key, to one position ahead
of their current position */
while (j >= 0 && arr[j] > last)
{
arr[j+1] = arr[j];
j--;
}
arr[j+1] = last;
}
// Driver Method
public static void main(String[] args)
{
int arr[] = {12, 11, 13, 5, 6};
insertionSortRecursive(arr, arr.length);
System.out.println(Arrays.toString(arr));
}
}
| ktsrivastava29/HacktoberFest-2021-CodeVault | inc.c |
504 | import java.io.IOException;
import java.util.Iterator;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.io.LongWritable;
import org.apache.hadoop.io.Text;
import org.apache.hadoop.mapreduce.lib.input.FileInputFormat;
import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;
import org.apache.hadoop.mapreduce.lib.output.TextOutputFormat;
import org.apache.hadoop.mapreduce.lib.input.TextInputFormat;
import org.apache.hadoop.mapreduce.Job;
import org.apache.hadoop.mapreduce.Mapper;
import org.apache.hadoop.mapreduce.Reducer;
import org.apache.hadoop.conf.Configuration;
public class MyMaxMin {
//Mapper
/**
*MaxTemperatureMapper class is static and extends Mapper abstract class
having four hadoop generics type LongWritable, Text, Text, Text.
*/
public static class MaxTemperatureMapper extends
Mapper<LongWritable, Text, Text, Text> {
/**
* @method map
* This method takes the input as text data type.
* Now leaving the first five tokens,it takes 6th token is taken as temp_max and
* 7th token is taken as temp_min. Now temp_max > 35 and temp_min < 10 are passed to the reducer.
*/
@Override
public void map(LongWritable arg0, Text Value, Context context)
throws IOException, InterruptedException {
//Converting the record (single line) to String and storing it in a String variable line
String line = Value.toString();
//Checking if the line is not empty
if (!(line.length() == 0))
{
String date = line.substring(6, 14); //date
float temp_Max = Float.parseFloat(line.substring(39, 45).trim()); //maximum temperature
float temp_Min = Float.parseFloat(line.substring(47, 53).trim()); //minimum temperature
//if maximum temperature is greater than 35 , its a hot day
if (temp_Max > 35.0) {
context.write(new Text("Hot Day " + date),new Text(String.valueOf(temp_Max))); // Hot day
}
//if minimum temperature is less than 10 , its a cold day
if (temp_Min < 10) {
context.write(new Text("Cold Day " + date),new Text(String.valueOf(temp_Min))); // Cold day
}
}
}
}
//Reducer
/**
*MaxTemperatureReducer class is static and extends Reducer abstract class
having four hadoop generics type Text, Text, Text, Text.
*/
public static class MaxTemperatureReducer extends
Reducer<Text, Text, Text, Text> {
/**
* @method reduce
* This method takes the input as key and list of values pair from mapper, it does aggregation
* based on keys and produces the final context.
*/
public void reduce(Text Key, Iterator<Text> Values, Context context)
throws IOException, InterruptedException {
//putting all the values in temperature variable of type String
String temperature = Values.next().toString();
context.write(Key, new Text(temperature));
}
}
/**
* @method main
* This method is used for setting all the configuration properties.
* It acts as a driver for map reduce code.
*/
public static void main(String[] args) throws Exception {
//reads the default configuration of cluster from the configuration xml files
Configuration conf = new Configuration();
//Initializing the job with the default configuration of the cluster
Job job = new Job(conf, "weather example");
job.setJarByClass(MyMaxMin.class); //Assigning the driver class name
job.setMapOutputKeyClass(Text.class); //Key type coming out of mapper
job.setMapOutputValueClass(Text.class); //value type coming out of mapper
job.setMapperClass(MaxTemperatureMapper.class); //Defining the mapper class name
job.setReducerClass(MaxTemperatureReducer.class); //Defining the reducer class name
//Defining input Format class which is responsible to parse the dataset into a key value pair
job.setInputFormatClass(TextInputFormat.class);
//Defining output Format class which is responsible to parse the dataset into a key value pair
job.setOutputFormatClass(TextOutputFormat.class);
//setting the second argument as a path in a path variable
Path OutputPath = new Path(args[1]);
//Configuring the input path from the filesystem into the job
FileInputFormat.addInputPath(job, new Path(args[0]));
//Configuring the output path from the filesystem into the job
FileOutputFormat.setOutputPath(job, new Path(args[1]));
//deleting the context path automatically from hdfs so that we don't have delete it explicitly
OutputPath.getFileSystem(conf).delete(OutputPath);
//exiting the job only if the flag value becomes false
System.exit(job.waitForCompletion(true) ? 0 : 1);
}
}
| jerald1608/big_data_analytics | ex7/MyMaxMin.java |
506 | package huangyongsheng;
import java.util.Scanner;
public class x {
/**
* @param args
*/
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
System.out.println("...");
int score=scanner.nextInt();
// TODO Auto-generated method stub
if(score>90)
System.out.println("A");
else if(score>=80)
System.out.println("B");
else if(score>=60)
System.out.println("C");
else
System.out.println("F");
}
}
| A205/huangyongsheng | x.java |
507 | /*1*/
class TC21 {
public static void main(String[] a) {
Fac mtTmp2;
int mtTmp3;
int mtTmp1;
mtTmp2 = new Fac();
mtTmp3 = 10;
mtTmp1 = mtTmp2.ComputeFac(mtTmp3);
System.out.println(mtTmp1);
}
}
class Fac {
public int ComputeFac(int num) {
int num_aux;
boolean mtTmp4;
int mtTmp5;
int mtTmp6;
int mtTmp7;
Fac mtTmp9;
int mtTmp10;
int mtTmp11;
int mtTmp8;
mtTmp5 = 0;
mtTmp4 = num <= mtTmp5;
if (mtTmp4) {
mtTmp6 = 1;
num_aux = mtTmp6;
} else {
mtTmp9 = new Fac();
mtTmp11 = 1;
mtTmp10 = num - mtTmp11;
mtTmp8 = mtTmp9.ComputeFac(mtTmp10);
mtTmp7 = num * mtTmp8;
num_aux = mtTmp7;
}
return num_aux;
}
}
| jayantakumar/Register-Allocation | input |
508 | import java.io.*;
import java.lang.*;
import java.util.*;
class J
{
public static void main(String[]args)throws IOException
{
BufferedReader venki=new BufferedReader(new InputStreamReader(System.in));
//
int t=Integer.parseInt(venki.readLine());
for(int T=0;T<t;T++)
{
int k=0,sum=0;
int n=Integer.parseInt(venki.readLine());
int c[]=new int[n],a[]=new int[100000][100000];
for(i=0;i<n;i++)
{
StringTokenizer tk = new StringTokenizer(venki.readLine());
c[i]=Integer.parseInt(tk.nextToken());
for(j=0;<c[i];j++)
{
StringTokenizer tk1 = new StringTokenizer(venki.readLine());
a[i][j]=Integer.parseInt(tk1.nextToken());
if(j%2==0)
{
sum+=a[i][k];
k++;
}
}
}
System.out.println(sum);
}
}
} | flick-23/JAVA-Programs | J.java |
511 | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
private void solution() throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int x = Integer.parseInt(br.readLine());
int n = Integer.parseInt(br.readLine());
int sum = 0;
while (n-->0) {
StringTokenizer st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
sum+=a*b;
}
System.out.println(sum==x?"Yes":"No");
}
public static void main(String[] args) throws Exception {
new Main().solution();
}
}
| nahwasa/BOJ_BaekjoonOnlineJudge | 25300/BOJ_25304.java |
512 | //{ Driver Code Starts
// Initial Template for Java
import java.io.*;
import java.util.*;
class GFG{
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
while (t-- > 0) {
int n = Integer.parseInt(br.readLine().trim());
String[] str = br.readLine().trim().split(" ");
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = Integer.parseInt(str[i]);
String[] xy = br.readLine().trim().split(" ");
int x = Integer.parseInt(xy[0]);
int y = Integer.parseInt(xy[1]);
Solution g = new Solution();
System.out.println(g.minDist(a, n, x, y));
}
}
}
// } Driver Code Ends
// User function Template for Java
class Solution {
int minDist(int a[], int n, int x, int y) {
// code here
int p = -1;
int q = -1;
int min = Integer.MAX_VALUE;
for(int i = 0 ; i < n ; i++){
if(a[i] == x) p = i;
else if(a[i] == y)q = i;
if(p != -1 && q != -1){
int d = Math.abs(p-q);
if(d < min)min = d;
}
}
if(p == -1 || q == -1)return -1;
else return min;
}
}
| dhruvabhat24/Geeks-4-Geeks_November | 2.java |
513 | package pl.touk.sputnik;
import org.apache.commons.cli.CommandLine;
import org.apache.commons.cli.HelpFormatter;
import org.apache.commons.cli.ParseException;
import org.jetbrains.annotations.NotNull;
import pl.touk.sputnik.configuration.*;
import pl.touk.sputnik.connector.ConnectorFacade;
import pl.touk.sputnik.connector.ConnectorFacadeFactory;
import pl.touk.sputnik.connector.ConnectorType;
import pl.touk.sputnik.engine.Engine;
public final class Main {
private static final String SPUTNIK = "sputnik";
private static final String HEADER = "Sputnik - review your Gerrit patchset with Checkstyle, PMD and FindBugs";
private static final int WIDTH = 120;
private Main() {}
public static void main(String[] args) {
printWelcomeMessage();
CliWrapper cliWrapper = new CliWrapper();
CommandLine commandLine = null;
try {
commandLine = cliWrapper.parse(args);
} catch (ParseException e) {
printUsage(cliWrapper);
System.out.println(e.getMessage());
System.exit(1);
}
ConfigurationHolder.initFromFile(commandLine.getOptionValue(CliOption.CONF.getCommandLineParam()));
Configuration configuration = ConfigurationHolder.instance();
configuration.updateWithCliOptions(commandLine);
ConnectorFacade facade = getConnectorFacade(configuration);
new Engine(facade).run();
}
private static ConnectorFacade getConnectorFacade(Configuration configuration) {
ConnectorType connectorType = ConnectorType.getValidConnectorType(configuration.getProperty(GeneralOption.CONNECTOR_TYPE));
ConnectorFacade facade = null;
try {
facade = ConnectorFacadeFactory.INSTANCE.build(connectorType);
facade.validate(ConfigurationHolder.instance());
} catch (GeneralOptionNotSupportedException e) {
System.out.println(e.getMessage());
System.exit(2);
}
return facade;
}
private static void printUsage(@NotNull CliWrapper cliOptions) {
System.out.println(HEADER);
HelpFormatter helpFormatter = new HelpFormatter();
helpFormatter.setWidth(WIDTH);
helpFormatter.printHelp(SPUTNIK, cliOptions.getOptions(), true);
}
private static void printWelcomeMessage() {
System.out.println("Sputnik version " + Main.class.getPackage().getImplementationVersion());
}
}
| lbordowitz/sputnik | src/main/java/pl/touk/sputnik/Main.java |
514 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// Prints "Hello, World" to the terminal window.
Scanner input= new Scanner(System.in);
System.out.printIn("Enter your name");
String n;
n=input.nextLine();
System.out.printIn("Welcome, " + n + ", How are you");
}
} | naquangaston/HostedFiles | e.java |
515 | import java.util.*;
public class Main{
public void addition(int[][] a,int[][] b)
{
int i,j;
for(i=0;i<3;i++)
{
System.out.print("[ ");
for(j=0;j<3;j++)
{
System.out.print((a[i][j]+b[i][j])+" ");
}
System.out.println("]");
}
}
public void subtraction(int[][] a,int[][] b)
{
int i,j;
for(i=0;i<3;i++)
{
System.out.print("[ ");
for(j=0;j<3;j++)
{
System.out.print((a[i][j]-b[i][j])+" ");
}
System.out.println("]");
}
}
public void multiplication(int[][] a,int[][] b)
{
int i,j;
int sum=0;
for(i=0;i<3;i++)
{
System.out.print("[ ");
for(j=0;j<3;j++)
{
for(int k=0;k<3;k++)
{
sum+=(a[i][k]*b[k][j]);
}
System.out.print(sum+" ");
sum=0;
}
System.out.println("]");
}
}
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
Main ob = new Main();
int i, j,ch;
int [][] a = new int[3][3];
int [][] b = new int[3][3];
System.out.println("Enter the values of a");
for (i = 0; i < 3; i++) {
System.out.print("[ ");
for (j = 0; j < 3; j++) {
a[i][j]=sc.nextInt();
}
}
System.out.println("Enter the values of b");
for (i = 0; i < 3; i++) {
System.out.print("[ ");
for (j = 0; j < 3; j++) {
b[i][j]=sc.nextInt();
}
}
while(true) {
System.out.println("|--------MENU--------|");
System.out.println("| 1.Addition |");
System.out.println("| 2.Subtraction |");
System.out.println("| 3.Multiplication |");
System.out.println("| 4.Exit |");
System.out.println("|--------------------|");
System.out.println("Enter your choice");
ch = sc.nextInt();
switch (ch) {
case 1:
ob.addition(a, b);
break;
case 2:
ob.subtraction(a, b);
break;
case 3:
ob.multiplication(a, b);
break;
case 4:
System.exit(0);
default:
System.out.println("Wrong choice glupy");
break;
}
}
}
} | Welding-Torch/Java-Prac | 8.java |
516 | import java.util.Scanner;
public class Equacao{
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Digite o coeficiente 'a': ");
double a = scanner.nextDouble();
System.out.print("Digite o coeficiente 'b': ");
double b = scanner.nextDouble();
System.out.print("Digite o coeficiente 'c': ");
double c = scanner.nextDouble();
if (a == 0 && b == 0 && c != 0) {
System.out.println("Coeficientes informados incorretamente.");
} else if (a == 0 && b != 0) {
System.out.println("Essa é uma equação de primeiro grau.");
double raiz = -c / b;
System.out.println("Raiz real da equação: " + raiz);
} else {
double delta = b * b - 4 * a * c;
if (delta < 0) {
System.out.println("Esta equação não possui raízes reais.");
} else if (delta == 0) {
System.out.println("Esta equação possui duas raízes reais iguais.");
double raiz = -b / (2 * a);
System.out.println("Valor das raízes: " + raiz);
} else {
System.out.println("Esta equação possui duas raízes reais diferentes.");
double raiz1 = (-b + Math.sqrt(delta)) / (2 * a);
double raiz2 = (-b - Math.sqrt(delta)) / (2 * a);
System.out.println("Valor da primeira raiz: " + raiz1);
System.out.println("Valor da segunda raiz: " + raiz2);
}
}
scanner.close();
}
}
| Pedro-HCM/una-lista-03-csharp-202302 | 3.java |
517 | // https://www.hackerrank.com/challenges/java-if-else/problem
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int i = scan.nextInt();
double d = scan.nextDouble();
String useless = scan.nextLine();
String s = scan.nextLine();
System.out.println("String: " + s);
System.out.println("Double: " + d);
System.out.println("Int: " + i);
}
}
| haytastan/Hackerrank_Java | 4.java |
518 | import java.util.*;
public class Solution {
public static boolean canWin(int leap, int[] game, int i) {
if (i < 0 || game[i] == 1)
return false;
if (i + 1 >= game.length || i + leap >= game.length)
return true;
game[i] = 1; //flag
return canWin(leap, game, i + leap)
|| canWin(leap, game, i + 1)
|| canWin(leap, game, i - 1);
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int q = scan.nextInt();
while (q-- > 0) {
int n = scan.nextInt();
int leap = scan.nextInt();
int[] game = new int[n];
for (int i = 0; i < n; i++) {
game[i] = scan.nextInt();
}
System.out.println((canWin(leap, game, 0)) ? "YES" : "NO");
}
scan.close();
}
}
| TechnoBlogger14o3/HackerRank-Java-Practice-Solutions | src/32. Java_1D_Array.java |
519 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
char operator;
Double number1, number2, result;
// create an object of Scanner class
Scanner input = new Scanner(System.in);
// ask users to enter operator
System.out.println("Choose an operator: +, -, *, or /");
operator = input.next().charAt(0);
// ask users to enter numbers
System.out.println("Enter first number");
number1 = input.nextDouble();
System.out.println("Enter second number");
number2 = input.nextDouble();
switch (operator) {
// performs addition between numbers
case '+':
result = number1 + number2;
System.out.println(number1 + " + " + number2 + " = " + result);
break;
// performs subtraction between numbers
case '-':
result = number1 - number2;
System.out.println(number1 + " - " + number2 + " = " + result);
break;
// performs multiplication between numbers
case '*':
result = number1 * number2;
System.out.println(number1 + " * " + number2 + " = " + result);
break;
// performs division between numbers
case '/':
result = number1 / number2;
System.out.println(number1 + " / " + number2 + " = " + result);
break;
default:
System.out.println("Invalid operator!");
break;
}
input.close();
}
}
| kroy-1/kroy-3 | .java |
521 | public class LinkedList {
public static class Node{
int data;
Node next;
public Node(int data){
this.data = data;
this.next = null;
}
}
public static Node head;
public static Node tail;
public static int size;
public void addFirst(int data){
Node newNode = new Node(data);
size++;
if(head == null){
head = tail = newNode;
return;
}
newNode.next = head;
head = newNode;
}
public void addLast(int data){
Node newNode = new Node(data);
size++;
if(head == null){
head = tail = newNode;
return;
}
tail.next = newNode;
tail = newNode;
}
public void addMidd(int idx, int data) {
if(idx == 0){
addFirst(data);
return;
}
Node newNode = new Node(data);
size++;
Node temp = head;
int i = 0;
while (i < idx) {
temp = temp.next;
i++;
}
newNode.next = temp.next;
temp.next = newNode;
}
public int removeFirst() {
if(head == null){
System.out.println("LL is empty");
return Integer.MIN_VALUE;
}
int val = head.data;
size--;
if(head == tail){
head = tail = null;
return val;
}
head = head.next;
return val;
}
public int removeLast() {
if(head == null){
System.out.println("LL is empty");
return Integer.MIN_VALUE;
}
int val = head.data;
size--;
if(head == tail){
head = tail = null;
return val;
}
Node prev = head;
while(prev.next!=tail){
prev = prev.next;
}
val = prev.next.data;
prev.next = tail;
tail = prev;
return val;
}
public void print() {
Node temp = head;
while (temp!=null) {
System.out.print(temp.data + "->");
temp = temp.next;
}
System.out.print("null");
System.out.println();
}
// Searching In linked list
public int itrSearch(int key) {
if(head == null){
return -1;
}
int i = 0;
Node temp = head;
while(temp!=null){
if(temp.data == key)
return i;
i++;
temp = temp.next;
}
return -1;
}
// Searching Using recursion
// public int recSearch(int key, Node start) {
// }
public static void main(String[] args) {
LinkedList ll = new LinkedList();
ll.addFirst(1);
ll.print();
ll.addLast(2);
ll.print();
ll.addLast(4);
ll.print();
ll.addMidd(2, 3);
ll.print();
}
}
| regression1607/HacktoberFest | rishi.java |
523 | import java.util.*;
import java.io.*;
import java.lang.Math;
class Solution{
public static void main(String []argh){
Scanner in = new Scanner(System.in);
int t=in.nextInt();
for(int i=0;i<t;i++){
int a = in.nextInt();
int b = in.nextInt();
int n = in.nextInt();
int result = a + (int) Math.pow(2, 0) * b;
System.out.print(result + " ");
for(int j=1; j<n; j++){
result += (int) Math.pow(2, j) * b;
System.out.print(result + " ");
}
System.out.println();
}
in.close();
}
}
| Ravi-758/100-Days-of-Coding-Challenge | day3 |
526 | import java.util.*;
public class n {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter N");
int n = sc.nextInt();
for (int i = 2; i <= 10; i++) {
// System.out.println(i);
if (n >= i) {
if (n / i == 0) {
System.out.println("valid");
} else if (n / i != 0) {
System.out.println("invalid");
}
} else {
System.out.println("k is small");
}
}
}
}
| aftab026/DSA | n.java |
528 | import java.util.*;
class sumofelements
{
public static void main(String args[])
{
int a[]=new int[30];
int n,i,sum=0;
Scanner input=new Scanner(System.in);
System.out.println("How many elements?");
n=input.nextInt();
System.out.println("Enter the elements");
for(i=0;i<n;i++)
a[i]=input.nextInt();
for(i=0;i<n;i++)
sum=sum+a[i];
System.out.println("The sum of the elements is"+" "+sum);
}
}
| miraz00/exp2 | 1.java |
529 | import java.util.*;
class B{
public static void main(String args[]) {
Scanner sc=new Scanner(System.in);
int a;
float b;
String c;
double d;
System.out.println("enter your a :");
a=sc.nextInt();
System.out.println("enter your b:");
b=sc.nextInt();
System.out.println("enter your c:");
c=sc.nextLine();
System.out.println("enter your d:");
d=sc.nextDouble();
}
}
| Jeevananthamcse/Java-Programs | B.java |
530 | import java.util.Scanner;
public class QuadraticEquationSolver {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("Enter the coefficients a, b and c of the quadratic equation ax^2 + bx + c = 0: ");
double a = input.nextDouble();
double b = input.nextDouble();
double c = input.nextDouble();
double discriminant = b * b - 4 * a * c;
if (discriminant < 0) {
System.out.println("The quadratic equation has no real roots.");
} else if (discriminant == 0) {
double root = -b / (2 * a);
System.out.println("The quadratic equation has one root: " + root);
} else {
double root1 = (-b + Math.sqrt(discriminant)) / (2 * a);
double root2 = (-b - Math.sqrt(discriminant)) / (2 * a);
System.out.println("The quadratic equation has two roots: " + root1 + " and " + root2);
}
}
}
| cicada0007/COLLEGE_JAVA_LAB | 1.java |
531 | import java.util.*;
public class B {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int r = m(n);
if (r == -1) {
System.out.println("NOT HAUNTING");
} else {
System.out.println(r);
}
}
static int m(int n) {
// if (n == 1) return 0;
int k = (int)(Math.log(n) / Math.log(2) + 1e-10);
int v = 1 << k;
if (n == v) {
return 2 * n - 1;
} else {
return -1;
}
// if (n == 1) return 1;
// if (n % 2 == 1) return -1;
// int p = m(n / 2);
// if (p == -1) return -1;
// return p + n;
}
}
| swiftyx/UW-ICPC-Qualifier-2019 | B.java |
532 | import java.util.Scanner;
public class Vinaio {
public static void main(String[] args) {
Scanner lettore = new Scanner(System.in);
int bottiglioni, nClienti = 0, nBottiglioni = 0;
double cap = 1.5, merlot = 1, lugana = 2, barbera = 1.5, iva, prezzoTotale = 0, vinoScelto;
String scelta, tipoVino;
do {
nClienti = nClienti + 1;
System.out.println("Quanti bottiglioni vuoi comprare?");
bottiglioni = lettore.nextInt();
nBottiglioni = nBottiglioni + bottiglioni;
lettore.nextLine();
System.out.println("Che tipo di vino vuoi acquistare? Inserire M per Merlot, L per lugana o B per barbera");
tipoVino = lettore.nextLine();
while (!tipoVino.equalsIgnoreCase("m") && !tipoVino.equalsIgnoreCase("b") && !tipoVino.equalsIgnoreCase("l")) {
System.out.println("Non hai inserito nessuna delle tre opzioni!\nInserisci di nuovo");
tipoVino = lettore.nextLine();
}
if (tipoVino.equalsIgnoreCase("m")) {
vinoScelto = merlot;
} else if (tipoVino.equalsIgnoreCase("l")) {
vinoScelto = lugana;
} else {
vinoScelto = barbera;
}
prezzoTotale = prezzoTotale + (cap * vinoScelto * bottiglioni);
System.out.println("Inserire S per un altro cliente o N per chiudere");
scelta = lettore.nextLine();
while (!scelta.equalsIgnoreCase("S") && !scelta.equalsIgnoreCase("N")) {
System.out.println("Non hai inserito ne' S ne' N!\nInserire S per continuare con un altro cliente o N per chiudere");
scelta = lettore.nextLine();
}
} while (scelta.equalsIgnoreCase("S"));
iva = prezzoTotale * 0.21;
double prezzoConIva = prezzoTotale + iva;
System.out.println("BARBERA VINI" + "\nSCONTRINO\n" + "N.clienti: " + nClienti + "\nIl numero di bottiglioni acquistati e': " + nBottiglioni +
"\nIl prezzo totale del vino e': " + prezzoTotale + " €" + "\nL'IVA applicata è di: " + Math.ceil(iva * 100) / 100 + " €" + "\nIl totale è: "
+ Math.ceil(prezzoConIva * 100) / 100 + " €\nCASSA CHIUSA");
}
}
| vise07/esercizi | vinaio |
533 | import java.util.Scanner;
public class voting {
public static void main(String[] args) {
int age,shrt;
Scanner scan = new Scanner(System.in);
System.out.println(" Please enter your age");
age = scan.nextInt();
if(age>=18) {
System.out.println("Welcome to voting system Yo can Vote");}
else
{shrt= (18 - age);
System.out.println("Sorry,You can vote after :"+ shrt + " years");}
}
}
| lankipalliprasanth/java-CSA0956 | voting.java |
534 | public class h
{
public static void main(String[] args)
{
while(true)
{
System.out.println("h");
}
}
}
| H4ckerxx44/h | h.java |
537 | import java.util.Scanner;
class user_get_input{
public static void main(String args[]){
System.out.println("How many operation you do?");
Scanner input= new Scanner(System.in);
int operators= input.nextInt();
int num1;
int num2;
int result=0;
int count=0;
for(int x=0;x<operators;x++){
if(count==0){
count++;
System.out.println("Enter the num1");
num1=input.nextInt();
System.out.println("Enter the num2");
num2=input.nextInt();
input.nextLine();
System.out.println("Enter the operator");
char oper=input.next().charAt(0);
switch(oper){
case'+':
result=num1+num2;
System.out.println(num1+"+"+num2+"="+result);
break;
case'-':
result=num1-num2;
System.out.println(num1+"-"+num2+"="+result);
break;
case'*':
result=num1*num2;
System.out.println(num1+"*"+num2+"="+result);
break;
case'/':
result=num1/num2;
System.out.println(num1+"/"+num2+"="+result);
break;
case'%':
result=num1%num2;
System.out.println(num1+"%"+num2+"="+result);
break;
}
}else{
num1=result;
System.out.println("Enter the num2");
num2=input.nextInt();
input.nextLine();
System.out.println("Enter the operator");
char oper=input.next().charAt(0);
switch(oper){
case'+':
result=num1+num2;
System.out.println(num1+"+"+num2+"="+result);
break;
case'-':
result=num1-num2;
System.out.println(num1+"-"+num2+"="+result);
break;
case'*':
result=num1*num2;
System.out.println(num1+"*"+num2+"="+result);
break;
case'/':
result=num1/num2;
System.out.println(num1+"/"+num2+"="+result);
break;
case'%':
result=num1%num2;
System.out.println(num1+"%"+num2+"="+result);
break;
}
}
}
System.out.println(result);
}
}
| Rubakumardirushan/calculater | cal2 |
539 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int vtr = 20;
int[] numeros = new int[vtr];
int[] par = new int[vtr];
int[] impar = new int[vtr];
int countPar = 0;
int countImpar = 0;
for (int i = 0; i < vtr; i++) {
System.out.print("Digite o número " + (i + 1) + ": ");
numeros[i] = scanner.nextInt();
if (numeros[i] % 2 == 0) {
par[countPar] = numeros[i];
countPar++;
} else {
impar[countImpar] = numeros[i];
countImpar++;
}
}
System.out.println("Números digitados:");
for (int i = 0; i < vtr; i++) {
System.out.print(numeros[i] + " ");
}
System.out.println();
System.out.println("Números pares:");
for (int i = 0; i < countPar; i++) {
System.out.print(par[i] + " ");
}
System.out.println();
System.out.println("Números ímpares:");
for (int i = 0; i < countImpar; i++) {
System.out.print(impar[i] + " ");
}
System.out.println();
scanner.close();
}
}
| Pedro-HCM/una-lista-05-csharp-202302- | 5.java |
542 | import java.util.*;
class AIO{
public static void main(String[] args){
Scanner a=new Scanner(System.in);
int[] arr=new int[10];
int n=a.nextInt();
try{
int sum=0;
for(int i=0;i<n;i++){
arr[i]=a.nextInt();
sum=sum+arr[i];
}
System.out.println(sum);
}
catch(Exception e){
System.out.println(e.toString());
}
| 192124019/java-programmings | Aio.java |
543 | import java.util.*;
class main
{
main(double r)
{
double area=3.14*r*r;
System.out.println("The area of the circle is"+" "+area);
}
main(double l,double b)
{
double area=l*b;
System.out.println("The area of the rectangle is"+" "+area);
}
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("To find the area of");
System.out.println("1.Circle");
System.out.println("2.Rectangle");
int choice=sc.nextInt();
switch(choice)
{
case 1:
{
System.out.println("Enter the radius of the circle");
double r=sc.nextDouble();
main obj=new main(r);
break;
}
case 2:
{
System.out.println("Enter the length of the rectangle");
double l=sc.nextFloat();
System.out.println("Enter the breadth of the rectangle");
double b=sc.nextFloat();
main obj=new main(l,b);
break;
}
default:
System.out.println("Enter a valid option");
}
}
}
| miraz00/exp3 | 5.java |
544 |
import java.util.Scanner;
public class z {
public static void main (String[] args){
Scanner sc = new Scanner (System.in);
int n = sc.nextInt();
if (n%2==0) n++;
for (int z = 0; z < n; z++){
System.out.print("z");
}
System.out.println();
for (int z = n-1; z > 1;z--){
for (int k = 0; k < z-1; k++){
System.out.print(" ");
}
System.out.print("z");
System.out.println();
}
for (int z = 0; z < n; z++){
System.out.print("z");
}
}
}
| LuisMav23/NCR-National-Java-Compe-Training | z.java |
545 | import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
String s = "";
int count = 0;
if(scan.hasNextLine())
{
s = scan.nextLine().toLowerCase();
}
for(int i=s.length()-1; i>=0; --i)
{
if(s.charAt(i) <= 'z' && s.charAt(i) >= 'a')
{
count++;
}
else if(count != 0)
{
System.out.print(count);
return;
}
else
{
while (s.charAt(i) != ' ')
{
i--;
}
}
}
System.out.println(count);
}
}
| NjustJiaweihan/NowCoder_HuaWei | 1.java |
546 | public class SecondLargestInArrayExample{
public static int getSecondLargest(int[] a, int total){
int temp;
for (int i = 0; i < total; i++)
{
for (int j = i + 1; j < total; j++)
{
if (a[i] > a[j])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
return a[total-2];
}
public static void main(String args[]){
int a[]={1,2,5,6,3,2};
int b[]={44,66,99,77,33,22,55};
System.out.println("Second Largest: "+getSecondLargest(a,6));
System.out.println("Second Largest: "+getSecondLargest(b,7));
}}
| 22csu120/java | Java Program to find Second Largest Number in an Array.txt |
547 | import java.awt.Canvas;
import java.awt.Color;
import java.awt.Graphics;
import javax.swing.JFrame;
import javax.swing.WindowConstants;
public class C extends Canvas {
private static final long serialVersionUID = 1480902466428347458L;
private static final int WIDTH = 400;
private static final int HEIGHT = 400;
private static final int RANGE = 30;
private static final int INTERVAL = 5;
private double[][] values = new double[WIDTH][HEIGHT];
private double inertia = 0.8;
private double decay = 0.9995;
private double dissipation = 0.92;
@Override
public void paint(Graphics g) {
super.paint(g);
// Initialize all pixels as blank
for (int x = 0; x < WIDTH; x++) {
for (int y = 0; y < HEIGHT; y++) {
values[x][y] = 0.0;
g.setColor(color(values[x][y]));
g.drawLine(x, y, x, y);
}
}
// Store co-ordinates of last rain-drop and time since falling
int lastX = -1;
int lastY = -1;
int lastT = -1;
while (true) {
// ~20ms per step (i.e. 50/sec)
try {
Thread.sleep(20);
} catch (InterruptedException e) {
e.printStackTrace();
}
// With some probability, add a rain-drop on a random location and initialize the timer
if (Math.random() < 1.0/INTERVAL) {
lastX = (int) (Math.random() * WIDTH);
lastY = (int) (Math.random() * HEIGHT);
lastT = 0;
}
// Currently, simulate water inflow at last location for three time-steps
// After, simply move drop off-canvas for simplicity
else if (lastT >= 3) {
lastX = -100;
}
lastT++;
// Compute updated values at each point in time
double[][] newValues = computeNewValues(lastX, lastY);
// Draw new canvas
for (int x = 0; x < WIDTH; x++) {
for (int y = 0; y < HEIGHT; y++) {
g.setColor(color(values[x][y]));
g.drawLine(x, y, x, y);
}
}
values = newValues;
}
}
/*
* Computes updated values given current state of canvas and last rain-drop
*/
private double[][] computeNewValues(int lastX, int lastY) {
double[][] newValues = new double[WIDTH][HEIGHT];
// For each pixel (somewhat inefficient, but fine for small canvas)
for (int i = 0; i < WIDTH; i++) {
for (int j = 0; j < HEIGHT; j++) {
double value = 0.0;
int count = 0;
// Compute distance to previous drop and if exist, simulate water inflow there
double dist = Math.sqrt(Math.pow(Math.abs(i - lastX), 2) + Math.pow(Math.abs(j - lastY), 2));
if (dist < RANGE) {
// Adjust new value by distance from drop ...
double newValue = 1.0;
while (dist-- > 0) newValue *= dissipation;
// ... but make sure not to "destroy" water that's already there
newValue = Math.max(newValue, values[i][j]);
// Update new value using inertia from old value
value = inertia * values[i][j] + (1 - inertia) * newValue;
}
// If not near new drop, simply simulate diffusion of water
else {
for (int x = i - 5; x <= i + 5; x++) {
for (int y = j - 5; y <= j + 5; y++) {
if (x < 0 || y < 0 || x >= WIDTH || y >= HEIGHT)
continue;
value += values[x][y];
count++;
}
}
value /= count;
}
// Decay values to simulate water soaking into ground
newValues[i][j] = value * decay;
}
}
return newValues;
}
private float fromValue(double value) {
return (float) (((300 * (1.0 - value) + 300) % 360) / 360.0);
}
private Color color(double value) {
return Color.getHSBColor(fromValue(value), 1.0f, .5f);
}
public static void main(String[] args) {
JFrame frame = new JFrame();
frame.setSize(WIDTH, HEIGHT);
frame.add(new C());
frame.setDefaultCloseOperation(WindowConstants.EXIT_ON_CLOSE);
frame.setVisible(true);
}
} | enankerv/s22-rec12 | C.java |
548 | /*
*****
* *
* *
* *
*****
*/
class D{
public static void main(String[] args){
int i,j;
for(i=1;i<=5;i++)
{
for(j=1;j<=5;j++)
{
if(i==1 ||i==5||j==2||j==5){
System.out.print("*");
}
else
System.out.print(" ");
}
System.out.println();
}
}
} | Yaduttam95/Java | D.java |
549 | import java.io.*;
class Q2
{
public static void main(String args[])throws IOException
{
BufferedReader xx=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the number of test cases");
int t=Integer.parseInt(xx.readLine());
int b[]= new int[28];
for(int i=0;i<26;i++)
b[i]=i+65;
b[26]=32;
b[27]=46;
int a[],f,k,ttt,tt,tem;
char c,temp;
for(int i=1;i<=t;i++)
{ a=new int[28];
String s=xx.readLine();
int l=s.length();
for(int j=0;j<l;j++)
{
c=s.charAt(j);
f=(int)c;
if(f>64 && f<92)
a[f-65]++;
else if(f==32)a[26]++;
else if(f==46)a[27]++;
}
tem=l;
for(int j=0,j<28;j++)
{
if(a[j]==0)
{
for(int h=0;
for(int j=0;j<27;j++) //SORT
{
for(int z=j+1;z<28;z++)
{
if(a[j]<a[z])
{
ttt=a[j];
tt=b[j];
a[j]=a[z];
b[j]=b[z];
a[z]=ttt;
b[z]=tt;
}
if(a[j]==a[i])
{
if(b[j]<b[z])
{
ttt=a[j];
tt=b[j];
a[j]=a[z];
b[j]=b[z];
a[z]=ttt;
b[z]=tt;
}
}
}
}
int pp=28
for(int e=0;e<pp;j++)
{
if(a[e]==0)
for(int r=0,
System.out.println(b[0]);
int d[]=new int[28];
for(int z=0;z<28;z++)
d[27-z]=b[z];
System.out.println(b[27]);
for(int z=0;z<l;z++)
{ temp= s.charAt(z);
for(int x=0;x<28;z++)
{if(temp==b[x])
System.out.print(((char)d[x]));
}
}
System.out.println();
}
}
}
| varunchaudharycs/javacodes | M.java |
550 | class RemainderAndQuotient {
public static void main(String[] args) {
public void reminderAndQuotient(int Numeratre, int Denominator)
{
double Remainder = Numeratre % Denominator;
double Quotient = Numerator / Denominator;
System.out.print(Remainder);
System.out.print(Quotient);
}
}
}
| AnjulGupta12/Basic_Of_Coding | 5.java |
551 | class i {
public static void main(String[] args) {
int k = 1;
while (k > 0) {
int i = 2;
while (i > 0) {
System.out.println(i * k);
i--;
}
k--;
}
}
} | shreyash14s/Translator | i.java |
552 | package Day11;
public class Main {
public static void main(String[] args) {
long angka1 = 12345L;
System.out.println("contoh nilai angka bulat adalah "+ angka1);
}
}
| Armawan02/100-Days | days11 |
553 | class B {
public static void main(String[] args) {
System.out.println("Hello bunny");
}
} | 23315a1204Narsimha/NarsimhasreenidhiIT-A | B.java |
555 | public class f {
public static void main(String[] args) {
for(int i=0;i<5;i++){
i+=2;
System.out.println("hello");
}
}
}
| imgagan18/DSA.java | f.java |
556 | public class j {
static boolean b1, b2;
public static void main(String [] args) {
int x = 0;
if ( !b1 ) {
if ( !b2 ) {
b1 = true;
x++;
if ( 5 > 6 )
{ x++;
}
if ( !b1 )
x = x + 10;
else if ( b2 = true )
x = x + 100;
else if ( b1 | b2 )
x = x + 1000;
}
System.out.println(x);
}
}
} | sakshirautela/user-java | j.java |
558 | import java.util.Scanner;
public class g {
public static boolean rec(int n, int x, int[] arr) {
if (n == 1) {
return arr[0] == x;
}
return rec(n - 1, x - arr[n - 1], arr) || rec(n - 1, x + arr[n - 1], arr);
}
public static void main(String[] args) {
try (Scanner inpt = new Scanner(System.in)) {
int n = inpt.nextInt();
int x = inpt.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = inpt.nextInt();
}
if (rec(n, x, arr)) {
System.out.println("YES");
} else {
System.out.println("NO");
}
}
}
}
| abdullah-mobin/RECURSION-PLUS-SUBSET-GENERETION-BY-RIH | g.java |
559 | // class One{
// public One(){
// System.out.println("One");
// }
// }
// class Two extends One{
// public Two(){
// System.out.println("Two");
// }
// }
// class Three extends Two{
// public Three(String s){
// System.out.println("Three"+s);
// }
// }
// public class test {
// public static void main(String[] args) {
// Three three = new Three("Java");
// }
// }
// public class ErrorFinding{
// public static void main(String[] args) {
// int x = 5;
// int y = "10";
// System.out.println(x+y);
// }
// }
// class abstract Gbase{
// public void testBase(){
// System.out.println("Base");
// }
// }
// class Gderived extends Gbase{
// public void testDerived(){
// System.out.println("Derived");
// }
// }
// interface II {
// private int a = 100;
// protected void m1();
// }
// class Al implements II {
// public void m1(){
// System.out.println("In ml method");
// }
// }
public class E{
public static void main(String[] args) {
int[] A;
A[0]=0;
}
} | aayushker/OOPJ-CW | E.java |
561 | package com.test.all
public class Test {
public static void main (String[] args) {
System.out.print("this is a text a more text");
System.out.print("abc");
}
}
| xuantuan58/tmp | a.java |
562 |
public class B {
public static void main(String[] args) {
char ch ='A';
byte b;
b =(byte)ch;
char c = 'b';
byte z;
z =(byte)c;
System.out.println(z);
System.out.println(b);
}
}
| KALIMULLAH41/Java_practical | B.java |