# Monthly Archives: October 2011

## Poj Solution 1959

http://poj.org/problem?id=1959 /* @author: */ import java.text.DecimalFormat; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a[]=new int[100]; int n,T; long sum; a[0]=0; for(int i=1;i<=20;i++) { a[i]=i; a[20+i]=2*(i); a[40+i]=3*(i); } a[61]=25; a[62]=50; … Continue reading

## Poj Solution 1953

http://poj.org/problem?id=1953 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()) { long[] f = new long[46]; f[0] = 0; f[1] = 2; f[2] = 3; for (int … Continue reading

## Poj Solution 1952

http://poj.org/problem?id=1952 //* @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 a=Integer.parseInt(in.readLine()); int n=0; my[] p=new my[a]; String[] ss; while(a-n>10) { ss=in.readLine().split(" "); for(int i=0;i< 10;i++) … Continue reading

## Poj Solution 1950

http://poj.org/problem?id=1950 //* @author:alpc12 import java.io.*; import java.util.*; import java.math.*; public class Main { char[] opa = { ‘+’, ‘-‘, ‘.’ }; char[] op; int cnt; int n; int rec[] = {88, 162, 197, 437, 1350 }; void print() { cnt++; … Continue reading

## Poj Solution 1948

http://poj.org/problem?id=1948 #include <stdio.h> #include <memory.h> #include <math.h> #include <list> using namespace std; bool sign[800][800]; int l[40], n; typedef pair<int,int> node; node q[800*800]; int qn; int main() { int i, j, x, y, s, m; list< node >::iterator iter; scanf( "%d", … Continue reading

## Poj Solution 1947

http://poj.org/problem?id=1947 #include <list> #include <iostream> using namespace std; list< int > e[150]; int ans[150][151]; int n, p, answer; int root; int creat( int r ) { int i, j, n, m, c, temp[151]; n = 1; ans[r][0] = 1; ans[r][1] … Continue reading

## Poj Solution 1946

http://poj.org/problem?id=1946 #include <iostream> using namespace std; int maxs[101][101], n, e, d; // ʱ�� �� int need[101][101]; // ·�� �� void init() { int t, s, v, h; cin>>n>>e>>d; for( t=0; t<=d; t++ ) maxs[t][0] = 0; for( h=0; h<=e; h++ … Continue reading

## Poj Solution 1944

http://poj.org/problem?id=1944 #include <stdio.h> #include <algorithm> #include <memory.h> using namespace std; int t[4100]; int sum[4100]; void insert( int l, int r, int a, int b, int s, bool del ) { int c = (l+r)/2; if( l>=r || l>=b || r<=a … Continue reading

## Poj Solution 1942

http://poj.org/problem?id=1942 //* @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[] ss=in.readLine().split(" "); Long n=Long.parseLong(ss[0]); Long m=Long.parseLong(ss[1]); if(n==0&&m==0) break; long ans=1; n=m+n; if(m>n-m) m=n-m; … Continue reading

## Poj Solution 1940

http://poj.org/problem?id=1940 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(in.hasNext()) { int a=in.nextInt(); double[] x=new double[a]; double[] y=new double[a]; for(int i=0;i< a;i++) { x[i]=in.nextDouble(); y[i]=in.nextDouble(); } double sx=0,sy=0,uu=-1; System.out.print(a); for(int … Continue reading