UVA 10295 Hay Points Solution

import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.StringTokenizer;
import java.util.TreeMap;

class Main {

//UVA 10295
public static void main(String[] args) throws IOException {

InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String m[] = br.readLine().split(" ");
int words = Integer.parseInt(m[0]);
int tc = Integer.parseInt(m[1]);
TreeMap <String, Integer> dic = new TreeMap<String, Integer>();
StringBuffer sb = new StringBuffer("");
for (int i=0 ; i< words; i++){
m = br.readLine().split(" ");
dic.put(m[0], Integer.parseInt(m[1]));
}
String str = br.readLine();
int ctr=0;
while(true){

if(str == null) {
System.out.print(sb);
System.exit(0);
}
                if(str.equalsIgnoreCase(".")){
sb.append(ctr).append("\n");
ctr =0;
}
StringTokenizer st = new StringTokenizer(str);
while(st.hasMoreTokens()) {
String check = st.nextToken();
//System.out.println("what am i checing" + check);
if(dic.containsKey(check)) {
//System.out.println(ctr);
ctr = ctr + dic.get(check);
}


}
//System.out.println(ctr);
str=br.readLine();
}

}
}

UVA 10374 Election solution

import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.HashMap;


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();

boolean ind = false;
for (int i =0 ;i < tc ;i++) {

sc.nextLine();
if(ind) System.out.println();
ind = true;
{
HashMap<String,String> cand = new HashMap<> ();
HashMap<String,Integer> vt_ctr= new HashMap<> ();
int p = sc.nextInt();
 sc.nextLine();

 for (int i1 =0; i1<p; i1++) {
 String candt = sc.nextLine();
 String part = sc.nextLine();
 if (part.equalsIgnoreCase("independent")) part = part+candt;
 cand.put(candt, part);
 }

 int votes = sc.nextInt();
 sc.nextLine();
 for(int i1 =0;i1<votes;i1++) {
 String cand1 = sc.nextLine();

 if (!vt_ctr.containsKey(cand1)) vt_ctr.put(cand1, (Integer)1);
 else {
 int tmp =1 + vt_ctr.get(cand1);
 vt_ctr.put(cand1,tmp);
 }
 }
 boolean flag = false;
 String winner=null;
 int max=0;
 Iterator<Entry<String, Integer>> it  = vt_ctr.entrySet().iterator();
while(it.hasNext()) {
Entry<String, Integer> entry = it.next();
 String key = entry.getKey();
 Integer value = entry.getValue();
 if(max<value) {
 max = value;
 winner = key;
 flag = false;
 }
 else if (max==value) {
 flag = true;
 }
}
if (flag) System.out.println("tie");
else
System.out.println(cand.get(winner));

}
}
}

}

UVA 10945 Mother Bear Solution

import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
boolean flag = true;
String s= null;
while (flag) {
s =sc.nextLine().toLowerCase().replaceAll("[^a-z]", "");
if (s.equalsIgnoreCase("DONE")) break;
StringBuffer sb = new StringBuffer(s);
if(s.equalsIgnoreCase(sb.reverse().toString())) System.out.println("You won't be eaten!");
//if (s(sb.reverse()))
else System.out.println("Uh oh..");
}
}

}

UVA 10098 Solution

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;


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();
StringBuffer bf = new StringBuffer("");
sc.nextLine();
for (int i =0; i<tc ; i++) {
if (i>0) bf.append("\n");
char [] a =sc.nextLine().toCharArray();
Arrays.sort(a);
//String s =String.valueOf(a);
Arrays.asList(a);
do{
bf.append(new String(a)+"\n");
//System.out.println(new String(a));
}while(next_permutation2(a));


}
System.out.println(bf);

}
public static boolean next_permutation2(char a[])
    {
       for(int i = a.length-2, j; i >= 0; i--)
       {
        if (a[i+1] > a[i])
               {
               for(j = a.length-1; a[j] <= a[i]; j--);
swap(a, i, j);
  for(j = 1; j <= (a.length-i)/2; j++)
  swap(a, i+j, a.length-j);
                     return true;
           }
       }
        return false;
   }


public static void swap(char a[], int i, int j)
{
char temp = a[i];
a[i] = a[j];
  a[j] = temp;
      }
}

UVA 495 Solution

import java.math.BigInteger;
import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
BigInteger [] bg = new BigInteger[5001];

