# Monthly Archives: April 2016

## Poj Solution 3658

http://poj.org/problem?id=3658 //* @author /** * @version 2009/08/21 * @author sbzlyessit */ import java.io.*; import java.util.*; public class Main { private static final int MAX_N = 100000; private static BufferedReader in =new BufferedReader(new InputStreamReader(System.in)); private static StringTokenizer st; private static int[] … Continue reading

Posted in poj | Comments Off on Poj Solution 3658

## Poj Solution 3657

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

Posted in poj | Comments Off on Poj Solution 3657

## Poj Solution 3653

http://poj.org/problem?id=3653 //* @author: SmilingWang import java.util.*; import java.io.*; public class Main { static final int INF = 100000000; public static void main(String[] args){ Scanner in = new Scanner(new BufferedInputStream(System.in)); int x = in.nextInt(); int y = in.nextInt(); while(x != 0 … Continue reading

Posted in poj | Comments Off on Poj Solution 3653

## Poj Solution 3652

http://poj.org/problem?id=3652 import java.util.Arrays; import java.util.Scanner; public class Main { int a; int b; int c; int s; int x; char[] result; int flg; boolean[] dup; public Main() { Scanner scan = new Scanner(System.in); while ((a = scan.nextInt()) != 0) { … Continue reading

Posted in poj | Comments Off on Poj Solution 3652

## Poj Solution 3650

http://poj.org/problem?id=3650 //* @author ������&lt;hongxp11@163.com&gt; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while(true) { String input = in.nextLine(); if(input.equals("#")) break; int len = input.length(); for(int i = 0; i < len; … Continue reading

Posted in poj | Comments Off on Poj Solution 3650

## Poj Solution 3646

http://poj.org/problem?id=3646 //* @author: import java.util.*; public class Main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int i,j,ans; end: while (sc.hasNext()) { int n=sc.nextInt(); if(n==0) break; int m=sc.nextInt(); int a[]=new int[n+1]; int b[]=new int[m+1]; for ( i=1;i<=n;i++) a[i]=sc.nextInt(); for … Continue reading

Posted in poj | Comments Off on Poj Solution 3646

## Poj Solution 3641

http://poj.org/problem?id=3641 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { long p=in.nextLong(); long a=in.nextLong(); if(a==0&&p==0) break; if(isPrime(p)){ System.out.println("no"); continue; } System.out.println(sum(a,p,p)==a?"yes":"no"); } } public static boolean isPrime(long a) { … Continue reading

Posted in poj | Comments Off on Poj Solution 3641

## Poj Solution 3640

http://poj.org/problem?id=3640 //* @author ������&lt;hongxp11@163.com&gt; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.Reader; import java.util.Arrays; import java.util.Collections; import java.util.HashMap; import java.util.Map; import java.util.Set; public class Main { /** * @param args * @throws IOException * @throws NumberFormatException */ public … Continue reading

Posted in poj | Comments Off on Poj Solution 3640

## 书单

Posted in books, 未分类 | Comments Off on 书单

## 八佾

Posted in 默写 | Comments Off on 八佾

## 入门者学

Posted in 默写 | Comments Off on 入门者学

## 泰伯

Posted in 默写 | Comments Off on 泰伯

## 学而

Posted in 默写 | Comments Off on 学而

## 为政

Posted in 默写 | Comments Off on 为政

## 乡党

Posted in 默写 | Comments Off on 乡党

## 先进

Posted in 默写 | Comments Off on 先进

## 宪问

Posted in 默写 | Comments Off on 宪问

## 大师兄

Posted in 默写 | Comments Off on 大师兄

## 公冶长

Posted in 默写 | Comments Off on 公冶长

## 雍也

Posted in 默写 | Comments Off on 雍也

## 子罕

Posted in 默写 | Comments Off on 子罕

## 季路

Posted in 默写 | Comments Off on 季路

## ORM设计

Posted in 默写 | Comments Off on ORM设计

## vps 升级 数据库丢了

Posted in 未分类 | Comments Off on vps 升级 数据库丢了

## Poj Solution 3639

http://poj.org/problem?id=3639 //* @author: import java.util.*; public class Main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int i,n; double rate,us,ca,tus,tca,t1,t2; while (sc.hasNext()) { n=sc.nextInt(); if(n==0) break; ca=1000;us=0; for (i=1;i<=n;i++) { rate=sc.nextDouble(); t1=ca/rate*.97; t1=(Math.floor(t1*100))/100; t2=us*rate*.97; t2=(Math.floor(t2*100))/100; tus=(us>t1?us:t1); tca=(ca>t2?ca:t2); us=tus;ca=tca; } … Continue reading

Posted in poj | Comments Off on Poj Solution 3639

## Poj Solution 3637

http://poj.org/problem?id=3637 //* @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=scanner.nextInt(); int t,total; int[] prs; for (int i=0;i< n ;i++ ){ t=scanner.nextInt(); prs=new int[t]; for (int j=0;j< t … Continue reading

Posted in poj | Comments Off on Poj Solution 3637

## Poj Solution 3633

http://poj.org/problem?id=3633 //* @author /** * @version 2009/08/26 * @author sbzlyessit */ /*������. ״̬����, ���ü��仯����, ����ת�ƺķѾ޴�, ���������֦. *����Ҫ��һ���֦����ÿһλƥ��ʱ��Ҫȡ��ĳ��Ƚ�����һ������. */ import java.io.*; import java.util.*; public class Main { private static final int MAX_N = 18; private static BufferedReader in = new BufferedReader(new … Continue reading

Posted in poj | Comments Off on Poj Solution 3633