phaniram

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

phaniram

package interviewstreet;

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

public class Permutation {

	int n;
	int[][] matrix;
	int[] set;

phaniram

package interviewstreet;

import java.util.ArrayList;
import java.util.Scanner;
class order
{
	int Order_id ;
	int Deal_id;
	String Email;
	String City;

phaniram

package interviewstreet;

import java.util.Scanner;

public class Direct_conn {

	int num;
	int[] distance;
	int[] population;
	

phaniram

package interviewstreet;

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

public class Permutation {

	int n;
	int[][] matrix;
	int[] set;

phaniram

package interviewstreet;

import java.util.HashMap;
import java.util.Scanner;

public class Picking_cards {

	int num;
	int[] card_nums;
	HashMap<Integer,Integer> hm=new HashMap<Integer,Integer>();

phaniram

/**
 *
 * @author cypronmaya
 */
import java.util.Scanner;

class Solution {

    boolean[] check;

phaniram

package com.cyp.codechef.febcontest;

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

class WCOUNT {
	int len;
	BigInteger mod; 
	HashMap<Character,Integer> hm=new HashMap<Character,Integer>();

phaniram

package com.interviewstreet.puzzles;

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

public class Solution {
    
    int bit;

phaniram

package com.cyp.codechef.marcontest;

import java.io.IOException;
import java.util.Scanner;
/*
 * Cypronmaya - Codechef March 2012 Contest - Problem Code : SPOON
 */

class SPOON {