# Monthly Archives: December 2015

## Poj Solution 3435

http://poj.org/problem?id=3435 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); int n,i,j,k1,k2,p[][]=new int; n=sc.nextInt(); int len=n*n; for(i=0;i< len;i++) for(j=0;j< len;j++) p[i][j]=sc.nextInt(); boolean bb[]=new boolean,is=true; //memset(bb,0,sizeof(bb)); for(i=0;i< len;i++) { Arrays.fill(bb,false); for(j=0;j< … Continue reading

Posted in poj | Comments Off on Poj Solution 3435

## Poj Solution 3429

http://poj.org/problem?id=3429 //* @author:alpc12 import java.util.*; import java.math.*; public class Main { int n; BigInteger[] x = new BigInteger; BigInteger[] y = new BigInteger; public class Line { BigInteger a, b, c; } void run() { Scanner cin = new Scanner(System.in); … Continue reading

Posted in poj | Comments Off on Poj Solution 3429

## Poj Solution 3427

http://poj.org/problem?id=3427 import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); int n,L,v; n=sc.nextInt(); L=sc.nextInt(); int m=0; while((n–)!=0) { v=sc.nextInt(); if(v%L==0)continue; int u=L-v%L; if(u>m)m=u; } System.out.printf("%d",m); } }

Posted in poj | Comments Off on Poj Solution 3427

## Poj Solution 3425

http://poj.org/problem?id=3425 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); Call[] calls = new Call[n]; for(int i = 0; i < n; i++) { int … Continue reading

Posted in poj | Comments Off on Poj Solution 3425

## Poj Solution 3414

http://poj.org/problem?id=3414 //* @author: import java.util.ArrayList; import java.util.Arrays; import java.util.LinkedList; import java.util.Scanner; public class Main{ private static final String[] status = new String[] { "", "FILL(1)", "FILL(2)", "DROP(1)", "DROP(2)", "POUR(1,2)", "POUR(2,1)" }; private static boolean[][] visted = new boolean; private static … Continue reading

Posted in poj | Comments Off on Poj Solution 3414

## Poj Solution 3406

http://poj.org/problem?id=3406 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int[] b2=new int[]{6,2,4,8}; int[] b3=new int[]{1,3,9,7}; int[] b7=new int[]{1,7,9,3}; int[] b9=new int[]{1,9,1,9}; int n=in.nextInt(); int m=in.nextInt(); int w=n-m; int e,a2=0,a3=0,a5=0,a7=0,a9=0; e=n;while((e=e/2)!=0) … Continue reading

Posted in poj | Comments Off on Poj Solution 3406

## Poj Solution 3404

http://poj.org/problem?id=3404 //* @author: ccQ.SuperSupper import java.util.*; import java.math.*; public class Main { public static void main(String[] args) { int i,n,ans; int way[] = new int; Scanner cin = new Scanner(System.in); while(cin.hasNext()) { n = cin.nextInt(); for(i=0;i< n;++i) way[i] = cin.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 3404

## Poj Solution 3399

http://poj.org/problem?id=3399 import java.util.*; import java.math.*; public class Main { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner in=new Scanner(System.in); int n=in.nextInt(); int k=in.nextInt(); int k1=0,k2=0,a=0,kk=0; int[] a1=new int,a2=new int,ans=new int; for(int … Continue reading

Posted in poj | Comments Off on Poj Solution 3399

## Poj Solution 3386

http://poj.org/problem?id=3386 #include <iostream> #include <map> #include <algorithm> using namespace std; int main() { int A,a,B,b,P; while (cin>>A>>a>>B>>b>>P) { map<int,int> m; if (a == b) { if (!(A + B <= P)) printf("Non"); else printf("Yesn"); continue; } m[a] = A; m[b] … Continue reading

Posted in poj | Comments Off on Poj Solution 3386

## Poj Solution 3378

http://poj.org/problem?id=3378 //* @author: ccQ.SuperSupper import java.util.*; import java.math.*; class Binary { int n,i; long ret; long a[],c[]; void init(int x) { n = x; a = new long [x+10]; c = new long [x+10]; for(i=0;i< x+10;++i) { a[i]=c[i]=0; } } … Continue reading

Posted in poj | Comments Off on Poj Solution 3378

## Poj Solution 3372

http://poj.org/problem?id=3372 //* @author: 82638882@163.com<br /> /*��Ŀ���⣺��n��ͬѧ���һ��Բ��һ��ʦ���ǹ��4η����1��2��4��7…��ͬѧ�����Ƿ�ÿ��ͬѧ���ܵõ�����һ���ǡ� *����д�����صĳ������1~100�������ѷ��֣�ֻ�е�n=2^k��kΪ����ʱ�����YES�� */ import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(in.hasNext()) { int a=in.nextInt(); while(a%2==0) a=a/2; if(a==1) System.out.println("YES"); else System.out.println("NO"); } } }

Posted in poj | Comments Off on Poj Solution 3372

## Poj Solution 3371

http://poj.org/problem?id=3371 import java.io.BufferedInputStream; import java.io.IOException; import java.util.Scanner; import java.text.DecimalFormat; class Main { public static boolean isvowel(char a) { if (a==’a’ || a==’e’ || a==’i’ || a==’o’ || a==’u’ || a==’y’) return true; else return false; } public static boolean isword(char … Continue reading

Posted in poj | Comments Off on Poj Solution 3371

## Poj Solution 3368

http://poj.org/problem?id=3368 import java.io.*; import java.util.*; public class Main { static treex[] mytreex=new treex; static int[] hash=new int; static int[] left=new int; static int[] right=new int; static int[] data=new int; static boolean build=false; static int k=0; public static void main(String args[]) … Continue reading

Posted in poj | Comments Off on Poj Solution 3368