Prove you're a programmer

Cached page
Click the matching diagram: 

 

|    
|    
|   |    
|    
|    
|    
|   |    
|    
|    
 

|    
|    
|    
|    
|    
|    
|    
|    
}   s      nuf
‮} r‬      


‮a‬               


‮fi‬        
‮eu‬                  
{        

{    
{
ao  c   
‮f‬    

‮f‬         

{        


‮n‬              
  () t  B     
‮   o‬     
‮ A ‬        
‮}  B   i‬        
‮k erb‬            
         
‮ C ‬        
‮}  D ‬           
‮  nit oc‬            
         
‮ E ‬
    
    
    
    
Hints
  • if <cond> { ... }  ==>  condition
  • for { ... }  ==>  unconditional loop
  • break  ==>  exit loop
  • continue  ==>  next iteration (subject to <cond>, if exists)

Read about Go
 

1 language:
Go

Powered by cfgCaptcha; based on 197,767 player solutions to Graphomata.
Playable diagrams: 8,591 (non-isomorphic)
Diagrams contributed by 15, 1, 3, and 2 players in solutions to 1, 1, 1, and 1 levels, respectively (left to right).