U-Labs Community - Aufgaben

Anf�nger PHP Langsames Skript

Snees — Wed, 14 Aug 2013 15:37:06 GMT

Heute mal eine wirklich sinnlose Aufgabe. Es darum darum ein m�glichst langsames Skript zu schreiben.

Das Skript, das ihr bearbeiten sollt sieht so aus:

PHP-Code:



$text = 'U-Hacks';

$start = microtime();

# Hier den ganzen Code einf�gen

echo $text;

$ende = microtime();

echo "
",$ende-$start;

?>

Am Ende soll der gleichen Text wie $text ausgegeben werden, was ihr damit anstellt bleibt euch �berlassen.

Dabei gibt es Folgendes zu beachten:

jede Funktion darf max. 2-mal verwendet werden (z.B. strstr, explode, implode usw.)
Keine Schleifen, die unn�tig oft durchlaufen werden
Keine Verz�gerung durch sleep, usleep uzw
Generell nichts, was das Skript irgendwie aufhalten k�nnte

Als Antwort bitte euer vollst�ndiges Skript und den Durchschnitt der Zeit bei f�nf Durchl�ufen posten.

Have fun :D

Anf�nger Pig Latin �bersetzer (simple Version)

Imperativ — Tue, 13 Aug 2013 15:44:29 GMT

Guten Tag,
da es in meinen Augen hier viel zu wenig Aufgaben gibt,
habe ich mich nun von der Seite "Codecademy" inspirieren lassen
und einen "Pig Latin �bersetzer" (der Teil der dortigen Aufgabe war)
geschrieben.

Erkl�rung
Bei W�rtern, die mit einem Vokal anfangen, wird einfach nur ein "ay" angehangen.
Bei W�rtern, die mit einem Konsonant anfangen, wird der Konsonant ans Ende des Wortes angehangen und dann
"ay" dahintergesetzt.

(Konsonant) Python -> ythonpay
(Vokal) Imperativ -> imperativay

Weiterf�hrendes (Wiki)
(Nat�rlich steht es euch frei, die kompletten Regeln so zu �bernehmen, wie sie in der Wikipedia stehen.)

Aufgabe:
Schreibe einen (simplen) Pig Latin �bersetzer, der pr�ft ob das eingegebene Wort nur aus Buchstaben besteht, Konsonanten von Vokalen unterscheiden kann
und dann die �bersetzung vornimmt.

L�sung: (Python)

Spoiler:

Gru�

Imperativ

Anf�nger Einfacher Taschenrechner

DMW007 — Sun, 17 Mar 2013 15:36:35 GMT

Schwierigkeit:
Aufgabenstellung:
Es soll ein kleiner konsolenbasierter Taschenrechner f�r die Grundrechenarten +, -, * und / programmiert werden.
F�rs dividieren sollen zwei Operatoren zur Verf�gung stehen:
/ Teilt die Zahl mit dezimalem Ergebnis (Beispiel: 7 / 2 = 3,5)
: Teilt die Zahl mit Ausgabe des Restes (Beispiel: 7 : 2 = 3 Rest 1)

L�sung (C++)

Spoiler:



#include 

#include 



using namespace std;



void main() {

     cout << "Erste Zahl eingeben: ";

     float Operand1;

     cin >> Operand1;



     cout << "Operator eingeben (G" << char(129) << "ltig: +, -, *, /, :): ";

     char Operator;

     cin >> Operator;



     cout << "Zweite Zahl eingeben: ";

     float Operand2;

     cin >> Operand2;



     switch(Operator) {

                      case '+':

                           cout << Operand1 + Operand2;

                           break;



                      case '-':

                           cout << Operand1 - Operand2;

                           break;



                      case '*':

                           cout << Operand1 * Operand2;

                           break;



                      case '/':

                           if(Operand2 == 0) {

                                       cout << "Division durch 0 nicht m" << char(148) << "glich!";

                                       getch();

                                       return;

                           }

                           else {

                                 cout << Operand1 / Operand2;

                           }

                           break;



                      case ':':

                           if(Operand2 == 0){

                                       cout << "Division durch 0 nicht m" << char(148) << "glich!";

                                       getch();

                                       return;

                           }

                           else if((int)Operand1 != Operand1 || (int)Operand2 != Operand2) {

                                 cout << "Nur ganzzahlige Operanden m" << char(148) << "glich!";

                                 getch();

                                 return;

                           }

                           else {

                                 cout << (int)(Operand1 / Operand2) << " Rest " << (int)Operand1 % (int)Operand2;

                           }

                           break;



                      default:

                              cout << "Ung" << char(129) << "ltiger Operator!" << Operator;

                              getch();

                              return;

                              break;

     }



     getch();

}

Anf�nger Br�che K�rzen

DMW007 — Sun, 17 Mar 2013 15:18:56 GMT

Schwierigkeit:
Aufgabenstellung:
Es soll ein konsolenbasiertes Programm entwickelt werden, dass einen Bruch so weit wie m�glich k�rzt.
Beispiele:
2/4 => 1/2
15/6 => 5/2
Das K�rzen selbst soll in einer externen Klasse vorgenommen werden.
Zur �bergabe der Parameter an die Funktionen sollen Referenzparameter (Zeiger) genutzt werden.
Au�erdem sollen die Daten des Bruchs als private Variablen in der Klasse hinterlegt werden.

L�sung (C++):

Spoiler:

Anf�nger Siebzehn und Vier

DMW007 — Sun, 17 Mar 2013 15:00:51 GMT

Schwierigkeit:
Aufgabenstellung:
Das Spiel Siebzehn und Vier soll vereinfacht als Konsolenanwendung realisiert werden.
Dazu wird beim Ziehen einer Karte eine Zufallszahl im Intervall [1; 11] generiert, die dann den Wert der gezogenen Karte darstellt.
Nach jedem Zug hat der Nutzer die M�glichkeit, das Spiel zu beenden oder eine weitere Karte zu ziehen.
Ziel des Spiels ist es, m�glichst nah an 21 heran zu kommen. Erreicht man mehr als 21 Punkte, hat man verloren.

Beispielscreenshots aus der fertigen Anwendung:

Verloren:

Gewonnen:

L�sung (C++):

Spoiler:



#include 

#include 

using namespace std;



