diff options
| author | Syndamia <kamen@syndamia.com> | 2024-01-05 08:17:59 +0200 |
|---|---|---|
| committer | Syndamia <kamen@syndamia.com> | 2024-01-05 08:17:59 +0200 |
| commit | 5e2d33632ed1dfc689f14ebf1a782239411d8534 (patch) | |
| tree | 3208b071ba14b549392b7aee321cdf605a0a29d5 /week09/ex2.cpp | |
| parent | 6c84273107288d6c97c80117b0743dd5b8188144 (diff) | |
| download | upp-2023-solutions-5e2d33632ed1dfc689f14ebf1a782239411d8534.tar upp-2023-solutions-5e2d33632ed1dfc689f14ebf1a782239411d8534.tar.gz upp-2023-solutions-5e2d33632ed1dfc689f14ebf1a782239411d8534.zip | |
[w9] Added solutions for first 3 exercises
Diffstat (limited to 'week09/ex2.cpp')
| -rw-r--r-- | week09/ex2.cpp | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/week09/ex2.cpp b/week09/ex2.cpp new file mode 100644 index 0000000..73ec11d --- /dev/null +++ b/week09/ex2.cpp @@ -0,0 +1,23 @@ +#include <iostream> + +int main() { + size_t N = 0; + std::cin >> N; + + char* str = new char[N+1]; + std::cin.ignore(); + std::cin.getline(str, N+1); + + size_t mid = N / 2; + for (size_t i = mid; i < N; i++) { + std::cout << str[i]; + } + for (size_t i = 0; i < mid; i++) { + std::cout << str[i]; + } + std::cout << std::endl; + /* Как може да направим горната логика със само един цикъл? + * Подсказка: модулно деление */ + + delete[] str; +} |
