Meta
-
Recent Posts
Recent Comments
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: October 2012
Poj Solution 2316
http://poj.org/problem?id=2316 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int[] a=new int[300]; int k=0; while(in.hasNextInt()) { String s=in.next(); for(int i=0;i< s.length();i++) a[i]=(a[i]+s.charAt(i)-‘0’)%10; k=s.length(); } for(int i=0;i< k;i++) { System.out.print(a[i]); } … Continue reading
Posted in poj
Leave a comment
Poj Solution 2313
http://poj.org/problem?id=2313 //* @author: import java.util.*; public class Main { static long abs(long a) { if(a< 0) return -a; else return a; } static boolean in(long a,long b,long c) { if(abs(a-c)+abs(b-c)==abs(a-b)) return true; else return false; } static public void main( … Continue reading
Posted in poj
Leave a comment
Poj Solution 2312
http://poj.org/problem?id=2312 /* @author: */ import java.util.Scanner; public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); int p[][]=new int[305][305]; char c[][]=new char[305][305]; int n,m,i,j,k; while(sc.hasNext()) { n=sc.nextInt(); m=sc.nextInt(); if(m==0&&n==0) break; for(i=0;i< n;i++) c[i]=sc.next().toCharArray(); int x1=0,y1=0,x2=0,y2=0; for(i=0;i< n;i++) for(j=0;j< … Continue reading
Posted in poj
Leave a comment
Poj Solution 2309
http://poj.org/problem?id=2309 //* @author mekarlos@gmail.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan=new Scanner(System.in); long n=scan.nextInt(); long k=0,j,v,temp,l,r; for(int i=0;i< n;i++){ k=scan.nextInt(); if(k%2==1)System.out.println(k+" "+k); else{ j=(int)Math.floor(Math.log(k)/Math.log(2)); v=1<< j; while(v!=k){ j–; if(v>k)v-=(1<< j); else v+=(1<< j); … Continue reading
Posted in poj
Leave a comment
Poj Solution 2305
http://poj.org/problem?id=2305 import java.io.BufferedInputStream; import java.math.BigInteger; 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 b = scan.nextInt(); if (b == 0) { break; } BigInteger p = … Continue reading
Posted in poj
Leave a comment
Poj Solution 2304
http://poj.org/problem?id=2304 //* @author ������<hongxp11@163.com> import java.util.Scanner; public class Main { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner in = new Scanner(System.in); while (true) { int begin = in.nextInt(); int one … Continue reading
Posted in poj
Leave a comment
Poj Solution 2302
http://poj.org/problem?id=2302 /* @author:zeropinzuo */ import java.io.*; import java.util.*; public class Main{ static Scanner cin; public static void main(String args[]){ cin = new Scanner(System.in); int n = cin.nextInt(); for(int i=0;i< n;i++) run(); } static void run(){ Card card = new Card(cin); … Continue reading
Posted in poj
Leave a comment
Poj Solution 2301
http://poj.org/problem?id=2301 import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner scan = new Scanner(System.in); if (scan.hasNext()) { int n = scan.nextInt(); for (int i = 0; i < n; i++) { int s = scan.nextInt(); int d … Continue reading
Posted in poj
Leave a comment
Poj Solution 2299
http://poj.org/problem?id=2299 import java.io.BufferedInputStream; import java.util.Scanner; public class Main { static long num = 0; 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; } … Continue reading
Posted in poj
Leave a comment
Poj Solution 2295
http://poj.org/problem?id=2295 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static void main(String[] args) throws Exception{ BufferedReader scanner=new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(scanner.readLine()); String f; String[] t; double a1,a2,b1,b2; for (int i=0;i< n ;i++ ){ a1=0; a2=0; b1=0; b2=0; … Continue reading
Posted in poj
Leave a comment
Poj Solution 2291
http://poj.org/problem?id=2291 //* @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 t=scanner.nextInt(); int n,max; int[] r; for (int i=0;i< t ;i++ ){ n=scanner.nextInt(); r=new int[n]; for (int j=0;j< n … Continue reading
Posted in poj
Leave a comment