void main() {

    cout << "Ziehen Sie Karten, aber bleiben Sie unter 22 Punkten!\n";

    cout << "Die Karten haben zwischen 1 und 11 Punkten.\n\n";



    randomize();

    int Karten = 0;

    char Eingabe = ' ';

    do {

                int Zahl = 0;

                do {

                        Zahl = random(12);

                }while(Zahl == 0);



        Karten += Zahl;



        if(Karten < 22) {

            cout << "Karte: " << Zahl << " Punkte. Weitere Karte ziehen? (j)? ";

            Eingabe = getch();

        }else {

            cout << "Karte: " << Zahl << " Punkte.";

        }



        cout << endl;

    } while(Eingabe == 'j' && Karten < 22);



    if(Karten < 22) {

        cout << "\nSie haben mit " << Karten << " Punkten beendet.";

    } else {

        cout << "\nVERLOREN! Sie haben " << Karten << " Punkte!";

    }



    getch();

}

Angeh�ngte Grafiken

Anf�nger Brainfuck-Interpreter

Mr. White — Mon, 11 Mar 2013 17:42:42 GMT

Hi,

wieder eine Programmieraufgabe: es soll ein Interpreter f�r die esoterische Programmiersprache Brainfuck programmiert werden.

Spoiler:Meine L�sung (Java)

Code:

import java.io.IOException;

import java.io.Reader;



import java.util.Scanner;



public final class BrainfuckInterpreter {

        private final String  input;

        private       int     inputPtr;

        private final short[] data;

        private       short   dataPtr;

        

        public BrainfuckInterpreter(final Reader source) throws IOException {

                input    = getInputAsString(source);

                data     = new short[Short.MAX_VALUE];

                inputPtr = dataPtr = 0;

        }

        

        public void interpret() {

                for (; inputPtr < input.length(); ++inputPtr) {

                        switch (input.charAt(inputPtr)) {

                        case '>': ++dataPtr; break;

                        case '<': --dataPtr; break;

                        case '+': ++data[dataPtr]; break;

                        case '-': --data[dataPtr]; break;

                        case '.': System.out.print((char) data[dataPtr]); break;

                        case ',': data[dataPtr] = new Scanner(System.in).nextByte(); break;

                        case '[': if (data[dataPtr] == 0) handleLoop('['); break;

                        case ']': handleLoop(']'); --inputPtr; break;

                        default: break;

                        }

                }

        }

        

        private void handleLoop(final char sign) {

                int brackets = 1;

                while (brackets > 0) {

                        switch (input.charAt(sign == '[' ? ++inputPtr : --inputPtr)) {

                        case '[': brackets += sign == '[' ?  1 : -1; break;

                        case ']': brackets += sign == '[' ? -1 :  1; break;

                        }

                }

        }

        

        private String getInputAsString(final Reader source) throws IOException {

                final StringBuilder output = new StringBuilder();

                int current = source.read();

                while (current != -1) {

                        output.append((char) current);

                        current = source.read();

                }

                return output.toString();

        }

}

Benutzung:

Code:

public final class BrainfuckInterpreterTest {

        public static void main(String[] args) throws FileNotFoundException, IOException {

                final BrainfuckInterpreter bfinterpreter =

                                new BrainfuckInterpreter(new FileReader("/home/tobi/test.bf"));

                bfinterpreter.interpret();

        }

}

Brainfuck-Codes zum F�ttern des Interpreters:

Spoiler:Hello World

Spoiler:99 Bottles of Beer

Code:

# 99 bottles of beer in Brainf*ck

# Copyright (C) 2008 Raphael Bois

# 1671 brainf*ck instructions.

# Published under GPL v2



Initialization

++    Counter for loop (a)

>+    unused

>++   Counter for loop (b)

>     Flag for 'no more'

>+    Flag for not 'no more'

>>>   (5) to (7) : temporary values

++++++++++[->+>+>++++++++++<<<]>>>    10 10 100 in (8) (9) (10)

>++++++++++   10 in (11)

[-

   >+++++           50  in (12)

   >++++++++++      100 in (13)

   >+++++++++++     110 in (14)

   >++++++++        80  in (15)

   >++++++++        80  in (16)

   >+++             30  in (17)

   >++++            40  in (18)

   >+               10  in (19)

   <<<<<<<<]

+

>-- +             48  '0'   plus 1 in (12)

>++ +             102 'f'   plus 1 in (13)

>+++++ +          115 's'   plus 1 in (14)

>-- +             78  'N'   plus 1 in (15)

>++++ +           84  'T'   plus 1 in (16)

>++ +             32  ' '   plus 1 in (17)

>++++ +           44  comma plus 1 in (18)

> +               10  LF    plus 1 in (19)



stuff for writing parts of the song

>+   select stuff

>+   select stuff

>+   write song part 3

>++  write song part 1

>+   write song part 2

>+   Flag for 'end of song'

>++  Flag for not 'end of song'



All bytes are at val plus 1

Go back to (7) with final initialization step (remove 1 to all bytes)

[-<]



<<<<<<< at (0)

