Monthly Archives: August 2013

http://poj.org/problem?id=2545 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { TreeSet< Long> t=new TreeSet< Long>(); Scanner in=new Scanner(System.in); long a=in.nextInt(); long b=in.nextInt(); long c=in.nextInt(); int d=in.nextInt(); long[] arr=new long[d+1]; arr[0]=1; int x1=0,x2=0,x3=0; for(int i=1;i<=d;i++) … Continue reading →

http://poj.org/problem?id=2539 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; import java.math.*; public class Main { static BigInteger digit100=new BigInteger("1"); static int t,a,b; static void start(){ for(int i=0;i< 100;++i) digit100 = digit100.multiply(BigInteger.valueOf(10)); } public static void main(String[]args) throws Exception{ BigInteger num1,num2,temp,ans; start(); … Continue reading →

http://poj.org/problem?id=2538 //* @author mekarlos@gmail.com import java.util.Hashtable; import java.util.Scanner; public class Main { public static void main(String[] args) { String[] s={"`1234567890-=","QWERTYUIOP[]","ASDFGHJKL;’","ZXCVBNM,./"}; Scanner scan=new Scanner(System.in); s[1]+=(char)(92); String cad="",out=""; Hashtable< String,String> table=new Hashtable< String,String>(); for(int i=0;i< 4;i++){ for(int j=1;j< s[i].length();j++){ table.put(s[i].charAt(j)+"", s[i].charAt(j-1)+""); } … Continue reading →

http://poj.org/problem?id=2537 //* @author: import java.util.*; public class Main { static public void main( String [] str ){ Scanner sc = new Scanner(System.in); while( sc.hasNext()) { double s=1,answer; int k=sc.nextInt(); int n=sc.nextInt(); double ans[][]=new double[n][k+1]; for( int i=0; i< n; i++ … Continue reading →

http://poj.org/problem?id=2535 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); int cnt[]=new int[101]; int temp[]=new int[101]; boolean arr[]=new boolean[101]; int n,p,i,j; n=sc.nextInt(); p=sc.nextInt(); Arrays.fill(cnt,0); Arrays.fill(arr,false); for(i=0;i< n;i++) { int max=0,min=999999; … Continue reading →

http://poj.org/problem?id=2533 import java.io.BufferedInputStream; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { int n = scan.nextInt(); int[] data = new int[n]; int[] count = new int[n]; for (int … Continue reading →

http://poj.org/problem?id=2531 /* @author: */ import java.util.Scanner; public class Main{ int c[][]=new int[22][22]; int result=0; int n; boolean sign[]=new boolean[22]; int v[]=new int[22]; int find(int k,int a,int r){ int temp=0; if(a+r<=result) return result; if(k==n+1){ if(a>result) result=a; return result; } sign[k]=false; for(int … Continue reading →

http://poj.org/problem?id=2528 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; import java.io.*; public class Main { public static int N = 10000; public static Node head; public static void main(String[] args) { Scanner sc = new Scanner(new BufferedInputStream(System.in)); Set< Integer> endpoints = new TreeSet< … Continue reading →

http://poj.org/problem?id=2526 #include "stdio.h" #include "algorithm" using namespace std; struct point { int x,y; }p[10000]; inline bool cmp( point a, point b ) { return a.x < b.x || ( a.x == b.x && a.y < b.y ); } int n; … Continue reading →

http://poj.org/problem?id=2524 import java.io.BufferedInputStream; import java.util.Scanner; public class Main { public static void main(String[] args) { final int MAXSIZE = 50001; Scanner scan = new Scanner(new BufferedInputStream(System.in)); int caseI = 1; int max = 0; while (scan.hasNext()) { int n = … Continue reading →

http://poj.org/problem?id=2522 #include "iostream" using namespace std; int ans[230][11]; int get( int a, int b ) { int i; if( b == 1 ) return 1; if( ans[a][b] < 0 ) { ans[a][b] = 0; for( i=0; i*b<=a; i++ ) ans[a][b] … Continue reading →