摘要：View Code 1 #include<stdio.h> 2 #include<stdlib.h> 3 #include<math.h> 4 #include<string.h> 5 6 int ascore, bscore; 7 8 int DFS(int m, int n, int p) 9 {10 if(ascore == 1) return 0; 11 if(m==1 && n==1)12 {13 bscore = 1;14 ascore = 1;15 return 0; 16 } ... 阅读全文

摘要：View Code 1 import java.util.*; 2 import java.math.*; 3 import java.io.*; 4 5 public class Hdu1063{//提交时名字改为Main 6 public static void main(String args[]){ 7 int n; 8 BigDecimal R,res; 9 String str;10 Scanner cin = new Scanner(System.in);11 12 while(cin.hasNext()){13 ... 阅读全文

摘要：View Code 1 import java.util.*; 2 import java.math.*; 3 import java.io.*; 4 5 public class Hdu1047{提交时要改为Main 6 public static void main(String args[]){ 7 int n, flag=0; 8 BigInteger a, sum; 9 10 Scanner cin = new Scanner (System.in);11 n = cin.nextInt();12 13 for(int ... 阅读全文

摘要：View Code 1 import java.util.*; 2 import java.math.*; 3 import java.io.*; 4 5 public class Main{ 6 public static void main(String args[]){ 7 BigInteger f[] = new BigInteger[1005]; 8 int n, p; 9 Scanner cin = new Scanner(System.in);10 f[1] = BigInteger.valueOf(1);11 f[2] = BigInteg... 阅读全文

摘要：View Code 1 import java.util.*; 2 import java.math.*; 3 import java.io.*; 4 5 public class Hdu1715{ 6 public static void main(String args[]){ 7 String s1; 8 BigDecimal a,b; 9 Scanner cin = new Scanner(System.in);10 11 while(cin.hasNext()){12 13 a = cin.nextBigDecim... 阅读全文

摘要：View Code 1 #include<stdio.h> 2 #include<stdlib.h> 3 #include<math.h> 4 #include<string.h> 5 6 char a[5002],b[4]="NOP"; 7 8 int ok(int l) 9 {10 int i, j;11 for(i = 0; i < (l+1)/2; i++) 12 {13 for(j = 0; j <= i; j++) 14 {15 if(a[l-i+j] != a[l-2*i+j-1])16 ... 阅读全文

摘要：咋一看此题有点不知所措，后来看了别人的题解，感悟良多用你自己的四轮现在草稿纸上画画，边入栈边匹配，匹配则出栈，不匹配则入栈，如此下去。。。View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cmath> 4 #include<cstring> 5 #include<stack> 6 #include<iostream> 7 #include<string> 8 9 using namespace std;10 11 int i,j,k,ans; 阅读全文