# Monthly Archives: September 2014

## Poj Solution 2909

http://poj.org/problem?id=2909 //* @author ������&lt;hongxp11@163.com&gt; import java.util.Scanner; public class Main { public static boolean isPrime(int n) { int root = (int) Math.sqrt(n); for (int i = 2; i <= root; i++) { if (n % i == 0) return false; } … Continue reading

Posted in poj | Comments Off on Poj Solution 2909

## Poj Solution 2907

http://poj.org/problem?id=2907 #include <functional> //#include <algorithm> #include <cstdio> #include <vector> #include <map> #include <stack> #include <memory.h> #include <math.h> using namespace std; int s[1<<10]; typedef pair<int,int> point; point p; point b; int dis( point &a, point &b ) { return abs(a.first-b.first) + … Continue reading

Posted in poj | Comments Off on Poj Solution 2907

## Poj Solution 2897

Posted in poj | Comments Off on Poj Solution 2897

## Poj Solution 2895

http://poj.org/problem?id=2895 #include <iostream> #include <string> #include <cstdlib> using namespace std; int num = {2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9}; int order = {1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4}; int main() { int N; while (cin>>N) { for (int z = 0;z < N;z++) { int p,w; cin>>p>>w; string msg; do … Continue reading

Posted in poj | Comments Off on Poj Solution 2895

## Poj Solution 2894

http://poj.org/problem?id=2894 //* @author ������&lt;hongxp11@163.com&gt; import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner in = new Scanner(System.in); int t = in.nextInt(); for(int i = 0; i< t; i++) { int n = in.nextInt(); int[] result = new … Continue reading

Posted in poj | Comments Off on Poj Solution 2894

## Poj Solution 2893

http://poj.org/problem?id=2893 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int M = 1000+2; static final int N = 1000000+10; static int sort[] = new int[N],map[][] = new int[M][M]; public static void main(String []args) throws Exception{ … Continue reading

Posted in poj | Comments Off on Poj Solution 2893

## Poj Solution 2892

http://poj.org/problem?id=2892 #include <functional> #include <algorithm> #include <cstdio> #include <vector> #include <map> #include <stack> #include <memory.h> using namespace std; map< int, int, less<int> > s; int query( int k ) { map<int, int, less<int> >::iterator it; it = s.lower_bound( k ); … Continue reading

Posted in poj | Comments Off on Poj Solution 2892

## Poj Solution 2890

http://poj.org/problem?id=2890 #include <functional> //#include <algorithm> #include <cstdio> #include <vector> #include <map> #include <stack> #include <memory.h> using namespace std; vector<int> e; stack<int> sk; int sign = { 0 }; int count = 0; int c; int n, m; bool input() { … Continue reading

Posted in poj | Comments Off on Poj Solution 2890

## Poj Solution 2887

http://poj.org/problem?id=2887 //* @author: 82638882@163.com import java.io.*; public class Main { public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); int[] s=new int; int size=0; while(true) { int u=in.read(); if(u==’n’)break; s[size++]=u; } int n=Integer.parseInt(in.readLine()); int[] arr=new … Continue reading

Posted in poj | Comments Off on Poj Solution 2887

## Poj Solution 2886

http://poj.org/problem?id=2886 #include <functional> #include <algorithm> #include <cstdio> #include <vector> #include <string> #include <iterator> #include <memory.h> using namespace std; int tree[500100*4]; int n; void init( int l, int r, int s ) { tree[s] = r-l; if( r > l+1 ) … Continue reading

Posted in poj | Comments Off on Poj Solution 2886

## Poj Solution 2876

http://poj.org/problem?id=2876 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); StringBuffer[] sb=new StringBuffer; sb=new StringBuffer("-"); for(int i=1;i< 13;i++) { sb[i]=new StringBuffer(sb[i-1]); int k=(int)Math.pow(3, i-1); for(int w=0;w< k;w++) sb[i].append(" "); sb[i].append(sb[i-1]); } … Continue reading

Posted in poj | Comments Off on Poj Solution 2876

## Poj Solution 2871

http://poj.org/problem?id=2871 //* @author ������&lt;hongxp11@163.com&gt; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); double first = in.nextDouble(); while(true) { double second = in.nextDouble(); if(second == 999) { System.out.println("End of Output"); break; } … Continue reading

Posted in poj | Comments Off on Poj Solution 2871