# Monthly Archives: March 2009

## Poj Solution 1026

http://poj.org/problem?id=1026 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); int len; int[] n; int[] loop; String[] s; int times; int … Continue reading

Posted in poj | Comments Off on Poj Solution 1026

## Poj Solution 1025

http://poj.org/problem?id=1025 #include <iostream> class Room { public: int fNo , rNo; // rNo表示房间号，fNo表楼层号，其中fNo-2表楼外。rNo=-1表示电梯 char * toString() { // 此函数线程不安全，不过用在此题没问题。千万不能在printf()这类函数内两次调用此函数。 static char str_room; sprintf(str_room,"%02d%02d",fNo,rNo); return str_room; } Room& operator = ( const Room& room ) { fNo=room.fNo; rNo=room.rNo; return *this; } … Continue reading

Posted in poj | Comments Off on Poj Solution 1025

## Poj Solution 1024

http://poj.org/problem?id=1024 #include <stdio.h> #include <string.h> struct pos { int len; int used; int r; int u; }p; int num, wallNum, w, h, Dx, Dy, minPath; void DFS(int x, int y, int len, int flag) { if (len >= p[x][y].len[flag] && … Continue reading

Posted in poj | Comments Off on Poj Solution 1024

## Poj Solution 1023

http://poj.org/problem?id=1023 /* @author: */ import java.util.Scanner; public class Main{ public static void main(String args[]){ long n; int k,t; int ans[]=new int; char a[]=new char; Scanner sc=new Scanner(System.in); t=sc.nextInt(); while((t–)!=0){ k=sc.nextInt(); a=sc.next().toCharArray(); n=sc.nextLong(); for(int i=0;i< k;i++){ if((n&0x1)!=0){ ans[k-1-i]=1; if(a[k-i-1]==’p’) n=n-1; else … Continue reading

Posted in poj | Comments Off on Poj Solution 1023

## Poj Solution 1022

http://poj.org/problem?id=1022 #include<iostream> #include"math.h" using namespace std; int id;int edge,set; int next,n,ok; int find(int d) {int i; for(i=0;i<n;i++) if(id[i]==d)return i; return -1; } int zb; ///////////////////////// void search(int i,int axes) {int ax,k; set[i]=1;ok++; for(k=0;k<4;k++) {if(axes[k]<zb[k])zb[k]=axes[k]; else if(axes[k]>zb[k])zb[k]=axes[k]; } int j; for(j=0;j<n;j++) … Continue reading

Posted in poj | Comments Off on Poj Solution 1022

## Poj Solution 1021

http://poj.org/problem?id=1021 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static int n_limit=100*100; static int width; static int height; static boolean in_map(int x,int y){ if (0<=x&&x< width&&0<=y&&y< height) return true; else return false; } static int calculate(int x,int y,int[][] … Continue reading

Posted in poj | Comments Off on Poj Solution 1021

## Poj Solution 1020

http://poj.org/problem?id=1020 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static int c[]=new int;//c[i]��ű߳�Ϊi��С���εĸ��� static int d[]=new int;//d[i]��ʾ��i������С���κ��������� static int s,n,sum; static boolean ok; public static void main(String args[]) { int t,it,i,tp; Scanner sc=new Scanner(System.in); t=sc.nextInt();//���Դ�¦ for(it=1;it<=t;it++)//ѭ������ÿһ�β��� { s=sc.nextInt();//�����ӡ������εı߳� … Continue reading

Posted in poj | Comments Off on Poj Solution 1020

## Poj Solution 1019

http://poj.org/problem?id=1019 #include <iostream> #include <cmath> using namespace std; unsigned int a, s; /* 打表 */ void reset() { int i; a = 1; s = 1; for(i = 2; i < 31270; i++) { /* 每一组数字都比上一组长 (int)log10((double)i) + 1 */ … Continue reading

Posted in poj | Comments Off on Poj Solution 1019

## Poj Solution 1018

Posted in poj | Comments Off on Poj Solution 1018

## Poj Solution 1017

http://poj.org/problem?id=1017 import java.util.Scanner; public class Main { int a; int b; int c; int d; int e; int f; int packets; int t; public Main() { Scanner scan = new Scanner(System.in); a = scan.nextInt(); b = scan.nextInt(); c = scan.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1017

## Poj Solution 1015

http://poj.org/problem?id=1015 //* @author: 82638882@163.com import java.util.Scanner; public class Main{ static short[] p,d; static short[][][] arr,path; static int add,a,b,st,ed; public static void main(String[] args) { Scanner in=new Scanner(System.in); int cnt=0; while(true) { cnt++; a=in.nextInt(); b=in.nextInt(); if(a==0&&b==0)break; System.out.println("Jury #"+cnt); p=new short[a+1]; d=new … Continue reading

Posted in poj | Comments Off on Poj Solution 1015

## Poj Solution 1014

http://poj.org/problem?id=1014 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); String[] s; int[] marbles; int sum; int part; int times = 0; while (true) … Continue reading

Posted in poj | Comments Off on Poj Solution 1014

## Poj Solution 1012

http://poj.org/problem?id=1012 #include<iostream> using namespace std; int a; int table[] = {0,2,7,5,30,169,441,1872,7632,1740,93313,459901,1358657,2504881,13482720}; int main(){ while(cin>>a && a){ cout<<table[a]<<endl; } return 0; }

Posted in poj | Comments Off on Poj Solution 1012