*MAFIA* Forums

*MAFIA* Forums

  • April 23, 2024, 03:37:19 PM
  • Welcome, Guest
Please login or register.

Login with username, password and session length
Advanced search  

News:

Welcome back the Arcade! Play over 100+ games to get the high score and compete against other forum members.

http://www.mafiaowns.com/index.php?action=arcade;sa=list;sortby=a2z;

Author Topic: LONGEST THREAD EVER  (Read 383455 times)

*MAFIA* masebot1

  • *MAFIA* Member
  • Forum Member
  • Reputation: 617
  • Offline Offline
  • Posts: 1,616
    • View Profile
    • Mason's art site
Re: LONGEST THREAD EVER
« Reply #1575 on: April 18, 2007, 09:33:29 PM »

SPARTAN your just fucking stupid.

Boemann (nl)

  • Forum Member
  • Reputation: 1155
  • Offline Offline
  • Posts: 1,985
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1576 on: April 18, 2007, 10:07:38 PM »

spam spam spam
Logged

*MAFIA* MAGGOT

  • *MAFIA* Admin
  • Forum Member
  • Reputation: 1389
  • Offline Offline
  • Posts: 3,144
  • OFWGKTADGAFLLBBLSBFBN
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1577 on: April 19, 2007, 11:19:20 AM »

aksjnljknbw,mnzoisah;ljew;pojlkjsasllksk jwiikjiwmndini nwjbs.,mbs.hnql;jkhnsknkdnkhwi h diw/.wm;pedlkmw/..,mwlknw.ne;,nw.,nw;kn.,;jklhbws;kje;lkjhe;lkjbe;iulgvdjydhtesw reasqk,jhnbveioiufvkjgvuiyfgvukyfvulihvspamlhyfukfgwlhvjsl.valkwjhvdv .whkvglal.hkvw jhvwhvhsvhvhsv hsvhsvshvhvhvs vhshvshvshvshv shvhsvhsvhsvhw evvekhvbkawsee dsxdcfvbgnh,kwertyusdfgsdfghjkdxcvbnzxcvbnqwedjndjndujhe lkjhe ljhe l;mqsdljhbqwn  whnwnwbnujqbub qbubwubuqbuwbu bquwbubquwqbbb dpjkhqwaewkssj khb200028jns98 u3ne9mjed652sa 596w292gvb629e sd44fd496e1f61 ed1gfvghjki56i 156r1561f1v6x1 sa61 6es1edq61q612w 12165316431516 61561661ffvxcv xzc asdsdsrkjhgchg chkgckhgckhgcm kmwkimoiwmokdc xmiomwik mikxmkkkkkkwvo hjv,
Logged


"At some point in their lives, 1 in 6 children will be abducted by the dutch." ~The fact core, Portal 2.

HaVoK

  • Forum Member
  • Reputation: 636
  • Offline Offline
  • Posts: 653
  • Gone
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1578 on: April 19, 2007, 04:04:41 PM »

I just got done writing a C++ program.  You won't be able to run it because you need an attached text file with certain specifications written in, but it's a randomly generated sentence maker of a certain preference.


Quote
#include
#include
#include "G:\cslib\stringfix"

using namespace std;

#include "G:\cslib\cstrtok"

#include    //  for getch()
#include   //  for "rand()"


class selectNode {
   public:
      string data;           // Class for holding data
      selectNode * link;
};

class optionNode {
   public:
      selectNode * sel;      // Class for linking to selectNode
      optionNode * link;
};
   
class structure {
   public:
      string prod;           // Class for holding productions,
      int count;             // links of top header node, and
      optionNode * opt;      // number of nodes attached
};

void Plist(selectNode *top);
void newOption(optionNode * &top1, bool option, selectNode * top);  // Prototypes
void newSelect(selectNode * &top, string token, bool selection);

// Structure to hold the different productions
structure d[50];    // For 50 productions
int linelen = 0;    // For line length at the end

void newSelect(selectNode * &top, string token) {
   // Add tokens to end of the list
    selectNode * x, *p;
   x = new selectNode;  // Adds tokens to long list and places them depending on
   x->data = token;     // if there is top already or not
   x->link = NULL;
    if(top == NULL) {
       top = x;
      return;
   }
   p = top;
   while(p->link != NULL)
      p = p->link;
    p->link = x;
}


void newOption(optionNode * &top1, selectNode * top) {
   // Make a header node and adds it to the front
    optionNode * k;
   k = new optionNode;
   k->sel = top;    
   k->link = top1;  
   top1 = k;
    return;
}


