# Monthly Archives: June 2013

## Poj Solution 2501

http://poj.org/problem?id=2501 //* @author import java.io.*; import java.util.*; import java.text.DecimalFormat; public class Main { static int hh; static int mm; static int ss; static double sumDist; static double speed; public static void main(String[] args) throws Exception { readFile(); } static void … Continue reading

Posted in poj | Comments Off on Poj Solution 2501

## Poj Solution 2500

http://poj.org/problem?id=2500 #include <iostream> #include <math.h> #include <algorithm> using namespace std; int n,c,g; double d,r; const double pi = 3.1415926535898; const double eps = 1e-8; double area(int a, int b, int c ) { double l1, l2; l1 = sin( pi*abs(a-b)/n … Continue reading

Posted in poj | Comments Off on Poj Solution 2500

## Poj Solution 2499

http://poj.org/problem?id=2499 //* @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(); int cnt=0; while((a–)!=0) { int b=in.nextInt(); int c=in.nextInt(); cnt++; int d=0,e=0; while(true) { if(b>c) { d+=b/c; b=b%c; if(b==0) break; … Continue reading

Posted in poj | Comments Off on Poj Solution 2499

## Poj Solution 2498

http://poj.org/problem?id=2498 //* @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(); int count=1; int[] arr=new int[]{9,3,7}; while((a–)!=0) { String s=in.next(); int total=0; int k=0; int p=0; int t=s.length(); for(int i=t-1;i>-1;i–) … Continue reading

Posted in poj | Comments Off on Poj Solution 2498

## Poj Solution 2497

http://poj.org/problem?id=2497 //* @author: 82638882@163.com import java.io.*; import java.util.Arrays; 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 cnt=0; while((a–)!=0) { cnt++; String[] ss=in.readLine().split(" "); int t=Integer.parseInt(ss); int w=Integer.parseInt(ss); … Continue reading

Posted in poj | Comments Off on Poj Solution 2497

## Poj Solution 2496

http://poj.org/problem?id=2496 #include <stdio.h> #include <algorithm> using namespace std; int e; int n; int p; int a; int main() { int cas, i, j, l, k, ans; scanf( "%d", &cas ); for( l=1; l<=cas; l++ ) { scanf( "%d", &p ); … Continue reading

Posted in poj | Comments Off on Poj Solution 2496

## Poj Solution 2495

http://poj.org/problem?id=2495 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { /** * @param args */ public static void main(String[] args)throws Exception { // TODO Auto-generated method stub int a,b,c,d,t,i; Scanner cin = new Scanner(System.in); t = cin.nextInt(); for(i=1;i<=t;++i){ … Continue reading

Posted in poj | Comments Off on Poj Solution 2495

## Poj Solution 2492

http://poj.org/problem?id=2492 //* @author: 82638882@163.com import java.io.*; public class Main { static my[] p; 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 cnt=0; while((a–)!=0) { cnt++; String[] ss=in.readLine().split(" "); int n=Integer.parseInt(ss); p=new … Continue reading

Posted in poj | Comments Off on Poj Solution 2492

## Poj Solution 2491

http://poj.org/problem?id=2491 #include <stdio.h> #include <string.h> int next; bool ishead; char w1,w2; int main() { int cas, i, n, j, k = 0; scanf( "%d", &cas ); while( cas– ) { scanf( "%d", &n ); n–; for( i=0; i<n; i++ ) … Continue reading

Posted in poj | Comments Off on Poj Solution 2491

## Poj Solution 2489

http://poj.org/problem?id=2489 #include <stdio.h> #include <math.h> #include <memory.h> #include <algorithm> using namespace std; struct point { int x,y; }; struct line { point a,b; int dx,dy; }l; int n; __int64 ans; inline double crossproduct(point o, point a, point b) { return … Continue reading

Posted in poj | Comments Off on Poj Solution 2489

## Poj Solution 2488

http://poj.org/problem?id=2488 import java.io.PrintWriter; import java.util.Scanner; import java.util.Stack; public class Main { static class Point{ int x ,y; public Point(int x ,int y){ this.x = x; this.y = y; } } static int[][] chessboard = new int; static int num = … Continue reading

Posted in poj | Comments Off on Poj Solution 2488

## Poj Solution 2487

http://poj.org/problem?id=2487 import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj2487 * @author NC */ public class Main { private static int partition(int[] array, int low, int high) { int key = array[low]; while (low < high) { while (low < high && … Continue reading

Posted in poj | Comments Off on Poj Solution 2487

## Poj Solution 2486

http://poj.org/problem?id=2486 #include <iostream> #include <list> #include <algorithm> using namespace std; int value; int gone,m,K,n; int back; list<int> e; void merge_back(int bk1[], int bk2[], int bk[], int maxstep ) { int i,j; for( i=0; i<=maxstep; i++ ) { bk[i] = bk2[i]; … Continue reading

Posted in poj | Comments Off on Poj Solution 2486

## Poj Solution 2485

http://poj.org/problem?id=2485 import java.util.Scanner; public class Main{ public static void main(String argvs[]){ int matrix[][]; int Max=65536; int m,n,t,i,j,k,max_len,count,num,min,point=0; int temp1[],temp2[],flag[]; Scanner in=new Scanner(System.in); t=in.nextInt(); for(i=0;i< t;i++){ n=in.nextInt(); matrix=new int[n][n]; flag=new int[n]; for(j=0;j< n;j++) flag[j]=0; flag=1; count=0; num=0; min=Max; max_len=0; temp1=new int[n*(n-1)/2]; … Continue reading

Posted in poj | Comments Off on Poj Solution 2485