# Monthly Archives: July 2014

## Poj Solution 2842

http://poj.org/problem?id=2842 #include <stdio.h> int an[10], bn[10]; int sa[10], sb[10]; int p[10], n, m, g, h; int S[500000], T[500000]; int get_T( int *a ) { int index = 0, i; for( i=0; i<n; i++ ) index += a[i]*sa[i]; return T[ index … Continue reading

Posted in poj | Comments Off on Poj Solution 2842

## Poj Solution 2840

http://poj.org/problem?id=2840 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(); for(int i = 0; i < num; i++) { String[] str = cin.nextLine().split(":"); int hour = Integer.valueOf(str[0]).intValue(); int … Continue reading

Posted in poj | Comments Off on Poj Solution 2840

## Poj Solution 2838

http://poj.org/problem?id=2838 #include <stdio.h> struct edge { edge *pri; edge *next; }; edge *e[1010]; edge temp[1010][1010]; void add( int from, int to ) { temp[from][to].next = e[from]; temp[from][to].pri = 0; if( e[from] ) e[from]->pri = temp[from]+to; e[from] = temp[from]+to; } void … Continue reading

Posted in poj | Comments Off on Poj Solution 2838

## Poj Solution 2837

http://poj.org/problem?id=2837 #include <stdio.h> int ans[512][512]; int main( ) { int i, j, k, n; ans[0][0] = 1; scanf( "%d", &n ); for( i=1; i<(1<<n); i<<=1 ) { for( j=i; j<i*2; j++ ) for( k=i; k<i*2; k++ ) ans[j][k] = ans[j-i][k-i]; … Continue reading

Posted in poj | Comments Off on Poj Solution 2837

## Poj Solution 2834

http://poj.org/problem?id=2834 #include <stdio.h> #include <memory.h> #include <algorithm> #include <vector> using namespace std; vector<int> e[10010], dest; int n, m; vector< pair<int,int> > jon, cely; void input( ) { int a, b; scanf( "%d", &n ); scanf( "%d", &m ); while( m– … Continue reading

Posted in poj | Comments Off on Poj Solution 2834

## Poj Solution 2833

http://poj.org/problem?id=2833 //* @author: 82638882@163.com import java.io.*; import java.util.*; public class Main { public static void main(String[] args) { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); StringBuffer buf=new StringBuffer(); try { while(true) { char c; int[] u=new int[3]; for(int i=0;i< 3;i++) { … Continue reading

Posted in poj | Comments Off on Poj Solution 2833

## Poj Solution 2823

http://poj.org/problem?id=2823 #include <stdio.h> #include <algorithm> using namespace std; int a[1000100], l[1000100], ans[1000100]; int pt[1000100], st[1000100], n, k, m; bool cmp( int x, int y ) { return a[x] < a[y]; } void calc( ) { int i, j, h, sn; … Continue reading

Posted in poj | Comments Off on Poj Solution 2823

## Poj Solution 2818

http://poj.org/problem?id=2818 /* @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 sum,a[]=new int[4],b[]=new int[4],sum1=0; while(true) { a[0]=sc.nextInt(); a[1]=sc.nextInt(); a[2]=sc.nextInt(); a[3]=sc.nextInt(); sum=sc.nextInt(); if(a[0]==0 && a[1]==0 && a[2]==0 &a[3]==0 … Continue reading

Posted in poj | Comments Off on Poj Solution 2818

## Poj Solution 2817

http://poj.org/problem?id=2817 #include <stdio.h> #include <memory.h> #include <string.h> int ans[12][1024][10]; int link[10][10]; int len[10]; char w[10][20]; int join_num( int i, int j ) { int k, l, ans = 0, h; for( k=0; w[i][k]; k++ ) { for( l=0, h=0; w[i][k+l] … Continue reading

Posted in poj | Comments Off on Poj Solution 2817

## Poj Solution 2816

http://poj.org/problem?id=2816 #include <stdio.h> #include <memory.h> #include <string.h> #include <math.h> char map[200][200]; bool ok[200][200]; int gx, gy, n, m, t, r; const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 }; … Continue reading

Posted in poj | Comments Off on Poj Solution 2816

## Poj Solution 2815

http://poj.org/problem?id=2815 #include <stdio.h> #include <memory.h> #include <string.h> #include <math.h> double get_angle( double s, double f, double m ) { if( s >= 12 ) s -= 12; s = ( s+f/60+m/7200 ) / 12 * 360; f = ( f+m/120 … Continue reading

Posted in poj | Comments Off on Poj Solution 2815

## Poj Solution 2812

http://poj.org/problem?id=2812 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class POINT{ double x,y; } public class Main { static final int N = 100000; static POINT point[] = new POINT[N]; static int n; static void start(){ for(int i=0;i< N;++i) point[i] = … Continue reading

Posted in poj | Comments Off on Poj Solution 2812