Monthly Archives: August 2011

http://poj.org/problem?id=1905 /* @author: */ import java.util.Scanner; public class Main{ static final double PI=3.1415926; static final double eps=1e-6; public static void main(String args[]) { Scanner sc=new Scanner(System.in); double L,n,C,M,y1,low,high,mid; while(true) { L=sc.nextDouble(); n=sc.nextDouble(); C=sc.nextDouble(); if(L==-1&&n==-1&&C==-1)break; if(L<=eps||n<=eps||C<=eps) { System.out.println("0.000"); continue; } M=(1+n*C)*L; … Continue reading →

http://poj.org/problem?id=1904 #include <stdio.h> #include <vector> #include <algorithm> using namespace std; int e2[2010], ee2[2010], n; vector<int> e1[2010]; vector<int> ee1[2010]; vector<int> ans[2010]; void input( ) { int i, k, m; scanf( "%d", &n ); for( i=0; i<n; i++ ) { scanf( "%d", … Continue reading →

http://poj.org/problem?id=1901 #include <stdio.h> #include <math.h> #include <algorithm> using namespace std; const int size = 1000; struct point { double x, y, z; int k; }p[size]; inline double dis( point &a, point &b ) { return (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y) + (a.z-b.z)*(a.z-b.z); … Continue reading →

http://poj.org/problem?id=1896 //* @author:alpc12 import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); String line; StringBuffer sb = new StringBuffer(); while ((line = in.readLine()) != null) { for … Continue reading →

http://poj.org/problem?id=1894 import java.io.*; import java.util.*; import java.math.*; public class Main { public static void main(String[] args) { BigInteger sum,m,D[] = new BigInteger[2]; int i,b[] = new int[340]; Scanner cin = new Scanner(System.in); m = cin.nextBigInteger(); sum = cin.nextBigInteger(); int k … Continue reading →

http://poj.org/problem?id=1887 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.*; public class Main { public static void main(String[] args) throws Exception{ BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); int totalnum; int count = 0; //while((totalnum=Integer.parseInt(in.readLine()))!=-100){ while(true) { int num; ArrayList < Integer> array = … Continue reading →

http://poj.org/problem?id=1882 #include<stdio.h> #include<string.h> #include<math.h> #include<stdlib.h> #define NMAX 101 #define INF 10000 int anset[NMAX],alen,min; int m[10020]; int t[NMAX]; int N,S,len; void solve() { int i,j; m[0]=0; i=1; while(1) { m[i]=INF; for(j=0;j<len;j++) { if(t[j]>i) break; if(m[i]>m[i-t[j]]+1) { m[i]=m[i-t[j]]+1; } } if(m[i]>S) break; … Continue reading →

http://poj.org/problem?id=1868 /* @author: */ import java.util.Scanner; public class Main { private int n; private int a[]; public Main(int n,int[] a){ this.n=n; this.a=a; } public boolean doIt(){ for(int j=1;j< n/2;j++) { for(int i=j;i< n-j;i++) { if((a[i-j]-a[i])*(a[i+j]-a[i])< 0) { return true; } … Continue reading →

http://poj.org/problem?id=1867 #include <stdio.h> #include <vector> #include <string.h> using namespace std; #define YES { printf( "samen" ); continue; } #define NO { printf( "differentn" ); continue; } #define PT(a) (printf("an")); struct node { vector< node* > next; char c; }mem[500]; char … Continue reading →

http://poj.org/problem?id=1862 import java.util.*; import java.text.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int num = Integer.valueOf(cin.nextLine()).intValue(); List list = new ArrayList(); for(int i = 0; i < num; i++) list.add(Double.valueOf(cin.nextLine())); Collections.sort(list); double … Continue reading →