From f65e7733a59efe8bfd8cfe33e699c1e750deb274 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Anton=20Luka=20=C5=A0ijanec?= Date: Tue, 14 May 2024 22:19:27 +0200 Subject: searphp nokia 6020 friendly (button->inputsubmit) --- prog/sear.php/css.css | 10 ++-- prog/sear.php/index.php | 12 ++-- "\305\241ola/ds2/n4.c" | 25 +++++++++ "\305\241ola/p2/dn/23kol1a.c" | 18 ++++++ "\305\241ola/p2/dn/DN09a_1.txt" | 2 + "\305\241ola/p2/dn/DN09a_63230317.c" | 106 +++++++++++++++++++++++++++++++++++ "\305\241ola/p2/vaja/mravlja.c" | 10 ++++ 7 files changed, 172 insertions(+), 11 deletions(-) create mode 100644 "\305\241ola/ds2/n4.c" create mode 100644 "\305\241ola/p2/dn/23kol1a.c" create mode 100644 "\305\241ola/p2/dn/DN09a_1.txt" create mode 100644 "\305\241ola/p2/dn/DN09a_63230317.c" create mode 100644 "\305\241ola/p2/vaja/mravlja.c" diff --git a/prog/sear.php/css.css b/prog/sear.php/css.css index dc78c9f..8b3bf6d 100644 --- a/prog/sear.php/css.css +++ b/prog/sear.php/css.css @@ -38,7 +38,7 @@ } } -input, textarea, button { +input, textarea { background: var(--bgc2); color: var(--fgc1); } @@ -79,7 +79,7 @@ code { color: var(--fgcodec); background-color: var(--bgcodec); } -input[type=text], button { +input[type=text], input[type=submit] { height: 1cm; font-size: large; } @@ -97,7 +97,7 @@ input[name=q] { flex-grow: 4; width: 100%; } -button { +input[type=submit] { flex-basis: 12.5%; } .SC_LOG_ERROR { @@ -128,9 +128,9 @@ button { .result img { height: 10em; } -button::after { +input[type=submit]::after { content: attr(value); } -button span { /* rationale: links browser does not support CSS and emojis, therefore it'll show */ +input[type=submit] span { /* rationale: links browser does not support CSS and emojis, therefore it'll show */ display: none; /* basic default text instead of emojis. */ } /* if browser does not support ::after, content or attr, but supports other CSS, button is blank */ diff --git a/prog/sear.php/index.php b/prog/sear.php/index.php index 2e695c5..9b9cbd4 100644 --- a/prog/sear.php/index.php +++ b/prog/sear.php/index.php @@ -122,15 +122,15 @@ function template ($title, $queryinfo, $body, $query = "", $additionalform = "", $query = htmlspecialchars($query); $title = htmlspecialchars($title); $buttons = " - - - + => + 1. + [^] "; if ($imgfirst) { $buttons = " - - - + [^] + => + 1. "; } return " diff --git "a/\305\241ola/ds2/n4.c" "b/\305\241ola/ds2/n4.c" new file mode 100644 index 0000000..23d73ca --- /dev/null +++ "b/\305\241ola/ds2/n4.c" @@ -0,0 +1,25 @@ +#include +#include +#include +#define KVADRAT(x) ((x)*(x)) +int main (int argc, char ** argv) { + assert(argc >= 2); + int n = atoi(argv[1]); + int povezanost[n*n][n*n]; + for (int i = 0; i < n*n; i++) { + for (int j = 0; j < n*n; j++) { + int istolpec = i/n; + int ivrstica = i%n; + int jstolpec = j/n; + int jvrstica = j%n; + povezanost[i][j] = KVADRAT(istolpec-jstolpec)+KVADRAT(jvrstica-ivrstica) == 5 ? 1 : 0; + } + } + for (int i = 0; i < n*n; i++) { + for (int j = 0; j < n*n; j++) { + printf("%d\t", povezanost[i][j]); + } + printf("\n"); + } + return 0; +} diff --git "a/\305\241ola/p2/dn/23kol1a.c" "b/\305\241ola/p2/dn/23kol1a.c" new file mode 100644 index 0000000..bafd30e --- /dev/null +++ "b/\305\241ola/p2/dn/23kol1a.c" @@ -0,0 +1,18 @@ +#include +#include +#define MAX(x,y) ((x)>(y)?(x):(y)) +int vsote (int n, int m) { + int r = 0; + if (!n) + return 1; + for (int a = 1; a <= n; a++) + for (int b = MAX(m, a); a*b <= n; b++) + if (n-a*b >= 0) + r += vsote(n-a*b, m); + return r; +} +int main (void) { + int n, m; + scanf("%d %d\n", &n, &m); + printf("%d\n", vsote(n, m)); +} diff --git "a/\305\241ola/p2/dn/DN09a_1.txt" "b/\305\241ola/p2/dn/DN09a_1.txt" new file mode 100644 index 0000000..788f7a3 --- /dev/null +++ "b/\305\241ola/p2/dn/DN09a_1.txt" @@ -0,0 +1,2 @@ +10 4 +1 2 3 4 5 6 8 9 10 16 diff --git "a/\305\241ola/p2/dn/DN09a_63230317.c" "b/\305\241ola/p2/dn/DN09a_63230317.c" new file mode 100644 index 0000000..64c5e2b --- /dev/null +++ "b/\305\241ola/p2/dn/DN09a_63230317.c" @@ -0,0 +1,106 @@ +#include +#include +#include +#include +#include +#define ARRSIZ 32 +// komentar 2024-05-13: testi iz ucilnica2223 passajo, toda sem prepozen za oddajo +struct množica { + int n; + int arr[ARRSIZ]; +}; +void najdi_targete (struct množica ** shramba, int * shramba_len, int * shramba_sizeof, int n, int * t, int * stack, int globina, int target) { + if (target < 0) + return; + if (!target) { + if (*shramba_len >= *shramba_sizeof) + *shramba = realloc(*shramba, (*shramba_sizeof *= 2)*sizeof(struct množica)); + memcpy((*shramba)[*shramba_len].arr, stack, sizeof(int)*globina); + (*shramba)[(*shramba_len)++].n = globina; + return; + } + for (int i = globina == 0 ? 0 : stack[globina-1]+1; i < n; i++) { + stack[globina] = i; + najdi_targete(shramba, shramba_len, shramba_sizeof, n, t, stack, globina+1, target-t[i]); + } +} +void najdi_množice (struct množica * shramba, int shramba_len, int * stack, int * t, bool * used, int n, int globina, int k) { + if (globina == k) { + for (int i = 0; i < n; i++) + if (!used[i]) + return; + printf("{"); + for (int i = 0; i < k; i++) { + printf("{"); + int donefirst = false; + for (int j = 0; j < shramba[stack[i]].n; j++) { + printf("%s%d", donefirst ? ", " : "", t[shramba[stack[i]].arr[j]]); + donefirst = true; + } + printf("}"); + if (i != k-1) + printf(", "); + } + printf("}\n"); + return; + } + for (int i = globina == 0 ? 0 : stack[globina-1]+1; i < shramba_len; i++) { + bool contpls = false; + for (int j = 0; j < shramba[i].n; j++) + if (used[shramba[i].arr[j]]) { + contpls = true; + break; + } + if (contpls) + continue; + for (int j = 0; j < shramba[i].n; j++) + used[shramba[i].arr[j]] = true; + stack[globina] = i; + najdi_množice(shramba, shramba_len, stack, t, used, n, globina+1, k); + for (int j = 0; j < shramba[i].n; j++) + used[shramba[i].arr[j]] = false; + } +} +int compar (const void * a, const void * b) { + struct množica * c = ((struct množica *) a); + struct množica * d = ((struct množica *) b); + int e = INT_MAX; + int f = INT_MAX; + for (int i = 0; i < c->n; i++) { + if (c->arr[i] < e) + e = c->arr[i]; + } + for (int i = 0; i < d->n; i++) { + if (d->arr[i] < f) + f = d->arr[i]; + } + if (e == f) + return 0; + return e > f ? 1 : -1; +} +int main (void) { + int n, k, sum = 0; + scanf("%d %d\n", &n, &k); + int t[n]; + for (int i = 0; i < n; i++) { + scanf("%d", &t[i]); + sum += t[i]; + } + if (sum % k) + return 0; + int shramba_sizeof = 2; + int shramba_len = 0; + struct množica * shramba = malloc(sizeof (struct množica) * shramba_sizeof); + int stack[ARRSIZ]; + najdi_targete(&shramba, &shramba_len, &shramba_sizeof, n, t, stack, 0, sum/k); + qsort(shramba, shramba_len, sizeof (struct množica), compar); + for (int i = 0; i < shramba_len; i++) { + for (int j = 0; j < shramba[i].n; j++) { + fprintf(stderr, "%d, ", t[shramba[i].arr[j]]); + } + fprintf(stderr, "\n"); + } + bool used[n]; + memset(used, 0, sizeof used); + najdi_množice(shramba, shramba_len, stack, t, used, n, 0, k); +} diff --git "a/\305\241ola/p2/vaja/mravlja.c" "b/\305\241ola/p2/vaja/mravlja.c" new file mode 100644 index 0000000..b22ad05 --- /dev/null +++ "b/\305\241ola/p2/vaja/mravlja.c" @@ -0,0 +1,10 @@ +#include +#include +#include +int main (int argc, char ** argv) { + assert(argc == 1+2); + int m = atoi(argv[1]); + int n = atoi(argv[2]); + int tabela[m]; + for () +} -- cgit v1.2.3