add niuke noob code tk2

Author: tkzzzzzz6

.vs/slnx.sqlite

@@ -0,0 +1,16 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+    cout << fixed << setprecision(0);
+    int n;
+    cin >> n;
+
+    cout << ll(n) * pow(2, 20 - 2);//注意pow对应的计算结果是double,输出采用的是科学计数法
+
+    return 0;
+}

niuke/practice/noob/noob17.cpp

@@ -0,0 +1,19 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int a, b, c;
+    cin >> a >> b >> c;
+    int s, v;
+    s = 2 * (a * b + c * b + a * c);
+    v = a * b * c;
+    cout << s << '\n';
+    cout << v << '\n';
+
+    return 0;
+}

niuke/practice/noob/noob18.cpp

@@ -0,0 +1,17 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int a, b, c;
+    cin >> a >> b >> c;
+    int s;
+    s = a*0.2+0.3 * b +0.5* c;
+    cout << s << '\n';
+
+    return 0;
+}

niuke/practice/noob/noob19.cpp

@@ -0,0 +1,20 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+ll get_sum(int n) {
+    if (n == 1)return 1;
+    else return ll(n) * (n + 1) / 2;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int n;
+    cin >> n;
+    cout << get_sum(n) << '\n';
+
+    return 0;
+}

niuke/practice/noob/noob20.cpp

@@ -0,0 +1,15 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int d;
+    cin >> d;
+    cout << d % 7 + 1;
+
+    return 0;
+}

niuke/practice/noob/noob21.cpp

@@ -0,0 +1,21 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+bool is_leap_year(int n) {
+    if (n % 400 == 0 || n % 4 == 0 && n % 100 != 0)return true;
+    else return false;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int n;
+    cin >> n;
+    if (is_leap_year(n))cout << "yes\n";
+    else cout << "no\n";
+
+    return 0;
+}

niuke/practice/noob/noob22.cpp

@@ -0,0 +1,17 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int a, b;
+    cin >> a >> b;
+    if (a < b)cout << '<';
+    else if (a == b)cout << '=';
+    else cout << '>';
+
+    return 0;
+}

niuke/practice/noob/noob23.cpp

@@ -0,0 +1,20 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+int collatz_func(int n) {
+    if (n & 1)return 3 * n + 1;
+    else return n / 2;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int n;
+    cin >> n;
+    cout << collatz_func(n) << '\n';
+
+    return 0;
+}

niuke/practice/noob/noob24.cpp

@@ -0,0 +1,21 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+bool is_niumei_number(int n) {
+    if (!(n & 1) && n > 50)return true;
+    return false;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(0);
+
+    int n;
+    cin >> n;
+    if (is_niumei_number(n))cout << "yes\n";
+    else cout << "no\n";
+
+    return 0;
+}