# Monthly Archives: February 2011

## Poj Solution 1707

http://poj.org/problem?id=1707 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; import java.math.*; import java.text.*; public class Main { static class com { BigInteger a,b;//a/b… com add(com C) { com ret=new com(); BigInteger lcm; lcm=b.multiply(C.b).divide(b.gcd(C.b)); ret.b=lcm; ret.a=a.multiply(lcm.divide(b)).add(C.a.multiply(lcm.divide(C.b))); lcm=ret.b.gcd(ret.a); ret.a=ret.a.divide(lcm); ret.b=ret.b.divide(lcm); return ret; } … Continue reading

Posted in poj | Comments Off on Poj Solution 1707

## Poj Solution 1706

http://poj.org/problem?id=1706 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; import java.io.*; public class Main { public static Map< Integer,Integer> mapOldToNew; public static Map< Integer,Integer> mapNewToOld; public static int counter = 1; public static void main(String[] args) throws Exception { BufferedReader stdin = new … Continue reading

Posted in poj | Comments Off on Poj Solution 1706

## Poj Solution 1704

http://poj.org/problem?id=1704 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[] ){ int arr[]=new int; Scanner sc=new Scanner(System.in); int T=sc.nextInt(); while((T–)!=0){ int n=sc.nextInt(); arr = 0; for (int i = 1; i <= n;i++) arr[i]=sc.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1704

## Poj Solution 1703

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

Posted in poj | Comments Off on Poj Solution 1703

## Poj Solution 1702

http://poj.org/problem?id=1702 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static long ans[]={ 1,3,9,27,81,243,729,2187,6561,19683,59049,177147,531441, 1594323,4782969,14348907,43046721,129140163,387420489,1162261467 }; public static void main(String args[]){ int n; Scanner sc=new Scanner(System.in); n=sc.nextInt(); int p[]=new int; while((n–)!=0){ Arrays.fill(p,0); int a; a=sc.nextInt(); int len=0,i; while(a!=0) { … Continue reading

Posted in poj | Comments Off on Poj Solution 1702

## Poj Solution 1700

http://poj.org/problem?id=1700 import java.util.Arrays; import java.util.Scanner; public class Main { private static int sum; public static int getSumTime(int[] a, int n) { if (n < 3) { return a[n-1]; } else if (n == 3) { return a + a + … Continue reading

Posted in poj | Comments Off on Poj Solution 1700

## Poj Solution 1699

http://poj.org/problem?id=1699 #include<iostream> #include"string.h" #include<vector> #include<algorithm> using namespace std; int m; int set; int len;int n; int order1,order2; char word; int h; int cmp1(int a,int b) {return m[h][a]>m[h][b];} int cmp2(int a,int b) {return m[a][h]>m[b][h];} int link(int a,int b) {int i,j; for(i=0;i<=len[a];i++) … Continue reading

Posted in poj | Comments Off on Poj Solution 1699

## Poj Solution 1695

http://poj.org/problem?id=1695 /* @author:zeropinzuo */ import java.io.*; import java.util.*; public class Main{ static Scanner cin; public static void main(String args[]){ cin = new Scanner(System.in); int M = cin.nextInt(); for(int i=0;i< M;i++) run(); } static void run(){ int N = cin.nextInt(); int[][] … Continue reading

Posted in poj | Comments Off on Poj Solution 1695

## Poj Solution 1694

http://poj.org/problem?id=1694 #include<iostream> #include<vector> #include"stdlib.h" using namespace std; int child,need; int ch; //int cmp(int i,int j) int cmp(const void * i,const void * j) { if(need[*((int *)i)]<need[*((int *)j)]) return 1; else if(need[*((int *)i)]>need[*((int *)j)]) return -1; return 0; } void doit(int … Continue reading

Posted in poj | Comments Off on Poj Solution 1694

## Poj Solution 1693

http://poj.org/problem?id=1693 #include<iostream> using namespace std; char set; int n_cl,n_rl; struct line {int x1,x2,y1,y2;}; line c,r; inline int min(int a,int b) {if(a<b)return a; else return b; } inline int max(int a,int b) {if(a>b)return a; else return b; } int jiao(line rl,line … Continue reading

Posted in poj | Comments Off on Poj Solution 1693