gamesa da se igra

1. 

   fade 2020-03-09 11:11:02 +0000

   napravite svoj server, ne spamujte ovde

   situacije posle sinoćnjeg prangijanja, modro kolje prejebo sve, pretenduje na prvo mesto

   nastavljamo danas od 20:00
   ista kombinacija kao i sinoć, sutra rotiranje

2. 

   Čiča Morada 2020-03-09 11:19:06 +0000

   Ekipa za CS :
   Pic zes caps s1LLa

3. 

   Agilni 2020-03-09 12:14:29 +0000

   Ne stižem večeras, ali perem vas sledeći put.

4. 

   fade 2020-03-09 12:31:47 +0000

   pošto ima 1 slot slobodan, umesto agilnog večeras igra rus

5. 

   mordoss koll 2020-03-09 18:53:35 +0000

   Kako se blizi 20:00 uzbudjenje i pozitvna trema u nama rastu i blize se tacki pucanja.
   AAAAJDE BRE KAD CE VISE 8!!!

6. 

   Zes,in medias res. 2020-03-09 18:55:59 +0000

   Igrate maks debilne igre iskr

7. 

   Čiča Morada 2020-03-09 19:03:46 +0000

   Ma jedu govna igraju ne njuti se man

8. 

   mordoss koll 2020-03-11 17:21:39 +0000

   Opet kralj salje svoje pacove na mene.

9. 

   mordoss koll 2020-03-14 15:36:08 +0000

   p2sp

10. 

    mordoss koll 2020-03-16 21:06:10 +0000

    Mozemo sad malo cesce da opicimo kad smo vec svi kuci zbog epidemije korona virusa

11. 

    Суперхик72 2020-04-17 17:37:15 +0000

    Oће неки гејмс ускоро?

12. 

    Čiča Morada 2020-04-17 17:41:35 +0000

    Games Rodriguez

13. 

    Grok`Grok 2020-04-17 19:18:39 +0000

    https://www.pornhub.com/view_video.php?viewkey=ph5d967098b82af

14. 

    *Дажбог* 2020-04-23 06:10:52 +0000

    Kad je jedan Fejd u nekom drustvu kul nekako se zapitas sta trazis u tom drustvu

15. 

    mordoss koll 2020-11-30 20:33:45 +0000

    Večeras u 9.
    Dva slobodna mesta
    Ko prvi dodje igra

16. 

    Рус 2020-12-01 13:59:22 +0000

    Danaas u 17h slobodna 3 mesta
    Vidimo se

17. 

    mordoss koll 2020-12-01 14:01:49 +0000

    Onaj moj druga Vlajko hoće i večeras, tako da 2 ostaju slobodna

18. 

    Рус 2020-12-01 14:02:36 +0000

    Vazi.
    Dva mesta slobodna, vidimo se u 17h.

19. 

    mordoss koll 2020-12-01 14:11:58 +0000

    Ajd taman sad možemo da probamo sa otkljucanim lamdbama i geo restrkišn da stavimo na prototipalni inheritens

20. 

    Рус 2020-12-01 14:23:14 +0000

    Ajde samo kucaj

    public class RecursionExampleDirectory
    {
    public int getSize(Directory dir)
    { int total = 0;
    
    //check files
    File[] files = dir.getFiles();
    for(int i = 0; i < files.length; i++)
    total += filesi.getSize();
    
    //get sub directories and check them
    Directory[] subs = dir.getSubs();
    for(int i = 0; i < subs.length; i++)
    total += getSize(subsi);
    
    return total;
    }
    
    public static void main(String[] args)
    { RecursionExampleDirectory r = new RecursionExampleDirectory();
    Directory d = new Directory();
    System.out.println( r.getSize(d) );
    }
    
    //pre: n >= 0
    public static int fact(int n)
    { int result = 0;
    if(n == 0)
    result = 1;
    else
    result = n fact(n-1);
    return result;
    }
    
    //pre: exp >= 0
    public static int pow(int base, int exp)
    { int result = 0;
    if(exp == 0)
    result = 1;
    else
    result = base pow(base, exp - 1);
    return result;
    }
    
    //slow fib
    //pre: n >= 1
    public static int fib(int n)
    { int result = 0;
    if(n == 1 || n == 2)
    result = 1;
    else
    result = fib(n-1) + fib(n-2);
    return result;
    }
    
    public static int minWasted(int[] items, int itemNum, int capLeft)
    { int result = 0;
    if(itemNum >= items.length)
    result = capLeft;
    else if( capLeft == 0)
    result = 0;
    else
    { int minWithout = minWasted(items, itemNum + 1, capLeft);
    if( capLeft <= itemsitemNum)
    { int minWith = minWasted(items, itemNum + 1, capLeft - itemsitemNum);
    result = Math.min(minWith, minWithout);
    }
    else
    result = minWithout;
    }
    return result;
    }
    }

    class Directory
    { private Directory[] mySubs;
    private File[] myFiles;
    
    public Directory()
    { int numSubs = (int)(Math.random() 3);
    mySubs = new DirectorynumSubs;
    int numFiles = (int)(Math.random() 10);
    myFiles = new FilenumFiles;
    
    for(int i = 0; i < myFiles.length; i++)
    myFilesi = new File( (int)(Math.random() * 1000 ) );
    for(int i = 0; i < mySubs.length; i++)
    mySubsi = new Directory();
    }
    
    public Directory[] getSubs()
    { return mySubs;
    }
    
    public File[] getFiles()
    { return myFiles;
    }
    }

    class File
    { private int iMySize;

    public File(int size)
    { iMySize = size;
    }
    
    public int getSize()
    { return iMySize;
    }
    }