void ProcessNextPro duction(fstream &df, int &product, int &num) {
//********************************************************************
//   Inputs the next grammar production (terminated by a semi-colon)
//   and adds it to the grammar data structure.
//********************************************************************
   string aline;
   string token;
   // Different nodes to hold the variables and header node

   selectNode * top;   // Holds data
   optionNode * top1;  // Acts as header node
   top = new selectNode;
   top1 = new optionNode;

   getline(df, aline);
   if (df.eof()) return;
   // get the production name
   token = cstrtok(aline," ");
   d[num].prod = token;

   top1 = NULL;    // For first call so it starts new
   top = NULL;

   product++;  // Adds to number of productions for generatesenten ce use

   //***** Process this production
   int cnt = 0; // Counter adds up number of header nodes
   do {
       token = cstrtok(aline, " =");
       if (token == "") {
           getline(df, aline);
           if (df.eof()) break;
           token = cstrtok(aline, " ");
       }
       if (token == "|" || token == ";") {
           newOption(top1, top);  // Adds header node
         top = NULL;
         cnt++;
         if (token == ";")   break;
       }
      else
           newSelect(top, token);   // Adds to data and next with top
    }while(token != ";");
   d[num].count = cnt;   // Adds to production
   d[num].opt = top1;
}// ProcessNextTok en


