so what's the point of running a powershell command

EEnceladus oh wait

E

Enceladus•12/13/21, 6:26 PM

when i run it as admin, it's not shown too

Aanic17 so what's the point of running a powershell command

E

Enceladus•12/13/21, 6:27 PM

that's before to run commands as admin, but with the manifest it's better

E

Enceladus•12/13/21, 6:29 PM

bruh

E

Enceladus•12/13/21, 6:29 PM

when i start it as admin, the command doesn't works

E

Enceladus•12/13/21, 6:30 PM

still the same

A

anic17OP•12/13/21, 7:07 PM

Just remove all the PowerShel stuff

A

anic17OP•12/13/21, 7:07 PM

And just run

system("netstat");

system("netstat");

system("netstat");

system("netstat");

Aanic17 And just run ```c system("netstat"); ```

E

Enceladus•12/14/21, 10:01 AM

always the same : "sfc has to be run as admin"

E

Enceladus•12/14/21, 10:12 PM

@Unknown user

A

anic17OP•12/15/21, 6:50 AM

You'll learn what pointers are when you use them

A

anic17OP•12/15/21, 6:50 AM

&

& = address of operator

= value of address

A

anic17OP•12/15/21, 6:51 AM

int a = 12;
int* b = &a;

int a = 12;
int* b = &a;

int a = 12;
int* b = &a;

int a = 12;
int* b = &a;

A

anic17OP•12/15/21, 6:51 AM

is now the address of

A

anic17OP•12/15/21, 6:52 AM

And

*b

*b

*b

*b is 12

A

anic17OP•12/15/21, 6:53 AM

Note that every change you make to

will be the same on

*b

*b

*b

*b

A

anic17OP•12/15/21, 6:53 AM

Because they both are the same memory address

E

Enceladus•12/16/21, 5:00 PM

@Unknown user nice : i took freebooter command to run command as admin in batch and it works ! it's easier :

E

Enceladus•12/16/21, 5:00 PM

system("PowerShell start YOUR COMMAND -verb RunAs");

system("PowerShell start YOUR COMMAND -verb RunAs");

system("PowerShell start YOUR COMMAND -verb RunAs");

system("PowerShell start YOUR COMMAND -verb RunAs");

E

Enceladus•12/22/21, 4:55 PM

@Unknown user do you know how to make a youtube videos downloader (mp3 and mp4) ?

A

anic17OP•12/22/21, 5:20 PM

No

GGameoKiller1912 Click to see attachment

<

<Tim>•12/24/21, 12:27 PM

I would recommend starting out with a function that counts the amount of each letter in a string

<

<Tim>•12/24/21, 12:27 PM

then you can split the string in the middle, call the function twice and compare the results

A

anic17OP•12/24/21, 12:29 PM

And if the character number is odd then add 1 that would be the middle character

<

<Tim>•12/24/21, 12:37 PM

just take the ranges [0; floor(length/2)-1] and [ceil(length/2); length-1]

<

<Tim>•12/24/21, 12:38 PM

or simpler ranges with an if/else

A

anic17OP•12/24/21, 12:44 PM

I was actually coding this for fun

<

<Tim>•12/24/21, 12:49 PM

yeah, looks like a fun little program, time to get my C-compiler out again :D

A

anic17OP•12/24/21, 12:50 PM

Alright I did it

A

anic17OP•12/24/21, 12:51 PM

Don't look at the code quality, it's my first time ever using

qsort()

qsort()

qsort()

qsort()

A

anic17OP•12/24/21, 12:59 PM

That's the output given:

YES
YES
NO
YES
YES
NO
NO

YES
YES
NO
YES
YES
NO
NO

YES
YES
NO
YES
YES
NO
NO

YES
YES
NO
YES
YES
NO
NO

A

anic17OP•12/24/21, 12:59 PM

First

YES

YES

YES

YES is because

6

6 is the same in the 2 halves

A

anic17OP•12/24/21, 1:00 PM

Here goes your assignement lol

A

anic17OP•12/24/21, 1:00 PM

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

#ifndef _bool_true_false_are_defined
typedef short bool;
#define false 0
#define true 1
#endif

int cmpfunc(const void *a, const void *b)
{
    return *(char *)a - *(char *)b;
}

bool lapindrome(char *str)
{
    size_t len = strlen(str);

    int split = len / 2;

    if ((len % 2))
    {
        split++;
    }

    char *part1 = (char *)malloc(split + 1); // For NULL character
    char *part2 = (char *)malloc(split + 1);
    memcpy(part1, str, split);
    memcpy(part2, str + len / 2, split);

    qsort(part1, strlen(part1), sizeof(char), cmpfunc);
    qsort(part2, strlen(part2), sizeof(char), cmpfunc);
    if (!strcmp(part1, part2))
    {
        return 1;
    }

    return 0;
}

int main()
{
    char* lapindrome_test[] = {"6", "gaga", "abcde", "rotor", "xyzxy", "abbaab", "ababc"};

    for(int i = 0; i < sizeof(lapindrome_test) / sizeof(lapindrome_test[0]); i++)
    {
        if(lapindrome(lapindrome_test[i]))
        {
            puts("YES");
        } else {
            puts("NO");
        }
    }
    return EXIT_SUCCESS;
}

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

#ifndef _bool_true_false_are_defined
typedef short bool;
#define false 0
#define true 1
#endif

