# Monthly Archives: October 2014

## Poj Solution 2954

http://poj.org/problem?id=2954 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class Point{ int x,y; } public class Main { static Point triangle[] = new Point[3]; static int GCD(int a,int b){ if(b==0) return a; return GCD(b,a%b); } static int area(Point a,Point b,Point c){ … Continue reading

## Poj Solution 2945

http://poj.org/problem?id=2945 import java.util.HashMap; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int n = sc.nextInt(); int m = sc.nextInt(); if (n == 0 && m == 0) break; … Continue reading

## Poj Solution 2941

http://poj.org/problem?id=2941 //* @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); while(true) { String s=in.readLine(); int a=Integer.parseInt(s); if(a==0)break; int[][] arr=new int[a][a]; String[] ss; for(int i=0;i< a;i++) { … Continue reading

## Poj Solution 2940

http://poj.org/problem?id=2940 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int N = 100000+100; static int n; static long num[] = new long[N]; public static double Get_Num(StreamTokenizer cin) throws Exception{ cin.nextToken(); return cin.nval; } public static … Continue reading

## Poj Solution 2939

http://poj.org/problem?id=2939 #include <algorithm> #include <cstdio> #include <string.h> #include <map> #include <stack> #include <memory.h> #include <math.h> #include <queue> using namespace std; #define count dofudf const int prime = 3374521; int hash[prime] = { 0 }; int num[prime]; int id[prime]; int count … Continue reading

## Poj Solution 2938

http://poj.org/problem?id=2938 #include <algorithm> #include <cstdio> #include <string> #include <map> #include <stack> #include <memory.h> #include <math.h> #include <queue> using namespace std; string str[1100]; int year[1100]; int ans[1100]; int doit( int l, int r ) { int i, j, b, e; ans[l] … Continue reading

## Poj Solution 2937

http://poj.org/problem?id=2937 #include <algorithm> #include <cstdio> #include <string.h> #include <map> #include <stack> #include <memory.h> #include <math.h> #include <queue> using namespace std; int main( ) { int n, pos, t, s; char c[2]; while( 1 ) { scanf( "%d", &n ); if( … Continue reading

## Poj Solution 2935

http://poj.org/problem?id=2935 //* @author: 82638882@163.com import java.io.*; import java.util.*; public class Main { static int x1,y1,x2,y2,l; static boolean[][] p=new boolean[8][8]; static int[] ax1,ay1,ax2,ay2; public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); String[] ss; while(true) { … Continue reading

## Poj Solution 2933

http://poj.org/problem?id=2933 #include <algorithm> #include <cstdio> #include <vector> #include <map> #include <stack> #include <memory.h> #include <math.h> using namespace std; int a[30]; int in[15]; int de[15]; int n, maxs; bool search( int k, int im, int dm ) { int i, t; … Continue reading

## Poj Solution 2930

http://poj.org/problem?id=2930 #include <algorithm> #include <cstdio> #include <string.h> #include <map> #include <stack> #include <memory.h> #include <math.h> #include <queue> using namespace std; #define count asdljflsdka #define for_ii(k) for( ii[(k)]=0; ii[(k)]<m; ii[(k)]++ ) char a[20]; char w[110]; char e[6][4] = { { 1, … Continue reading

## Poj Solution 2928

http://poj.org/problem?id=2928 #include <algorithm> #include <cstdio> #include <vector> #include <map> #include <stack> #include <memory.h> #include <math.h> using namespace std; __int64 x[100010], y[100010]; int main( ) { int n, m, c, C, i, j; scanf( "%d%d%d%d", &n, &m, &c, &C ); for( … Continue reading