bg[0] = BigInteger.ZERO;
bg[1] = BigInteger.ONE;
for (int i=2; i<5001; i++) bg[i] = bg[i-1].add(bg[i-2]);
Scanner sc = new Scanner(System.in);
while(sc.hasNext())
{
int i = sc.nextInt();
System.out.println( "The Fibonacci number for "  + i + " is " +  bg[i]);
}
}

}

UVA 10579 Fibonacci Numbers Solution

import java.math.BigInteger;
import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
BigInteger [] bg = new BigInteger[5001];

bg[0] = BigInteger.ZERO;
bg[1] = BigInteger.ONE;
for (int i=2; i<5001; i++) bg[i] = bg[i-1].add(bg[i-2]);

//System.out.println(bg[5000].toString(10).length());
Scanner sc = new Scanner(System.in);
while(sc.hasNext())
{
int i = sc.nextInt();
System.out.println( bg[i]);
}
}

}

UVA 10346 Solution

import java.util.Scanner;

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 x = sc.nextInt();
if (x==0) break;
int y = sc.nextInt();
System.out.println(x + ((x-1)/(y-1)));
}

}

}

UVA 113 Solution

import java.math.BigInteger;
import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
//BigInteger p = new BigInteger("4357186184021382204544");

double x =sc.nextDouble();
//if (x==0.0) break;
double y = sc.nextDouble();
//System.out.println(Math.log10(y));
//System.out.println(x);
System.out.println(Math.round(Math.pow(10.0, (Math.log10(y)/x))));
}

}

}

UVA 10079 Pizza Cutting Solution

import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
long no = sc.nextLong();
if (no<0l) break;
System.out.println(1+((no*(no+1l))/2l));

}
}

}

UVA 483 Word Scramble solution

import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;

class Main {

/**
* @param args
* @throws IOException
*/
@SuppressWarnings("deprecation")
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
boolean flag = false;
String m = null;
StringBuffer res = new StringBuffer("");
while ((m= br.readLine())!=null){
String[] sa = m.split(" ");

if(flag) res.append("\n");
                         flag = true;
StringBuffer b = new StringBuffer("");
                        boolean bt= false;
for (int i = 0 ; i < sa.length; i++) {

StringBuffer t = new StringBuffer(sa[i]).reverse();
                                if (bt) b.append(" ");
b.append(t);
                                bt = true;
}
res.append(b);

}
System.out.println(res);
}
}

UVA 10008 Cryptanalysis Solution

import java.io.IOException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.TreeMap;


class Main {

/**
* @param args
* @throws IOException
*/
@SuppressWarnings("deprecation")
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
boolean flag = false;
String m = null;
StringBuffer res = new StringBuffer("");

Map<Character,Integer> m1 = new TreeMap<>();
Map<Character,Integer> m2 = new TreeMap<>();
int tc = Integer.parseInt(br.readLine());
int t =0;
for (int i =1 ; i <=tc ; i++) {
char ch[]= br.readLine().toUpperCase().replaceAll("[^A-Z]", "").toCharArray();
for (int k =0; k<ch.length; k++ ) {
t=1;
if (m1.containsKey(ch[k])) {
t = m1.get(ch[k]);
t++;

}
m1.put(ch[k], t);
}

}
TreeMap<Character,Integer> sortedData = new TreeMap(new ValueComparer(m1));
sortedData.putAll(m1);

Set it = sortedData.entrySet();
Iterator  ijh = sortedData.entrySet().iterator();
while(ijh.hasNext()) {
Map.Entry<Character, Integer>nnn = (Entry<Character, Integer>) ijh.next();
System.out.println(nnn.getKey() + " " + nnn.getValue());
}


// ArrayList<Character,Integer> arr = new ArrayList <> ();
//System.out.println(res);
}
}
class ValueComparer implements Comparator {
public Map  _data = null;
public ValueComparer (Map<Character, Integer> m1){
super();
_data = m1;
}

    public int compare(Object o1, Object o2) {
    Integer e1 = (Integer) _data.get(o1);
    Integer e2 = (Integer) _data.get(o2);
    int tmp = e2.compareTo(e1);
        if (tmp==0) {
        return ((Character) o1).compareTo((Character) o2);
        }
    return e2.compareTo(e1);
    }
}

UVA 10929 Solution