[ loop (a)

-



>> at (2)

[ loop (b)



  >>>>>>>> at (10)

  [ start loop



    <<<<<<< at (3)

    [->[-]

      print '(N|n)o more'

      >>>>>>>>>>>.  '(N|n)'

      <----.        'o'

      >>>.          ' '

      <<<--.        'm'

      ++.           'o'

      +++.+         'r'

      <-.+          'e'

      <<+<<<<<<<<

    ]+> at (4)

    [-<[-]>>>>> at (9)

      prints number (using (9) and (10))

      [>>>+<<<<+<+<+>>>-]<<<[->>>+<<<]> at (6)

      [>>>>>>+<<<<<<-]>>>>>[[-]>.<]<<<<[>>>>>-<<<<<-]>> at (9)

      [<<+<+<+>>>>-]<<<<[->>>>+<<<<]> at (6)

      [>>>>>>+<<<<<<-]>>>>>>.<<<<<[>>>>>-<<<<<-] at (7)



      memorize in (11) if (10) not 1

      >>>[-<<<+<+>>>>]<<<<[->>>>+<<<<]>-[[-]>>>>+<<<<]<<< at (4)

    ]+



    >>>>>>>> at (12)

    print ' bottle(s) of beer'

    >>>>>.      ' '

    <<<<----.    'b'

    >----.       'o'

    +++++..-     'tt'

    <++++++++++. 'l'

    -------.     'e'

    <<[[-]>>>.<<<]>> 's' if (11)==1 ie if (10)!=1

    >>>>.        ' '

    <<<----.     'o'

    <+.          'f'

    >>>>.        ' '

    <<<<----.    'b'

    +++..+       'ee'

    >+++.+       'r'



    [>] at (20)



    +>+>[->+<<-<-

         print ' on the wall' DOT LF LF

         <<<.            ' '

         <<<----.        'o'

         -.              'n'

         >>>.            ' '

         <<<++++++.      't'

         <++.            'h'

         ---.            'e'

         >>>>.           ' '

         <<<+++.         'w'

         <----.          'a'

         +++++++++++..   'll'

         ------>----     reset to 'f' and 's'

         >---------- ---------- ---------- -- sets (15) to 'N'



         >>>++.--  DOT

         >..       LF LF

    >>>] at (22)



    >>>[->[-]<<<<<<<[<]<[-]>>[>]>>>>>]+ if end of song reset bottles counter

    >[-<[-] at (25)

      <<<< at (21)

      [->>[->+<<<<-

           print ' on the wall' COMMA ' '

           <<<.            ' '

           <<<----.        'o'

           -.              'n'

           >>>.            ' '

           <<<++++++.      't'

           <++.            'h'

           ---.            'e'

           >>>>.           ' '

           <<<+++.         'w'

           <----.          'a'

           +++++++++++..   'll'



           ------>----     reset (13) and (14) to 'f' and 's'

           >++++++++++ ++++++++++ ++++++++++ ++ sets (15) to 'n'



           >>>.            comma

           <.              ' '

      >>>>>>]<<]< at (20)



      [->>>>[-<<+< at (21)

             <<<++.--       DOT

             >.             LF



             [<]<<<<<<<< at (3)

             [->[-]<]+>  at (4)

             [-<[-]>

               >>>>>>>>>>>>.  'T'

               <<<-----.      'a'

               ++++++++++.    'k'

               ------.        'e'

               >>>>.          ' '

               <<<----.       'o'

               -.             'n'

               <.             'e'

               >>>>.          ' '

               <<<<-.         'd'

               >+.            'o'

               ++++++++.      'w'

               ---------.     'n'

               >>>.           ' '

               <<<<---.       'a'

               >.             'n'

               <+++.          'd'

               >>>>.          ' '

               <<<++.         'p'

               <---.          'a'

               >+++..         'ss'

               >>>.           ' '

               <<<<++++++++.  'i'

               >+.            't'

               >>>.           ' '

               <<<<--------.  'a'

               >--.           'r'

               ---.           'o'

               ++++++.        'u'

               -------.       'n'

               <+++.          'd'

               ++>+++++       reset (13) and (14) to 'f' and 's'

               >>>>.          comma

               <.             ' '



               [<]<<<<<<< at (4)

             ]+



            >>>>>> at (10)

            decrements values

            -<<<+>>[<<[-]<+<+>>>>-]<<<<[>-<[-]]>[->>>+<<<]>[->->+++++++++<<]>>> at (10)



         >>[>]>>>>] at (24)

      <<<<] at (20)



    >>>>>>]+ at (26)



    <<<<<<<[<]< at (10)

  ]

  +<+

  <<<<<<+< at (2)

  -

]



print 'Go to the store and buy some more' comma ' '



  >>>>>>>>>>[>]>>>>> at (25)

  [->[-]<]+> at (26)

  [-<[-]

    <<<<<<<<< at (16)

    -------------.   'G'

    <<----.          'o'

    >>>.             ' '

    <<<+++++.        't'

    -----.           'o'

    >>>.             ' '

    <<<+++++.        't'

    <++.             'h'

    ---.             'e'

    >>>>.            ' '

    <<<-.            's'

    +.               't'

    -----.           'o'

    +++.             'r'

    <.               'e'

    >>>>.            ' '

    <<<<----.        'a'

    >----.           'n'

    <+++.            'd'

    >>>>.            ' '

    <<<<--.          'b'

    >+++++++.        'u'

    ++++.            'y'

    >>>.             ' '

    <<<------.       's'

    ----.            'o'

    --.              'm'

    <+++.            'e'

    >>>>.            ' '

    <<<.             'm'

    ++.              'o'

    +++.+            'r'

    <.+              'e'

    >>>>>.           coma

    <.               ' '

    >>>>>>>>>

  ]+



  Initialize last loop to print final '99 bottles of beer on the wall' DOT

  <[-]+<[-]<[-]<[-]+<<< at (19)

  [<]<[-]<[-]<[-]<[-] at (7)

  ++++++++++[->+>+>++++++++++<<<]>->->-

  <<<<<<[-]+<[-]<+<< at (0)

]

Ausgabe:

Code:

99 bottles of beer on the wall, 99 bottles of beer.

Take one down and pass it around, 98 bottles of beer on the wall.



98 bottles of beer on the wall, 98 bottles of beer.

Take one down and pass it around, 97 bottles of beer on the wall.



97 bottles of beer on the wall, 97 bottles of beer.

Take one down and pass it around, 96 bottles of beer on the wall.



96 bottles of beer on the wall, 96 bottles of beer.

Take one down and pass it around, 95 bottles of beer on the wall.



95 bottles of beer on the wall, 95 bottles of beer.

Take one down and pass it around, 94 bottles of beer on the wall.



94 bottles of beer on the wall, 94 bottles of beer.

Take one down and pass it around, 93 bottles of beer on the wall.



93 bottles of beer on the wall, 93 bottles of beer.

Take one down and pass it around, 92 bottles of beer on the wall.



92 bottles of beer on the wall, 92 bottles of beer.

Take one down and pass it around, 91 bottles of beer on the wall.



91 bottles of beer on the wall, 91 bottles of beer.

Take one down and pass it around, 90 bottles of beer on the wall.



90 bottles of beer on the wall, 90 bottles of beer.

Take one down and pass it around, 89 bottles of beer on the wall.



89 bottles of beer on the wall, 89 bottles of beer.

Take one down and pass it around, 88 bottles of beer on the wall.



88 bottles of beer on the wall, 88 bottles of beer.

Take one down and pass it around, 87 bottles of beer on the wall.



87 bottles of beer on the wall, 87 bottles of beer.

Take one down and pass it around, 86 bottles of beer on the wall.



86 bottles of beer on the wall, 86 bottles of beer.

Take one down and pass it around, 85 bottles of beer on the wall.



