# Monthly Archives: February 2010

## Poj Solution 1312

http://poj.org/problem?id=1312 import java.math.BigInteger; import java.util.ArrayList; import java.util.List; import java.util.Scanner; /** * * Accepted. BigInteger is used here. * * */ public class Main { /** * Check if the given string is in numberic format. * * @param a * … Continue reading

Posted in poj | Comments Off on Poj Solution 1312

## Poj Solution 1309

http://poj.org/problem?id=1309 //* @author: import java.util.*; public class Main { public static void main(String[] args){ Scanner in = new Scanner(System.in); long N,i,j,t,ans; int flag=0; N=in.nextLong(); while(N>0) { flag=0; for(j=N-1;j>1;j–) { i=0; t=N; while(t%j==1) { t-=(t/j+1); i++; } if(t%j==0&&i==j) { flag=1; ans=j; … Continue reading

Posted in poj | Comments Off on Poj Solution 1309

## Poj Solution 1308

http://poj.org/problem?id=1308 #include<iostream> using namespace std; short ins[50000]; bool bb[50000]; int main() { int a,b,c=1; int i; memset(bb,0,sizeof(bb)); memset(ins,0,sizeof(ins)); int iMax=-1; int zero; bool flag;// ones; while(scanf("%d%d",&a,&b)) { if(a==-1 && b==-1) break; if(a==0 && b==0) { zero=0; flag = false; for(i=1;i<=iMax;++i) … Continue reading

Posted in poj | Comments Off on Poj Solution 1308

## Poj Solution 1307

http://poj.org/problem?id=1307 #include"stdio.h" bool left[13][13]; bool right[13][13]; bool up[13][13]; bool down[13][13]; int n,m,x1,x2,y1,y2; bool init() { int i,j,s; scanf("%d %d %d %d %d %d",&n,&m,&x1,&y1,&x2,&y2); if(n==0&&m==0&&x1==0&&x2==0&&y1==0&&y2==0) return 0; x1–,x2–,y1–,y2–; for(i=0;i<n;i++) for(j=0;j<m;j++) { scanf("%d",&s); right[i][j] = left[i][j+1]= (s&1); down[i][j] = up[i+1][j]= (s&2); } … Continue reading

Posted in poj | Comments Off on Poj Solution 1307

## Poj Solution 1306

http://poj.org/problem?id=1306 //* @author ������&lt;hongxp11@163.com&gt; import java.math.BigDecimal; import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while(true) { int n = in.nextInt(); int m = in.nextInt(); int m1 = m; BigInteger … Continue reading

Posted in poj | Comments Off on Poj Solution 1306

## Poj Solution 1302

http://poj.org/problem?id=1302 /* @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); while(run()==true) ; } static boolean run(){ String marker = cin.next(); if(marker.compareTo("ENDOFINPUT")==0) return false; int n = cin.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1302

## Poj Solution 1300

http://poj.org/problem?id=1300 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { String s=in.next(); if(s.equals("ENDOFINPUT"))break; int loc=in.nextInt(); int n=in.nextInt(); in.nextLine(); int[] door=new int[n]; int doors=0; for(int i=0;i< n;i++) { s=in.nextLine(); if(s.equals("")) … Continue reading

Posted in poj | Comments Off on Poj Solution 1300

## Poj Solution 1299

http://poj.org/problem?id=1299 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static void main(String[] args){ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); String s1; int r,g,w; while (true){ s1=scanner.next(); if (s1.equals("ENDOFINPUT")){ break; } r=scanner.nextInt(); g=scanner.nextInt(); w=scanner.nextInt()%360; if (w>180){ w=360-w; } int … Continue reading

Posted in poj | Comments Off on Poj Solution 1299

## Poj Solution 1298

http://poj.org/problem?id=1298 import java.io.BufferedInputStream; import java.util.Scanner; public class Main { String cipher; char[] message; char c; public Main() { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (!(cipher = scan.nextLine()).equals("ENDOFINPUT")) { while (!(cipher = scan.nextLine()).equals("END")) { message = cipher.toCharArray(); for (int i … Continue reading

Posted in poj | Comments Off on Poj Solution 1298

## Poj Solution 1291

http://poj.org/problem?id=1291 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; import java.io.BufferedInputStream; public class Main { public static Node[] nodes; public static void main(String[] args) { Scanner sc = new Scanner(new BufferedInputStream(System.in)); while(true) { int n = sc.nextInt(); if(n == 0) { break; } … Continue reading

Posted in poj | Comments Off on Poj Solution 1291