Meta
-
Recent Posts
Recent Comments
- MorrissMar on 隆宪叁年-五一
- tEVFSJtRNq on A man in his twenties (in hex)
- MorrissMar on 隆宪叁年-五一
- ZEzPRbkFJG on A man in his twenties (in hex)
- MorrissMar on 隆宪叁年-五一
Archives
- May 2024
- April 2023
- February 2023
- January 2023
- December 2022
- November 2022
- September 2022
- June 2022
- July 2021
- January 2021
- February 2020
- September 2019
- March 2018
- February 2018
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
Categories
Monthly Archives: February 2014
Poj Solution 2660
http://poj.org/problem?id=2660 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static double lfabs(double x) { return x>0?x:-x; } public static void main(String args[]){ Scanner sc=new Scanner(System.in); double sat[][]=new double[100][3]; double xa,xb,ya,yb,za,zb,s,s1,s2,s3,angle,r=20000/3.14159265; int k,m,i,j,flag=0,num; while(sc.hasNext()) { k=sc.nextInt(); m=sc.nextInt(); if(k==0&&m==0) break; … Continue reading
Posted in poj
Leave a comment
Poj Solution 2656
http://poj.org/problem?id=2656 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int caseNum = 0; int unhappyDay, unhappyValue; int studyTime = 0; while(true) { unhappyDay = 0; unhappyValue = 0; caseNum = cin.nextInt(); … Continue reading
Posted in poj
Leave a comment
Poj Solution 2651
http://poj.org/problem?id=2651 //* @author: import java.util.*; public class Main { static double t=0; static double e( double s, int k) { if( k == 0 ) return s; else { double temp = e( 2*s, k-1 ); double h = s/temp; … Continue reading
Posted in poj
Leave a comment
Poj Solution 2649
http://poj.org/problem?id=2649 //* @author mekarlos@gmail.com import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Hashtable; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { Hashtable< Integer,Integer> table=new Hashtable< Integer,Integer>(); Hashtable< Integer,Integer> table2=new Hashtable< Integer,Integer>(); BufferedReader stdin=new … Continue reading
Posted in poj
Leave a comment
Poj Solution 2646
http://poj.org/problem?id=2646 //* @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) { int a=in.nextInt(); if(a==0) break; double[] d=new double[a]; double total=0; for(int i=0;i< a;i++) { d[i]=in.nextDouble(); total+=d[i]; } double avg=total/a; long … Continue reading
Posted in poj
Leave a comment
Poj Solution 2645
http://poj.org/problem?id=2645 //* @author: import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static public void main( String [] string ) throws Exception{ Scanner cin = new Scanner( System.in ); long p, q; while( true ) { p = cin.nextLong(); … Continue reading
Posted in poj
Leave a comment
Poj Solution 2643
http://poj.org/problem?id=2643 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int n=in.nextInt(); String[] ss1=new String[n]; String[] ss2=new String[n]; int[] p=new int[n]; in.nextLine(); for(int i=0;i< n;i++) { ss1[i]=in.nextLine(); ss2[i]=in.nextLine(); } int m=in.nextInt(); … Continue reading
Posted in poj
Leave a comment
Poj Solution 2641
http://poj.org/problem?id=2641 //* @author: import java.util.*; public class Main { static public void main( String [] str ){ Scanner sc = new Scanner(System.in); while( sc.hasNext()) { int a=sc.nextInt(); int b=sc.nextInt(); int s=sc.nextInt(); int m=sc.nextInt(); int n=sc.nextInt(); if( a == 0 ) … Continue reading
Posted in poj
Leave a comment
Poj Solution 2640
http://poj.org/problem?id=2640 import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); double x[]=new double[21],sum; int n,flag; int i,j; while(sc.hasNext()) { n=sc.nextInt(); if(n==0) break; for(i=0;i< n;i++) x[i]=sc.nextDouble(); Arrays.sort(x,0,n); sum=0;flag=0; for(i=0;i< n-1;i++) { sum+=x[i]; for(j=i+1;j< n;j++) if(x[j]<=sum) … Continue reading
Posted in poj
Leave a comment
Poj Solution 2636
http://poj.org/problem?id=2636 //* @author mekarlos@gmail.com import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(stdin.readLine()),k,aux; StringTokenizer tokens; while((n–)!=0){ tokens=new StringTokenizer(stdin.readLine()); k=Integer.parseInt(tokens.nextToken()); aux=-k+1; while((k–)!=0)aux+=Integer.parseInt(tokens.nextToken()); System.out.println(aux); } … Continue reading
Posted in poj
Leave a comment