# Monthly Archives: April 2009

## Poj Solution 1046

http://poj.org/problem?id=1046 #include <stdio.h> struct Color{ int R,G,B; }map; 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

Posted in poj | Comments Off on Poj Solution 1046

## Poj Solution 1045

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

Posted in poj | Comments Off on Poj Solution 1045

## Poj Solution 1043

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

Posted in poj | Comments Off on Poj Solution 1043

## Poj Solution 1042

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

Posted in poj | Comments Off on Poj Solution 1042

## Poj Solution 1039

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

Posted in poj | Comments Off on Poj Solution 1039

## Poj Solution 1038

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; static { p = 1; for(int i=1; i!=p.length; ++i) p[i] = 3*p[i-1]; } static int get(int s, int i) … Continue reading

Posted in poj | Comments Off on Poj Solution 1038

## Poj Solution 1037

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; m … Continue reading

Posted in poj | Comments Off on Poj Solution 1037

## Poj Solution 1035

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

Posted in poj | Comments Off on Poj Solution 1035

## Poj Solution 1032

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

Posted in poj | Comments Off on Poj Solution 1032

## Poj Solution 1028

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

Posted in poj | Comments Off on Poj Solution 1028