import java.math.BigInteger;
import java.util.Scanner;
class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
StringBuffer br = new StringBuffer("");
BigInteger bg11 = BigInteger.valueOf(11);
boolean flag = false;
while(true) {
String m = sc.nextLine();
if (m.equalsIgnoreCase("0")) break;
BigInteger bg = new BigInteger(m);
if(bg.compareTo(BigInteger.ZERO)==0) break;
int x =(bg.remainder(bg11)).compareTo(BigInteger.ZERO);
//System.out.println(x);
if(x==0){
br.append(m + " is a multiple of 11.\n");
//System.out.println(bg + " is not a multiple of 11.");
}
else {
br.append(m + " is not a multiple of 11.\n");
}
}
System.out.print(br);
}

}

UVA 10678 The Grazing Cow Solution

import java.math.BigInteger;
import java.util.Scanner;
class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
StringBuffer br = new StringBuffer("");

int tc = sc.nextInt();

for (int i = 1; i<= tc;i++) {
double d= sc.nextDouble();
double l = sc.nextDouble();
double a = Math.sqrt(.25 * (l*l - d*d));
double b = l/2.0;

double area = Math.PI*a*b*1000;
System.out.printf("%.3f\n",Math.round(area)/1000.0);
}
}

}

UVA 10297 Beavergnaw Solution

import java.math.BigInteger;
import java.util.Scanner;
class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
StringBuffer br = new StringBuffer("");

while(true) {
double D = sc.nextDouble();
double Vch = sc.nextDouble();
if (D==0.0 && Vch==0.0) break;

double res = (6.0/Math.PI) * (((Math.PI * D*D*D / 4.0) - Vch)) - (0.5 *D*D*D);
//System.out.println(res);
res = Math.pow(res,( 1.0/3.0));
//res = Math.round(res*1000)/1000.0;
System.out.printf("%.3f\n",res);

}
}

}

UVA 11207 The Easiest Way solution

import java.util.Arrays;
import java.util.Scanner;

class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);


while ( true )
{
 int tc = sc.nextInt();
 double[][] t = new double[tc][2];
 int idx =0;
 if (tc==0) break;
 double x, y ,mx=0;
 for(int i=0;i<tc;i++) {
x =sc.nextDouble();
y = sc.nextDouble();
double [] mi = new double [3];
mi[0] = Math.min(x, y/4.0);
mi[1] = Math.min(x/4.0, y);
mi[2] = Math.min(x, y)/2.0;
Arrays.sort(mi);
if (mx< mi[2]) {
mx= mi[2];
idx = i+1;
}
 }
 System.out.println(idx);
}

}

}

UVA 991 Safe Solutions

import java.util.Scanner;

class Main {

static public  void  main(String[] args) {
// TODO Auto-generated method stub
int [] catalan ={1,1,2,5,14,42,132,429,1430,4862,16796};;
//catalan[0] = 1;

/*for (int i =0 ; i<10; i++) {
catalan[i+1] = (catalan[i] * 2* ( 2*i +1) )/ ( i+2);
}*/
boolean flag = false;
Scanner sc = new Scanner(System.in);
while(sc.hasNext()) {
if(flag) System.out.println();
System.out.println(catalan[sc.nextInt()]);
flag = true;
}

}


}

UVA 11479 Solution

import java.util.Arrays;
import java.util.Scanner;


class Main {

    /**UVA java solution to  11479
* @param args
*/
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
long[] side = new long[3];
long tc = sc.nextLong();
for (long j=1 ; j<=tc; j++){

for (int i=0; i<3;i++) {
side[i] =sc.nextLong();
}
//if ((side[1]==0) && (side[0] ==0) && (side[2] ==0)) break;

Arrays.sort(side);
if( (side[0] + side[1])<=side[2] || (side[0]<=0) )
System.out.printf("Case %d: %s\n",j,"Invalid");
else if(side[0]==side[2])
System.out.printf("Case %d: %s\n",j,"Equilateral");
else if ( (side[0] == side[1]) || (side[1] == side[2]))
System.out.printf("Case %d: %s\n",j,"Isosceles");
else System.out.printf("Case %d: %s\n",j,"Scalene");
}

}
}

UVA 11854 Solution

import java.util.Arrays;
import java.util.Scanner;

class Main{
//class 11854 {

/**UVA java solution to  11854
* @param args
*/
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
int[] side = new int[3];
while(sc.hasNext()){

for (int i=0; i<3;i++) {
side[i] =sc.nextInt();
}
if ((side[1]==0) && (side[0] ==0) && (side[2] ==0)) break;

Arrays.sort(side);
if(Math.pow(side[2], 2) == (Math.pow(side[1], 2) + Math.pow(side[0], 2))) {
System.out.println("right");
}
else
System.out.println("wrong");

}

}

}

