# Monthly Archives: January 2013

## Poj Solution 2392

http://poj.org/problem?id=2392 //* @author: import java.util.Scanner; import java.util.Arrays; public class Main{ private int k; private Block block[]; private boolean access[]=new boolean[400001]; public Main(int k,Block block[]){ this.k=k; this.block=block; } private int doIt(){ int maxs=0; access[0]=true; Arrays.sort(block); for(int i=0;i< k;i++) { int t=0; … Continue reading

Posted in poj | Comments Off on Poj Solution 2392

## Poj Solution 2390

http://poj.org/problem?id=2390 import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; /** * * Poj2390 * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { int r = scan.nextInt(); long m … Continue reading

Posted in poj | Comments Off on Poj Solution 2390

## Poj Solution 2389

http://poj.org/problem?id=2389 import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; /** * * poj2389 * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { BigInteger a = scan.nextBigInteger(); BigInteger b … Continue reading

Posted in poj | Comments Off on Poj Solution 2389

## Poj Solution 2388

http://poj.org/problem?id=2388 import java.io.BufferedInputStream; import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { int n = scan.nextInt(); int[] array = new int[n + 1]; for (int i = 0; i … Continue reading

Posted in poj | Comments Off on Poj Solution 2388

## Poj Solution 2387

http://poj.org/problem?id=2387 import java.util.*; public class Main{ public static void main(String args[]){ Scanner in=new Scanner(System.in); int c=0; int t=in.nextInt();//����˳�����WA��N�Σ������������⣡ int n=in.nextInt(); int dist[]=new int[n+1];//��������ȷ�������С������RE��N�Σ� int[][] w=new int[n+1][n+1]; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ w[i][j]=Integer.MAX_VALUE; } } for(int i=0;i< t;i++){//����}�㼰֮����� int sn=in.nextInt(); int en=in.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 2387

## Poj Solution 2386

http://poj.org/problem?id=2386 //* @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(); int b=in.nextInt(); int count=0; int[][] arr=new int[a+2][b+2]; for(int i=1;i<=a;i++){ String s=in.next(); for(int j=1;j<=b;j++) arr[i][j]=s.charAt(j-1); } for(int i=1;i<=a;i++) for(int j=1;j<=b;j++) … Continue reading

Posted in poj | Comments Off on Poj Solution 2386

## Poj Solution 2385

http://poj.org/problem?id=2385 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { /** * @param args */ public static int max(int x,int y) { if(x>y) return x; return y; } public static void main(String[] args) throws Exception{ // TODO Auto-generated … Continue reading

Posted in poj | Comments Off on Poj Solution 2385

## Poj Solution 2383

http://poj.org/problem?id=2383 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; import java.math.*; class circle{ int x,y,r,color; } class Set{ int n,m; int next[][] = new int[1010][1010]; void init(int _n,int _m){ for(n=0;n<=_n;++n) for(m=0;m<=_m;++m) next[n][m] = m; n = _n; m = _m; } … Continue reading

Posted in poj | Comments Off on Poj Solution 2383

## Poj Solution 2381

http://poj.org/problem?id=2381 #include <stdio.h> #include <string.h> char b[16000002]; int main() { unsigned long a,m,c,r; memset(b,0,sizeof(b)); scanf("%lu%lu%lu%lu",&a,&c,&m,&r); while(1) { r=(a*r+c)%m; if(b[r]) break; else b[r]=1; } long i,max=0,last=0; for(i=0;i<16000002;i++) if(b[i]) break; last=i++; for(;i<16000002;i++) { if(b[i]) { // printf("%lu ",i); if(i-last>max) { max=i-last; } … Continue reading

Posted in poj | Comments Off on Poj Solution 2381

## Poj Solution 2380

http://poj.org/problem?id=2380 #include<stdio.h> #include<string.h> #include<stdlib.h> #include<string.h> #include<math.h> #define INF 30000 #define NMAX 500003 typedef struct { long q,s,v; }data; data a[NMAX]; data b[NMAX]; long y[NMAX]; long x[NMAX]; long N; int cmp(const void *a,const void *b) { if(((data*)a)->s==((data*)b)->s) return ((data*)a)->q-((data*)b)->q; else return … Continue reading

Posted in poj | Comments Off on Poj Solution 2380

## Poj Solution 2377

http://poj.org/problem?id=2377 //* @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)); int n = sc.nextInt(); int m = sc.nextInt(); int[] mind = new int[n]; boolean[] reached = … Continue reading

Posted in poj | Comments Off on Poj Solution 2377

## Poj Solution 2376

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

Posted in poj | Comments Off on Poj Solution 2376