Monthly Archives: November 2011

Poj Solution 1979

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

Posted in poj | Comments Off on Poj Solution 1979

Poj Solution 1978

http://poj.org/problem?id=1978 import java.io.BufferedInputStream; import java.util.LinkedList; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { int m = scan.nextInt(); int n = scan.nextInt(); if (m == 0 && n … Continue reading

Posted in poj | Comments Off on Poj Solution 1978

Poj Solution 1977

http://poj.org/problem?id=1977 #include<iostream> #include"string.h" using namespace std; char m[30][100][100]; int n,t,v[100]; char name[100][100][100]; char nm[100][100]; int s[100]; char ans[100][100]; char temp[100][100]; void multiply(char a[100][100],char b[100][100],char c[100][100]) { int i,j,k; for(i=0;i<n;i++) for(j=0;j<n;j++) { c[i][j]=0; for(k=0;k<n;k++) c[i][j]+=a[i][k]*b[k][j]; c[i][j]%=2; } return; } void init() … Continue reading

Posted in poj | Comments Off on Poj Solution 1977

Poj Solution 1976

http://poj.org/problem?id=1976 #include<stdio.h> #include<string.h> #define debug 0 #define NMAX 10002 int a[NMAX]; int s[4][NMAX]; int main() { #if debug freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif int i,j,k,t,d,N; scanf("%d",&t); while(t–) { scanf("%d",&N); memset(s,0,sizeof(int)); memset(a,0,sizeof(int)); for(i=1;i<=N;i++) { scanf("%d",&a[i]); a[i]+=a[i-1]; } scanf("%d",&d); for(k=1;k<=3;k++) { for(i=1;i<=N;i++) { j=0>i-d?0:i-d; … Continue reading

Posted in poj | Comments Off on Poj Solution 1976

Poj Solution 1974

http://poj.org/problem?id=1974 #include<stdio.h> #include<stdlib.h> #define debug 0 #define NMAX 1000003 struct data { long x,y; }v[NMAX]; long t,m,n,k; long count; int cmp1(void const *a,void const *b) { if((*(struct data*)a).y==(*(struct data*)b).y) return (*(struct data*)a).x-(*(struct data*)b).x; else return (*(struct data*)a).y-(*(struct data*)b).y; } int … Continue reading

Posted in poj | Comments Off on Poj Solution 1974

Poj Solution 1973

http://poj.org/problem?id=1973 #include<iostream> using namespace std; int f[110],ft[110]; int n,m; int t1[110],t2[110]; bool checkout(int t) { int i,j,a,b; for(i=1;i<=m;i++) f[i]=-1; f[0]=0; for(j=0;j<=m;j++) ft[j]=f[j]; for(i=0;i<n;i++) { for(a=0;a<=t/t1[i]&&a<=m;a++) { b=(t-t1[i]*a)/t2[i]; for(j=0;j<=m-a;j++) if(f[j]>=0) { if(ft[j+a]<f[j]+b) ft[j+a]=f[j]+b; } } for(j=0;j<=m;j++) f[j]=ft[j]; if(f[m]>=m)return 1; } return … Continue reading

Posted in poj | Comments Off on Poj Solution 1973

Poj Solution 1972

http://poj.org/problem?id=1972 //* @author: <strong> import java.util.*; public class Main { static int max(int u,int v,int w,int x) { if (u< v)u=v; if (u< w)u=w; if (u< x)u=x; return u; } public static void main(String[] args){ Scanner sc = new Scanner(System.in); … Continue reading

Posted in poj | Comments Off on Poj Solution 1972

Poj Solution 1971

http://poj.org/problem?id=1971 #include<stdio.h> #include<string.h> #include<stdlib.h> #define debug 0 #define INF 30000 #if debug #define NMAX 10 #else #define NMAX 1003 #endif typedef struct { int x,y; }point; point a[NMAX],m[NMAX*NMAX]; int cmp(const void*a,const void *b) { if((*(point*)a).x==(*(point*)b).x) return (*(point*)a).y-(*(point*)b).y; else return (*(point*)a).x-(*(point*)b).x; … Continue reading

Posted in poj | Comments Off on Poj Solution 1971

Poj Solution 1970

http://poj.org/problem?id=1970 /* @author: */ import java.util.Scanner; public class Main{ static int p[][]=new int[21][21]; public static void main(String args[]) { Scanner sc=new Scanner(System.in); int tt,i,j,k,x=0,y=0; tt=sc.nextInt(); while((tt–)!=0) { for(i=1;i< 20;i++) for(j=1;j< 20;j++) p[i][j]=sc.nextInt(); int tag=0; for(i=1;i< 20;i++) { for(j=1;j< 16;j++) { … Continue reading

Posted in poj | Comments Off on Poj Solution 1970

Poj Solution 1969

http://poj.org/problem?id=1969 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(cin.hasNext()) { int num = cin.nextInt(); int index = 1; int result = 0; while(result <= num) { result += index; index … Continue reading

Posted in poj | Comments Off on Poj Solution 1969

Poj Solution 1965

http://poj.org/problem?id=1965 //* @author mekarlos@gmail.com import java.math.BigDecimal; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan=new Scanner(System.in); BigDecimal k; BigDecimal root=new BigDecimal("1"); BigDecimal aux=new BigDecimal("0.0000000001"); BigDecimal tr=new BigDecimal("3"); String a; int ind=0,sum; while(scan.hasNext()){ k=scan.nextBigDecimal(); root=k.divide(new BigDecimal("2")); … Continue reading

Posted in poj | Comments Off on Poj Solution 1965

Poj Solution 1964

http://poj.org/problem?id=1964 //* @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=new int[1001][1001]; int[][] M=new int[1001][1001]; int k=scan.nextInt(); int n=0,m=0,d,maxA; for(int z=0;z< k;z++){ maxA=0; m=scan.nextInt(); n=scan.nextInt(); for(int i=0;i< m;i++) for(int j=0;j< n;j++) … Continue reading

Posted in poj | Comments Off on Poj Solution 1964

Poj Solution 1961

http://poj.org/problem?id=1961 //* @author: import java.util.Scanner; public class Main { static int next[]=new int[1000010]; public static void main(String[] args) { Scanner scn = new Scanner(System.in); int n; String input = ""; int j=0; int k=0; while(scn.hasNext()){ n=scn.nextInt(); input = scn.next(); if(n==0){ … Continue reading

Posted in poj | Comments Off on Poj Solution 1961