UVA 438 Solution

import java.util.Scanner;


class Main {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
//int i = (int)'1';
Scanner sc =new Scanner(System.in);

double [] x = new double[3];
double [] y = new double[3];
double[]  side = new double[3];
while(sc.hasNext()) {
for (int i =0; i<3 ;i++) {
x[i] = sc.nextDouble();
y[i] = sc.nextDouble();
}

side[0] = Math.pow(x[0]-x[1],2) +Math.pow(y[0]-y[1],2);
side[0] = Math.sqrt(side[0]);
side[1] = Math.pow(x[2]-x[1],2) +Math.pow(y[2]-y[1],2);
side[1] = Math.sqrt(side[1]);
side[2] = Math.pow(x[2]-x[0],2) +Math.pow(y[2]-y[0],2);
side[2] = Math.sqrt(side[2]);
double d = 0.5 *  (side[0] + side[1] + side [2]);
//System.out.println(side[1] + " " + side[2] + " " + side [0]);
double area =  Math.sqrt(d* (d-side[0]) * (d-side[1]) * (d-side[2]));
//System.out.println(area);
double rad = (side[1] * side[2] * side[0]) / (4*area);
//System.out.println("radius is " + rad);
double res = 3.141592653589793 *  rad * 2.0;
System.out.printf("%.2f\n", res);
//System.out.println(i);
}
}

}

UVA 10432 Solution

import java.util.Arrays;
import java.util.Scanner;


class Main {

/**UVA java solution to  10432
* @param args
*/
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
double  PI = 4*Math.atan(1.0);
//System.out.println(PI);
while(sc.hasNext()) {
double r = sc.nextDouble();
double n = sc.nextDouble();
//System.out.println(Math.sin( 2* Math.PI / n));
double area = 0.5 *n* r*r * Math.sin(  2* PI  / n);
System.out.printf("%.3f\n", (double)Math.round(area*1000)/1000);
}
System.exit(0);

}
}

UVA 10195 Solution

import java.util.Scanner;


class Main {

/**UVA java solution to  10195
* @param args
*/
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);

double[]  side = new double[3];
while(sc.hasNext()) {
for (int i =0; i<3 ;i++) {
side[i] = sc.nextDouble();
}

double d = 0.5 *  (side[0] + side[1] + side [2]);
if(d!=0) {
double area =  Math.sqrt(d* (d-side[0]) * (d-side[1]) * (d-side[2]));
double rad = area / d;
System.out.printf("The radius of the round table is: %.3f\n", rad);
}
else
//if (rad == Nan) System.out.println();;
System.out.printf("The radius of the round table is: 0.000\n");
}
}

}

UVA 12250 solution

import java.util.Scanner;