85 bottles of beer on the wall, 85 bottles of beer.

Take one down and pass it around, 84 bottles of beer on the wall.



84 bottles of beer on the wall, 84 bottles of beer.

Take one down and pass it around, 83 bottles of beer on the wall.



83 bottles of beer on the wall, 83 bottles of beer.

Take one down and pass it around, 82 bottles of beer on the wall.



82 bottles of beer on the wall, 82 bottles of beer.

Take one down and pass it around, 81 bottles of beer on the wall.



81 bottles of beer on the wall, 81 bottles of beer.

Take one down and pass it around, 80 bottles of beer on the wall.



80 bottles of beer on the wall, 80 bottles of beer.

Take one down and pass it around, 79 bottles of beer on the wall.



79 bottles of beer on the wall, 79 bottles of beer.

Take one down and pass it around, 78 bottles of beer on the wall.



78 bottles of beer on the wall, 78 bottles of beer.

Take one down and pass it around, 77 bottles of beer on the wall.



77 bottles of beer on the wall, 77 bottles of beer.

Take one down and pass it around, 76 bottles of beer on the wall.



76 bottles of beer on the wall, 76 bottles of beer.

Take one down and pass it around, 75 bottles of beer on the wall.



75 bottles of beer on the wall, 75 bottles of beer.

Take one down and pass it around, 74 bottles of beer on the wall.



74 bottles of beer on the wall, 74 bottles of beer.

Take one down and pass it around, 73 bottles of beer on the wall.



73 bottles of beer on the wall, 73 bottles of beer.

Take one down and pass it around, 72 bottles of beer on the wall.



72 bottles of beer on the wall, 72 bottles of beer.

Take one down and pass it around, 71 bottles of beer on the wall.



71 bottles of beer on the wall, 71 bottles of beer.

Take one down and pass it around, 70 bottles of beer on the wall.



70 bottles of beer on the wall, 70 bottles of beer.

Take one down and pass it around, 69 bottles of beer on the wall.



69 bottles of beer on the wall, 69 bottles of beer.

Take one down and pass it around, 68 bottles of beer on the wall.



68 bottles of beer on the wall, 68 bottles of beer.

Take one down and pass it around, 67 bottles of beer on the wall.



67 bottles of beer on the wall, 67 bottles of beer.

Take one down and pass it around, 66 bottles of beer on the wall.



66 bottles of beer on the wall, 66 bottles of beer.

Take one down and pass it around, 65 bottles of beer on the wall.



65 bottles of beer on the wall, 65 bottles of beer.

Take one down and pass it around, 64 bottles of beer on the wall.



64 bottles of beer on the wall, 64 bottles of beer.

Take one down and pass it around, 63 bottles of beer on the wall.



63 bottles of beer on the wall, 63 bottles of beer.

Take one down and pass it around, 62 bottles of beer on the wall.



62 bottles of beer on the wall, 62 bottles of beer.

Take one down and pass it around, 61 bottles of beer on the wall.



61 bottles of beer on the wall, 61 bottles of beer.

Take one down and pass it around, 60 bottles of beer on the wall.



60 bottles of beer on the wall, 60 bottles of beer.

Take one down and pass it around, 59 bottles of beer on the wall.



59 bottles of beer on the wall, 59 bottles of beer.

Take one down and pass it around, 58 bottles of beer on the wall.



58 bottles of beer on the wall, 58 bottles of beer.

Take one down and pass it around, 57 bottles of beer on the wall.



57 bottles of beer on the wall, 57 bottles of beer.

Take one down and pass it around, 56 bottles of beer on the wall.



56 bottles of beer on the wall, 56 bottles of beer.

Take one down and pass it around, 55 bottles of beer on the wall.



55 bottles of beer on the wall, 55 bottles of beer.

Take one down and pass it around, 54 bottles of beer on the wall.



54 bottles of beer on the wall, 54 bottles of beer.

Take one down and pass it around, 53 bottles of beer on the wall.



53 bottles of beer on the wall, 53 bottles of beer.

Take one down and pass it around, 52 bottles of beer on the wall.



52 bottles of beer on the wall, 52 bottles of beer.

Take one down and pass it around, 51 bottles of beer on the wall.



51 bottles of beer on the wall, 51 bottles of beer.

Take one down and pass it around, 50 bottles of beer on the wall.



50 bottles of beer on the wall, 50 bottles of beer.

Take one down and pass it around, 49 bottles of beer on the wall.



49 bottles of beer on the wall, 49 bottles of beer.

Take one down and pass it around, 48 bottles of beer on the wall.



48 bottles of beer on the wall, 48 bottles of beer.

Take one down and pass it around, 47 bottles of beer on the wall.



47 bottles of beer on the wall, 47 bottles of beer.

Take one down and pass it around, 46 bottles of beer on the wall.



46 bottles of beer on the wall, 46 bottles of beer.

Take one down and pass it around, 45 bottles of beer on the wall.



45 bottles of beer on the wall, 45 bottles of beer.

Take one down and pass it around, 44 bottles of beer on the wall.



44 bottles of beer on the wall, 44 bottles of beer.

Take one down and pass it around, 43 bottles of beer on the wall.



43 bottles of beer on the wall, 43 bottles of beer.

Take one down and pass it around, 42 bottles of beer on the wall.



42 bottles of beer on the wall, 42 bottles of beer.

Take one down and pass it around, 41 bottles of beer on the wall.



41 bottles of beer on the wall, 41 bottles of beer.

Take one down and pass it around, 40 bottles of beer on the wall.



40 bottles of beer on the wall, 40 bottles of beer.

Take one down and pass it around, 39 bottles of beer on the wall.



39 bottles of beer on the wall, 39 bottles of beer.

Take one down and pass it around, 38 bottles of beer on the wall.



38 bottles of beer on the wall, 38 bottles of beer.

Take one down and pass it around, 37 bottles of beer on the wall.



37 bottles of beer on the wall, 37 bottles of beer.

Take one down and pass it around, 36 bottles of beer on the wall.



36 bottles of beer on the wall, 36 bottles of beer.

Take one down and pass it around, 35 bottles of beer on the wall.



35 bottles of beer on the wall, 35 bottles of beer.

Take one down and pass it around, 34 bottles of beer on the wall.



34 bottles of beer on the wall, 34 bottles of beer.

Take one down and pass it around, 33 bottles of beer on the wall.



