UVA 927 - Integer Sequence solution

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int tc = sc.nextInt();

while(tc-- >0) {
int [] num = new int[sc.nextInt()+1];
int ctr=0;
for(int i=0;i<num.length;i++) {

num[i] = sc.nextInt();
}
int d =sc.nextInt();
int k= sc.nextInt();
long v=0,c=0;

for(int i =0;c<=k;i++) {
c=c+ i * d;
v=0;
for(int l=0;l<num.length;l++ ) {

   v = (long) (v +  (long)num[l]* Math.pow(i,l));
}
if (c>=k){
System.out.println(v);
break;
}
}
}
}

}

UVA Open Credit System - 11078 Solution

import java.util.Scanner;

public class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int tc= sc.nextInt();
while(tc-- >0) {
int noOfStud = sc.nextInt();
int dif =-999999,max=0;
int marks[] = new int[noOfStud];
//int maxAr [] = new int[noOfStud-1];
for(int idx=0;idx<noOfStud;idx++) {
marks[idx]=sc.nextInt();

}
max=-9999999;
//int min = marks[1];
//maxAr[0]= max-min;


for (int idx=0;idx < noOfStud-1; idx++) {

if (max< marks[idx]) max= marks[idx];
if (max-marks[idx+1]>dif) dif = max-marks[idx+1];


}
System.out.println(dif);

}
}

}

UVA 102 Bin Packing Java Solution

import java.util.Scanner;

public class Main{

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
while(sc.hasNext()) {
int [] bin_list = new int [9];
int [] total = new int[6];
for(int idx=0;idx<9;idx++) bin_list[idx] =sc.nextInt();

 total[1] = bin_list[3] + bin_list [6] + bin_list[1] + bin_list[7] + bin_list[2] + bin_list[5];
 total[0] = bin_list[3] + bin_list [6] + bin_list[2] + bin_list[8] + bin_list[1] + bin_list[4];
 total[4] = bin_list[4] + bin_list [7] + bin_list[0] + bin_list[6] + bin_list[2] + bin_list[5];
 total[5] = bin_list[4] + bin_list [7] + bin_list[2] + bin_list[8] + bin_list[0] + bin_list[3];
 total[2] = bin_list[5] + bin_list [8] + bin_list[0] + bin_list[6] + bin_list[1] + bin_list[4];
 total[3] = bin_list[5] + bin_list [8] + bin_list[1] + bin_list[7] + bin_list[0] + bin_list[3];

int min = 2147483647,min_idx=0;
for(int idx=0;idx<6;idx++) {
//System.out.println(" idx = " + idx + " value " + total[idx]);
if (total[idx]<min ) {
min=total[idx];
min_idx = idx;
}
}


switch(min_idx){
case 0 :
System.out.println("BCG " + min);
break;
case 1 :
System.out.println("BGC " + min);
break;
case 4 :
System.out.println("GBC " + min);
break;
case 5 :
System.out.println("GCB " + min);
break;
case 2 :
System.out.println("CBG " + min);
break;
case 3 :
System.out.println("CGB " + min);
break;
}
}
}

}