26 条题解
- 
  3
12206戴爱佳 (12206戴爱佳) LV 7 @ 2022-01-07 16:01:46
#include<iostream>
using namespace std;
int main()
{
int hb,st,kl,x;
cin>>hb>>st>>kl;
if(hb<st)
if(kl<hb)
x=kl;
else
x=hb;
else
if(kl<st)
x=kl;
else
x=st;
cout<<x*2;
return 0;
}
家人们绝对正确 - 
  2@ 2021-12-25 11:38:38
#include<iostream> using namespace std; int main() { int han,shu,ke,x; cin>>han>>shu>>ke; if(han<shu) if(ke<han) x=ke; else x=han; else if(ke<shu) x=ke; else x=shu; cout<<x*2; return 0; } - 
  1@ 2024-07-20 11:27:25
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,minn=10000;
cin>>a>>b>>c;
if(minn>a)
minn=a;
if(minn>b)
minn=b;
if(minn>c)
minn=c;
cout<<minn*2;
} - 
  1@ 2024-06-25 18:40:57
省的钱数取决于套餐数,而套餐数又取决于购买数量最少的那种商品
#include<iostream> using namespace std; int main(){ ios::sync_with_stdio(false); int a, b, c; cin >> a >> b >> c; cout << 2*(min(min(a, b), c)); return 0; } - 
  0@ 2025-07-20 14:18:37
#include <bits/stdc++.h> using namespace std; int l,m,n; int main() { cin>>l>>m>>n; cout<<2*min(l,min(m,n)); return 0; } - 
  0@ 2023-07-22 21:58:50
#include<bits/stdc++.h> using namespace std; int main() { int a,b,c,n; cin>>a>>b>>c; n=min(a,min(b,c)); cout<<n*2; }保证正确 !!!
 - 
  0@ 2022-07-01 14:28:10
#include<iostream>
using namespace std;
int main()
{
int a,b,c,min;
cin>>a>>b>>c;
if(a<b)
if(c<a)
min=c;
else
min=a;
else
if(c<b)
min=c;
else
min=b;
cout<<min*2<<endl;
return 0;
} - 
  -2@ 2021-12-14 20:36:24
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -2@ 2021-12-14 20:36:06
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2<<endl;
return 0;
} - 
  -3@ 2021-12-14 20:37:45
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:41
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:38
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:35
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:32
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:09
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:06
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:37:02
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:36:31
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:36:28
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} - 
  -3@ 2021-12-14 20:36:19
#include<iostream>
using namespace std;
int main()
{
int han,shu,ke,x;
cin>>han>>shu>>ke;
if(han<shu)
if(ke<han)
x=ke;
else
x=han;
else
if(ke<shu)
x=ke;
else
x=shu;
cout<<x*2;
return 0;
} 
信息
- ID
 - 1698
 - 难度
 - 2
 - 分类
 - (无)
 - 标签
 - 递交数
 - 233
 - 已通过
 - 135
 - 通过率
 - 58%
 - 被复制
 - 2
 - 上传者