大数除算java

J - Single Round Math
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit 
Status
Description
Association for Couples Math (ACM) is a non-profit organization which is engaged in helping single people to find his/her other half. As November 11th is “Single Day”, on this day, ACM invites a large group of singles to the party. People round together, chatting with others, and matching partners.
There are N gentlemen and M ladies in the party, each gentleman should only match with a lady and vice versa. To memorize the Singles Day, ACM decides to divides to divide people into 11 groups, each group should have the same amount of couples and no people are left without the groups.
Can ACM achieve the goal?
Input
The first line of the input is a positive integer T. T is the number of test cases followed. Each test case contains two integer N and M (0 ≤ N, M ≤ 101000), which are the amount of gentlemen and ladies.
Output
For each test case, output “YES” if it is possible to find a way, output “NO” if not.
Sample Input

3
1 1
11 11
22 11

Sample Output

NO
YES
NO

【分析】
标题:あなたに一群の独身犬をあげて、n人の男性の独身犬とm人の女性の独身犬、あなたに彼らが完全にペアになることができるかどうかを聞いて、しかもすべて11組に分けます..だからまずn=mを満たします
そしてn%11=0を満たせばいい…10^1000回だから大数除算...ここではJavaを少し勉強して大数四則演算をするのに役立つのか...
大数除算は面倒なので直接javaですが、大数加減算は上手に書くほうがいいです.
【コード】
[cpp]  view plain
 copy
 
import java.math.BigInteger;    
import java.util.Scanner;     
public class Main   
{    
    public static void main(String[] args)  
    {          
        BigInteger MOD=new BigInteger("11");    
        BigInteger zero=new BigInteger("0");    
        Scanner sc=new Scanner(System.in);    
        int pp;  
        pp=sc.nextInt();    
        while((pp--)>0)  
        {          
            BigInteger n=sc.nextBigInteger();    
            BigInteger m=sc.nextBigInteger();    
            if(n.compareTo(m)==0 && n.mod(MOD).compareTo(zero)==0)    
                System.out.println("YES");    
            else  
                System.out.println("NO");    
        }    
            
    }    
転入先http://blog.csdn.net/jnxxhzz/article/details/60969546