# Monthly Archives: June 2010

## Poj Solution 1468

http://poj.org/problem?id=1468 //* @author mekarlos@gmail.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan=new Scanner(System.in); int n=0,k=0; boolean band; int M[][]=new int; while(scan.hasNext()){ n=scan.nextInt(); for(int i=0;i< n;i++){ for(int j=0;j< 4;j++){ M[i][j]=scan.nextInt(); } } k=0; for(int i=0;i< … Continue reading

Posted in poj | Comments Off on Poj Solution 1468

## Poj Solution 1466

http://poj.org/problem?id=1466 import java.util.*; /** * * @author yeming */ public class Main { static int n; static LinkedList< Integer>[] matrix; static int[] result; static boolean[] state; static int ans; /** * @param args the command line arguments */ public static … Continue reading

Posted in poj | Comments Off on Poj Solution 1466

## Poj Solution 1465

http://poj.org/problem?id=1465 //* @author: 82638882@163.com import java.io.*; import java.util.*; public class Main { static int[] p,q; static int m,n; static Queue< mye> qu; public static void main(String[] args) throws IOException { Scanner in=new Scanner(System.in); qu=new LinkedList< mye>(); while(in.hasNext()) { qu.clear(); n=in.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1465

## Poj Solution 1463

http://poj.org/problem?id=1463 #include <stdio.h> #include <memory.h> #define min(a,b) ((a)<(b)?(a):(b)) int e; int en; int ans, n; void calc( int k, int f ) { int i; ans[k] = 0, ans[k] = 1; for( i=0; i<en[k]; i++ ) { if( e[k][i] != … Continue reading

Posted in poj | Comments Off on Poj Solution 1463

## Poj Solution 1458

http://poj.org/problem?id=1458 import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner in = new Scanner(System.in); while(in.hasNext()){ String str1 = in.next(); String str2 = in.next(); int[][] DP = new int[str1.length()+1][str2.length()+1]; int i; for(i=0;i<=str1.length();i++) DP[i] = 0; for(i=0;i<=str2.length();i++) DP[i] = 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1458

## Poj Solution 1455

http://poj.org/problem?id=1455 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int a=in.nextInt(); while((a–)!=0) { int b=in.nextInt(); int ans=0; int c=b/2; if(b%2==0) ans=c*(c-1); else ans=c*c; System.out.println(ans); } } }

Posted in poj | Comments Off on Poj Solution 1455

## Poj Solution 1451

http://poj.org/problem?id=1451

Posted in poj | Comments Off on Poj Solution 1451

## Poj Solution 1450

http://poj.org/problem?id=1450 #include <stdio.h> #include <stdlib.h> #define DEBUG 0 int main(void) { int iCase; if(DEBUG) freopen("in","r",stdin); scanf("%d",&iCase); int number; for ( number = 1; number <=iCase; ++number) { int N,M; scanf("%d%d",&M,&N); printf("Scenario #%d:n",number); printf("%d.",M*N); if(M%2&&N%2)printf("41"); else printf("00"); printf("nn"); } return 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1450

## Poj Solution 1430

http://poj.org/problem?id=1430 #include<iostream> using namespace std; const long big=1024*1024*1024; long b; long n,m; char a={ ". . . . . . . . . . . . . . . 1", ". . . . . . . . . . … Continue reading

Posted in poj | Comments Off on Poj Solution 1430

## Poj Solution 1426

http://poj.org/problem?id=1426 //* @author mekarlos@gmail.com import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.math.BigInteger; public class Main { public static void main(String[] args) throws IOException { BigInteger a; BigInteger b; BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in)); long c=0,d=0; long n=0; while((n=Long.parseLong(stdin.readLine()))!=0){ //for(n=1;n<=200;n++) { b=new … Continue reading

Posted in poj | Comments Off on Poj Solution 1426

## Poj Solution 1423

http://poj.org/problem?id=1423 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int n = cin.nextInt(); while(n > 0) { int test = cin.nextInt(); if(test <= 3) System.out.println(1); else { double result = 0.5*Math.log10(2*test*Math.PI)+ … Continue reading

Posted in poj | Comments Off on Poj Solution 1423

## Poj Solution 1422

http://poj.org/problem?id=1422 //* @author: import java.io.*; import java.util.*; import java.math.*; public class Main { static int n,m,match[]=new int; static boolean mat[][]=new boolean,v[]=new boolean; static boolean findmatch(int pre) { int i; for(i=0;i< m;i++) { if(mat[pre][i]&&!v[i]) { v[i]=true; int buf=match[i]; match[i]=pre; if(buf==-1||findmatch(buf))return true; … Continue reading

Posted in poj | Comments Off on Poj Solution 1422

## Poj Solution 1419

http://poj.org/problem?id=1419 /* @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 1419

## Poj Solution 1418

http://poj.org/problem?id=1418 #include<iostream> #include"math.h" using namespace std; #define MSIZE 1000 const double pi=3.14159265358979324; const double eps=1e-15; struct point {double x,y;}; struct typearc {double a,b;}; struct typecir {point ct; double r; typearc arc; int n; }; int cmp(double a,double b) {if(fabs(a-b)<eps)return 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1418