Category Archives: poj

http://poj.org/problem?id=1063 //* @author: import java.util.Scanner; public class Main{ public static void main(String args[]) { int cas, i, n, j, s1, s2; int a[]=new int[30]; Scanner sc=new Scanner(System.in); cas=sc.nextInt(); while((cas–)!=0 ) { n=sc.nextInt(); for( i=0; i< n; i++ ) { a[i]=sc.nextInt(); … Continue reading →

http://poj.org/problem?id=1062 //���ձ��˵�˼���õ�,֮ǰ���Ǻ��˽�dijkstra������������Щ��� //1,����ǰδ�������·�ķ��Ҫ��ľ�����̽���������·; //2,�������뵱ǰ����Ľ���й�j����δ���������·�Ľ����̾�����и��¡� //ͼ������һ������С�����ĵľ����㷨Prim�㷨��Dij��̼������ƣ�����̰��˼�롣 //ֻ��һ���ǶԶ����ѡ������һ���ǶԱߵ�ѡ�� import java.util.*; public class Main { public static int[][] e; public static int[] dis; public static int[] used; public static int[] level; public static int n,m; public static void main(String[] args){ Scanner cin = … Continue reading →

http://poj.org/problem?id=1061 import java.util.Scanner; public class Main { static long x0, y0; public static void main(String[] args) { Scanner scan = new Scanner(System.in); long x = scan.nextInt(); long y = scan.nextInt(); long m = scan.nextInt(); long n = scan.nextInt(); long L … Continue reading →

http://poj.org/problem?id=1058 //* @author: import java.util.*; public class Main{ String result[][]; char c[]={‘A’,’B’,’C’,’D’,’E’,’F’,’G’,’H’,’I’,’J’,’K’,’L’,’M’,’N’,’O’,’P’}; boolean used[]; public Main(String result[][]){ this.result=result; } public static void main(String args[]){ Scanner sc=new Scanner(System.in); while(true){ String result[][]=new String[5][4]; for(int i=0;i< 5;i++) for(int j=0;j< 4;j++){ if(i>=3) result[i][j]=""; else … Continue reading →

http://poj.org/problem?id=1057 /* @author:����acmilan_fan@yahoo.cn */ import java.io.*; public class Main { public static void main(String[] args) throws Exception{ //System.setIn(new FileInputStream(new File("E:\in.txt"))); //System.setOut(new PrintStream(new File("E:\out.txt"))); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String s; Node root=new Node("ROOT",null); Node curr=root; Node t,n; int count=1; … Continue reading →

http://poj.org/problem?id=1056 //* @author 洪晓鹏&lt;hongxp11@163.com&gt; import java.util.ArrayList; import java.util.Scanner; public class Main { /** * @param args */ public static boolean isPrefix(String a, String b) { int len = a.length() > b.length() ? b.length() : a.length(); if (a.substring(0, len).equals(b.substring(0, len))) return … Continue reading →

http://poj.org/problem?id=1054 import java.util.Arrays; import java.util.Scanner; public class Main { class Point implements Comparable { int row; int col; public Point(int x, int y) { this.row = x; this.col = y; } public int compareTo(Object o) { int result = 0; … Continue reading →

http://poj.org/problem?id=1051 //* @author import java.io.*; import java.util.*; public class Main { static HashMap< String,String> codeMap = new HashMap< String,String>(); static HashMap< String,String> ref = new HashMap< String,String>(); public static void main(String[] args) throws Exception { initMap(); readFile(); } static void … Continue reading →

http://poj.org/problem?id=1050 import java.util.Scanner; public class Main { int[][] a; int l; int max = Integer.MIN_VALUE; int t; int t1; int t2[]; public Main() { Scanner scan = new Scanner(System.in); l = scan.nextInt(); a = new int[l][l]; for (int i = … Continue reading →

http://poj.org/problem?id=1047 import java.util.*; import java.math.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); BigInteger b,c,d; String str,str1,str2,str3; int i,len; while(cin.hasNext()) { str = cin.next(); b = new BigInteger(str); len=str.length()+1; char []kids = new … Continue reading →

