Prove you're a programmer

Cached page
Click the matching diagram: 

 


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


|    
|    
|   |    
|   |    
|   |    
|   |    
|    
|    
|    
|    
}    ta    uf



‮of‬        


‮r‬                 



‮fi‬        
‮rb‬            


{
(      cn  

‮of‬    

‮r‬          


‮ae‬                  
{            


‮}    ‬           
‮ae‬              
{        
   )s  C     
‮ A ‬    
‮} r‬      
‮ B ‬        
}            
‮ C ‬            
‮}  D  fi‬            
‮k   b‬                
             
‮ E ‬            
{        
‮   F ‬           
‮k‬                
         
{
    
    
    
    
Hints
  • if <cond> { ... }  ==>  condition
  • for { ... }  ==>  unconditional loop
  • break  ==>  exit loop

Read about Go
 

1 language:
Go

Powered by cfgCaptcha; based on 213,026 player solutions to Graphomata.
Playable diagrams: 9,265 (non-isomorphic)
Diagrams contributed by 30, 6, 8, and 112 players in solutions to 3, 1, 3, and 3 levels, respectively (left to right).