33 bottles of beer on the wall, 33 bottles of beer.

Take one down and pass it around, 32 bottles of beer on the wall.



32 bottles of beer on the wall, 32 bottles of beer.

Take one down and pass it around, 31 bottles of beer on the wall.



31 bottles of beer on the wall, 31 bottles of beer.

Take one down and pass it around, 30 bottles of beer on the wall.



30 bottles of beer on the wall, 30 bottles of beer.

Take one down and pass it around, 29 bottles of beer on the wall.



29 bottles of beer on the wall, 29 bottles of beer.

Take one down and pass it around, 28 bottles of beer on the wall.



28 bottles of beer on the wall, 28 bottles of beer.

Take one down and pass it around, 27 bottles of beer on the wall.



27 bottles of beer on the wall, 27 bottles of beer.

Take one down and pass it around, 26 bottles of beer on the wall.



26 bottles of beer on the wall, 26 bottles of beer.

Take one down and pass it around, 25 bottles of beer on the wall.



25 bottles of beer on the wall, 25 bottles of beer.

Take one down and pass it around, 24 bottles of beer on the wall.



24 bottles of beer on the wall, 24 bottles of beer.

Take one down and pass it around, 23 bottles of beer on the wall.



23 bottles of beer on the wall, 23 bottles of beer.

Take one down and pass it around, 22 bottles of beer on the wall.



22 bottles of beer on the wall, 22 bottles of beer.

Take one down and pass it around, 21 bottles of beer on the wall.



21 bottles of beer on the wall, 21 bottles of beer.

Take one down and pass it around, 20 bottles of beer on the wall.



20 bottles of beer on the wall, 20 bottles of beer.

Take one down and pass it around, 19 bottles of beer on the wall.



19 bottles of beer on the wall, 19 bottles of beer.

Take one down and pass it around, 18 bottles of beer on the wall.



18 bottles of beer on the wall, 18 bottles of beer.

Take one down and pass it around, 17 bottles of beer on the wall.



17 bottles of beer on the wall, 17 bottles of beer.

Take one down and pass it around, 16 bottles of beer on the wall.



16 bottles of beer on the wall, 16 bottles of beer.

Take one down and pass it around, 15 bottles of beer on the wall.



15 bottles of beer on the wall, 15 bottles of beer.

Take one down and pass it around, 14 bottles of beer on the wall.



14 bottles of beer on the wall, 14 bottles of beer.

Take one down and pass it around, 13 bottles of beer on the wall.



13 bottles of beer on the wall, 13 bottles of beer.

Take one down and pass it around, 12 bottles of beer on the wall.



12 bottles of beer on the wall, 12 bottles of beer.

Take one down and pass it around, 11 bottles of beer on the wall.



11 bottles of beer on the wall, 11 bottles of beer.

Take one down and pass it around, 10 bottles of beer on the wall.



10 bottles of beer on the wall, 10 bottles of beer.

Take one down and pass it around, 9 bottles of beer on the wall.



9 bottles of beer on the wall, 9 bottles of beer.

Take one down and pass it around, 8 bottles of beer on the wall.



8 bottles of beer on the wall, 8 bottles of beer.

Take one down and pass it around, 7 bottles of beer on the wall.



7 bottles of beer on the wall, 7 bottles of beer.

Take one down and pass it around, 6 bottles of beer on the wall.



6 bottles of beer on the wall, 6 bottles of beer.

Take one down and pass it around, 5 bottles of beer on the wall.



5 bottles of beer on the wall, 5 bottles of beer.

Take one down and pass it around, 4 bottles of beer on the wall.



4 bottles of beer on the wall, 4 bottles of beer.

Take one down and pass it around, 3 bottles of beer on the wall.



3 bottles of beer on the wall, 3 bottles of beer.

Take one down and pass it around, 2 bottles of beer on the wall.



2 bottles of beer on the wall, 2 bottles of beer.

Take one down and pass it around, 1 bottle of beer on the wall.



1 bottle of beer on the wall, 1 bottle of beer.

Take one down and pass it around, no more bottles of beer on the wall.



No more bottles of beer on the wall, no more bottles of beer.

Go to the store and buy some more, 99 bottles of beer on the wall.

Anf�nger RPN-Rechner

Mr. White — Wed, 16 Jan 2013 15:22:44 GMT

Hallo,

mal wieder eine Programmieraufgabe:
Es geht um den Shunting-yard-Algorithmus, den es zu implementieren gilt. Der Algorithmus �berf�hrt einen Term aus der Infixnotation in die Reverse Polish Notation (RPN, deutsch: Umgekehrte Polnische Notation). Der �berf�hrte Term soll dann berechnet werden.

Beispiel
Eingabe (Array): "(", "22", "*", "(", "13", "-", "4.5", ")", ")", "/", "2", "+", "100"
Ausgabe (RPN): "22", "13", "4.5", "-", "*", "2", "/", "100", "+"
Ergebnis: 193.5

Zusatz
Die Eingabe erfolgt als Zeichenkette (Bsp: "(22 * (13 - 4.5)) / 2 + 100") und muss durch ein zus�tzliches Verfahren erst entsprechend verarbeitet werden. Kurz: eine tokenize-Methode muss programmiert werden.

Meine L�sung:

Spoiler:Scala

Code:

object RPN {

        private val ops: Map[String, Tuple2[(Double, Double) => Double, Int]] = 

                                         Map("+" -> ((a, b) => a + b, 1), "-" -> ((a, b) => b - a, 1),

                                                 "*" -> ((a, b) => a * b, 2), "/" -> ((a, b) => b / a, 2))

        

        def fromInfix(s: String): String = {

                val tokens = new scala.collection.mutable.ListBuffer[String]()

                val opStack = new scala.collection.mutable.Stack[String]

                for (i <- tokenize(s)) i match {

                        case digit if Character.isDigit(digit(0)) => tokens += digit

                        case op if ops contains op => {

                                if (opStack.length != 0) {

                                        val cmpVal = if (opStack.head != "(") ops(opStack.head)._2 else 0

                                        while (ops(op)._2 < cmpVal && opStack.length != 0) tokens += opStack.pop()

                                }

                                opStack push op

                        }

                        case lparen if lparen == "(" => opStack push lparen

                        case rparen if rparen == ")" => {

                                while (opStack.head != "(") tokens += opStack.pop()

                                if (opStack.length != 0) opStack.pop()

                        }

                        case dflt => println("Unbekanntes Zeichen: " + dflt)

                }

                while (opStack.length != 0) tokens += opStack.pop()

                tokens mkString " "

        }

        

