zoj1796
2015-07-24 16:34
417 查看
不难。
#include <iostream>
using namespace std;
int main()
{
int record[6];
while(1)
{
for(int i = 0;i<6;i++)
{
cin >> record[i];
}
if(record[0] + record[1] == 0)
break;
int all,win,lose;
all = record[0] + record[1];
win = all*2 - (record[0] + record[2] + record[4]);
lose = all*2 - (record[1] + record[3] + record[5]);
cout << "Anna's won-loss record is "<< win << '-' << lose << '.' << endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int record[6];
while(1)
{
for(int i = 0;i<6;i++)
{
cin >> record[i];
}
if(record[0] + record[1] == 0)
break;
int all,win,lose;
all = record[0] + record[1];
win = all*2 - (record[0] + record[2] + record[4]);
lose = all*2 - (record[1] + record[3] + record[5]);
cout << "Anna's won-loss record is "<< win << '-' << lose << '.' << endl;
}
return 0;
}
相关文章推荐
- highcharts作图
- 中文乱码问题解决方案汇总
- 反转单链表的几种方法
- hdu 5288 (小技巧)
- Java、HTML、CSS、JSP、JavaScript注释语法
- [LeetCode]Integer to Roman
- 核典型关联分析(KCCA)算法原理
- Linux网络编程之使用TCP传输文件
- 如何取得Spring管理的bean (请用第3种方法):
- 【源代码】java.util.Stack & Queue
- uva 10594 Data Flow (最小费最大流+题目给的数据有错)
- Codeforces Round #313 (Div. 2) C Gerald's Hexagon 计数
- HTML DOM submit() 方法
- jquery ajax备用
- (转)反转单链表的几种方法
- 统计难题
- Espresso——Android测试工具Espresso简介
- zoj1715
- android布局-GridLayout
- KEIL/IAR 与 Doxygen 快速上手 - 嵌入式编程的注释管理小技巧