Monthly Archives: March 2015

http://poj.org/problem?id=3095 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); String s; while (!(s = read.readLine()).equals("#")) { char[] c = s.toCharArray(); int[] p = … Continue reading →

http://poj.org/problem?id=3094 //* @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))); String s; int total; while (true){ s=scanner.nextLine(); if (s.equals("#")){ break; } total=0; for (int i=0;i< s.length() ;i++ ){ total=total+(i+1)*getValue(s.charAt(i)); … Continue reading →

http://poj.org/problem?id=3093 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int N = 30+5; static final int M = 1000+10; static int n,m; static int DP[] = new int[M],value[] = new int[N]; public static void main(String … Continue reading →

http://poj.org/problem?id=3092 /* @author: */ import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n, i, k, t, tt, p, count = 0; tt=sc.nextInt(); while(( tt– )!=0) { n=sc.nextInt(); int a[]=new int[100]; … Continue reading →

http://poj.org/problem?id=3091 /* @author: */ import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static public void main( String [] str ) throws Exception{ int n; int m; Scanner cin = new Scanner( System.in ); n = cin.nextInt(); for( int … Continue reading →

http://poj.org/problem?id=3090 //* @author: import java.util.*; public class Main { public static void main(String[] args){ int[] p=new int[1001]; p[1]=3; p[2]=5; Scanner cin=new Scanner(System.in); int T=cin.nextInt(); for(int a=3;a<=1000;a++){ p[a]=p[a-1]+2; for(int i=2;i<=a;i++) p[a]+=2*c(a,i); } for(int t=1;t<=T;t++){ int r=cin.nextInt(); System.out.println(t+" "+r+" "+p[r]); } } … Continue reading →

http://poj.org/problem?id=3088 /* @author: */ import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static int a[][] = new int[12][12]; static long ans[] = new long[12]; static public void main( String [] str ) throws Exception{ int n; int m; … Continue reading →

http://poj.org/problem?id=3087 /* @author: */ import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static int a[] = new int[200]; static char start[], result[]; static public void main( String [] str ) throws Exception{ int n; int m; Scanner cin … Continue reading →

http://poj.org/problem?id=3086 import java.io.BufferedInputStream; import java.util.Scanner; /** * @author NC * Poj3086 */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); int n = scan.nextInt(); for (int i = 1; i <= n; … Continue reading →

http://poj.org/problem?id=3085 //* @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); int n = in.nextInt(); for(int i = 0; i < n; i++) { int sum = in.nextInt(); int quarter … Continue reading →

http://poj.org/problem?id=3084 /* @author: */ import java.util.*; class ff { static int min( int a, int b ) { return a< b?a:b; } class edge { int to; int c, f; int rev_i; edge( int pa, int pb, int pc ) … Continue reading →

http://poj.org/problem?id=3083 /* @author: */ import java.util.*; public class Main { static String map[] = new String[50]; static int q[] = new int[2000]; static int n, m; static boolean inmap( int x, int y ) { return 0<=x&&x< n && 0<=y&&y< … Continue reading →

http://poj.org/problem?id=3082 /* @author: */ import java.util.*; class point { int x,y; point(){x=y=0;} }; public class Main { static int cheng(point a,point b,point c) { return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y); } static int dcheng(point a,point b,point c) { return (b.x-a.x)*(c.x-a.x)+(c.y-a.y)*(b.y-a.y); } static int in(point … Continue reading →