http://poj.org/problem?id=1046 #include <stdio.h> struct Color{ int R,G,B; }map[16]; int main() { int i; for ( i = 0; i < 16; ++i) scanf("%d%d%d",&map[i].R,&map[i].G,&map[i].B); struct Color c; while(scanf("%d%d%d",&c.R,&c.G,&c.B)&&c.R>=0){ int index=0,min=65535; for ( i = 0; i < 16; ++i) { int … Continue reading →

http://poj.org/problem?id=1045 import java.util.Scanner; public class Main { static double vs = 0; static double c = 0; static double r = 0; static double w = 0; static int times = 0; public static void main(String[] args) { Scanner scan … Continue reading →

http://poj.org/problem?id=1043 #include<iostream> #include<string> #include<cmath> #include<algorithm> using namespace std; struct criminal { char name[21]; int id; }crim[20]; int cmp(void const * a,void const * b) //按姓名升序排序 { return strcmp(((criminal *)a)->name,((criminal *)b)->name); } int Bipartite(bool decryp[][20],int n,int count) //二分图的匈牙利算法,decryp是原始数组,n是用户ID的个数,count是罪犯的个数(列数) { int i,j,x,qs,qe,q[20],prev[20],ncount=0; … Continue reading →

http://poj.org/problem?id=1042 import java.io.BufferedInputStream; import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { int n = scan.nextInt(); if (n == 0) { break; } int h = … Continue reading →

http://poj.org/problem?id=1039  

http://poj.org/problem?id=1038 //* @author import java.util.*; public class Main { static Scanner in = new Scanner(System.in); static int[] p = new int[12]; static { p[0] = 1; for(int i=1; i!=p.length; ++i) p[i] = 3*p[i-1]; } static int get(int s, int i) … Continue reading →

http://poj.org/problem?id=1037 //* @author: import java.util.*; public class Main{ static final int MAX=21;//���20��ľ�� static long w[][];//w�����еĸ��� static long m[][];//m�����еĸ���m[x][n]Ϊ��n��Ȳ�ͬ��ľ����ɵ�դ8�У������е�x��ľ��ʼ�ġ�M�������еĸ��� private int n;//ľ��ĸ��� private long c;//��� private boolean flag[]; private boolean print; static {//��ʼ����̬�� w=new long[MAX][MAX]; m=new long[MAX][MAX]; w[1][1] = 1; m[1][1] … Continue reading →

http://poj.org/problem?id=1035 //* @author import java.io.*; import java.util.*; public class Main { static ArrayList< Item> dicts = new ArrayList< Item>(); public static void main(String[] args) throws Exception { readFile(); } static void readFile() throws Exception { BufferedReader br = new BufferedReader( … Continue reading →

http://poj.org/problem?id=1032 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int[] u=new int[]{ 1,2,5,9,14,20,27,35,44,54,65,77,90,104,119,135,152,170,189,209,230,252,275,299,324, 350,377,405,434,464,495,527,560,594,629,665,702,740,779,819,860,902,945,989,1034,1111 }; int a=in.nextInt(); int b=0; int k=22; int m=0; int h=45; while(!(a< u[k+1]&&a>=u[k])) { if(a>=u[k+1]) { … Continue reading →

http://poj.org/problem?id=1028 import java.util.Scanner; import java.util.Stack; public class Main { String command; Stack<String> back = new Stack<String>(); Stack<String> forward = new Stack<String>(); String current = "http://www.acm.org/"; String display; public Main() { Scanner scan = new Scanner(System.in); while (!(command = scan.next()).equals("QUIT")) { … Continue reading →

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 →

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[5]; 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 →

http://poj.org/problem?id=1024 #include <stdio.h> #include <string.h> struct pos { int len[2]; int used; int r; int u; }p[20][20]; 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 →

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[65]; char a[]=new char[66]; 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 →

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

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 →

