New paste›Public feed

Public feed

Pastes people chose to make public. Author names hidden.
  • Unbenannt

    1260898·text·34.6 KB·2008-11-18 23:32 UTC
    
        
  • Unnamed

    1260887·text·127.4 KB·2008-11-18 23:27 UTC
    
        
  • aa1_dmesg_stacktrace

    1260886·text·58.7 KB·2008-11-18 23:27 UTC
    
        
  • Miscellany

    1260835·text·3.9 KB·2008-11-18 22:36 UTC
    rpm name match `rtl8187':
     dkms-rtl8187se
     rtl8187se-kernel-2.6.27.4-desktop-1mnb
     rtl8187se-kernel-2.6.27.4-desktop-2mnb
     rtl8187se-kernel-2.6.27.4-desktop586-1mnb
     rtl8187se-kernel-2.
  • Something

    1260833·text·1.6 KB·2008-11-18 22:33 UTC
    Nanar: rpm name match `sqlite':
     apache-mod_log_sqlite
     apache-mod_log_sqlite-debug
     apache-mod_vhost_sqlite3
     apr-util-dbd-sqlite3
     asterisk-plugins-sqlite
     bacula-dir-sqlite
     ba
  • Meins

    1260830·text·34.5 KB·2008-11-18 22:28 UTC
    
        
  • Haskell l33t program

    1260792·text·1.8 KB·2008-11-18 21:47 UTC
    import Random
    
    --Extended GCG algorithm
    extd_gcd :: (Integer,Integer) -> (Integer,Integer)
    extd_gcd (a,b) = 
     if a `mod` b == 0 then (0,1)
     else let
     (x,y) = extd_gcd (b, a `mod` b)
     in
  • rsa

    1260770·text·1.7 KB·2008-11-18 21:23 UTC
    import Random
    
    --Extended GCG algorithm
    extd_gcd :: (Integer,Integer) -> (Integer,Integer)
    extd_gcd (a,b) = 
     if a `mod` b == 0 then (0,1)
     else let
     (x,y) = extd_gcd (b, a `mod` b)
     in
  • Someone

    1260768·text·1.6 KB·2008-11-18 21:21 UTC
    import Random
    
    --Extended GCG algorithm
    extd_gcd :: (Int,Int) -> (Int,Int)
    extd_gcd (a,b) = 
     if a `mod` b == 0 then (0,1)
     else let
     (x,y) = extd_gcd (b, a `mod` b)
     in
     (y, x-y*(a
  • l33t haskell coder

    1260764·text·1.7 KB·2008-11-18 21:15 UTC
    import Random
    
    --Extended GCG algorithm
    extd_gcd :: (Integer,Integer) -> (Integer,Integer)
    extd_gcd (a,b) = 
     if a `mod` b == 0 then (0,1)
     else let
     (x,y) = extd_gcd (b, a `mod` b)
     in
  • Unbenannt

    1260752·text·61.4 KB·2008-11-18 21:06 UTC
    
        
  • Bruna

    1260748·text·9.3 KB·2008-11-18 21:03 UTC
    Logfile of HijackThis v1.99.1
    Scan saved at 18:43:47, on 17/11/2008
    Platform: Windows XP SP2 (WinNT 5.01.2600)
    MSIE: Internet Explorer v6.00 SP2 (6.00.2900.2180)
    
    Running processes:
    C:\WINDOWS\S
  • Anonym

    1260642·text·25.1 KB·2008-11-18 19:44 UTC
    ==7584== Memcheck, a memory error detector.
    ==7584== Copyright (C) 2002-2007, and GNU GPL'd, by Julian Seward et al.
    ==7584== Using LibVEX rev 1804, a library for dynamic binary translation.
    ==7584
  • kakashi

    1260630·text·17.5 KB·2008-11-18 19:20 UTC
    !!################################
    !!ALSA Information Script v 0.4.41
    !!################################
    
    !!Script ran on: Tue Nov 18 20:20:06 CET 2008
    
    !!Linux Distribution
    !!------------------
    
    Fe
  • Miscellany

    1260588·xml·64.3 KB·2008-11-18 18:31 UTC
    
        
  • belt16ag

    1260582·text·32.5 KB·2008-11-18 18:27 UTC
    
        
  • duna

    1260581·text·20.7 KB·2008-11-18 18:25 UTC
    tsalsa version 2008-09-14 Út lis 18 19:25:05 CET 2008 
    
     Laptop: hp dv6810ec 
     Plugs: 0 
     Surround sound system: y 
     Model options: y 
     Number of speakers: 0
  • Haskell

    1260572·text·1.1 KB·2008-11-18 18:13 UTC
    import Random
    
    --Extended GCG algorithm
    extd_gcd :: (Integer,Integer) -> (Integer,Integer)
    extd_gcd (a,b) = 
     if a `mod` b == 0 then (0,1)
     else let
     (x,y) = extd_gcd (b, a `mod` b)
     in
  • tchat free

    1260563·text·1.9 KB·2008-11-18 18:07 UTC
    [18-11-2008 18h37] [Début Session Tchat] [Service choisi: Technique]
    
    [18h48] Assistance: Bienvenue, vous êtes actuellement connecté sur le salon technique de free. Notez que vous pouvez à tout mome
  • Haskel l33t program

    1260558·text·956 B·2008-11-18 18:04 UTC
    import Random
    
    extd_gcd :: (Int,Int) -> (Int,Int)
    extd_gcd (a,b) = 
     if a `mod` b == 0 then (0,1)
     else let
     (x,y) = extd_gcd (b, a `mod` b)
     in
     (y, x-y*(a `div` b))
    
    coprime :: In

older pastes →