Monthly Archives: August 2010

http://poj.org/problem?id=1543 //* @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=in.nextInt(); for(int i=6;i<=a;i++) { for(int j=2;j< a;j++) for(int m=j;m< a;m++) for(int n=m;n< a;n++) { if((n*n*n+m*m*m+j*j*j)==i*i*i) System.out.println("Cube = "+i+", Triple = … Continue reading →

http://poj.org/problem?id=1528 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); System.out.println("PERFECTION OUTPUT"); while(true) { int a=in.nextInt(); if(a==0) break; double w=Math.sqrt(a); int total=1; for(int i=2;i< w;i++) { if(a%i==0) total+=(a/i+i); } if(a%w==0) total+=w; … Continue reading →

http://poj.org/problem?id=1522 /* @author:zeropinzuo */ import java.io.*; import java.util.*; public class Main{ static Scanner cin; static int count=0; public static void main(String args[]){ cin = new Scanner(System.in); int n; while((n=cin.nextInt())!=0) run(n); } static void run(int n){ Point start,end; start = new … Continue reading →

http://poj.org/problem?id=1521 import java.io.BufferedReader; import java.io.InputStreamReader; import java.math.BigDecimal; import java.math.RoundingMode; /** * Accepted. * * * @author hong * */ public class Main { private static Node[] nodes = new Node[1000]; private static boolean[] used = new boolean[1000]; private static int … Continue reading →

http://poj.org/problem?id=1520 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { String s=in.nextLine(); if(s.equals("."))break; s=s.substring(0,s.length()-1); String[] arr=s.split(", "); int l=arr.length; int[] kk=new int[l]; ArrayList< Integer> arrI=new ArrayList< Integer>(); TreeMap< String,String> … Continue reading →

http://poj.org/problem?id=1519 //* @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 number = in.next(); if (number.equals("0")) { break; } int len = number.length(); int sum = … Continue reading →

http://poj.org/problem?id=1517 //* @author: 82638882@163.com public class Main { public static void main(String[] args) { int i, n, j; double e = 0; System.out.printf("n en- ———–n"); for (n = 0; n <= 9; ++n) { i = 1; for (j = … Continue reading →

http://poj.org/problem?id=1515 #include <stdio.h> #include <memory.h> bool e[1000][1000]; int low[1000]; int visit[1000]; int vs,n; void print( int a, int b) { printf( "%d %dn", a+1, b+1 ); } void search( int s, int f ) { int i; visit[s] = vs++; … Continue reading →

http://poj.org/problem?id=1511 //* @author: 82638882@163.com import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int[] cost; static node[] edge,redge; static int n; static boolean[] used; public static void main(String[] args) throws NumberFormatException, IOException { InputStreamReader is=new InputStreamReader(System.in); … Continue reading →

http://poj.org/problem?id=1509 /* @author: */ import java.util.Scanner; public class Main{ public static int minP(String s) { int i = 0, j = 1, k = 0; int l = s.length(); while (true) { if (i + k >= l || j … Continue reading →

http://poj.org/problem?id=1505 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int N = 500+10; static int n,m; static boolean flag[] = new boolean[N]; static long sum[] = new long[N],num[] = new long[N]; public static void main(String[]args) … Continue reading →

http://poj.org/problem?id=1504 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int num = Integer.valueOf(cin.nextLine()).intValue(); String[] str = new String[2]; String rawA, rawB; int a, b, sum = 0; for(int i = 0; … Continue reading →