/prog/ - I'm worthless :(

Name: Anonymous 2009-02-03 21:31

What can I program to test myself? I need something challenging to check whether I really am worthless or not.

Thanks /prog/.

Name: Anonymous 2009-02-03 21:38



Problem 9 - Howmany



Write a program to read two strings, A and B, of no more then 20 characters each.  Each of these strings will consist of letters and there will be no spaces within the strings.  Each string will be on one line.  You program than determines and writes the largest n such that the first n letters of A occur in B in exactly the same order.



Examples:



Input:

BBISEE

BRIBBSIEEGBE

Output is:

3



Input:

BBISEE

BISEIEF

Output is:

1



Input:

ABCXYT

AAABBCDDYXT

Output is:

4

Name: Anonymous 2009-02-03 21:39

a scheme compiler

Name: Anonymous 2009-02-03 21:53

What are you bad at and want to learn more about?
A video codec?
A dynamic binary translator?
An optimizing compiler?
A software synthesizer?
A machine translator for natural languages?
A persistent multiclient prototype friendly code environment for your favorite dynamic language?

Name: Anonymous 2009-02-03 22:09

An internet enabled enterprise application suite?

Name: Anonymous 2009-02-03 22:34

>>1
well, if you're ^{^over} 12 years old and haven't already written your own ENTERPRISE JAVA EE VM, then you're pretty _{_worthless}

Name: Anonymous 2009-02-03 22:45

Write a program. Now write two.

Name: Anonymous 2009-02-04 1:17

>>1
>>4's suggestions are really good and tend to be challenging pieces of code to write from different perspectives.

Name: Anonymous 2009-02-04 1:39

Project Euler thread over

Name: Anonymous 2009-02-04 4:19

Write a machine code interpreter for javascript. And then port windows XP to firefox.

Name: Anonymous 2009-02-04 12:55

>>11
It would take several years to boot.

Name: Anonymous 2009-02-04 14:19

Have you read your SICP today?

Name: Anonymous 2009-02-04 14:24

>>12
What about in Chrome?

Name: Anonymous 2009-02-04 14:26

>>11
I think I read recently that C programs can be compiled into Flash just like ActionScript can, which means they would use the same VM. It might then be possible to write something similar for SpiderMonkey/Tracemonkey, and then compile a VM onto the JS VM, then run it in the browser.

Name: Anonymous 2009-02-04 15:21

>>14
Then you would have two problems

Name: Anonymous 2009-02-04 18:54

>>15
Then you would have three problems.

Name: Anonymous 2009-02-04 18:57

>>15
The problem of enumerating the number of problems with this approach is NP-complete.

Name: Anonymous 2009-02-04 20:43

Do the Facebook developer problems. They're pretty nuts. Submit a resume to fb if you do some of them.

Name: Anonymous 2009-02-04 21:11

project euler problems

/thread.

Name: Over 21 Thread 2009-02-04 22:12

>>20
Error: /thread: Thread already over (see >>9) in libshiichan!eval_post+0x19c in libshiichan!handle_request+0x32 ... 155 stack frames ... in world4ch!main+0x08

Name: Anonymous 2009-02-05 0:57

>>21
wow, you pretty clever

maybe if u pay me enuf, i'll let u in my private area of hacks ;)

Name: Anonymous 2009-02-05 14:47

A program that tells whether a chosen picture is CP or not.

Name: Anonymous 2009-02-05 16:08

>>23

for (@ARGV) {

    if (/^\d{13}\.jpe?g$/i and rand() > .5) {

        print("Yup, it's CP\n");

    }

}

Name: Annoymous 2009-02-05 16:46

>>24
I do not think that would work well enough to not compute a penis

Name: Anonymous 2009-02-05 19:02

>>24
i tried that on my CP folder and it only works ^¹/_₂ the time.

Name: Anonymous 2009-02-05 19:45

>>24
I tried that on my CP folder and it only works ¼ the time.
I'm canceling my subscription to that site!

Name: Anonymous 2009-02-05 22:50

Determine if two regular expressions are equivalent. That is, the set of languages denoted by regular expressions R1 and R2 are the same.

http://en.wikipedia.org/wiki/Regular_language if you don't know what a regular language is.

Good luck.

Name: Anonymous 2009-02-06 0:25

>>28
You can do that in PHP quite easily:
echo regular_language_equiv($R1, $R2);

Name: !!kHbdbucBDDpi6ms 2009-02-06 1:26

Write a graphics API that uses hardware acceleration.

Name: Anonymous 2009-02-06 15:43

Copy this, but give it some user interface so I can choose some options. Allowing the user to set the "distance buggy runs before program stops" and "how many runs in one bunch beofre breeding" etc.

http://www.wreck.devisland.net/ga/

I'm on lunix, so decompiling the SWF and re-compiling it would be better than some VisualC# with .net abomination.

Name: Anonymous 2009-02-06 15:56

>>31
thats pretty nifty. how long did it take to get an optimal solution on your first run?

Name: Anonymous 2009-02-06 18:32

I'm using eee 701 4g, so it's slow.

"optimal" is tricky, but a few hours got a good result.

But there's a "cliff of death". Many buggies make it over that, but you can see they're about to land on the red cargo when the time limit runs out. Because they got far¹ they score high. It'd be great if I could set the time limit to run just a bit longer, anything crashing after "cliff of death gets culled.

¹ see also walking robots where a very tall robot that falls over "wins" because head travels far.

Name: Anonymous 2009-02-07 13:08

>>31

Anyone want to hax / decompile / copy this swf, but give it some user input options?

Name: Anonymous 2009-03-06 6:11

The vomit rising until my throat Incapable.

I'm worthless :(

Name: Anonymous 2009-02-03 21:31

Name: Anonymous 2009-02-03 21:38

