# Monthly Archives: June 2009

## Poj Solution 1087

http://poj.org/problem?id=1087 #include<iostream> #include"string.h" using namespace std; #define null 0 const int size=1000; bool w[size][size]; void maxmatch(int n,int m,int *p) { int p_n[size]; int p_m[size]; bool sign[size]; int q[size],from[size],s,t; int i,j,link,now,h; for(i=0;i<n;i++)p_n[i]=-1; for(j=0;j<m;j++)p_m[j]=-1; for(i=0;i<n;i++) if(p_n[i]==-1) { for(j=0;j<m;j++)sign[j]=0; s=0; for(j=0;j<m;j++) if(w[i][j]!=null) { … Continue reading

## Poj Solution 1082

http://poj.org/problem?id=1082 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int a=in.nextInt(); while((a–)!=0) { in.nextInt(); boolean bb=false; int m=in.nextInt(); int d=in.nextInt(); if((m+d)%2==0)bb=true; else if(m==9&&d==30)bb=true; else if(m==11&&d==30)bb=true; if(bb)System.out.println("YES"); else System.out.println("NO"); } } … Continue reading

## Poj Solution 1080

http://poj.org/problem?id=1080 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static int[][] chart; public static void main(String[] args){ init(); Scanner in=new Scanner(new BufferedReader(new InputStreamReader(System.in))); int p=in.nextInt(); for (int k=0;k< p ;k++ ){ int m=in.nextInt(); String a=in.next(); int n=in.nextInt(); … Continue reading

## Poj Solution 1079

http://poj.org/problem?id=1079 import java.io.*; public class Main { public static int gcd(int a,int b){ while(a%b!=0){ int temp=a; a=b; b=temp%b; } return b; } public static void main(String[] args) throws IOException{ StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))); while(in.nextToken()!=StreamTokenizer.TT_EOF){ int a,b; double last=100000; a=(int)in.nval; … Continue reading

## Poj Solution 1078

http://poj.org/problem?id=1078 #include<iostream> using namespace std; int t[100],n; int go(int i,long s,long a,long b) {if(s==1)return 1; if(i==n)return 0; if(a%t[i]==0)if(go(i+1,s/t[i],a/t[i],b))return 1; if(b%t[i]==0)if(go(i+1,s/t[i],a,b/t[i]))return 1; if(go(i+1,s,a,b))return 1; return 0; } int main() {int i;long a,b,s; while(1) {cin>>a;if(cin.fail())break; cin>>b; if(a<b){a=a+b;b=a-b;a=a-b;} s=a*b;n=0; for(i=100;i>1;i–) if(s%i==0&&(a%i==0||b%i==0))t[n++]=i; if(!go(0,b,b,1)){cout<<a<<endl;continue;} if(!go(0,a,a,1)){cout<<b<<endl;continue;} … Continue reading

## Poj Solution 1077

http://poj.org/problem?id=1077 //* @author: 82638882@163.com import java.util.*; public class Main { static int[][] arr; static boolean[] bb=new boolean[10000000]; static Queue< my> qu=new LinkedList< my>(); public static void main(String[] args) { Scanner in=new Scanner(System.in); arr=new int[5][5]; String s; for(int i=1;i< 4;i++) { … Continue reading

## Poj Solution 1072

http://poj.org/problem?id=1072 #include <stdio.h> #include <string.h> #include <algorithm> //#define DEBUG //#define PRINT_TREE #ifdef DEBUG #include <time.h> #endif using namespace std; const char NONE = 30; const char WORD = 50; struct node { node(){ p=0; m=”; for(int i=0;i<27;i++)id[i]=NONE; } char id[27]; … Continue reading

## Poj Solution 1068

http://poj.org/problem?id=1068 import java.util.Scanner; public class Main { int t; int len; int[] p; int[] w; String[] s; int index; int temp; int pos; public Main() { Scanner scan = new Scanner(System.in); t = scan.nextInt(); for (int i = 0; i … Continue reading

## Poj Solution 1067

http://poj.org/problem?id=1067 #include <iostream> #include <algorithm> #include <cmath> #include <stdio.h> using namespace std; int main() { int ax,bx,temp; int k,wantedax; while(scanf("%d%d",&ax,&bx)!=EOF) /*题中没有输入结标志时，必须这样写，否则会WA*/ { if(ax>bx) swap(ax,bx); k = bx – ax; wantedax = (floor)( k*(1.0+sqrt(5.0))/2.0 ); if(ax==wantedax) printf("%dn",0); else printf("%dn",1); } return … Continue reading

## Poj Solution 1066

http://poj.org/problem?id=1066 #include <iostream> #include <cstdio> #include <algorithm> #define MAX 35 int N; using namespace std; typedef struct Point { double x,y; Point() {} Point(double tx,double ty):x(tx),y(ty) {} }Vector; int WallY0[MAX]; //��ַ����ݸ��� int WallY100[MAX]; int WallX0[MAX]; int WallX100[MAX]; struct Line { … Continue reading

## Poj Solution 1065

http://poj.org/problem?id=1065 import java.util.*; public class Main{ public static void main(String[] args){ int l[]=new int[10000]; int w[]=new int[10000]; int tt[]=new int[5000]; int k=0; Scanner keyin=new Scanner(System.in); int m=keyin.nextInt(); int mm=m; int n=0; for(;m>0;m–){ n=keyin.nextInt(); for(int j=0;j< n;j++){ l[j]=keyin.nextInt(); w[j]=keyin.nextInt(); } int … Continue reading