        def compute(s: String) = {

                val resStack = new scala.collection.mutable.Stack[Double]

                tokenize(s).foreach(token => {

                        if (ops contains token) resStack push(ops(token)._1(resStack.pop(), resStack.pop()))

                        else resStack push token.toDouble

                })

                resStack.pop()

        }

        

        private def tokenize(inp: String): Seq[String] = {

                val tokens = new scala.collection.mutable.ListBuffer[String]()

                var numbbuffer = ""

                for (i <- inp) i match {

                        case digit if Character.isDigit(digit) || digit == '.' => numbbuffer = numbbuffer + digit.toString

                        case op if ops.contains(op.toString) || op == '(' || op == ')' || op == ' ' => {

                                if (numbbuffer != "") { tokens += numbbuffer; numbbuffer = "" }

                                tokens += op.toString

                        }

                        case dflt => if (!Character.isWhitespace(dflt)) println("Unbekanntes Zeichen: " + dflt)

                }

                if (numbbuffer != "") (tokens += numbbuffer).filter(_ != " ").toList 

                else tokens.filter(_ != " ").toList

        }

}



// Test

println(RPN.compute(RPN.fromInfix("(22 * (13 - 4.5)) / 2 + 100"))) // 193.5

Anf�nger Conway's Game of Life

Mr. White — Wed, 03 Oct 2012 14:26:57 GMT

Hallo,

damit dieses Subforum auch mal genutzt wird, hier eine Aufgabe: Es soll Conway's Game of Life implementiert werden.
Dazu ersteinmal grundlegende Informationen aus dem Wikipedia-Artikel:

Das Spiel des Lebens von John Horton Conway ist ein System, das auf einem zweidimensionalen zellu�ren Automaten basiert.
Das Spielfeld ist in Spalten und Zeilen unterteilt. Jedes Quadrat ist eine Zelle, die zwei Zust�nde haben kann. Entweder lebt sie, oder sie ist tot. Jede Zelle hat acht Nachbarn (oben, unten, links, rechts und die diagonal angrenzenden Zellen) und diese muss jede Zelle auch kennen, denn die Folgegeneration wird unter Beachtung nachfolgender Regeln erzeugt:

Eine tote Zelle mit genau drei lebenden Nachbarn wird in der Folgegeneration leben
Lebende Zellen mit weniger als zwei lebenden Nachbarn sterben in der n�chsten Generation
Lebende Zellen mit zwei oder drei lebenden Nachbarn bleiben auch in der Folgegeneration am leben
Lebende Zellen mtt mehr als drei Nachbarn sterben in der Folgegeneration

Aufgaben

Anf�nger: Schreibe eine Klasse f�r das Spiel des Lebens. Als eine kleine Orientierung sei ein unvollst�ndiges Interface gegeben, das es zu implementieren gilt. Au�erdem soll eine beliebige Anfangsgeneration manuell erstellt werden und die ersten 5 Generationen auf der Konsole ausgegeben werden.

Code:

public interface GameOfLifeModel {

    // Anzahl Zeilen des Spielfeldes

    public static final int ROWS = 60;

    

    // Anzahl Spalten des Spielfeldes

    public static final int COLS = 80;

    

    // Kantenl�nge eines Quadrates (Zelle)

    public static final int CELL_SIZE = 10;

    

    // Berechnet die Folgegeneration und speichert diese.

    public void nextGeneration();

    

    // Gibt die aktuelle Generation zur�ck.

    // das zweidimensionale boolean-Array ist eine m�gliche Form

    // der internen Repr�sentation.

    public boolean[][] getGeneration();

}

Fortgeschritten:

Je gr��er das Spielfeld, desto besser. Es gibt eine M�glichkeit, ein unendliches Spielfeld zu simulieren, in dem man es torus-f�rmig macht.
Erstelle ein GUI, das folgende Funktionalit�ten besitzt:
- Der Benutzer kann die Generation "zeichnen"
- Es gibt Buttons f�r die Berechnung und Anzeige der Folgegeneration und zum Zur�cksetzen (alle Zellen sind tot)
- Optional: der Benutzer kann eine Animation starten und die Geschwindigkeit einstellen. Die "Animation" soll dann automatisch die Folgegeneration berechnen und anzeigen, bis der Benutzer die Animation stoppt.

Wer auch die fortgeschrittenen Aufgaben l�st, muss nat�rlich die L�sung der Konsolenausgabe nicht posten.

Meine L�sung:

Spoiler:Java7/JavaFx

Spoiler:GameOfLifeMain.java

Spoiler:UI_GameOfLife.fxml

Spoiler:UI_GameOfLifeController.java

Code:

package gameoflife;



import java.net.URL;

import java.util.ResourceBundle;

import javafx.animation.Animation;

import javafx.animation.Transition;

import javafx.beans.property.IntegerProperty;

import javafx.beans.property.SimpleIntegerProperty;

import javafx.event.ActionEvent;

import javafx.fxml.FXML;

import javafx.fxml.Initializable;

import javafx.scene.canvas.Canvas;

import javafx.scene.canvas.GraphicsContext;

import javafx.scene.control.Slider;

import javafx.scene.input.MouseEvent;

import javafx.scene.paint.Color;

import javafx.scene.text.Text;

import javafx.util.Duration;



public class UI_GameOfLifeController implements Initializable {

    private GameOfLifeModel model;

    private Animation timer;

    

    @FXML private Canvas canvas;

    @FXML private Text generationCount;

    @FXML private Slider slider;



    @FXML

    private void nextGenerationButtonFired(ActionEvent ae) {

        timer.stop();

        model.nextGeneration();

        drawGeneration();

    }



    @FXML

    private void startButtonFired(ActionEvent ae) {

        timer.play();

    }



    @FXML

    private void stopButtonFired(ActionEvent ae) {

        timer.stop();

    }



    @FXML

    private void resetButtonFired(ActionEvent ae) {

        timer.stop();

        model.initDefaultGeneration();

        drawGeneration();

    }



    @FXML

