1 条题解
-
0
C :
#include <stdio.h> int f() { int max = 0 ; int min = 10 ; int totle = 0 ; for( int i = 0 ; i < 6 ; i ++ ) { int t ; scanf("%d" , &t ) ; if( t > max ) max = t ; if( t < min ) min = t ; totle += t ; } return totle - min - max ; } int main() { int XDZ = f() ; int YY = f() ; if( XDZ > YY ) { printf("Victory\n") ; } else if( XDZ == YY ) { printf("Dogfall\n") ; } else { printf("Defeat\n") ; } return 0 ; }
C++ :
#include<iostream> using namespace std; int main() { int d, a[11]={0}, b[11] = {0}; int sa = 0, sb = 0; for(int i = 0; i < 6; ++i) cin>>d, a[d]++; for(int i = 0; i < 6; ++i) cin>>d, b[d]++; for(int i = 10; i >= 0; --i) if( a[i] ){ a[i]--; break; } for(int i = 0; i <= 10; ++i) if( a[i] ){ a[i]--; break; } for(int i = 10; i >= 0; --i) if( b[i] ){ b[i]--; break; } for(int i = 0; i <= 10; ++i) if( b[i] ){ b[i]--; break; } for(int i = 0; i <= 10; ++i) while(a[i]--) sa += i; for(int i = 0; i <= 10; ++i) while(b[i]--) sb += i; //cout<<sa<<endl<<sb<<endl; if( sa > sb ) cout<<"Victory"<<endl; else if( sa == sb ) cout<<"Dogfall"<<endl; else cout<<"Defeat"<<endl; return 0; }
Pascal :
var x,y:array [1..6]of integer; max1,max2,min1,min2,total1,total2,i:integer; begin for i:=1 to 6 do begin read(x[i]); if x[i]>max1 then max1:=x[i]; if x[i]>min1 then min1:=x[i]; total1:=x[i]+total1; end; for i:=1 to 6 do begin read(y[i]); if y[i]>max2 then max2:=y[i]; if y[i]>min2 then min2:=y[i]; total2:=y[i]+total2; end; total1:=total1-max1-min1; total2:=total2-max2-min2; if total1>total2 then writeln('Victory') else if total1=total2 then writeln('Dogfall') else writeln('Defeat'); end.
- 1
信息
- ID
- 814
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者