http://poj.org/problem?id=1020 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static int c[]=new int[11];//c[i]��ű߳�Ϊi��С���εĸ��� static int d[]=new int[41];//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 →

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

http://poj.org/problem?id=1018 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { double bp = 0; public Main() throws NumberFormatException, IOException { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); int t = Integer.parseInt(read.readLine()); int num; int[][] b; int[][] p; int[] n; … Continue reading →

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 →

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 →

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 →

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; }

http://poj.org/problem?id=1011 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { static boolean[] used; static int len; static int[] s; static int sum; static int max; static int parts; public static void main(String[] args) throws Exception { BufferedReader … Continue reading →

http://poj.org/problem?id=1010 //* @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()) { int[] arr=new int[100]; int n=0; while(true) { int a=in.nextInt(); if(a==0)break; arr[n++]=a; } Arrays.sort(arr,0,n); while(true) { int a=in.nextInt(); if(a==0)break; int … Continue reading →

http://poj.org/problem?id=1009 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static void main(String[] args){ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); int n,dtf,m,mn,cp,cpl; int[][] dt; while (true){ n=scanner.nextInt(); if (n==0){ break; } System.out.println(n); dt=new int[2][10000]; dtf=0; while (true){ dt[0][dtf]=scanner.nextInt(); dt[1][dtf]=scanner.nextInt(); … Continue reading →

http://poj.org/problem?id=1008 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int times = scan.nextInt(); System.out.println(times); int day; int day2; int t_day = 0; int t_month; String month; String month2; int year; int … Continue reading →

http://poj.org/problem?id=1007 import java.util.*; class DNA { private String str = null; private int sortNum = 0; public DNA(String input) { str = input; int num = 0; for(int i = 0; i < str.length()-1; i++) { for(int j = i+1; … Continue reading →

http://poj.org/problem?id=1006 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int k = 0; while (scan.hasNext()) { int p = scan.nextInt(); int e = scan.nextInt(); int i = scan.nextInt(); int d = … Continue reading →

http://poj.org/problem?id=1005 #include <stdio.h> #include <stdlib.h> #include <math.h> #define M_PI 3.14159265358979323846 #define DEBUG 0 int main(void) { if(DEBUG) freopen("in","r",stdin); int year,n,i=1; double x,y,radius,area; scanf("%d",&n); while(n–){ scanf("%lf%lf",&x,&y); radius=x*x+y*y; area=M_PI*radius/2.0; year=(int)ceil(area/50); printf("Property %d: ",i++); printf("This property will begin eroding in year %d.n",year); } … Continue reading →

http://poj.org/problem?id=1004 #include <iostream> using namespace std; int main(){ double d,t; while(cin>>d){ t+=d; } cout<<"$"<<t/12; return 0; }

http://poj.org/problem?id=1003 #include <stdio.h> #include <stdlib.h> #define DEBUG 0 int main(void) { if(DEBUG) freopen("in","r",stdin); float c; while(scanf("%f",&c)&&c!=0){ int i=2; float rs=0; while(rs<c){ rs+=1.0/i; i++; } printf("%d card(s)n",i-2); } return 0; }

http://poj.org/problem?id=1002 #include<stdio.h> #include<stdlib.h> #include<string.h> #include<ctype.h> typedef struct BSTNode { char phoneName[9]; int times; struct BSTNode *lchild,*rchild; }BSTNode,*BSTree; int count; void InsertBST(BSTree &t, char name[])//二叉排序树的插入,注意里面的BSTree &t { BSTree p,f; p = t;//指向树根 while(p) { if(strcmp(name,p->phoneName) == 0)//树中已有name值了,无需插入 { p->times++; count=1; return; … Continue reading →

http://poj.org/problem?id=1001 #include <iostream> #include <string.h> using namespace std ; char R[10] , Num[160] ; int n , L , Point , i , j , l , k ; int f[160] , c[160] , A[160] ; int x , y … Continue reading →

http://poj.org/problem?id=1000 #include<stdio.h> int main(){ int a,b; scanf("%d%d",&a,&b); printf("%dn",a+b); return 0; }