    private void mouseControl(MouseEvent me) {

        int x = (int)me.getX();

        int y = (int)me.getY();

        if (canvas.contains(x, y)) {

            int xc = x / GameOfLifeModel.CELL_SIZE;

            int yc = y / GameOfLifeModel.CELL_SIZE;

            if (me.isSecondaryButtonDown()) {

                model.setCell(yc, xc, false);

            } else if (me.isPrimaryButtonDown()) {

                model.setCell(yc, xc, true);

            } 

            drawGeneration();

        }

    }



    private void drawGeneration() {

        final GraphicsContext gc = canvas.getGraphicsContext2D();

        final int ROWS = GameOfLifeModel.ROWS;

        final int COLS = GameOfLifeModel.COLS;

        final int CELL_SIZE = GameOfLifeModel.CELL_SIZE;

        final boolean[][] generation = model.getGeneration();

        gc.setFill(Color.GRAY);

        gc.setStroke(Color.BLACK);

        gc.fillRect(0, 0, canvas.getWidth(), canvas.getHeight());

        gc.setFill(Color.WHITE);

        int x = 0, y = 0;

        for (int row = 0; row < ROWS; ++row) {

            for (int col = 0; col < COLS; ++col) {

                if (generation[row][col]) {

                    gc.fillRect(x, y, CELL_SIZE, CELL_SIZE);

                }

                x += CELL_SIZE;

            }

            x = 0;

            y += CELL_SIZE;

        }

    }



    @Override

    public void initialize(URL url, ResourceBundle rb) {

        model = new GameOfLifeModel();

        final IntegerProperty speed = new SimpleIntegerProperty(1);

        slider.valueProperty().bindBidirectional(speed);

        generationCount.textProperty().bind(model.generationCountProperty().asString());

        timer = new Transition() {

            {

                setCycleDuration(Duration.millis(500));

                setCycleCount(Animation.INDEFINITE);

            }

            @Override

            protected void interpolate(double d) {

                model.nextGeneration();

                drawGeneration();

                setRate(speed.get());

            }

        };

        drawGeneration();

    }

}

Spoiler:GameOfLifeModel.java

Code:

package gameoflife;



import java.util.Arrays;

import javafx.beans.property.IntegerProperty;

import javafx.beans.property.SimpleIntegerProperty;



public class GameOfLifeModel {

    public static final int CELL_SIZE = 10;  

    public static final int ROWS = 60;

    public static final int COLS = 80;

    

    private boolean[][] generation;

    private IntegerProperty generationCount;

    

    public GameOfLifeModel() {

        generation = new boolean[ROWS][COLS];

        generationCount = new SimpleIntegerProperty(0);

        initDefaultGeneration();

    }



    public final void initDefaultGeneration() {

        for (int row = 0; row < ROWS; ++row) {

            for (int col = 0; col < COLS; ++col) {

                generation[row][col] = false;

            }

        }

        generationCount.set(0);

    }



    public void nextGeneration() {

        boolean[][] newGen = new boolean[ROWS][COLS];

        for (int row = 0; row < ROWS; ++row) {

            for (int col = 0; col < COLS; ++col) {

                int neighbours = countNeighbours(row, col);

                if (!getCell(row, col)) {

                    if (neighbours == 3) {

                        setCell(newGen, row, col, true);

                    }

                } else {

                    if (neighbours < 2) {

                        setCell(newGen, row, col, false);

                    } else if (neighbours <= 3) {

                        setCell(newGen, row, col, true);

                    } else {

                        setCell(newGen, row, col, false);

                    }

                }

            }

        }

        if (!Arrays.equals(newGen, generation)) {

            generation = newGen;

            generationCount.set(generationCount.get() + 1);

        }

    }

    

    public boolean[][] getGeneration() {

        return generation;

    }

    

    public IntegerProperty generationCountProperty() {

        return generationCount;

    }

    

    public void setCell(int row, int col, boolean alive) {

        setCell(generation, row, col, alive);

    }



    private int countNeighbours(int row, int col) {

        int counter = 0;

        for (int i = -1; i <= 1; i++) {

            for (int k = -1; k <= 1; k++) {

                if (getCell(row + i, col + k)) {

                    counter++;

                }

            }

        }

        if (getCell(row, col)) {

            counter--;

        }

        return counter;

    }



    private boolean getCell(int row, int col) {

        row %= ROWS;

        col %= COLS;

        row += row < 0 ? ROWS : 0;

        col += col < 0 ? COLS : 0;

        return generation[row][col];

    }



    private void setCell(boolean[][] newGen, int row, int col, boolean alive) {

        row %= ROWS;

        col %= COLS;

        row += row < 0 ? ROWS : 0;

        col += col < 0 ? COLS : 0;

        newGen[row][col] = alive;

    }

}

Spoiler:Screenshots

Spoiler:Download (JAR)

Anf�nger L�sen von Knuddels-Matheaufgaben

Mentos — Sun, 05 Feb 2012 00:12:28 GMT

Hey Ho,
Aufgabe heute ist es, Mathefragen von Knuddels zu l�sen.
Bsp.
"Nennen Sie die gesuchte Zahl: 5 mal ??? = 20"
"Nennen Sie die gesuchte Zahl: 10 durch ??? = 3 Rest 1"
"Nennen Sie die gesuchte Zahl: 5 + 5 = ???"

Nach diesem Prinzip.
Wie bei dem anderen Thread auch bereits hier eine L�sung von mir.
(Java6 Kompatible!)

Spoiler:Java



