HDU4523+简单
题意很简单。
一次最多多切出一条边!
其余的就没什么好说的了
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 import java.util.*; 2 import java.math.*; 3 public class Main{ 4 public static void main( String[] args ){ 5 Scanner cin = new Scanner( System.in ); 6 BigInteger n,m,p; 7 while( cin.hasNext() ){ 8 n = cin.nextBigInteger(); 9 m = cin.nextBigInteger(); 10 p = cin.nextBigInteger(); 11 if( m.compareTo(BigInteger.valueOf(3))<0 ){ 12 System.out.println("NO"); 13 continue; 14 } 15 if( m.compareTo(n)==0 ){//n==m 16 System.out.println("YES"); 17 continue; 18 } 19 if( n.compareTo(m)<0 ){//n<m 20 if( m.compareTo(p.add(n))<=0 ) 21 System.out.println("YES"); 22 else 23 System.out.println("NO"); 24 continue; 25 } 26 //n>m 27 if( p.compareTo(BigInteger.valueOf(1))>=0 ) 28 System.out.println("YES"); 29 else 30 System.out.println("NO"); 31 } 32 } 33 }
keep moving...