# Monthly Archives: October 2010

## Poj Solution 1607

http://poj.org/problem?id=1607 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static void main(String[] args) throws Exception{ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); System.out.printf("Cards Overhangn"); int n; double d; while (scanner.hasNext()){ n=scanner.nextInt(); d=0; for (int i=1;i<=n ;i++ ){ d=d+1.0/(2*i); } … Continue reading

Posted in poj | Comments Off on Poj Solution 1607

## Poj Solution 1604

http://poj.org/problem?id=1604 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int[] b2=new int[]{6,2,4,8}; int[] b3=new int[]{1,3,9,7}; int[] b7=new int[]{1,7,9,3}; int[] b9=new int[]{1,9,1,9}; while(in.hasNext()) { int n=in.nextInt(); int e,a2=0,a3=0,a5=0,a7=0,a9=0; e=n;while((e=e/2)!=0) a2+=e; e=n;while((e=e/5)!=0) … Continue reading

Posted in poj | Comments Off on Poj Solution 1604

## Poj Solution 1603

http://poj.org/problem?id=1603 //* @author: 82638882@163.com import java.util.Scanner; public class Main { static int[][] w=new int; static final int n=20; public static void main(String[] args) { Scanner in=new Scanner(System.in); int cnt=0; while(in.hasNext()) { cnt++; for(int i=0;i< n;i++) for(int j=0;j< n;j++) w[i][j]=9999999; for(int … Continue reading

Posted in poj | Comments Off on Poj Solution 1603

## Poj Solution 1598

http://poj.org/problem?id=1598 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static void main(String[] args){ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); String[] kws; String[] exs,exsk; int[] kn; String fl; int n,m,max; int index=1; while (scanner.hasNext()){ fl=scanner.nextLine(); String[] t=fl.split(" "); n=Integer.parseInt(t); … Continue reading

Posted in poj | Comments Off on Poj Solution 1598

## Poj Solution 1597

http://poj.org/problem?id=1597 //* @author mekarlos@gmail.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan=new Scanner(System.in); int s=0,m=0,ac=0; boolean[] bands; boolean flaj; while(scan.hasNext()){ s=scan.nextInt(); m=scan.nextInt(); bands=new boolean[m+1]; flaj=true; ac=0; for(int i=0;i< m;i++){ if(bands[ac]){ flaj=false; break; } bands[ac]=true; … Continue reading

Posted in poj | Comments Off on Poj Solution 1597

## Poj Solution 1595

http://poj.org/problem?id=1595 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { int[] arr=new int[]{ 1,2,3,5,7,11,13,17,19,23,29,31,37,41, 43,47,53,59,61,67,71,73,79,83,89,97,101,103,107, 109,113,127,131,137,139,149,151,157,163,167,173,179,181,191, 193,197,199,211,223,227,229,233,239,241,251,257,263,269,271, 277,281,283,293,307,311,313,317,331,337,347,349,353,359,367, 373,379,383,389,397,401,409,419,421,431,433,439,443,449,457, 461,463,467,479,487,491,499,503,509,521,523,541,547,557,563, 569,571,577,587,593,599,601,607,613,617,619,631,641,643,647, 653,659,661,673,677,683,691,701,709,719,727,733,739,743,751, 757,761,769,773,787,797,809,811,821,823,827,829,839,853,857, 859,863,877,881,883,887,907,911,919,929,937,941,947,953,967, 971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061, 1063,1069,1087,1091,1093,1097 }; Scanner in=new Scanner(System.in); while(in.hasNext()) { int a=in.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1595

## Poj Solution 1591

http://poj.org/problem?id=1591 //* @author: SmilingWang import java.util.*; public class Main{ public static void main(String[] args){ LinkedList< Integer> list; Scanner in = new Scanner(System.in); int n; int left; int i, j; int count = 1; while(in.hasNext()){ n = in.nextInt(); left = in.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1591

## Poj Solution 1590

http://poj.org/problem?id=1590 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.Scanner; import java.util.Map; import java.util.HashMap; import java.io.BufferedInputStream; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(new BufferedInputStream(System.in)); Map<Character,Character> map = new HashMap<Character,Character>(); map.put(‘A’,’A’); map.put(‘E’,’3′); map.put(‘H’,’H’); map.put(‘I’,’I’); map.put(‘J’,’L’); map.put(‘L’,’J’); map.put(‘M’,’M’); … Continue reading

Posted in poj | Comments Off on Poj Solution 1590

## Poj Solution 1581

http://poj.org/problem?id=1581 //* @author mekarlos@gmail.com import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in)); int n=new Integer(stdin.readLine()); String nombre="",winner=""; int sub,pena,solved,time; int maxsolved=0,mintime=0; StringTokenizer tokens; for(int … Continue reading

Posted in poj | Comments Off on Poj Solution 1581

## Poj Solution 1580

http://poj.org/problem?id=1580 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { String s1=in.next(); if(s1.equals("-1"))break; String s2=in.next(); int max=0; for(int i=0;i< s1.length();i++) { int count =0; for(int j=0;j< s2.length();j++) { boolean … Continue reading

Posted in poj | Comments Off on Poj Solution 1580