Search:

Here is my solution with reversing vrooom.



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

char str[] = "vrooom race";

void invVrooom () {

This problem can be solved recursively but it is slow on the order of O(n^2) or greater. But I beleive you could use dynamic programming to solve the recursion from the bottom up. Basically you only...

duncanbojangles:

This problem is basically for a group of n people find out if n/2 people know each other.

The method you propose will only work in O(n^2) time. Or number of people ^ 2.


...

if( var < 0) {
var *= -1;
}

Hey, I did that, it is sometimes called the Knight's Tour. I actually did it for some class using either FRIL or LISP can't remember which. If I find my code I will post it here. There is another...

I have a new challenge for everybody. This program was one that I had to write for a computer science class and requires a little mathematics background. (Though which a little intuition it can be...

I have found an interesting result while using Perl to program the Array with equally distributed ones. Because Perl doesn't have any preset data types, when dividing two integers it automatically...

Here is the perl code for the ip parser challenge:



#! /usr/sbin/perl

$ip="123.234.21.123";
my $iplong;
my $ip2;
my $delim;

Here is the perl way to the replace tab with three spaces challenge.
Other than opening the file, basically one line to replace and one to write to file.



#! /usr/sbin/perl

open (INFILE,...

I deciphered Sepero's first code. I mostly figured it out without a program but used it just to help. Anyway, I have attached the code to decipher the code in Perl. Did anyone else get it?