Single Round Match
来源:互联网 发布:科比00年总决赛数据 编辑:程序博客网 时间:2024/05/22 05:03
Problem Description
Association for Couples Match (ACM) is a non-profit organization which is engaged in helping single people to find his/her other half. As November 11th is "Singles 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 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. It is worth notice that N and M are really huge. You are suggested to input the number with string.
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
NOYESNO
题意:首先输入的第一个数代表数据的组数;
接下来的每一行都有两个数,数据很大,应该用字符储存;
首先输入的两个数都必须相等;然后都能被11整除;那么就输出YES,否则就输出NO;
# include<cstdio># include<iostream># include<cstring>using namespace std;int main(){ int n; cin>>n; while(n--) { string n,m; cin>>n>>m; if(n!=m) { cout<<"NO"<<endl; continue; } else { int r=0,i; for(i=0;i<n.size();i++) { r=r*10+n[i]-'0'; //每次取一位,-‘0’是转换类型; r%=11; } if(!r) cout<<"YES"<<endl; else cout<<"NO"<<endl; } } return 0;}
0 0
- 1790. Single Round Match
- 1790. Single Round Match
- Single Round Match
- Single Round Match
- Single Round Match
- Single Round Match
- Single Round Match
- Single Round Match
- Single Round Match
- Single Round Match 695
- Sicily 1790. Single Round Match
- Sicily 1790. Single Round Match
- Sicily 1790. Single Round Match
- NYOJ 786 Single Round Match
- Problem J Single Round Match
- Sicily 1790. Single Round Match
- Single Round Match 585 Div2 A B
- GDCPC 2008:J Single Round Match
- hdu3336Count the string
- hdu 1853 Cyclic Tour && hdu 3435 A new Graph Game(简单KM算法)
- cocos2d-x-3.0移植android
- QThread的使用总结(2)
- ubuntu 安装gcc pcre
- Single Round Match
- HDU 4883 TIANKENG’s restaurant
- 使用rgba属性兼容IE8
- 九度OJ 1021统计字符----20140728
- 炒冷饭系列:设计模式 单例模式
- poj 2006 Litmus Test 【即zoj 2351:计算酸的PH】
- iOS的一些理解
- Spring MVC使用fastjson数据传到前台中文乱码解决
- Cloudera Manager 和 CDH 4 终极安装