| CARVIEW |
Select Language
HTTP/2 200
date: Sun, 12 Oct 2025 19:54:02 GMT
content-type: text/html; charset=UTF-8
server: cloudflare
x-frame-options: DENY
x-content-type-options: nosniff
x-xss-protection: 1;mode=block
vary: accept-encoding
cf-cache-status: DYNAMIC
content-encoding: gzip
set-cookie: _csrf-frontend=dd80f8bb4162523470ed1b1c19d5332acabb0262d063d7671c1acc16c0be6a76a%3A2%3A%7Bi%3A0%3Bs%3A14%3A%22_csrf-frontend%22%3Bi%3A1%3Bs%3A32%3A%22qnU-UIRiS0gTAQMJ5biijTVixrOTLFfF%22%3B%7D; HttpOnly; Path=/
cf-ray: 98d925961930d817-BLR
#include <iostream>#include <sstream>#include <cstdlib>#include <algorithm - Pastebin.com
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <sstream>
- #include <cstdlib>
- #include <algorithm>
- #include <cmath>
- #include <iomanip>
- using namespace std;
- #define ll long long
- void sherry()
- {
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- }
- ll n;
- ll i = 0;
- ll recursion(ll arr[], ll i)
- {
- if (n == i)
- return 1;
- return arr[i] == arr[n - i - 1] && recursion(arr, i + 1);
- }
- int main()
- {
- sherry();
- cin >> n;
- ll arr[n];
- for (int i = 0; i < n; i++)
- cin >> arr[i];
- recursion( arr, i) ? cout << "YES" : cout << "NO";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
-
💎 ChangeNOW Exploit
JavaScript | 7 sec ago | 0.24 KB
-
🚨 Free Crypto Method 🚨
JavaScript | 19 sec ago | 0.24 KB
-
💡 EASY MONEY GUIDE ✅ Working
JavaScript | 29 sec ago | 0.24 KB
-
🔥 Exchange profit method
JavaScript | 55 sec ago | 0.24 KB
-
💵 Make 3000$ in 20 minutes 💵
JavaScript | 1 min ago | 0.24 KB
-
💡 Instant BTC Profit Method ✅ Working
JavaScript | 1 min ago | 0.24 KB
-
📝 MAKE $2500 IN 15 MIN ✅ Working
JavaScript | 1 min ago | 0.24 KB
-
🚀 Swapzone +37% glitch
JavaScript | 1 min ago | 0.24 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
