aboutsummaryrefslogtreecommitdiff
path: root/Semestr 4/ask/lista5/zad2.c
diff options
context:
space:
mode:
authorFranciszek Malinka <franciszek.malinka@gmail.com>2021-10-05 21:49:54 +0200
committerFranciszek Malinka <franciszek.malinka@gmail.com>2021-10-05 21:49:54 +0200
commitc5fcf7179a83ef65c86c6a4a390029149e518649 (patch)
treed29ffc5b86a0d257453cedcf87d91a13d8bf3b0d /Semestr 4/ask/lista5/zad2.c
parentf8a88b6a4aba1f66d04711a9330eaba49a50c463 (diff)
Duzy commit ze smieciami
Diffstat (limited to 'Semestr 4/ask/lista5/zad2.c')
-rw-r--r--Semestr 4/ask/lista5/zad2.c44
1 files changed, 0 insertions, 44 deletions
diff --git a/Semestr 4/ask/lista5/zad2.c b/Semestr 4/ask/lista5/zad2.c
deleted file mode 100644
index ab9cb54..0000000
--- a/Semestr 4/ask/lista5/zad2.c
+++ /dev/null
@@ -1,44 +0,0 @@
-#include <stdio.h>
-#include <stdint.h>
-
-long puzzle2(char *rdi /* rdi */, char *rsi /* rsi */) {
- char *rax = rdi;
-L3:
- char r9b = *rax;
- char *r8 = rax + 1;
- char *rdx = rsi;
-L2:
- char cl = *rdx;
- rdx++;
- if (cl == 0) {
- goto L4;
- }
- if (cl != r9b) {
- goto L2;
- }
- rax = r8;
- goto L3;
-L4:
- return rax - rdi;
-}
-
-
-// funkcja sprawdza jaka jest pierwsza litera z s która nie występuje w d
-// jesli wszystkie występują, to zwróci długość s.
-long puzzle2_decoded(char *s /* rdi */, char *d /* rsi */) {
- for (char *result = s ; ; result++) {
- char first = *result;
- char *crawl = d;
- for (char *crawl = d; *crawl != first; crawl++) {
- if (*crawl == 0) {
- return result - s;
- }
- }
- }
-}
-
-
-
-int main() {
-
-} \ No newline at end of file