1 条题解
-
0
DO NOT CTJ PLS
#include <bits/stdc++.h> #define ll long long #define db double #define cr char #define scd(x) scanf("%d",&x) #define prd(x) printf("%d",x) #define prl() printf("\n") #define prsp() printf(" ") #define rep(i,x,y) for(int i=x;i<=y;i++) using namespace std; ll fanzhendong,duishou; char defen; int main(){ cin>>defen; while(defen!='E'){//在E之前 if(defen=='F') fanzhendong++; else duishou++;//简单的计分 if((fanzhendong>10||duishou>10)&&abs(fanzhendong-duishou)>1){ cout<<fanzhendong<<':'<<duishou<<endl; fanzhendong=0,duishou=0; }//判断是否一局结束 cin>>defen;//输入下一个状态 } if(fanzhendong||duishou) cout<<fanzhendong<<':'<<duishou<<endl;//判断是否一局未结束 return 0; }
- 1
信息
- ID
- 31
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 6
- 标签
- (无)
- 递交数
- 63
- 已通过
- 18
- 上传者