Monthly Archives: November 2014

http://poj.org/problem?id=3002 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static long gcd(long a,long b) { if(b==0) return a; return gcd(b,a%b); } public static void main(String args[]) { Scanner sc=new Scanner(System.in); int t,n,i; long p[]=new long[6]; t=sc.nextInt(); while((t–)!=0) { … Continue reading →

http://poj.org/problem?id=2996 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.List; public class Main { class Compara implements Comparator< String[]> { public int compare(String[] o1, String[] o2) { if (o1[1].charAt(1) == o2[1].charAt(1)) { return o1[1].charAt(0) – … Continue reading →

http://poj.org/problem?id=2993 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); char[][] arr=new char[8][8]; String s1=in.nextLine(); s1=s1.substring(7); String[] ws=s1.split(","); for(int i=0;i< ws.length;i++) { if(ws[i].length()==3) { int x=8-ws[i].charAt(2)+’0′; int y=ws[i].charAt(1)-‘a’; arr[x][y]=ws[i].charAt(0); } else … Continue reading →

http://poj.org/problem?id=2992 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int[] prime=new int[] { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47, 53,59,61,67,71,73,79,83,89,97,101,103,107,109,113, 127,131,137,139,149,151,157,163,167,173,179,181,191,193,197, 199,211,223,227,229,233,239,241,251,257,263,269,271,277,281, 283,293,307,311,313,317,331,337,347,349,353,359,367,373,379, 383,389,397,401,409,419,421,431 }; int[] arr=new int[84]; while(in.hasNext()) { int c=in.nextInt(); int n=in.nextInt(); int … Continue reading →

http://poj.org/problem?id=2985 #include "stdio.h" #include "memory.h" int tree[600000]; int k, key; void set( int l, int r, int s ) { int c = (l+r)/2; tree[s] += key; if( r == l+1 ) return; if( k < c ) set( l, … Continue reading →

http://poj.org/problem?id=2984 //* @author import java.io.*; import java.util.*; import java.math.*; public class Main { public static int a[]; public static int luckpeople(int n) { if(n==1) return 1; if(n%2==1) return luckpeople((n-1)/2)*2+1; else return luckpeople(n/2)*2-1; } public static int fun(int n) { int … Continue reading →

http://poj.org/problem?id=2983 //* @author: import java.io.*; import java.util.Scanner; /* *SPFA �����Լ������.һ��ʼû���Դ��һֱWA….- -!~~~~ */ class Node { int dian,value; Node next; Node(int x,int h) { dian=x; value=h; next=null; } void insert(Node a) { next=a; } } class Point { int dian; Node … Continue reading →

http://poj.org/problem?id=2982 #include "stdio.h" #include "memory.h" int cast[111][111]; int a[111], b[111], c[111]; int n, m, k; bool sign[111]; int main() { int i, j, l, s, x, y, h; while( 1 ) { scanf( "%d%d%d", &n, &m, &k ); if( !n … Continue reading →

http://poj.org/problem?id=2976 //* @author: import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); int i,j,n,k; while (sc.hasNext()) { n=sc.nextInt(); k=sc.nextInt(); if(n==0) break; int num[]=new int[n]; int den[]=new int[n]; double scores[]=new double[n]; for (i=0;i< n;i++) num[i]=sc.nextInt(); … Continue reading →

http://poj.org/problem?id=2967 //* @author: 82638882@163.com import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); int a=Integer.parseInt(in.readLine()); int[] arr=new int[a]; int u,total; for(int i=0;i< a;i++) { total=0; while(true) { … Continue reading →

http://poj.org/problem?id=2959 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int a=in.nextInt(); while((a–)!=0) { double D=in.nextDouble(); double d=in.nextDouble(); double s=in.nextDouble(); System.out.printf("%dn", (int)(Math.PI/Math.asin((d+s)/(D-d)))); } } }