## 论语有感

一箪食,一瓢饮,在陋巷,人不堪其忧,小也不改其乐. 小也三省吾身，与人谋而不忠乎?于朋友交而不信乎?传不习乎?

## 说说回忆

Seeing female pig climb the tree home! Personals Condition 1.female 2.coarse legs 3.breast-feeding 4.eat less

## Sault fish ready to turn over!

Sault fish ready to turn over!

## A man in his twenties (in hex)

As a full stack programmer,which is also a experienced software architect, whom has one boy and one girl ,happy with everyday life~~

## Poj Solution 3984

http://poj.org/problem?id=3984 #include <iostream> using namespace std; const int M=2147483647; int b[5][5]; void calc(int a[][5],int i,int j); void print(int i,int j); int main() { int i,j; int a[5][5]; for(i=0;i<=4;i++) for(j=0;j<=4;j++) { cin>>a[i][j]; if(a[i][j]==1) a[i][j]=M; } calc(a,0,0); print(4,4); return 0; } void … Continue reading

## Poj Solution 3983

http://poj.org/problem?id=3983 #include<stdio.h> int main(){ printf("5*(5-(1/5))n"); return 0; }

## Poj Solution 3982

http://poj.org/problem?id=3982 #include <stdio.h> #include <string.h> #include <stdlib.h> #define MAX_LEN 1024 void BigIntegerAdd(const char a[], const char b[], char res[]) { int i, j, k; int x, y, z; int up, l; char *c; if(strlen(a) > strlen(b)) { l = strlen(a) … Continue reading

## Poj Solution 3981

http://poj.org/problem?id=3981 #include <stdio.h> #include <string.h> #define MAX_LEN 1024 int main(int argc, char **argv) { char str[MAX_LEN]; int i, len; while(gets(str)) { len = strlen(str); for(i = 0; i < len; ++i) { if(‘y’ != str[i]) { putchar(str[i]); } else { … Continue reading

## Poj Solution 3980

http://poj.org/problem?id=3980 #include <stdio.h> int mod(int n, int m){ return n%m; } int main(){ int m,n; while(scanf("%d%d",&n,&m)!=EOF){ printf("%dn",mod(n,m)); } return 0; }

## Poj Solution 3979

http://poj.org/problem?id=3979 #include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> int gdb(int a,int b) { int tmp,ret; if(a < b) { tmp = a; a = b; b =tmp; } while(b) { tmp = a; a = b; b = tmp%b; … Continue reading

## Poj Solution 3934

http://poj.org/problem?id=3934 #include <stdio.h> int dp[81][201]; int main() { int n,m,i,j,k; for(i=1;i<=80;i++){ for(j=0,k=i-1;j<k;j++) dp[i][j]=0; } dp[1][0]=1; dp[2][1]=2; dp[3][2]=4; dp[3][3]=2; for(i=4;i<=80;i++){ for(j=i-1;j<=200;j++){ dp[i][j]=0; if(j>=2) dp[i][j]=(dp[i-1][j-2]*(i-2))%9937; if(j>=1) dp[i][j]=(dp[i][j]+dp[i-1][j-1]*2)%9937; } } while(scanf("%d%d",&n,&m),n||m){ if(m>=200) printf("0n"); else printf("%dn",dp[n][m]); } return 0; }

## Poj Solution 3768

http://poj.org/problem?id=3768 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNextInt()) { int n = sc.nextInt(); if (n == 0) break; sc.nextLine(); String[] template = new String[n]; for (int i = … Continue reading

## Poj Solution 3767

http://poj.org/problem?id=3767 import java.util.Scanner; public class Main{ public static void dijkstra(int[][] GA, int[] leader, int road) { if (road == 0) System.out.println(-1); else { int size = GA.length; // System.out.println(size); int[] dist = new int[size]; int[] isUsed = new int[size]; isUsed[1] … Continue reading

## Poj Solution 3763

http://poj.org/problem?id=3763 //* @author import java.util.*; import java.io.*; public class Main { static Scanner in = new Scanner(System.in); static class Node extends LinkedList< Node> { final int[] dp = new int[]{-1, -1}; int query(int b) { if(dp[b]< 0) init(null); return dp[b]; … Continue reading

## Poj Solution 3753

http://poj.org/problem?id=3753 import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj3753 * C������� * while(EOF != scanf("%s",source)) *�ȼ���java���while (scan.hasNext()) * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { String … Continue reading

## Poj Solution 3752

http://poj.org/problem?id=3752 import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj3752 * ģ�� * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { int m = scan.nextInt(); int n = … Continue reading

## Poj Solution 3751

http://poj.org/problem?id=3751 import java.io.BufferedInputStream; import java.text.ParseException; import java.text.SimpleDateFormat; import java.util.Locale; import java.util.Scanner; import java.util.logging.Level; import java.util.logging.Logger; /* * To change this template, choose Tools | Templates * and open the template in the editor. */ /** * * poj3751 easy * … Continue reading

## Poj Solution 3750

http://poj.org/problem?id=3750 #include <stdio.h> #include <string.h> int main() { int n, w, s; int i, j; char name[65][16]; scanf("%d", &n); getchar(); for (i=0; i<n; ++i) { gets(name[i]); } scanf("%d,%d", &w, &s); i = w-1; while (n != 0) { if (i+s-1 … Continue reading

## Poj Solution 3749

http://poj.org/problem?id=3749 #include<stdio.h> #include<string.h> int main() { void translate(char word[]); char start[20]; char end[20]; char word[205]; while(1) { gets(start); if(strcmp(start,"START")!=0) break; gets(word); translate(word); puts(word); gets(end); } } void translate(char word[]) { int i,len; len=strlen(word); for(i=0;i<len;i++) { if(word[i]>=’A’&&word[i]<=’E’) { word[i]+=21; } else … Continue reading

