# Monthly Archives: July 2010

## Poj Solution 1503

http://poj.org/problem?id=1503 import java.util.*; import java.math.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); BigDecimal bd1 = BigDecimal.valueOf(0); BigDecimal bd2 = BigDecimal.valueOf(0); String str; while(cin.hasNext()) { str = cin.nextLine(); if(str.equals("0")) break; else { bd2 … Continue reading

Posted in poj | Comments Off on Poj Solution 1503

## Poj Solution 1496

http://poj.org/problem?id=1496 //* @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()) { String s=in.next(); boolean bb=true; for(int i=0;i< s.length()-1;i++) { if(s.charAt(i)-s.charAt(i+1)>=0) { System.out.println(0); bb=false; break; } } if(!bb)continue; int l=s.length(); long … Continue reading

Posted in poj | Comments Off on Poj Solution 1496

## Poj Solution 1493

http://poj.org/problem?id=1493 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int N = 100000; static String str[] = new String[N]; static int n; static void start(){ for(int i=0;i< n;++i) str[i] = new String(); } public static … Continue reading

Posted in poj | Comments Off on Poj Solution 1493

## Poj Solution 1491

http://poj.org/problem?id=1491 //* @author ������&lt;hongxp11@163.com&gt; import java.text.DecimalFormat; import java.util.Scanner; import java.util.Vector; public class Main { public static int factor(int a, int b) { if (b == 0) return a; else return factor(b, a % b); } public static void main(String[] args) … Continue reading

Posted in poj | Comments Off on Poj Solution 1491

## Poj Solution 1488

http://poj.org/problem?id=1488 #include<stdio.h> int main() { char c; int q=1; while((c=getchar())!=EOF) { if(c == ‘"’) { printf(q ? "“":"”"); q=!q; } else printf("%c",c); } return 0; }

Posted in poj | Comments Off on Poj Solution 1488

## Poj Solution 1485

http://poj.org/problem?id=1485 #include <iostream> #define MAX 200000000 using namespace std; long r[300],sum[300][40],one[300][300]; long from[300][40],to[300][40],at[300][40]; long printDetail(long i, long j)//递归输出 { if(j<=0||i<=0) return 1; long num=printDetail(from[i][j]-1,j-1); cout<<"Depot "<<num<<" at restaurant "<<at[i][j]<<" serves ";; if(from[i][j]==to[i][j]) cout<<"restaurant "<<from[i][j]<<endl; else cout<<"restaurants "<<from[i][j]<<" to "<<to[i][j]<<endl; return … Continue reading

Posted in poj | Comments Off on Poj Solution 1485

## Poj Solution 1484

http://poj.org/problem?id=1484 //* @author: SmilingWang import java.util.LinkedList; import java.util.Scanner; public class Main { public static void main(String[] args){ int n, m, c; int i, j = 1, k; Scanner scanner = new Scanner(System.in); boolean blowFuse = false; int sumOfPower = 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1484

## Poj Solution 1477

http://poj.org/problem?id=1477 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int c=0; while(true) { int a=in.nextInt(); if(a==0)break; c++; int[] arr=new int[a]; int total=0; for(int i=0;i< a;i++) { arr[i]=in.nextInt(); total+=arr[i]; } total/=a; … Continue reading

Posted in poj | Comments Off on Poj Solution 1477

## Poj Solution 1476

http://poj.org/problem?id=1476 #include<stdio.h> #define debug 0 #define NMAX 20 #define DMAX 30 #define INF 1000000000 #define KMAX 1001 long d[KMAX][NMAX]; int main() { #if debug freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif int T=1,N,K,i,j,k; long c[NMAX+1][NMAX+1][DMAX+1]; int t[NMAX+1][NMAX+1]; scanf("%d%d",&N,&K); while(N&&K) { for(i=1;i<=N;i++) for(j=1;j<=N;j++) { if(i!=j) … Continue reading

Posted in poj | Comments Off on Poj Solution 1476

## Poj Solution 1474

http://poj.org/problem?id=1474 #include<iostream> using namespace std; int xmin,ymin,xmax,ymax,n; int main() {int i,xn,yn,xp,yp,dx,dy,c_n=0; while(1) {cin>>n; if(!n)break; xmin=-32000;ymax=32000; xmax=-xmin;ymin=-ymax; cin>>xp>>yp; dx=xp;dy=yp; for(i=0;i<n;i++) {if(i<n-1)cin>>xn>>yn;else {xn=dx;yn=dy;} if(yn==yp){if(xn>xp){if(yp<ymax)ymax=yn;} else if(yp>ymin)ymin=yn; } else {if(yn>yp){if(xn>xmin)xmin=xn;} else if(xn<xmax)xmax=xn; } xp=xn;yp=yn; } cout<<"Floor #"<<++c_n<<endl; if(xmin<=xmax&&ymin<=ymax)cout<<"Surveillance is possible."<<endl<<endl; else cout<<"Surveillance is … Continue reading

Posted in poj | Comments Off on Poj Solution 1474

## Poj Solution 1473

http://poj.org/problem?id=1473 #include<stdio.h> #include<string.h> #include<stdlib.h> #include<string.h> #include<math.h> #define sq2 0.70710678118654752440084436210485 #define INF 30000 #define NMAX 52 int p[10]={0}; int as[10]={0}; double xd[8]={0,sq2,1,sq2,0,-sq2,-1,-sq2}; double yd[8]={1,sq2,0,-sq2,-1,-sq2,0,sq2}; double cx,cy; void findpos(char *s) { s[strlen(s)-1]=0; int len; char direct[4]; sscanf(s,"%d%s",&len,direct); int d; if(!strcmp("NE",direct)) d=1; else … Continue reading

Posted in poj | Comments Off on Poj Solution 1473

## Poj Solution 1472

http://poj.org/problem?id=1472 /* @author: */ import java.io.BufferedInputStream; import java.util.Scanner; import java.util.Arrays; class Main { public static Scanner cin=new Scanner(new BufferedInputStream(System.in)); public static int [] coef=new int[11]; public static String temp; public static void work(int con,int expo) { while (true) { temp=cin.next(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1472

## Poj Solution 1471

http://poj.org/problem?id=1471 #include<iostream> #include<stdlib.h> #include<stdio.h> using namespace std; #define MAXNO 102 int tr[MAXNO][2*MAXNO-1]={0}; int maxtr[MAXNO][2*MAXNO-1]={0}; int curmax=0; int min(int a,int b) { if(a>b) return b; else return a; } int sum(int a1,int an,int n) { return (a1+an)*n/2; } int ln(int n) … Continue reading

Posted in poj | Comments Off on Poj Solution 1471