Prove you're a programmer

Cached page
Click the matching diagram: 

 


|    
|    
|   |    
|   |   |    
|   |    
|   |    
|   |    
|   |   |    
|   |    
|    
|    
 


|    
|    
|   |    
|   |    
|   |    
|   |    
|   |    
|   |    
|    
|    
}    i      uf

‮r‬      

‮of‬        
‮}      i‬            
‮uter‬                
{            






{    
{
   c T



            {
             f
                     n


            if
                  ea
            }
  ()s xa   n  
‮ A ‬    
‮}  of‬    
‮ B ‬        
‮  r‬          
‮   C ‬               
‮ r‬                    
             
‮ D ‬            
‮}  E ‬               
‮k  rb‬                
             
{        
‮ F ‬
    
    
    
    
Hints
  • if <cond> { ... }  ==>  condition
  • for { ... }  ==>  unconditional loop
  • break  ==>  exit loop
  • return  ==>  exit

Read about Go
 

1 language:
Go

Powered by cfgCaptcha; based on 218,696 player solutions to Graphomata.
Playable diagrams: 9,955 (non-isomorphic)
Diagrams contributed by 4, 8, 20, and 1 players in solutions to 1, 3, 7, and 1 levels, respectively (left to right).