void GenerateSenten ce(structure d[], int num, int product) {
// Supposed to generate sentence from tokens stored in nodes
   selectNode * k;
   optionNode * z;
   z = d[num].opt;   // Takes first production and puts it in optionNode x
   int holder = rand() % d[num].count;   // Random from count
   for(int i=0; i      z = z->link;               // select the random one
   k = z->sel;                 // Node for selection

   do {
      if(k->data[0] == '<') {       // Checks for productions in data
          for(int i=0; i<=product; i++) {
            if(d.prod == k->data) {    // If found calls generator with
                GenerateSenten ce(d, i, product);   // that as is
            }
         }
      }
      else {
         linelen = linelen + k->data.length()+1;  
         if(linelen > 70){                  // Does length so no overflow
            cout << endl;
            linelen = k->data.length()+1;
            linelen = 0;
         }
         if(k->data == "~")   k->data = "";
         cout << k->data << " ";  // Prints out data with space behind
      }
          k = k->link;    // Takes next link from k as long as not NULL
   }while(k!=NULL);
}

/*void Plist(selectNode * top) {
    while (top != NULL) {
        cout << top->data << " ";
        top = top->link;
    }
    cout << endl << flush;
}*/

void main() {
   fstream df;
   string fname;
   bool found = false;    // For
   int product = 0;
 
   cout << "Enter grammar file ";  
   getline(cin, fname);

   df.open(fname.c_str(), ios::in);
   if (!df) {
      cout << "Can't open " << fname << endl;  getch();  return;
   }

   //******************************************************************
   //   Process the grammar file by creating the internal structure
   //******************************************************************
   int num = 0;
   do {
       //  Read the next production from the file and add it to the structure
       ProcessNextPro duction(df, product, num);
      num++;
       if (df.eof()) break;
   } while (true);

   //******************************************************************
   //   At this point, the structure is built.  Now, generate sentences
   //******************************************************************
   do {
      for(int num=0; num<=product; num++) {
         if(d[num].prod == "") {   // Finds so it can start
              cout << endl;
               GenerateSenten ce(d, num, product);  // Prints list
            found = true;
         }
         if(found==true)   break;
       }
       cout << "\nUse 'q' to quit. ";    // q to quit
       char ch = getch();
         cout << endl;
       if (ch == 'q') return;
   } while(1);
}
Logged

*MAFIA* masebot1

  • *MAFIA* Member
  • Forum Member
  • Reputation: 617
  • Offline Offline
  • Posts: 1,616
    • View Profile
    • Mason's art site
Re: LONGEST THREAD EVER
« Reply #1579 on: April 20, 2007, 12:04:12 PM »

I was watching this thing on the Military Channel were the American soldier brought there camera and made these small little films in Iraq or when they were out in the field.
Logged

SPARTAN420

  • Forum Member
  • Reputation: -100
  • Offline Offline
  • Posts: 66
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1580 on: April 20, 2007, 07:29:53 PM »

I thought I saw that... do you watch Weaponology?
Logged

*MAFIA* masebot1

  • *MAFIA* Member
  • Forum Member
  • Reputation: 617
  • Offline Offline
  • Posts: 1,616
    • View Profile
    • Mason's art site
Re: LONGEST THREAD EVER
« Reply #1581 on: April 20, 2007, 08:42:45 PM »

I download them and shit
Logged

SPARTAN420

  • Forum Member
  • Reputation: -100
  • Offline Offline
  • Posts: 66
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1582 on: April 20, 2007, 09:03:12 PM »

Nah I don't do that. I just don't see the point in risking your computer to viruses, when you could just buy the whole season.
Logged

*MAFIA* Capsloc

  • *MAFIA* Member
  • Forum Member
  • Reputation: 1212
  • Offline Offline
  • Posts: 1,525
    • View Profile
    • Elusive Gamers
Re: LONGEST THREAD EVER
« Reply #1583 on: April 20, 2007, 10:53:28 PM »


Nah I don't do that. I just don't see the point in risking your computer to viruses, when you could just buy the whole season.

only noobs get viruses, well at least get them and dont know how to remove em.
Logged

*MAFIA* masebot1

  • *MAFIA* Member
  • Forum Member
  • Reputation: 617
  • Offline Offline
  • Posts: 1,616
    • View Profile
    • Mason's art site
Re: LONGEST THREAD EVER
« Reply #1584 on: April 20, 2007, 11:05:42 PM »


Nah I don't do that. I just don't see the point in risking your computer to viruses, when you could just buy the whole season.

I am not a dumbass who use programs like Limewre and other shit that find things sources by whatever.  Only dumbass like you download them and get viruses.  I use Itunes and something else.
« Last Edit: April 20, 2007, 11:23:19 PM by masebot1 »
Logged

Hallander

  • Forum Member
  • Reputation: 200
  • Offline Offline
  • Posts: 287
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1585 on: April 20, 2007, 11:56:37 PM »


Logged

*MAFIA* masebot1

  • *MAFIA* Member
  • Forum Member
  • Reputation: 617
  • Offline Offline
  • Posts: 1,616
    • View Profile
    • Mason's art site
Re: LONGEST THREAD EVER
« Reply #1586 on: April 21, 2007, 12:28:25 AM »

spam spam spam and Hallander that apic not showing up fjkashlierthlk sdjrofas eiruhq93ui5uy4 o238u09 85jl kjn,jmaj,hbkiuqaghcjhguguuygauygioweiouiwfeioitsopiijo[4Q3  98J8WERAJKLJSA DFKLJLK;SDFKLLLLLLLLLL LLLLLLLLLLLLLL LLLLLLLLLLLLLL LLLLLLLFP[IOKJAW;PLKR[PWOEIR[POWOERI[PWOEIR0[-W9EI0-8-2438-905-034958309485-093485-9345034958-09238-590OIJWE;LKFM,.SDM,.FMNKLM,BC KJGOEPUYR[PIOUPOKJRA;LK SOI PDUFAPOIJOH IO OIU TEIOUTIOUTEIO TRJIO IJOO JITDRGJ OIGOM SDFAJIO SEOJI DOIJP O0ISETAIJPJO OIJROJKDJOJKDL JKDJKL FDKJL;GJKLJKLGDJKL DOI DIOU  9PU8 9UJBIIHBHBUWAE RJHJNHFSAELKJ; JKL SDFA LKJ;KLJ SDFALKJ JKL FSDA JKL; OIJSFAE0 0 IWERA0 OU IWERAOJI LJK SFADLJKN O KJSDFAOJK LJK; ASREL;JK ;LK SER;KLNJKN SER OOP WRA 0U9 08UWER 908 9U8032Q5F 90 980T38 90 056230-089326890690874 =3125=9 412=7 532 =90352= 325== 350=- H- NH90 -NB0BU 8N80 BY 7YV98 V7T 8V 7C6 7C CE566 4XE 4XW5X4 E6C5 R7RV67 68GV 7 YGU9 9H8N 0IJN 09UN0NJIPOKKOM PKMOK,,,[KOOKMPOMKINJMIJNNBUYBHUYIBUYIGUYGYUGHUHGTVUYUYUYUY7YHY7U78878U99UI9K--IK9.-9K.I90JI,U8HM9M6M77GG68FGN68FGN6GN7676GTN76GN7TTN6G7N6T7GN6TG76TGN6TGN6TGN86GJ86G8TN6TGN6TGNG6TNTGN6NG6TGN6TN6T8GY7HNMUMM8UH8I,JI,JI,P
Logged

Boemann (nl)

  • Forum Member
  • Reputation: 1155
  • Offline Offline
  • Posts: 1,985
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1587 on: April 21, 2007, 12:36:30 AM »

Right.
Logged

*MAFIA* masebot1

  • *MAFIA* Member
  • Forum Member
  • Reputation: 617
  • Offline Offline
  • Posts: 1,616
    • View Profile
    • Mason's art site
Re: LONGEST THREAD EVER
« Reply #1588 on: April 21, 2007, 12:42:33 AM »

LIAR!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Logged

Hallander

  • Forum Member
  • Reputation: 200
  • Offline Offline
  • Posts: 287
    • View Profile
Re: LONGEST THREAD EVER
« Reply #1589 on: April 21, 2007, 02:24:21 AM »

Spartan, you are not 14/15/16 like you claim to be. You are in 6th grade and 11 according to this thread:

http://www.mafiaowns.com/forum/index.php?topic=5141.0

Have a nice day  :)
Logged
 

Page created in 0.063 seconds with 31 queries.