## Poj Solution 3748

http://poj.org/problem?id=3748 import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj3748 * λ���� * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { String[] ss = scan.nextLine().trim().split("[,]"); Integer r = … Continue reading

## Poj Solution 3747

http://poj.org/problem?id=3747 //* @author /** * @version 2009/08/31 * @author sbzlyessit */ import java.io.*; import java.util.*; public class Main { private static BufferedReader in =new BufferedReader(new InputStreamReader(System.in)); private static StringTokenizer st; private static double[] x = new double[10], y = new … Continue reading

## Poj Solution 3744

http://poj.org/problem?id=3744 //* @author: <strong> import java.util.*; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); double p,p1,p2,p3; while (sc.hasNext()) { int n=sc.nextInt(); int a[]=new int[n+1]; p=sc.nextDouble(); for (int i=1;i<=n;i++) a[i]=sc.nextInt(); if (a[1]==1) {System.out.println("0.0000000");continue;} int now=1; p1=0;p2=1; for (int … Continue reading

## Poj Solution 3742

http://poj.org/problem?id=3742 import java.math.BigInteger; import java.io.*; import java.util.*; public class Main { static int n; static BigInteger t=new BigInteger("1"); static BigInteger c[][] = new BigInteger [210][210]; /* static BigInteger C(int n,int m) { if(m==0||m==n) return BigInteger.ONE; BigInteger res=new BigInteger("1"); int i; … Continue reading

## Poj Solution 3740

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

## Poj Solution 3737

http://poj.org/problem?id=3737 //* @author: <strong> import java.util.*; public class Main{ static final double pi=Math.PI; public static void main(String args[]){ Scanner sc=new Scanner(System.in); double s; while (sc.hasNext()) { s=sc.nextDouble(); double h=Math.sqrt(2*s/pi); double r=Math.sqrt(s*s/(pi*pi*h*h+2*pi*s)); double v=(1.0/3.0)*(s*s)*h/(pi*h*h+2*s); System.out.printf("%.2fn%.2fn%.2fn",v,h,r); } } }

## Poj Solution 3736

http://poj.org/problem?id=3736 //* @author: import java.io.*; import java.math.*; import java.util.*; import java.util.Comparator; import java.util.ArrayList; public class Main { public static class node { double x,y,s,r,d,t; node(double xx,double yy,double ss,double rr,double dd,double tt) { x=xx;y=yy;s=ss;r=rr;d=dd;t=tt; } double getx(){return x;} double gety(){return y;} … Continue reading

## Poj Solution 3734

http://poj.org/problem?id=3734 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { /** * @param args * @return */ static int pow_mod(int a,int b,int c) { int r=1,d=a; while(b>0){ if((b&1)==1) r = r*d%c; d = d*d%c; b>>=1; } return r; … Continue reading

## Poj Solution 3723

http://poj.org/problem?id=3723 //* @author: //Kruskal �㷨: import java.io.*; import java.util.*; class cin { static int leave=0; static StringTokenizer st; static BufferedReader in=new BufferedReader(new InputStreamReader(System.in)); static int nextInt() throws Exception { while (leave==0) { st=new StringTokenizer(in.readLine()); leave=st.countTokens(); } leave–; return Integer.parseInt(st.nextToken()); } … Continue reading

## Poj Solution 3720

http://poj.org/problem?id=3720 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Scanner; import java.util.StringTokenizer; /** * @author Administrator ѭ��С��+ѭ���� */ public class Main { /** *���� */ private int numerator; /** *��ĸ */ private int denominator; /** * ѭ���ڲ��ᳬ��100����� */ private static int … Continue reading

## Poj Solution 3708

http://poj.org/problem?id=3708 import java.util.*; import java.math.*; public class Main { static BigInteger x,y; static BigInteger[] a=new BigInteger[1000]; static BigInteger[] m=new BigInteger[1000]; static void egcd(BigInteger a,BigInteger b){ if(b.equals(BigInteger.ZERO)){ x=BigInteger.ONE; y=BigInteger.ZERO; return ; } egcd(b,a.mod(b)); BigInteger temp=y; y=x.subtract((a.divide(b)).multiply(y)); x=temp; } static BigInteger solve(int … Continue reading

## Poj Solution 3705

http://poj.org/problem?id=3705 //* @author: import java.util.Scanner; public class Main { Scanner cin = new Scanner(System.in); int n; public void inPut() { n = cin.nextInt(); reverse(); } private void reverse() { if (n == 1) { System.out.println(0); } else { if (n … Continue reading

## Poj Solution 3692

http://poj.org/problem?id=3692 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; public class Main { public static int b; public static int g; public static int m; public static boolean[][] graph; public static boolean[] checked; public static int[] link; public static void main(String[] args) { … Continue reading

## Poj Solution 3687

http://poj.org/problem?id=3687 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ int degree[]=new int[210]; boolean visit[][]=new boolean[210][210]; int path[]=new int[210]; int n,m,t; void topsort(){ for(int k=n;k>=1;k–){ int i=n; while(i>=1 && degree[i]!=0) i–; if(i< 1){ System.out.printf("-1n"); return; } degree[i]=-1; path[i]=k; for(int … Continue reading

## Poj Solution 3677

http://poj.org/problem?id=3677 //* @author import java.util.*; import java.io.*; class Main { static int armor[]; final static int MAX = 1000000; static class Node { Node l = null, r = null; int flag, step, value; Node(int k, int v) { flag … Continue reading