# Monthly Archives: July 2015

## Poj Solution 3189

http://poj.org/problem?id=3189 #include <vector> #define min(a,b) (((a)<(b))?(a):(b)) using namespace std; class ff { public: typedef int type; // ��Ȩ���� enum { size = 1110 }; // �����ģ enum { max = ( 1<<30 ) }; // ����������� // ��ʼ�� void init(); … Continue reading

Posted in poj | Comments Off on Poj Solution 3189

## Poj Solution 3188

http://poj.org/problem?id=3188 #include <stdio.h> #include <algorithm> using namespace std; char w; int button; __int64 a; int n, B, L; int flag; void clac( int &s1, int &s2 ) { int i, j; s1 = 0, s2 = 0; flag[B] = 100; … Continue reading

Posted in poj | Comments Off on Poj Solution 3188

## Poj Solution 3187

http://poj.org/problem?id=3187 //* @author: 82638882@163.com import java.io.*; import java.util.Arrays; public class Main { static int[] p,arr; static int a; public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); String[] ss=in.readLine().split(" "); a=Integer.parseInt(ss); int sum=Integer.parseInt(ss); p=new int[a]; … Continue reading

Posted in poj | Comments Off on Poj Solution 3187

## Poj Solution 3186

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

Posted in poj | Comments Off on Poj Solution 3186

## Poj Solution 3185

http://poj.org/problem?id=3185 /* @author: */ import java.util.Scanner; public class Main { static boolean b[]=new boolean; static void set( int k ) { if( k !=0) b[k-1] = !b[k-1]; b[k] = !b[k]; if( k< 19 ) b[k+1] = !b[k+1]; } public static … Continue reading

Posted in poj | Comments Off on Poj Solution 3185

## Poj Solution 3184

http://poj.org/problem?id=3184 #include <stdio.h> #include <algorithm> #include <math.h> #include <memory.h> using namespace std; int l; int temp, *ans1 = temp, *ans2 = temp; int main( ) { int n, len, i, j, d1, d2, rest, t, k, *ans_i_j, *ans_i1_j; scanf( "%d%d", … Continue reading

Posted in poj | Comments Off on Poj Solution 3184

## Poj Solution 3183

http://poj.org/problem?id=3183 /* @author: */ import java.util.Scanner; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.IOException; public class Main{ static final int MAX=50001; public static void main(String args[]) throws IOException{ BufferedReader buff = new BufferedReader(new InputStreamReader(System.in)); // Scanner sc = new Scanner (System.in);//�����Ȼ��ʱ int … Continue reading

Posted in poj | Comments Off on Poj Solution 3183

## Poj Solution 3181

http://poj.org/problem?id=3181 //* @author:alpc12 import java.io.*; import java.util.*; import java.math.*; public class Main { final int N = 1010; BigInteger[] dp = new BigInteger[N]; void run() { Scanner cin = new Scanner(System.in); while(cin.hasNext()) { int i, j; int n = cin.nextInt(), … Continue reading

Posted in poj | Comments Off on Poj Solution 3181

## Poj Solution 3180

http://poj.org/problem?id=3180 #include <stdio.h> #include <algorithm> #include <vector> #include <memory.h> using namespace std; class Graph { public: enum { MAX_NUM_EDGE = 50010, MAX_NUM_NODE = 10010 }; struct Edge { int to; Edge *next; }e[2*MAX_NUM_EDGE]; int en; Edge *e_begin[MAX_NUM_NODE], *e_reverse[MAX_NUM_NODE], *e_end[MAX_NUM_NODE]; Edge … Continue reading

Posted in poj | Comments Off on Poj Solution 3180

## Poj Solution 3179

http://poj.org/problem?id=3179 #include <stdio.h> #include <algorithm> using namespace std; int sum,s; inline int lowbit(int a) { return a&(a^(a-1)); } void init( ) { int i,j; for(i=1;i<=s;i++) for(j=1;j<=s;j++) sum[i][j]=0; } void set( int x, int y ) { int j; x++,y++; while(x<=s) … Continue reading

Posted in poj | Comments Off on Poj Solution 3179

## Poj Solution 3177

http://poj.org/problem?id=3177 //* @author: 82638882@163.com import java.io.*; public class Main { static int a,cnt=1; static int[] rank,un; static boolean[][] map; public static void main(String[] args) throws NumberFormatException, IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); String[] ss=in.readLine().split(" "); a=Integer.parseInt(ss); map=new boolean[a+1][a+1]; … Continue reading

Posted in poj | Comments Off on Poj Solution 3177

## Poj Solution 3176

http://poj.org/problem?id=3176 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int height = cin.nextInt(); int[][] tree = new int[height][height]; int[][] max = new int[height][height]; int maxValue = 0; int left, right = … Continue reading

Posted in poj | Comments Off on Poj Solution 3176

## Poj Solution 3174

http://poj.org/problem?id=3174 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class point{ int x,y; } public class Main { static final int N = 770+10; static int n; static point way[] = new point[N]; static void start(){ int i; for(i=0;i< N;++i) way[i] … Continue reading

Posted in poj | Comments Off on Poj Solution 3174