1409. Two Gangsters
Time limit: 1.0 second
Memory limit: 64 MB
Memory limit: 64 MB
Two gangsters Harry and Larry had a rest at countryside. They decided to spend some time shooting, so they put several beer cans (no more than 10) on a log. Harry started to shoot cans one after another from the leftmost to the right and Larry – from the rightmost to the left. At some moment it happened so that they shot one and the same can.
Harry got indignant and claimed that Larry owed him a considerable sum of money because Larry deprived him of shooting some more cans. Larry became furious and told Harry that he owed even greater sum of money to Larry because of the same reason. They started to argufy but nobody remembered how many cans there were at the very beginning. And no one of them was going to search cans which was shot. Anyway, each of them remembered exactly how many cans he shot.
Determine how many cans were not shot by Harry and how many cans were not shot by Larry.
Input
The only input line contains two integers — the number of cans shot by Harry and by Larry respectively.
Output
two integers — the number of cans that were not shot by Harry and the number of cans that were not shot by Larry, respectively.
Sample
input | output |
---|---|
4 7 | 6 3 |
还是一个炒鸡简单的问题,两个人总会有打到一起的时候,把对方打中的瓶子数减一就OK了。
还有注意不要用10减去瓶子数,因为no more than在这里的意思是不超过...
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b)
{
printf("%d %d\n",b-1,a-1);
}
return 0;
}