Monthly Archives: September 2011

http://poj.org/problem?id=1934 #include <stdio.h> #include <vector> #include <string.h> #include <algorithm> #include <set> using namespace std; int ans[81][81]; int from[81][81]; char route1[100],route2[100]; int n,m; void doit() { int i,j; for( i=0; i<=n; i++) ans[i][0] = 0; for( j=0; j<=m; j++) ans[0][j] = … Continue reading →

http://poj.org/problem?id=1928 //* @author: 82638882@163.com import java.io.*; import java.util.Arrays; 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()); while((a–)!=0) { String[] ss=in.readLine().split(" "); int cow=Integer.parseInt(ss[0]); int cul=Integer.parseInt(ss[1]); int sum=Integer.parseInt(ss[2])-2; my[] … Continue reading →

http://poj.org/problem?id=1927 /* @author: */ import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int k = 1; double l1, l2, l3, s, c, p, R, ctg1, ctg2, ctg3, len, r, ls, area; … Continue reading →

http://poj.org/problem?id=1925 #include"stdio.h" #include"math.h" #include"memory.h" int x[5010],h[5010]; int pos[1000001]; int n; void init() { int i; scanf( "%d", &n ); for( i=0; i<n; i++ ) scanf( "%d %d", x+i, h+i ); memset( pos, -1, sizeof(int)*(x[n-1]+1) ); } void doit() { int … Continue reading →

http://poj.org/problem?id=1923 import java.util.Scanner; public class Main { static int com(int a) { return a*(a-1)/2; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); long line[][]=new long[101][10001]; int i,j,k,p,q,cs=0; long max,tmp; for(i=1;i<=100;i++) line[i][0]=i+1; for(i=2;i<=100;i++) for(j=1;j<=com(i);j++) { max=0; for(k=1;k<=i-1;k++) … Continue reading →

http://poj.org/problem?id=1922 import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner s = new Scanner(System.in); while(true) { int n = s.nextInt(); if(n == 0) System.exit(-1); double min = 1000000000; while(n > 0) { int v = s.nextInt(); int … Continue reading →

http://poj.org/problem?id=1916 #include <iostream> #include <string.h> using namespace std; int a[1030][1030]; int main() { int test,d,n,i,max,j,temp,x,y,now; cin>>test; while(test–) { cin>>d; cin>>n; memset(a,0,sizeof(a)); for(i=0;i<n;i++) { cin>>x>>y; cin>>a[x][y]; } max=-1; for(i=1;i<1025;i++) { a[i][0]+=a[i-1][0]; a[0][i]+=a[0][i-1]; } temp=2*d+1; for(i=1;i<1025;i++) for(j=1;j<1025;j++) { a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1]; if(i>=temp&&j>=temp) { now=a[i][j]-a[i-temp][j]-a[i][j-temp]+a[i-temp][j-temp]; … Continue reading →

http://poj.org/problem?id=1915 import java.io.BufferedInputStream; import java.util.LinkedList; import java.util.Scanner; public class Main { private static int[][] directions = new int[][]{ {-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, {1, -2}, {1, 2}, {2, -1}, {2, 1}}; static void BreadthFirstSearch(int startX, int startY, … Continue reading →

http://poj.org/problem?id=1914 //* @author popop0p0popo import java.util.*; import java.io.*; import java.text.*; import java.math.*; public class Main{ public static void main(String[] args){ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); int n=scanner.nextInt(); BigInteger[][] a; BigInteger[] b; BigInteger aa,aa1,aa2,aa3; for (int i=0;i< n ;i++ ){ a=new … Continue reading →

http://poj.org/problem?id=1909 //* @author: ccQ.SuperSupper import java.util.*; import java.io.*; class node{ int init_have; int sum_have; int nodes; Vector son = new Vector(); } public class Main { static int N = 10000+100; public static void main(String []args) throws Exception{ int n,i,j,ans,cnt,sons,root; … Continue reading →

http://poj.org/problem?id=1906 //* @author: import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[]args){ BigInteger dat[]=new BigInteger[100]; dat[0]=BigInteger.ONE; BigInteger tr=new BigInteger("3"); for(int i=1;i< 100;i++){ dat[i]=dat[i-1].multiply(tr); } long N; int t; boolean first; Scanner cin=new Scanner(System.in); while(cin.hasNext()){ N=cin.nextLong(); if(N==0) break; … Continue reading →