public class Main {

/**
* @param args
* UVA 12250 java solution
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int ctr =0;
String m= new String();
String lan = new String();
while (!(m=sc.nextLine()).equalsIgnoreCase("#")){
ctr++;
if(m.equalsIgnoreCase("HELLO"))
lan = "ENGLISH";
else if(m.equalsIgnoreCase("HOLA"))
lan = "SPANISH";
else if(m.equalsIgnoreCase("HALLO"))
lan = "GERMAN";
else if(m.equalsIgnoreCase("BONJOUR"))
lan = "FRENCH";
else if(m.equalsIgnoreCase("CIAO"))
lan = "ITALIAN";
else if(m.equalsIgnoreCase("ZDRAVSTVUJTE"))
lan = "RUSSIAN";
else
lan = "UNKNOWN";

System.out.printf("Case %d : %s\n",ctr,lan);
}

}

}

UVA 11364 java solution

import java.util.Arrays;
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);
boolean flag = true;
int tc = sc.nextInt();
for (int i = 0; i<tc; i++) {
int no = sc.nextInt();
int [] arr = new int [no];
for (int j =0 ; j < no ;j++) arr[j] = sc.nextInt();
Arrays.sort(arr);
System.out.println(2*(arr[no-1] - arr[0]));

}
}

}

UVA 11850 Java Solution

    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
import java.util.Arrays;
   
    import java.util.Scanner;
   
   
    public class Main {
        public static void main(String[] args) throws IOException {
            //Scanner sc =new Scanner(System.in);
            InputStreamReader isr = new InputStreamReader(System.in);
            BufferedReader br = new BufferedReader(isr);
            //StringBuilder sb = new StringBuilder();
StringBuffer sbr = new StringBuffer("");
            String m = "";
            //boolean flag=true;
int tc = Integer.parseInt(br.readLine());
while(tc!=0)
{
boolean possible = true;
//int tc = Integer.parseInt(br.readLine());
int [] stations = new int[tc];
for (int i = 0; i< tc; i++) {
stations[i]= Integer.parseInt(br.readLine());
}
Arrays.sort(stations);
if (tc<7) possible = false;
else{
if (stations[0] > 200) possible = false;
else if ( 1422 - stations[tc-1] > 100) possible = false;
else {
int tmp = stations[0];
for (int idx2 =1; idx2<tc; idx2++) {
if (stations[idx2] - tmp > 200)  possible = false;
else {
tmp = stations[idx2];
}
}
}
}
if (!possible) sbr.append("IMPOSSIBLE" + "\n");
else {
sbr.append("POSSIBLE\n");
}
tc = Integer.parseInt(br.readLine());
}
System.out.print(sbr);
        }
        }

UVA 10252 Common Permutation Java solution

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

/**
* @param args
* @throws IOException
* UVA 10252 - Common permutation solution
*/
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader bReader = new   BufferedReader(new InputStreamReader(System.in));
StringBuffer sbr = new StringBuffer("");

String m;
while ((m=bReader.readLine())!=null) {
int [] c1 = new int[26];
int [] c2 = new int[26];
int [] cres = new int[26];

for (int i=0 ; i< m.length(); i++) {
if(m.charAt(i)>='a' && m.charAt(i)<='z' ){
                    c1[m.charAt(i)-97]++;
}
}
m=bReader.readLine();
for (int i=0 ; i< m.length(); i++) {
if(m.charAt(i)>='a' && m.charAt(i)<='z' ){
                    c2[m.charAt(i)-97]++;
}
}

for (int i=0 ;i<26;i++) {
int j = Math.min(c1[i],c2[i]);
for(int m1 =0; m1<j;m1++){
sbr.append((char)(97+i));
}
}
sbr.append("\n");

}
System.out.print(sbr);
}

}

UVA 1237 Solution

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {
 public static void main(String[] args) throws NumberFormatException, IOException {
  //Scanner sc = new Scanner(System.in);
  
  BufferedReader br = new   BufferedReader(new InputStreamReader(System.in));
  StringBuilder sb =  new StringBuilder("");
  boolean b = false; 
  boolean first =false;
  int tc = Integer.parseInt(br.readLine());
  while (tc >0) {
   if (first) sb.append("\n");
   first = true;
   tc--;
   int mkrs = Integer.parseInt(br.readLine());
   
   String [] mkr = new String[mkrs];
   int [] [] value = new int[mkrs][2];
   for (int i =0;i<mkrs;i++) {
    String[] tmp = br.readLine().split(" ");
    mkr[i] = tmp[0];
    value[i][0] =Integer.parseInt(tmp[1]);
    value[i][1] =Integer.parseInt(tmp[2]);
   }
   
   int qry = Integer.parseInt(br.readLine());
   for (int i =0;i<qry;i++) {
   int qry_value =  Integer.parseInt(br.readLine());
   boolean flag = false;
   int ctr =0;
   int idx_maker =0;
   inner:
    for (int j=0; j<mkrs;j++)
    {
     //System.out.println(qry_value + " " +  value[j][0] + " " + value[j][1]);
     if (qry_value >=value[j][0] && qry_value <=value[j][1]) {
      ctr++;
      idx_maker=j;
     }
     if (ctr >1) {
      flag = true;
      break inner;
     }
     
    }
   if (ctr==0) flag = true;
   if(flag)  sb.append("UNDETERMINED\n");
   else sb.append(mkr[idx_maker] + "\n");
   } 

  }
  System.out.print(sb);
 }

}

Locked objects in oracle database

Following script will give the list of objects locked in a schema :

select a.session_id,a.oracle_username, a.os_user_name, b.owner "OBJECT OWNER", b.object_name,b.object_type,a.locked_mode from
(select object_id, SESSION_ID, ORACLE_USERNAME, OS_USER_NAME, LOCKED_MODE from v$locked_object) a,
(select object_id, owner, object_name,object_type from dba_objects WHERE  owner = &owner) b
where a.object_id=b.object_id