zoj 1057 Undercut

zoj 1057 Undercut,第1张

zoj 1057 Undercut
#include <iostream>using namespace std;int main(){    int n;    int a[20],b[20],i=0,SumA,SumB;    while(cin>>n&&n!=0)    {        if (i!= 0)        { cout << endl;        }        SumA = 0;        SumB = 0;        for(i=0;i<n;++i)        { cin>>a[i];        }        for (i=0;i<n;++i)        { cin>>b[i];        }        for (i=0;i<n;++i)        { if (a[i]==b[i]) {     continue; } else if (a[i]==1&&b[i]==2) {     SumA += 6;     continue; } else if(b[i]==1&&a[i]==2) {     SumB += 6;     continue; } else if (a[i]-b[i]==1) {     SumB += a[i]+b[i];     continue; } else if (b[i]-a[i]==1) {     SumA += a[i]+b[i];     continue; } else if (a[i]-b[i]>1) {     SumA += a[i];     continue; } else if (b[i]-a[i]>1) {     SumB += b[i];     continue; }        }        cout<<"A has "<<SumA<<" points. B has "<<SumB<<" points."<<endl;    }    return 0;}

欢迎分享,转载请注明来源:内存溢出

原文地址: http://outofmemory.cn/zaji/4893708.html

(0)
打赏 微信扫一扫 微信扫一扫 支付宝扫一扫 支付宝扫一扫
上一篇 2022-11-12
下一篇 2022-11-12

发表评论

登录后才能评论

评论列表(0条)

保存