baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-24 02:28:47 +00:00
Code Releases Activity

P2433 【深基1-2】小学数学 N 合一

Browse Source 
R41970634
This commit is contained in:
Baoshuo Ren 2020-11-15 21:00:52 +08:00 committed by Baoshuo Ren
parent c3c888b0a5
commit e93f7eacc9
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 58 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

58
problem/P2433/P2433.cpp Normal file
View File

@ -0,0 +1,58 @@
#include<bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
if (T == 1) {
cout << "I love Luogu!";
}
else if (T == 2) {
cout << 2 + 4 << " " << 10 - 2 - 4;
}
else if (T == 3) {
cout << 3 << endl
<< 12 << endl
<< 2 << endl;
}
else if (T == 4) {
printf("%.3lf\n", 500.0 / 3.0);
}
else if (T == 5) {
cout << 15 << endl;
}
else if (T == 6) {
cout << sqrt(6 * 6 + 9 * 9) << endl;
}
else if (T == 7) {
cout << 110 << endl
<< 90 << endl
<< 0 << endl;
}
else if (T == 8) {
cout << 3.141593 * 5 * 2 << endl
<< 3.141593 * 5 * 5 << endl
<< 4.0 / 3 * 3.141593 * 5 * 5 * 5 << endl;
}
else if (T == 9) {
cout << 22 << endl;
}
else if (T == 10) {
cout << 9 << endl;
}
else if (T == 11) {
cout << 100.0 / (8 - 5) << endl;
}
else if (T == 12) {
cout << 13 << endl
<< "R" << endl;
}
else if (T == 13) {
cout << floor(pow((3.141593 * 4 * 4 * 4 * 4 / 3 + 3.141593 * 10 * 10 * 10 * 4 / 3), 1.0 / 3)) << endl;
}
else if (T == 14) {
cout << 50 << endl;
}
return 0;
}