Monthly Archives: February 2011

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 →

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 →

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[10005]; Scanner sc=new Scanner(System.in); int T=sc.nextInt(); while((T–)!=0){ int n=sc.nextInt(); arr[0] = 0; for (int i = 1; i <= n;i++) arr[i]=sc.nextInt(); … Continue reading →

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[0]); int … Continue reading →

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[25]; while((n–)!=0){ Arrays.fill(p,0); int a; a=sc.nextInt(); int len=0,i; while(a!=0) { … Continue reading →

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[0] + a[1] + … Continue reading →

http://poj.org/problem?id=1699 #include<iostream> #include"string.h" #include<vector> #include<algorithm> using namespace std; int m[10][10]; int set[10]; int len[10];int n; int order1[10][9],order2[10][9]; char word[10][22]; 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 →

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 →

http://poj.org/problem?id=1694 #include<iostream> #include<vector> #include"stdlib.h" using namespace std; int child[201],need[201]; int ch[201][200]; //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 →

http://poj.org/problem?id=1693 #include<iostream> using namespace std; char set[100][100]; int n_cl,n_rl; struct line {int x1,x2,y1,y2;}; line c[100],r[100]; 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 →

http://poj.org/problem?id=1692 #include<iostream> using namespace std; int links[101][101]; int f[101],s[101],n,m; int answer; void find() {int i,j,t,k,h; links[0][0]=0; links[0][1]=0; links[1][0]=0; for(i=1;i<=n;i++) for(j=1;j<=m;j++) {t=links[i-1][j]>links[i][j-1]?links[i-1][j]:links[i][j-1]; if(f[i]!=s[j]) { for(k=i-1;k>=1;k–) if(f[k]==s[j])break; for(h=j-1;h>=1;h–) if(f[i]==s[h])break; if(k&&h&&links[k-1][h-1]+1>t)t=links[k-1][h-1]+1; } links[i][j]=t; } } int main() {int i,t; cin>>t; while(t–) {cin>>n>>m; for(i=1;i<=n;i++)cin>>f[i]; … Continue reading →