Monthly Archives: May 2013

Poj Solution 2479

http://poj.org/problem?id=2479 import java.io.BufferedReader; import java.io.InputStreamReader; public class Main { int t; int l; int[] a; String[] s; int[] left; int[] right; int max = 0; int temp; public Main() throws Exception { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); t … Continue reading

Poj Solution 2477

http://poj.org/problem?id=2477 #include<iostream> #include"stdio.h" using namespace std; struct tree { int l,r; __int64 value; int child; }t[100]; int n,root; bool init() { int i,times[100]; cin>>n; if(n==0) return 0; for(i=1;i<=n;i++) times[i]=0; for(i=1;i<=n;i++) { cin>>t[i].l>>t[i].r; if(t[i].l>0) times[t[i].l]++; if(t[i].r>0) times[t[i].r]++; } for(i=1;i<=n;i++) if(times[i]==0) { … Continue reading

Poj Solution 2473

http://poj.org/problem?id=2473 #include<iostream> #include"algorithm" using namespace std; struct rect { int x1,x2,y1,y2; }r[210]; int n,w,h,n1,n2,m; int x[411],y[411]; void init() { int i; cin>>n>>w>>h; for(i=0;i<n;i++) { cin>>r[i].x1>>r[i].y1>>r[i].x2>>r[i].y2; x[i]=r[i].x2; y[i]=r[i].y2; } m=n+1; x[n]=0,y[n]=0; std::sort(x,x+m); std::sort(y,y+m); n1=std::unique_copy(x,x+m,x)-x; n2=std::unique_copy(y,y+m,y)-y; } inline int max(int a,int b) … Continue reading

Poj Solution 2472

http://poj.org/problem?id=2472 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static int N = 100+5; static int n; static double Graph[][] = new double[N][N]; public static void init(){ int i,j; for(i=0;i< N;++i) for(j=0;j< N;++j) Graph[i][j] = 0.0; } … Continue reading

Poj Solution 2470

http://poj.org/problem?id=2470 //* @author ������&lt;hongxp11@163.com&gt; //�t���� buffered import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.HashMap; import java.util.Map; import java.util.Scanner; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); while (true) … Continue reading

Poj Solution 2469

http://poj.org/problem?id=2469 #include<iostream> using namespace std; char *suit[]={"Clubs", "Diamonds", "Hearts", "Spades"}; char *value[]={"2", "3", "4", "5", "6", "7", "8", "9", "10", "Jack", "Queen", "King", "Ace"}; int shuffles[101][52],n; int card[52]; void init() { int i,j; cin>>n; for(i=0;i<n;i++) for(j=0;j<52;j++) cin>>shuffles[i][j]; for(i=0;i<52;i++) card[i]=i; } … Continue reading

Poj Solution 2465

http://poj.org/problem?id=2465 #include<iostream> using namespace std; inline int min(int a,int b) { return a<b?a:b; } int dis[112],price[112]; int l,n; void init() { n=0; cin>>l; while(cin>>dis[n]) cin>>price[n++]; price[n]=99999999; dis[n]=l; n++; } int doit() { int i,j,s,temp[212],p; int best[212]; for(i=0;i<201;i++) best[i]=-1; best[100]=0; for(s=dis[0],i=0;i<n;i++) … Continue reading

Poj Solution 2463

http://poj.org/problem?id=2463 #include<iostream> #include"math.h" using namespace std; double k,l,s,w; const double g=9.81; bool init() { cin>>k>>l>>s>>w; return !(k==0&&l==0&&s==0&&w==0); } int calculate() { double v,v0,h,vv; if(s<=l||k==0) { v=sqrt(2*s*g); if(v>10)return -1; else return 1; } else { v0=sqrt(2*l*g); h=(2*w*g+sqrt(4*w*w*g*g+8*k*w*g*l))/(2*k); h+=l; if(h<s)return 0; vv=(2*w*g*s-k*(s-l)*(s-l))/w; … Continue reading