# Monthly Archives: December 2014

## Poj Solution 3036

http://poj.org/problem?id=3036 #include <stdio.h> int ans = { 0 }; int main( ) { int i, j, k, t; ans = 1; for( i=0; i<14; i++ ) { for( j=1; j<39; j++ ) for( k=1; k<39; k++ ) { t = … Continue reading

Posted in poj | Comments Off on Poj Solution 3036

## Poj Solution 3032

http://poj.org/problem?id=3032 //* @author: 82638882@163.com import java.util.*; 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[] arr=new int[b]; int u=0; for(int i=1;i<=b;i++) { int y=i; while(true) { if(arr[u]==0) y–; if(y==-1) … Continue reading

Posted in poj | Comments Off on Poj Solution 3032

## Poj Solution 3030

http://poj.org/problem?id=3030 //* @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))); int n=scanner.nextInt(); int r,e,c; for (int i=0;i< n ;i++ ){ r=scanner.nextInt(); e=scanner.nextInt(); c=scanner.nextInt(); if (r< e-c){ System.out.println("advertise"); } else … Continue reading

Posted in poj | Comments Off on Poj Solution 3030

## Poj Solution 3027

http://poj.org/problem?id=3027 /* @author:����acmilan_fan@yahoo.cn */ import java.util.*; public class Main { static public void main( String [] str ){ Scanner sc=new Scanner(System.in); int tt=sc.nextInt(); while(( tt–)!=0 ) { int a, b, r1, r2, t, r, s; a=sc.nextInt(); b=sc.nextInt(); r1=sc.nextInt(); r2=sc.nextInt(); for( … Continue reading

Posted in poj | Comments Off on Poj Solution 3027

## Poj Solution 3026

http://poj.org/problem?id=3026 import java.io.PrintWriter; import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static class Point{ int x,y,step; int result = 1; char c; public Point(int x, int y, char c){ this.x = x; this.y = y; this.c = c; … Continue reading

Posted in poj | Comments Off on Poj Solution 3026

## Poj Solution 3017

http://poj.org/problem?id=3017 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; import java.io.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(new BufferedInputStream(System.in)); Container cn= new Container(); boolean noSuchCut =false; int n = sc.nextInt(); long m = sc.nextLong(); Wrapper[] … Continue reading

Posted in poj | Comments Off on Poj Solution 3017

## Poj Solution 3014

http://poj.org/problem?id=3014 import java.util.*; import java.io.*; public class Main{ static int dp[][]=new int; public static void main(String args[]){ Scanner scan = new Scanner(new BufferedInputStream(System.in)); while(scan.hasNext()) { int n = scan.nextInt(); int m = scan.nextInt(); System.out.println(f(n, m)); } } public static int … Continue reading

Posted in poj | Comments Off on Poj Solution 3014

## Poj Solution 3012

http://poj.org/problem?id=3012 #include <stdio.h> int main( ) { int n, k, m, t, i; __int64 a, ans, temp; scanf( "%d", &t ); while( t– ) { scanf( "%d%d%d", &n, &k, &m ); a = 10%m; ans = 1; temp = 1; … Continue reading

Posted in poj | Comments Off on Poj Solution 3012

## Poj Solution 3009

http://poj.org/problem?id=3009 //* @author import java.util.*; public class Main { static final int MAX= 30; static int w,h; static int start_x,start_y; static int flag[][] = new int[MAX][MAX]; static int min=11; static int step=1; static void dfs(int x,int y,int step) { if(step>10) … Continue reading

Posted in poj | Comments Off on Poj Solution 3009

## Poj Solution 3006

http://poj.org/problem?id=3006 //* @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))); while (true){ int a=scanner.nextInt(); int d=scanner.nextInt(); int n=scanner.nextInt(); if (a+d+n==0){ break; } int index=0; int i=0; while (index< n){ … Continue reading

Posted in poj | Comments Off on Poj Solution 3006