Meta
-
Recent Posts
Recent Comments
- MorrissMar on 隆宪叁年-五一
- tEVFSJtRNq on A man in his twenties (in hex)
- MorrissMar on 隆宪叁年-五一
- ZEzPRbkFJG on A man in his twenties (in hex)
- MorrissMar on 隆宪叁年-五一
Archives
- May 2024
- April 2023
- February 2023
- January 2023
- December 2022
- November 2022
- September 2022
- June 2022
- July 2021
- January 2021
- February 2020
- September 2019
- March 2018
- February 2018
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
Categories
Monthly Archives: April 2015
Poj Solution 3112
http://poj.org/problem?id=3112 #include <stdio.h> int m[1000]; int main( ) { int n, p, c, i, j, t, ans; while( 1 ) { scanf( "%d%d%d", &p, &n, &c ); if( n == 0 && p == 0 && c == 0 ) … Continue reading
Posted in poj
Leave a comment
Poj Solution 3111
http://poj.org/problem?id=3111 #include <stdio.h> #include <algorithm> using namespace std; struct node{ int v, w, id; }nd[100010]; double r; bool cmp( node &a, node &b ) { return a.v-a.w*r > b.v-b.w*r; } int main( ){ int n, k, i; double t, s1, … Continue reading
Posted in poj
Leave a comment
Poj Solution 3110
http://poj.org/problem?id=3110 #include <stdio.h> #include <queue> using namespace std; int days[] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; int getDays( int dd, int mm, int year ) { int res = (year-1700)*365 … Continue reading
Posted in poj
Leave a comment
Poj Solution 3109
http://poj.org/problem?id=3109 #include <stdio.h> #include <memory.h> #include <algorithm> using namespace std; const int size = 100010; int s[size]; int m; //��� void clear( ) { memset( s, 0, sizeof s ); } inline int lowbit(int a) { return a&(a^(a-1)); } //����a[y] … Continue reading
Posted in poj
Leave a comment
Poj Solution 3106
http://poj.org/problem?id=3106 #include <stdio.h> static char str[100010]; static char input[310][310], ans[310][310]; static int n, m; static int doit( int s ) { int i = s/1000, j = s%1000, a = i, b = j; int nn = n; int mm … Continue reading
Posted in poj
Leave a comment
Poj Solution 3105
http://poj.org/problem?id=3105 /* @author: */ import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static public void main( String [] string ) throws Exception{ Scanner cin = new Scanner( System.in ); int m = cin.nextInt(); int n, i, p1, p0, … Continue reading
Posted in poj
Leave a comment
Poj Solution 3104
http://poj.org/problem?id=3104 //* @author: 82638882@163.com import java.io.*; public class Main { static int[] p; static int a,k; public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); a=Integer.parseInt(in.readLine()); p=new int[a]; String[] ss=in.readLine().split(" "); long total=0; for(int i=0;i< … Continue reading
Posted in poj
Leave a comment
Poj Solution 3102
http://poj.org/problem?id=3102 /* @author: */ import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static double dis[][]; static int e[][]; static int [] x, y, en; static double distance( int a, int b ) { return Math.sqrt( (x[a]-x[b])*(x[a]-x[b]) + (y[a]-y[b])*(y[a]-y[b]) … Continue reading
Posted in poj
Leave a comment
Poj Solution 3101
http://poj.org/problem?id=3101 import java.util.*; import java.math.*; public class Main { public static int[] p=new int[3000]; public static int pc; public static int[] a=new int[3000]; public static boolean[] che=new boolean[10001]; public static void init(){ int t1=2; while(t1*t1<=10000){ int t2=t1*t1; while(t2<=10000){ che[t2]=true; t2+=t1; … Continue reading
Posted in poj
Leave a comment
Poj Solution 3100
http://poj.org/problem?id=3100 import java.util.*; import java.io.*; import java.lang.reflect.Array; public class Main { static public void main( String [] string ) throws Exception{ Scanner cin = new Scanner( System.in ); int b, n; while( true ) { b = cin.nextInt(); n = … Continue reading
Posted in poj
Leave a comment
Poj Solution 3096
http://poj.org/problem?id=3096 //* @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))); boolean flag; int index; String s; String[] pair; while (true){ s=scanner.next(); if (s.equals("*")){ break; } if (s.length()==1){ System.out.println(s+" is … Continue reading
Posted in poj
Leave a comment