/**

     * L�st nummerische Fragen in Knuddels

     * Written by Mentos. If you use it. Say thank you!

     * @param question Die vollst�ndige Frage

     * @return Die (hoffentlich) korrekte Antwort

     */

    private static int solveNumericQuestion(String question) {



        if (question.startsWith("Nennen Sie die gesuchte Zahl: ")) {

            question = question.substring(30);

            //System.out.println(question);

        }

        String[] parts = question.split(" ");

        String operator = parts[1];



        String firstNumber = parts[0];

        String secondNumber = parts[2];

        String thirdNumber = parts[4];

        int solution = 0;



        if (operator.equals("mal")) {

            if (thirdNumber.equals("???")) { // 50 * 50 = ???

                solution = new Integer(firstNumber) * new Integer(secondNumber);

            } else {

                if (firstNumber.equals("???")) { // ??? * 20 = 40

                    solution = new Integer(thirdNumber) / new Integer(secondNumber);

                } else if (secondNumber.equals("???")) { //20 * ??? = 40

                    solution = new Integer(thirdNumber) / new Integer(firstNumber);

                }

            }

        } else if (operator.equals("durch")) {

            if (thirdNumber.equals("???")) { // 50 / 25 = ???

                if (question.indexOf("Rest") != -1) {

                    firstNumber = String.valueOf(new Integer(firstNumber) - new Integer(parts[6]));

                }

                solution = new Integer(firstNumber) / new Integer(secondNumber);

            } else {

                if (firstNumber.equals("???")) { // ??? / 20 = 2

                    solution = new Integer(secondNumber) * new Integer(thirdNumber);

                    if (question.indexOf("Rest") != -1) {

                        solution += new Integer(parts[6]);

                    }

                } else if (secondNumber.equals("???")) // 19 durch ??? = 1 Rest 7

                {

                    if (question.indexOf("Rest") != -1) {

                        firstNumber = String.valueOf(new Integer(firstNumber) - new Integer(parts[6]));

                    }

                    solution = new Integer(firstNumber) / new Integer(thirdNumber);

                }

            }

        } else if (operator.equals("plus")) {

            if (thirdNumber.equals("???")) { // 50 + 50 = ???

                solution = new Integer(firstNumber) + new Integer(secondNumber);

            } else {

                if (firstNumber.equals("???")) { // ??? + 20 = 30

                    solution = new Integer(thirdNumber) - new Integer(secondNumber);

                } else if (secondNumber.equals("???")) { // 50 + ??? = 150

                    solution = new Integer(thirdNumber) - new Integer(firstNumber);

                }

            }

        } else if (operator.equals("minus")) {

            if (thirdNumber.equals("???")) { // 40 - 20 = ???

                solution = new Integer(firstNumber) - new Integer(secondNumber);

            } else {

                if (firstNumber.equals("???")) { // ??? - 50 = 10

                    solution = new Integer(thirdNumber) + new Integer(secondNumber);

                } else if (secondNumber.equals("???")) {// 50 - ??? = 40

                    solution = new Integer(firstNumber) - new Integer(thirdNumber);

                }

            }

        }



        return solution;

    }

Anf�nger Mein Konto.

Mentos — Fri, 03 Feb 2012 21:27:18 GMT

Geschichte: Tja. So schnell kann es gehen. Ich habe wieder mal keine Kohle. Was will man machen? Gottseidank habe ich etwas Geld bei der Bank angelegt, mit einem Zinssatz von 5% (p.a.) Wie entwickelt sich das Geld?

Aufgabenstellung: Schreibe ein Programm, welches den Kontostand in Abh�ngigkeit von dem angelegten Geld, dem Zinssatz und die vergangene Zeit (p.a.) angiebt.

Advanced: Schreibe eine zus�tzliche Funktion, wann das Geld bei dem angegebenen Prozentsatz eine gew�nschte H�he erreicht hat.

Geplante Zeit:

Anf�nger: Keine Limitierung

Fortgeschritten: 5 Minuten (+2 Minuten f�r Advanced)

Profi: Im Kopf schon beim Aufgabenlesen fertig.

MfG

Anf�nger Kindergeld berechnen

patlux — Fri, 03 Feb 2012 20:45:34 GMT

HeyHo,

hier eine kleine Aufgabe aus dem Unterricht:

Aufgabe

Erstelle ein Konsolen-Programm das nach Eingabe einer Kinderanzahl die H�he des Kindergeldes berechnet.
Dabei gilt folgendes:

Ein Kind = 20� Kindergeld
Zwei Kinder = 50� Kindergeld (20� f�r erstes Kind + 30� f�r zweites Kind)
Drei Kinder = 90� Kindergeld (50� f�r erstes und zweites Kind + 40� f�r drittes Kind)
Mehr als drei Kinder = 90� Kindergeld + F�r jedes weitere Kind 50� Kindergeld.

Das Programm soll nach der Berechnung die H�he des Kindergeldes ausgeben und zwar wie folgt:
"Bei einer Kinderanzahl von X ist die H�he des Kindergeldes Y �/Euro".

---
Zusatz

Zus�tzlich kann noch eine Schleife hinzugef�gt werden die das Programm sooft wiederholt bis auf die Frage "Wollen Sie aufh�ren?" mit 'J' oder 'j' geantwortet wird. Am Anfang dieser Schleife soll das Eingabefenster geleert werden.

F�r Fortgeschrittene
Erstellt das Programm unter 5 Minuten.
(Mit Wiederholungsschleife 6 Minuten)

F�r Profis
Erstellt das Programm unter 2 Minuten.
(Mit Wiederholungsschleife 3 Minuten)

---
Programmablaufplan(=PAP)

Spoiler:

Fortgeschritten Konvertieren von einem Fifty-String zu einem anderen Format

Mentos — Fri, 03 Feb 2012 15:17:17 GMT

Hallo,
als ich mich gerade mit PaT dar�ber redete, wie wir uns kennenlerneten, kamen wir letzendes zu folgender Fragestellung:

Wie kann man einen Knuddels-String (z.B. "2W4 + 3W8 + W10 + W8") zu folgendem Format umwandeln: "4,4,8,8,8,10,8" (Sprich die W�rfel werden "ausgeschrieben" und mit Kommatas getrennt).

Da es Knuddels ist, und ich dementsprechend in der Beweispflicht bin, dass es nicht zu Eigenprofit ist, hier die C#-Funktion:

Spoiler:C#

Spoiler:Java

Anf�nger K�rzen von Br�chen

DANP — Thu, 02 Feb 2012 18:34:25 GMT

Hallo,
hier die Aufgabe:
Erstellen Sie eine Methode welche 2 Integer (zaehler und nenner) �bergeben bekommt, und diesen Bruch k�rzt.

Hilfe: K�rzen

Die Methode soll den gek�rzten Bruch auf der Console ausgeben ODER einfach returnen!

Spoiler:JAVA

Anf�nger 2 Strings mit einander verrechnen

DeKaDeNz — Thu, 02 Feb 2012 16:18:53 GMT

Aufgabe:

Es sind Funktionen zu schreiben, die 2 Ganzzahlen (int, long, char, byte), welche als String �bergeben werden, miteinander addieren, subtrahieren, multiplizieren und dividieren.

Werfe bei m�glichen Fehlern Exceptions, oder falls die Programmiersprache es nicht erlaubt, gebe einen Fehlertext aus und beende das Programm sofort.