# Monthly Archives: March 2010

## Poj Solution 1337

http://poj.org/problem?id=1337 //* @author: import java.util.*; public class Main { public static void main(String[] args){ Scanner in = new Scanner(System.in); int ans[]=new int[300]; int a[]=new int[100],d[]=new int[100],t[]=new int[100]; int cas, i, j, n, temp; boolean key; cas=in.nextInt(); while(( cas– )!=0) { … Continue reading

Posted in poj | Comments Off on Poj Solution 1337

## Poj Solution 1331

http://poj.org/problem?id=1331 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int a=in.nextInt(); while((a–)!=0) { String s1=in.next(); String s2=in.next(); String s3=in.next(); int max=0; for(int i=0;i< s1.length();i++) { char c=s1.charAt(i); int u=c-48; if(max< … Continue reading

Posted in poj | Comments Off on Poj Solution 1331

## Poj Solution 1330

http://poj.org/problem?id=1330 import java.util.*; @SuppressWarnings("unchecked") public class Main { int MAX = 10001; Vector< Integer> tree[] = new Vector[MAX + 1];; // 树结构 byte[] flag = new byte[MAX]; // 入度标志，用于寻找根节点 int parent[] = new int[MAX];; int rank[] = new int[MAX];; int … Continue reading

Posted in poj | Comments Off on Poj Solution 1330

## Poj Solution 1328

http://poj.org/problem?id=1328 import java.io.PrintWriter; import java.util.Arrays; import java.util.Scanner; /** * * @author 小e * * 2010-6-12 下午01:48:35 */ public class Main { static class Range implements Comparable<Range>{ double left,right; public Range(double left,double right){ this.left = left; this.right = right; } @Override … Continue reading

Posted in poj | Comments Off on Poj Solution 1328

## Poj Solution 1326

http://poj.org/problem?id=1326 import java.util.*; import java.text.*; class FRecord { String from; String to; int miles; String type; public FRecord(String a, String b, int c, String d) { this.from = a; this.to = b; this.miles = c; this.type = d; } } … Continue reading

Posted in poj | Comments Off on Poj Solution 1326

## Poj Solution 1325

http://poj.org/problem?id=1325 #include <iostream> #include<cstdio> #include<cstring> using namespace std; #define size 101 int g[size][size]; //ƥ��ͼ int visited[size]; //x�����ʱ�־ int m,n; //n:x������Ŀ��m:y����Ŀ int My[size], Mx[size]; //ƥ���� int Q[size], prev[size]; int BFS_MaxMatch(void) { int res = 0, i, u, v; int head, tail; … Continue reading

Posted in poj | Comments Off on Poj Solution 1325

## Poj Solution 1323

http://poj.org/problem?id=1323 #include<iostream> #include<algorithm> using namespace std; const int mMax = 22; const int nMax = 52; struct data{ int num; bool my; bool small; }card[mMax * nMax]; int main(){ int m , n, i, j, t = 1; while(cin >> … Continue reading

Posted in poj | Comments Off on Poj Solution 1323

## Poj Solution 1321

http://poj.org/problem?id=1321 #include <iostream> using namespace std; int map[10][10]; int vis[10]; int n,k,ans; void dfs(int col,int cnt) { int i; if(cnt==k) { ans++ ; return ; } if(n-col<k-cnt-1) return ; for(i=1;i<=n;i++) { if(!vis[i]&&map[col][i]) { vis[i]=1; dfs(col+1,cnt+1); vis[i]=0; } } dfs(col+1,cnt); } … Continue reading

Posted in poj | Comments Off on Poj Solution 1321

## Poj Solution 1320

http://poj.org/problem?id=1320 /* @author:zeropinzuo */ import java.io.*; import java.util.*; public class Main{ public static void main(String args[]){ int[] array = new int[10]; array[0]=6; array[1]=35; for(int i=2;i< 10;i++) array[i] = 6*array[i-1]-array[i-2]; for(int i=0;i< 10;i++){ //System.out.println(" "+array[i]+" "+(Math.sqrt(8*array[i]*array[i]+1)-1)/2); } System.out.println(" "+6+" "+8); System.out.println(" … Continue reading

