第十一章模拟 2 AcWing 1483. 世界杯投注

男娘i 2024-03-31 12:24 51阅读 0赞

## 第十一章 模拟 2 AcWing 1483. 世界杯投注 ##

### 原题链接 ###

[AcWing 1483. 世界杯投注][AcWing 1483.]

### 算法标签 ###

模拟

### 思路 ###

依题意模拟

### 代码 ###

#pragma GCC optimize(2)
    #pragma GCC optimize(3)
    #include<bits/stdc++.h>
    #define int long long
    #define xx first
    #define yy second
    #define ump unordered_map
    #define us unordered_set
    #define pq priority_queue
    #define rep(i, a, b) for(int i=a;i<b;++i)
    #define Rep(i, a, b) for(int i=a;i>=b;--i)
    using namespace std;
    typedef pair<int, int> PII;
    const int N=10005, inf=0x3f3f3f3f3f3f3f3f, mod=1e9+7;
    const double Exp=1e-8;
    //int t, n, m, cnt, ans;
    double w, l, t, mx, res;
    inline int rd(){
       int s=0,w=1;
       char ch=getchar();
       while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
       while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
       return s*w;
    }
    void put(int x) {
        if(x<0) putchar('-'),x=-x;
        if(x>=10) put(x/10);
        putchar(x%10^48);
    }
    signed main(){
    	ios::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
    	res=1;
    	rep(i, 0, 3){
    	    scanf("%lf %lf %lf", &w, &t, &l);
    	    mx=max({w, t, l});
    	    res*=mx;
    	    if(mx==w){
    	        printf("W ");
    	    }else if(mx==t){
    	        printf("T ");
    	    }else{
    	        printf("T ");
    	    }
    	}
    	printf("%.2lf", (res*0.65-1)*2);
    	return 0;
    }

### 参考文献 ###

[AcWing 1483. 世界杯投注（PAT甲级辅导课）y总视频讲解][AcWing 1483. _PAT_y]

原创不易  
转载请标明出处  
如果对你有所帮助 别忘啦点赞支持哈  
![在这里插入图片描述][9cb4cb80a18345158f8a69e2f196e5b9.png]

[AcWing 1483.]: https://www.acwing.com/problem/content/1485/
[AcWing 1483. _PAT_y]: https://www.acwing.com/video/1242/
[9cb4cb80a18345158f8a69e2f196e5b9.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/31/df7c572784034403a6bab9e4b8dc3d7f.png