This is no place for Befunge97 code.
Chris Pressey
3 years ago
68  68 
 [pangram.bf](pangram.bf)  CC0  Chris Pressey  8/25/112  Checks if the first line of input is a pangram  a sentence which contains all the letters of the alphabet, such as "The quick brown fox jumps over the lazy dog" or "Pack my lunch box with five dozen liquor jugs." Caseinsensitive, and ignores most punctuation, but "high" punctuation (above ASCII character 90) will likely confuse it.

69  69 
 [pascserp.bf](pascserp.bf)  CC0  Chris Pressey  7/12/97  Generates a gasket (Serpinsky triangle) using Pascal's Triangle.

70  70 
 [pi.bf](pi.bf)   Ben Olmstead  6/25/97  Produces the first hundred digits of pi in under one hundred characters of Befunge, but cheats in that it simply decompresses the digits encoded in the source code.

71  
 [pi2.bf](pi2.bf)   Kevin Vigor  7/2/97  Generates the first hundred digits of Pi. It does this not by cheating, but actually calculating Pi; unfortunately it far exceeds 100 characters of Befunge code.

72  71 
 [prime.bf](prime.bf)   Kalyna Zazelenchuk  9/5/93  Lists the counting numbers incrementally from one and checks if each is prime.

73  72 
 [rand.bf](rand.bf)   Chris Pressey  9/5/93  Generates random numbers between 1 and 9 as statistically evenly distributed as the computer's random number generator.

74  73 
 [rand10.bf](rand10.bf)   Ken Bateman  4/12/97  A 3x10 random number generator.

0  
aa* v ++

1  
vp*9920p*9930<  Pi generator in Bef97 

2  
>:09a*pa*3/1+19a*p09a*g:09b*v  

3  
v_@# g*b90 p*b910 < p<  7/2/1997, Kevin Vigor 

4  
>19a*g:+129b*p19a*g::09v ++

5  
v*a90g*b90*g*b91: _v#p*9<

6  
>g#v_ 2a*+\$ v :$

7  
>\1aa*ga*+v p

8  
v1:/g*b92p*991:< *

9  
>9b*p29b*g*199*g\v9

10  
v*b92p*aa1g*990<9

11  
>g229b*p099*g1:0^

12  
v 9p*b92:%ag*991 <

13  
>#v_ 299*g1+299*p> ^

14  
>09b*g:#v_$v

15  
v93p*b901<

16  
>9*g199*ga/+.v

17  
v:g*992 <p*9 92<

18  
v_29b*g399*p ^

19  
>09b*g:#v_v 1

20  
vp*b901 < $ g

21  
>199*g9`#v_'9,v *

22  
>'0, >' ,299^⏎
