sicily1634
2011-03-22 21:20
225 查看
#include<iostream> using namespace std; int main() { int a,b; int pos=0; int pro=1; int pro1=1; while(cin>>a>>b&&a!=-1&&b!=-1) { pos=0; pro=1; pro1=1; if(a==0||b==0) pos=1; else { int c=a>=b?a:b; int d=a<b?a:b; for(int i=c+2-d;i<=c+1;i++) pro*=i; for(int j=1;j<d;j++) pro1*=j; pos=pro/pro1; } if(pos==a+b) cout<<a<<"+"<<b<<"="<<a+b<<endl; else cout<<a<<"+"<<b<<"!="<<a+b<<endl; } return 0; }
相关文章推荐
- sicily题目之1561 1566 1569 1634
- sicily 1634
- sicily1634. Relax! It's just a game
- Sicily 1634. Relax! It's just a game
- Sicily 1152 简单的马周游问题[Speical judge]
- sicily 1009 Maximum Module
- Sicily 1052. Candy Sharing Game
- sicily 1444 Prime Path
- sicily 1800. Sequence(RMQ,线段树解决)
- Sicily 1134 积木分发
- Sicily 1172 Queens, Knights and Pawns
- sicily 1342. 开心的金明
- Sicily1424(拓扑排序)
- Sicily 1485 Hanoi双塔问题 (SOJ 1485) 【高精度】
- Sicily 1193 Up the Stairs
- sicily 1046. Plane Spotting
- Sicily 1145. 校门外的树
- Sicily 1790. Single Round Match
- sicily1825. Nickname
- sicily1166. Computer Transformat