Posted in poj | Comments Off on Poj Solution 1320

## Poj Solution 1319

http://poj.org/problem?id=1319 //* @author: import java.util.*; public class Main { static final double l = Math.sqrt(3)/2; static int calc( double x, double y ) { int a[]=new int[2], s, i; double h; if( x < 1 ) return 0; a[0] = … Continue reading

Posted in poj | Comments Off on Poj Solution 1319

## Poj Solution 1318

http://poj.org/problem?id=1318 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); List< String> s1 = new ArrayList< String>(); List< String> s2 = new ArrayList< String>(); int indexS1 = 0; int indexS2 = 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1318

## Poj Solution 1317

http://poj.org/problem?id=1317 #include <iostream> #include <cstring> using namespace std; char ci[1000]; char pl[1000]; int main() { int k,temp,t1; int i; int len; while(cin>>k && k) { getchar(); gets(ci);//输入密文 len=strlen(ci); for(i=0;i<len;i++) { if(ci[i]==’.’)//这两点要特判 temp=27; else if(ci[i]==’_’) temp=0; else temp=ci[i]-‘_’-1; t1=(temp+i)%28; //密文跟明文相对应 if(t1==0) … Continue reading

Posted in poj | Comments Off on Poj Solution 1317

## Poj Solution 1315

http://poj.org/problem?id=1315 //* @author: import java.io.*; import java.util.StringTokenizer; /*����,ÿ���Wall��λ����}�����,��rook����,���Թ�����Ӽ��ռ���,���ݵõ����Էŵ����rook�� *���ռ���Ϊһ�ö�����,������nΪ16,ʱ�临�Ӷ�ΪO(2^n)<=65536,�����㷨���� *�����Լ�������rook����ֱ��ˮƽ�����Ҵ�λ�ò�Ϊǽ.. */ class cin { static int leave=0; static StringTokenizer st; static BufferedReader in=new BufferedReader(new InputStreamReader(System.in)); static int nextInt() throws IOException { while(leave==0) { st=new StringTokenizer(in.readLine()); leave=st.countTokens(); } int a=Integer.parseInt(st.nextToken()); leave–; … Continue reading

Posted in poj | Comments Off on Poj Solution 1315

## Poj Solution 1314

http://poj.org/problem?id=1314 #include<iostream> using namespace std; int main() {int p[27][3],n,cas,line; int i,j,k,h,jie;char a; cas=1; while(1) {cin>>n; if(cin.fail())break; if(n==0)break; for(i=0;i<n;i++){cin>>a;p[i][0]=a;cin>>p[i][1];cin>>p[i][2];} line=0;jie=0; cout<<"Point set "<<cas<<":"; for(i=0;i<n;i++) {for(j=0;j<n;j++)if(p[i][2]==p[j][2]&&p[i][1]<p[j][1]) {for(k=0;k<n;k++)if(p[k][1]==p[j][1]&&p[k][2]<p[j][2]) {for(h=0;h<n;h++)if(p[h][1]==p[i][1]&&p[h][2]==p[k][2]) {if(line==0)cout<<endl; cout<<‘ ‘<<(char)p[i][0]<<(char)p[j][0]<<(char)p[k][0]<<(char)p[h][0]; line++;if(line%10==0){cout<<endl;}} }}} if(line==0)cout<<" No rectangles"<<endl; else if(line%10!=0)cout<<endl; cas++; } return 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1314

## Poj Solution 1313

http://poj.org/problem?id=1313 //* @author: import java.util.*; public class Main { public static void main(String[] args){ Scanner in = new Scanner(System.in); int n,max; int i; while(in.hasNext()){ n=in.nextInt(); if(n==0) break; max=n/4+1; System.out.printf("Printing order for %d pages:n",n); if(n%4==1){ int k=3; if(n==1) System.out.printf("Sheet 1, front: … Continue reading

Posted in poj | Comments Off on Poj Solution 1313