Name: Anonymous 2009-02-03 21:39

Name: Anonymous 2009-02-03 21:53

Name: Anonymous 2009-02-03 22:09

Name: Anonymous 2009-02-03 22:34

Name: Anonymous 2009-02-03 22:45

Name: Anonymous 2009-02-04 1:17

Name: Anonymous 2009-02-04 1:39

Name: Anonymous 2009-02-04 4:19

Name: Anonymous 2009-02-04 12:55

Name: Anonymous 2009-02-04 14:19

Name: Anonymous 2009-02-04 14:24

Name: Anonymous 2009-02-04 14:26

Name: Anonymous 2009-02-04 15:21

Name: Anonymous 2009-02-04 18:54

Name: Anonymous 2009-02-04 18:57

Name: Anonymous 2009-02-04 20:43

Name: Anonymous 2009-02-04 21:11

Name: Over 21 Thread 2009-02-04 22:12

Name: Anonymous 2009-02-05 0:57

Name: Anonymous 2009-02-05 14:47

Name: Anonymous 2009-02-05 16:08

Name: Annoymous 2009-02-05 16:46

Name: Anonymous 2009-02-05 19:02

Name: Anonymous 2009-02-05 19:45

Name: Anonymous 2009-02-05 22:50

Name: Anonymous 2009-02-06 0:25

Name: !!kHbdbucBDDpi6ms 2009-02-06 1:26

Name: Anonymous 2009-02-06 15:43

Name: Anonymous 2009-02-06 15:56

Name: Anonymous 2009-02-06 18:32

Name: Anonymous 2009-02-07 13:08

Name: Anonymous 2009-03-06 6:11

Name: Anonymous 2010-11-26 1:54

Name: Anonymous 2010-12-20 16:16

Name: Anonymous 2011-02-04 17:14

I'm worthless :(

1 Name: Anonymous 2009-02-03 21:31

2 Name: Anonymous 2009-02-03 21:38

3 Name: Anonymous 2009-02-03 21:39

4 Name: Anonymous 2009-02-03 21:53

5 Name: Anonymous 2009-02-03 22:09

6 Name: Anonymous 2009-02-03 22:34

7 Name: Anonymous 2009-02-03 22:45

8 Name: Anonymous 2009-02-04 1:17

9 Name: Anonymous 2009-02-04 1:39

11 Name: Anonymous 2009-02-04 4:19

12 Name: Anonymous 2009-02-04 12:55

13 Name: Anonymous 2009-02-04 14:19

14 Name: Anonymous 2009-02-04 14:24

15 Name: Anonymous 2009-02-04 14:26

16 Name: Anonymous 2009-02-04 15:21

17 Name: Anonymous 2009-02-04 18:54

18 Name: Anonymous 2009-02-04 18:57

19 Name: Anonymous 2009-02-04 20:43

20 Name: Anonymous 2009-02-04 21:11

21 Name: Over 21 Thread 2009-02-04 22:12

22 Name: Anonymous 2009-02-05 0:57

23 Name: Anonymous 2009-02-05 14:47

24 Name: Anonymous 2009-02-05 16:08

25 Name: Annoymous 2009-02-05 16:46

26 Name: Anonymous 2009-02-05 19:02

27 Name: Anonymous 2009-02-05 19:45

28 Name: Anonymous 2009-02-05 22:50

29 Name: Anonymous 2009-02-06 0:25

30 Name: !!kHbdbucBDDpi6ms 2009-02-06 1:26

31 Name: Anonymous 2009-02-06 15:43

32 Name: Anonymous 2009-02-06 15:56

33 Name: Anonymous 2009-02-06 18:32

34 Name: Anonymous 2009-02-07 13:08

35 Name: Anonymous 2009-03-06 6:11

36 Name: Anonymous 2010-11-26 1:54

37 Name: Anonymous 2010-12-20 16:16

38 Name: Anonymous 2011-02-04 17:14

Name: Anonymous 2009-02-03 21:31

Name: Anonymous 2009-02-03 21:38

Name: Anonymous 2009-02-03 21:39

Name: Anonymous 2009-02-03 21:53

Name: Anonymous 2009-02-03 22:09

Name: Anonymous 2009-02-03 22:34

Name: Anonymous 2009-02-03 22:45

Name: Anonymous 2009-02-04 1:17

Name: Anonymous 2009-02-04 1:39

Name: Anonymous 2009-02-04 4:19

Name: Anonymous 2009-02-04 12:55

Name: Anonymous 2009-02-04 14:19

Name: Anonymous 2009-02-04 14:24

Name: Anonymous 2009-02-04 14:26

Name: Anonymous 2009-02-04 15:21

Name: Anonymous 2009-02-04 18:54

Name: Anonymous 2009-02-04 18:57

Name: Anonymous 2009-02-04 20:43

Name: Anonymous 2009-02-04 21:11

Name: Over 21 Thread 2009-02-04 22:12

Name: Anonymous 2009-02-05 0:57

Name: Anonymous 2009-02-05 14:47

Name: Anonymous 2009-02-05 16:08

Name: Annoymous 2009-02-05 16:46

Name: Anonymous 2009-02-05 19:02

Name: Anonymous 2009-02-05 19:45

Name: Anonymous 2009-02-05 22:50

Name: Anonymous 2009-02-06 0:25

Name: !!kHbdbucBDDpi6ms 2009-02-06 1:26

Name: Anonymous 2009-02-06 15:43

Name: Anonymous 2009-02-06 15:56

Name: Anonymous 2009-02-06 18:32

Name: Anonymous 2009-02-07 13:08

Name: Anonymous 2009-03-06 6:11

Name: Anonymous 2010-11-26 1:54

Name: Anonymous 2010-12-20 16:16

Name: Anonymous 2011-02-04 17:14