Website Summary Files Commits Branches @commit @diff @stats
path: root / Sem. 5 / Task 5.cpp
diff options
context:
space:
mode:
Commitf05726d51dd6c41c23c337c2d4b0324ad231dbc8 (patch)
Author
 Angeld55 <angel_dimitriev@abv.bg>
2020-11-13 20:45:46 +0200
Committer
 Angeld55 <angel_dimitriev@abv.bg>
2020-11-13 20:45:46 +0200
Filesce8ee1c313676689342299c4e96c3d199d00370e /Sem. 5/Task 5.cpp
Introduction_to_programming_FMI-f05726d51dd6c41c23c337c2d4b0324ad231dbc8.tar
Introduction_to_programming_FMI-f05726d51dd6c41c23c337c2d4b0324ad231dbc8.tar.gz
Introduction_to_programming_FMI-f05726d51dd6c41c23c337c2d4b0324ad231dbc8.zip
Parent8f4b6b75fd57a34d33bb9dd17af305898a8da81e (diff)
added examples sem 5
1 files changed, 33 insertions, 0 deletions
-rw-r--r--Sem. 5/Task 5.cpp33
diff --git a/Sem. 5/Task 5.cpp b/Sem. 5/Task 5.cpp
new file mode 100644
index 0000000..b11de99
--- /dev/null
+++ b/Sem. 5/Task 5.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+ unsigned int n, k;
+ cin >> n >> k;
+
+ //Смятаме n*k. n+n+n...+n (k пъти).
+ //Прилагаме кода от предишната задача k пъти
+
+
+ int result = 0;
+
+ // Изпъллнява се k пъти.
+ for (int t = 0; t < k; t++)
+ {
+
+ //Събира result с n
+ for (int i = 0; i < n; i++)
+ {
+ //Събираме result с 1.
+ int mask = 1;
+ while ((result & mask) > 0)
+ {
+ result ^= mask;
+ mask <<= 1;
+ }
+ result |= mask;
+ }
+ }
+ cout << result << endl;
+} \ No newline at end of file