标签:std set == algorithm NPU mes inpu using turn
#include<iostream> #include<algorithm> #include<iomanip> using namespace std; int input[3][3]; int max(int *n){ int *m=max_element(n,n+3); return m-n; } int main(){ for(int i=0;i!=3;++i) { for(int j=0;j!=3;++j){ cin>>input[i][j]; } } double product=1; for(int i=0;i!=3;++i){ int n=max(input[i]); if(n==0) cout<<"W"; else if(n==1) cout<<"T"; else cout<<"L"; cout<<" "; product *=input[i][n]; } product *=0.65; product =(product-1)*2; cout<<fixed<<setprecision(2)<<product; return 0; }
标签:std set == algorithm NPU mes inpu using turn
原文地址:https://www.cnblogs.com/chuan-chuan/p/11416579.html