Monthly Archives: February 2015

http://poj.org/problem?id=3080 import java.util.*; public class Main { static String w[] = new String[10]; public static void main(String args[]) { int t, n, i, j = 0, k; Scanner cin = new Scanner( System.in ); t = cin.nextInt(); String p = … Continue reading →

http://poj.org/problem?id=3078 import java.math.BigInteger; import java.util.*; public class Main { static String name[] = new String[20]; static int pos[] = new int[20]; public static void main(String args[]) { Scanner cin = new Scanner( System.in ); int t, n, m, a, b; … Continue reading →

http://poj.org/problem?id=3077 import java.math.BigInteger; import java.util.*; public class Main { public static void main(String args[]) { int n, s, i; Scanner cin = new Scanner( System.in ); n = cin.nextInt(); while( n– != 0 ) { s = cin.nextInt(); for( i=10; … Continue reading →

http://poj.org/problem?id=3070 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); int[] f = new int[15000]; f[0] = 0; f[1] = 1; f[2] = 1; … Continue reading →

http://poj.org/problem?id=3068 #include <stdio.h> #include <memory.h> #include <math.h> #include <algorithm> using namespace std; #include <vector> using namespace std; typedef int type; //�������� const int size = 230; //ͼ�Ķ���ģ const type MAX_FEE = (1<<30); //�������� const int MAX = (1<<30); //������� const … Continue reading →

http://poj.org/problem?id=3067 //* @author: 82638882@163.com import java.io.*; import java.util.Arrays; public class Main { static long ans=0; public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); int a=Integer.parseInt(in.readLine()); int cnt=0; while((a–)!=0) { ans=0; cnt++; String[] ss=in.readLine().split(" "); … Continue reading →

http://poj.org/problem?id=3066 #include <stdio.h> #include <memory.h> #include <math.h> #include <algorithm> int main( ) { int m, p, a, b, k, i; double sum, q_a, a_p, ans, t; while( scanf( "%d%d%d%d", &m, &p, &a, &b ) == 4 ) { q_a = … Continue reading →

http://poj.org/problem?id=3065 #include <stdio.h> #include <memory.h> #include <math.h> #include <algorithm> using namespace std; int p[6000010]; int st[6000010]; void clear( int n ) { memset( p, -1, sizeof(int)*(n+1) ); } void input( int &m, int &sa, int &sb ) { char w[2]; … Continue reading →

http://poj.org/problem?id=3063 #include <stdio.h> #include <stdlib.h> int m, n; int s0[5000], s1[5000]; int mem[2][10000], *a = mem[0], *b = mem[1]; int w0, w1, b0, b1, sum; #define mine( a, b ) ((a)<(b)?(a):(b)) void fill( ) { int i; int m0 = … Continue reading →

http://poj.org/problem?id=3062 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(cin.hasNext()) { System.out.println(cin.nextLine()); } } }

http://poj.org/problem?id=3061 import java.util.Arrays; import java.util.Scanner; public class Main { // private static int ans[] =new int[100000]; private static int index = 0; public static void get(int[] seq, int s , int[]ans) { int sum = 0; int k = 0; … Continue reading →