# Monthly Archives: November 2010

## Poj Solution 1650

http://poj.org/problem?id=1650 /* @author: */ import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); double a; int d; a=sc.nextDouble(); d=sc.nextInt(); double ans; double min=a; int v1=0,v2=0,m=1,n=1; while(m<=d&&n<=d) { ans=m*1.0/n*1.0; if(ans>=a) { if(min>ans-a) { min=ans-a; v1=m; v2=n; } … Continue reading

Posted in poj | Comments Off on Poj Solution 1650

## Poj Solution 1648

http://poj.org/problem?id=1648 #include<stdio.h> #include<string.h> #include<stdlib.h> #include<string.h> #include<math.h> #define INF 30000 #define NMAX 13 float N,E,W; double gety(double x) { return (E-W)/N*x+W; } void solve() { int i,j; int sum=0; double(y); for(i=0;i<N;i++) { for(j=0;j<N;j++) { for(int p=0;p<2;p++) { y=gety(i+p); if(y>=j&&y<=j+1) { sum++; … Continue reading

Posted in poj | Comments Off on Poj Solution 1648

## Poj Solution 1639

http://poj.org/problem?id=1639 //* @author import java.util.*; import java.io.*; import java.util.concurrent.*; public class Main { private static class UFSets { UFSets(int l) { s = new int[l]; for(int i=0; i!=l; ++i) s[i] = i; } void union(int x, int y) { s[find(x)] … Continue reading

Posted in poj | Comments Off on Poj Solution 1639

## Poj Solution 1637

http://poj.org/problem?id=1637 //* @author import java.util.*; import java.util.concurrent.ArrayBlockingQueue; public class Main { static int N = 205; static int [] degin, degout, deg, pre; static int [][] cap; private static int maxflow(int s, int t, int size) { Queue<Integer> que = … Continue reading

Posted in poj | Comments Off on Poj Solution 1637

## Poj Solution 1633

http://poj.org/problem?id=1633 //* @author:alpc12 import java.math.BigInteger; import java.util.Scanner; public class Main { BigInteger[][] dp = new BigInteger[51][51]; BigInteger go(int n, int y) { if (y == 1) return BigInteger.ONE; if (n < y || y < 1) return BigInteger.ZERO; if(dp[n][y] != … Continue reading

Posted in poj | Comments Off on Poj Solution 1633

## Poj Solution 1631

http://poj.org/problem?id=1631 #include <stdio.h> #include <algorithm> using namespace std; int a[40000], n; int ans[40000]; int id[40000], m; bool cmp( int s1,int s2 ) { return a[s1] < a[s2]; } int main() { int i, j, s; int cas; scanf( "%d", &cas … Continue reading

Posted in poj | Comments Off on Poj Solution 1631

## Poj Solution 1630

http://poj.org/problem?id=1630 #include<iostream> using namespace std; struct point {int x,y;}; long cheng(point a,point b,point c) {return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);} long dcheng(point a,point b,point c) {return (b.x-a.x)*(c.x-a.x)+(b.y-a.y)+(c.y-a.y);} point p[10000]; int n,k[32],begin[32],end[32],m; void init() {int i,h=0;char c; cin>>n; for(i=0;i<=n;i++) {begin[i]=h; while(cin.peek()!=’#’) {cin>>p[h].x>>c; cin>>p[h++].y>>c; } cin.get(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1630

## Poj Solution 1628

http://poj.org/problem?id=1628 #include <stdio.h> #include <algorithm> using namespace std; __int64 p[210],q[210]; inline int geti( char c ) { if( c <= ‘Z’ && c >= ‘A’ ) return c – ‘A’ + 26; else return c – ‘a’; } int n, … Continue reading

Posted in poj | Comments Off on Poj Solution 1628

## Poj Solution 1617

http://poj.org/problem?id=1617 /* @author:����acmilan_fan@yahoo.cn */ import java.io.*; import java.util.*; public class Main { public static void main(String[] args)throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String s; String ciphertext; int codesize; int textrow; int colnum; StringBuilder sb; while((s=br.readLine())!=null&&!s.equals("THEEND")){ //length of the … Continue reading

Posted in poj | Comments Off on Poj Solution 1617

## Poj Solution 1615

http://poj.org/problem?id=1615 #include"iostream" #include"stdlib.h" #include"memory.h" //#include"time.h" using namespace std; long m[5][100],len[5],n,total,answer; /////////////////////////// long cas; /////////////////////////// void init() { n=5;total=0; int i,j; for(i=0;i<n;i++) { len[i]=80; for(j=0;j<len[i];j++) { m[i][j]=rand()%201-100; total+=m[i][j]; } } } void init1() { n=0;total=0; do { len[n]=0; do { cin>>m[n][len[n]++]; … Continue reading

Posted in poj | Comments Off on Poj Solution 1615

## Poj Solution 1612

http://poj.org/problem?id=1612 #include<iostream> using namespace std; int dis[50][50],n; void init() { char c; int i,j,k; cin>>n; for(i=0;i<n;i++) { for(j=0;j<n;j++) dis[i][j]=9999; dis[i][i]=0; } for(i=0;i<n;i++) { cin.get(c); while(cin.peek()!=’n’) { cin>>j; dis[i][j-1]=1; dis[j-1][i]=1; } } for(k=0;k<n;k++) for(i=0;i<n;i++) for(j=0;j<n;j++) if(dis[i][k]<9999&&dis[k][j]<9999&&dis[i][k]+dis[k][j]<dis[i][j]) dis[i][j]=dis[i][k]+dis[k][j]; } void doit() { … Continue reading

Posted in poj | Comments Off on Poj Solution 1612

## Poj Solution 1611

http://poj.org/problem?id=1611 import java.util.Arrays; import java.util.Scanner; public class Main { static int[] student; static int[] ans; 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 == … Continue reading

Posted in poj | Comments Off on Poj Solution 1611

## Poj Solution 1609

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

Posted in poj | Comments Off on Poj Solution 1609