int cmpfunc(const void *a, const void *b)
{
    return *(char *)a - *(char *)b;
}

bool lapindrome(char *str)
{
    size_t len = strlen(str);

    int split = len / 2;

    if ((len % 2))
    {
        split++;
    }

    char *part1 = (char *)malloc(split + 1); // For NULL character
    char *part2 = (char *)malloc(split + 1);
    memcpy(part1, str, split);
    memcpy(part2, str + len / 2, split);

    qsort(part1, strlen(part1), sizeof(char), cmpfunc);
    qsort(part2, strlen(part2), sizeof(char), cmpfunc);
    if (!strcmp(part1, part2))
    {
        return 1;
    }

    return 0;
}

int main()
{
    char* lapindrome_test[] = {"6", "gaga", "abcde", "rotor", "xyzxy", "abbaab", "ababc"};

    for(int i = 0; i < sizeof(lapindrome_test) / sizeof(lapindrome_test[0]); i++)
    {
        if(lapindrome(lapindrome_test[i]))
        {
            puts("YES");
        } else {
            puts("NO");
        }
    }
    return EXIT_SUCCESS;
}

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

#ifndef _bool_true_false_are_defined
typedef short bool;
#define false 0
#define true 1
#endif

int cmpfunc(const void *a, const void *b)
{
    return *(char *)a - *(char *)b;
}

bool lapindrome(char *str)
{
    size_t len = strlen(str);

    int split = len / 2;

    if ((len % 2))
    {
        split++;
    }

    char *part1 = (char *)malloc(split + 1); // For NULL character
    char *part2 = (char *)malloc(split + 1);
    memcpy(part1, str, split);
    memcpy(part2, str + len / 2, split);

    qsort(part1, strlen(part1), sizeof(char), cmpfunc);
    qsort(part2, strlen(part2), sizeof(char), cmpfunc);
    if (!strcmp(part1, part2))
    {
        return 1;
    }

    return 0;
}

int main()
{
    char* lapindrome_test[] = {"6", "gaga", "abcde", "rotor", "xyzxy", "abbaab", "ababc"};

    for(int i = 0; i < sizeof(lapindrome_test) / sizeof(lapindrome_test[0]); i++)
    {
        if(lapindrome(lapindrome_test[i]))
        {
            puts("YES");
        } else {
            puts("NO");
        }
    }
    return EXIT_SUCCESS;
}

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

#ifndef _bool_true_false_are_defined
typedef short bool;
#define false 0
#define true 1
#endif

int cmpfunc(const void *a, const void *b)
{
    return *(char *)a - *(char *)b;
}

bool lapindrome(char *str)
{
    size_t len = strlen(str);

    int split = len / 2;

    if ((len % 2))
    {
        split++;
    }

    char *part1 = (char *)malloc(split + 1); // For NULL character
    char *part2 = (char *)malloc(split + 1);
    memcpy(part1, str, split);
    memcpy(part2, str + len / 2, split);

    qsort(part1, strlen(part1), sizeof(char), cmpfunc);
    qsort(part2, strlen(part2), sizeof(char), cmpfunc);
    if (!strcmp(part1, part2))
    {
        return 1;
    }

    return 0;
}

int main()
{
    char* lapindrome_test[] = {"6", "gaga", "abcde", "rotor", "xyzxy", "abbaab", "ababc"};

    for(int i = 0; i < sizeof(lapindrome_test) / sizeof(lapindrome_test[0]); i++)
    {
        if(lapindrome(lapindrome_test[i]))
        {
            puts("YES");
        } else {
            puts("NO");
        }
    }
    return EXIT_SUCCESS;
}

<

<Tim>•12/24/21, 1:15 PM

noice

<

<Tim>•12/24/21, 1:16 PM

just to let you feel better about the code quality: here's the same in ugly and short JavaScript xD

<

<Tim>•12/24/21, 1:16 PM

<script>
s=prompt()
x=[],y=1
n=s.length/2
for(c of s.substr(0,n))x[c]=(x[c]??0)+1
for(c of s.substr(n+.5,n))--x[c]
for(_ in x)y&=x[_]===0
alert(!!y)
</script>

<script>
s=prompt()
x=[],y=1
n=s.length/2
for(c of s.substr(0,n))x[c]=(x[c]??0)+1
for(c of s.substr(n+.5,n))--x[c]
for(_ in x)y&=x[_]===0
alert(!!y)
</script>

<script>
s=prompt()
x=[],y=1
n=s.length/2
for(c of s.substr(0,n))x[c]=(x[c]??0)+1
for(c of s.substr(n+.5,n))--x[c]
for(_ in x)y&=x[_]===0
alert(!!y)
</script>

<script>
s=prompt()
x=[],y=1
n=s.length/2
for(c of s.substr(0,n))x[c]=(x[c]??0)+1
for(c of s.substr(n+.5,n))--x[c]
for(_ in x)y&=x[_]===0
alert(!!y)
</script>

<

<Tim>•12/24/21, 1:20 PM

Well, I wrote it myself lol

<

<Tim>•12/24/21, 1:20 PM

Minified js would be much shorter i think

<

<Tim>•12/24/21, 1:22 PM

But it isn't obfuscated, the algorithm is pretty obvious: you increment the array positions for the first half and decrement them for the second half. Then you look if the amounts for all letters is zero