Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	var scanner = bufio.NewScanner(os.Stdin)
	board := make([][]int, 8)
	for i := range board {
		board[i] = make([]int, 8)
			for j := range board[i] {
				board[i][j] = 0
			}
	}
	var ans string
	for scanner.Scan() {
		tmp := strings.Split(scanner.Text(), "")
		for i := 0; i < 8; i++ {
			board[0][i], _ = strconv.Atoi(tmp[i])
		}
		for i := 1; i < 8; i++ {
			scanner.Scan()
			row := strings.Split(scanner.Text(), "")
			for j := 0; j < 8; j++ {
				board[i][j], _ = strconv.Atoi(row[j])
			}
		}
		fmt.Println(board)
		for i := 0; i < 7; i++ {
			for j := 0; j < 7; j++ {
				if board[i][j] == 1 && board[i+1][j] == 1 && board[i][j+1] == 1 && board[i+1][j+1] == 1 {
					ans = "A"
				}
			}
		}
		for i := 0; i < 5; i++ {
			for j := 0; j < 8; j++ {
				if board[i][j] == 1 && board[i+1][j] == 1 && board[i+2][j] == 1 && board[i+3][j] == 1 {
					ans = "B"
				}
			}
		}
		for i := 0; i < 8; i++ {
			for j := 0; j < 5; j++ {
				if board[i][j] == 1 && board[i][j+1] == 1 && board[i][j+2] == 1 && board[i][j+3] == 1 {
					ans = "C"
				}
			}
		}
		for i := 0; i < 6; i++ {
			for j := 0; j < 7; j++ {
				if board[i][j+1] == 1 && board[i+1][j] == 1 && board[i+1][j+1] == 1 && board[i+2][j] == 1 {
					ans = "D"
				}
			}
		}
		for i := 0; i < 7; i++ {
			for j := 0; j < 6; j++ {
				if board[i][j] == 1 && board[i][j+1] == 1 && board[i+1][j+1] == 1 && board[i+1][j+2] == 1 {
					ans = "E"
				}
			}
		}
		for i := 0; i < 7; i++ {
			for j := 0; j < 6; j++ {
				if board[i][j+1] == 1 && board[i][j+2] == 1 && board[i+1][j] == 1 && board[i+1][j+1] == 1 {
					ans = "G"
				}
			}
		}
		for i := 0; i < 6; i++ {
			for j := 0; j < 7; j++ {
				if board[i][j] == 1 && board[i+1][j] == 1 && board[i+1][j+1] == 1 && board[i+2][j+1] == 1 {
					ans = "F"
				}
			}
		}
		fmt.Println(ans)
	}
}

C++: #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

string grid[8];
bool is_A(int i,int j) {
    if(i+1>=8 || j+1>=8) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i+1][j]=='0') return false;
    if(grid[i][j+1]=='0') return false;
    if(grid[i+1][j+1]=='0') return false;
    return true;

}
bool is_B(int i,int j) {
    if(i+3>=8) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i+1][j]=='0') return false;
    if(grid[i+2][j]=='0') return false;
    if(grid[i+3][j]=='0') return false;
    return true;
}
bool is_C(int i,int j) {
    if(j+3>=8) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i][j+1]=='0') return false;
    if(grid[i][j+2]=='0') return false;
    if(grid[i][j+3]=='0') return false;
    return true;
}
bool is_D(int i,int j) {
    if(i+2>=8||j-1<0) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i+1][j]=='0') return false;
    if(grid[i+1][j+1]=='0') return false;
    if(grid[i+2][j+1]=='0') return false;
    return true;
}
bool is_E(int i,int j) {
    if(i+2>=8||j+2>=8) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i][j+1]=='0') return false;
    if(grid[i+1][j+1]=='0') return false;
    if(grid[i+1][j+2]=='0') return false;
    return true;
}
bool is_F(int i,int j) {
    if(j+2>=8||i-1<0) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i][j+1]=='0') return false;
    if(grid[i+1][j+1]=='0') return false;
    if(grid[i+1][j+2]=='0') return false;
    return true;
}
bool is_G(int i,int j) {
    if(i+2>=8||j+2>=8) return false;
    if(grid[i][j]=='0') return false;
    if(grid[i+1][j]=='0') return false;
    if(grid[i+1][j+1]=='0') return false;
    if(grid[i+2][j+1]=='0') return false;
    return true;
}
void solve() {
    rep(i,8) rep(j,8) {

        if(is_A(i,j)) {
            cout<<"A"<<endl;
            return;
        }
        if(is_B(i,j)) {
            cout<<"B"<<endl;
            return;
        }
        if(is_C(i,j)) {
            cout<<"C"<<endl;
            return;
        }
        if(is_D(i,j)) {
            cout<<"D"<<endl;
            return;
        }
        if(is_E(i,j)) {
            cout<<"E"<<endl;
            return;
        }
        if(is_F(i,j)) {
            cout<<"F"<<endl;
            return;
        }
        if(is_G(i,j)) {
            cout<<"G"<<endl;
            return;
        }
        if(is_B(i,j)) {
            cout<<"B"<<endl;
            return;
        }
        if(is_B(i,j)) {
            cout<<"B"<<endl;
            return;
        }
    }

    cout<<"hoge"<<endl;
}
int main() {
    while(cin>>grid[0]) {
        rep(i,7) cin>>grid[i+1];
        solve();

    }
    return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main()
{
	int dx[] = {1,1,0,0,0,0,1,2,3,0,-1,-1,1,1,2,0,1,1,1,0,-1};
	int dy[] = {0,1,1,1,2,3,0,0,0,1,1,2,0,1,1,1,1,2,0,1,1};
	string abc = " ABCDEFG";
	string map[8];
	while (cin >> map[0]){
		
		for (int i = 1; i < 8; i++){
			cin >> map[i];
		}
		int cnt = 0;
		int flag = 0;
		for (int i = 0; i < 8; i++){
			for (int i2 = 0; i2 < 8; i2++){
				if (map[i][i2] == '1'){
					for (int i3 = 1; i3 <= 21; i3++){
						int x = i2 + dx[i3 - 1];
						int y = i + dy[i3 - 1];
						if (x >= 0 && x < 8 && y >= 0 && y < 8 && map[y][x] == '1'){
							cnt++;
						}
						if (i3 % 3 == 0){
							if (cnt == 3){
								flag = i3 - 1; cout << abc[(i3) / 3] << endl;
								cnt = 0;
							}
							cnt = 0;
						}
					}
				}
			}
		}
	}
}

C++: #include <iostream>
using namespace std;

int check_n(char math[]){
	int i=0;
	int count = 0;
	while(math[i]){
		if(math[i]=='1') count++;
		i++;
	}
	return (count);
}

int check_p(char math[]){
	int i=0;
	int count = 0;
	while(math[i]){
		if(math[i]=='1') break;
		i++;
	}
	return (i);
}


int main(void)
{
	char math[10][10]={0};
	while(cin >> math[0]){
		for(int i=1; i<8; i++){
			cin >> math[i];
		}
		int i=0;
		int count;
		for(; i<8; i++){
			if(check_n(math[i])) {
				count = check_n(math[i]);
				break;
			}
		}
		if(count == 4){
			cout << "C" << endl;
		}else if( count == 2 ){
			switch(check_p(math[i+1])-check_p(math[i])){
			case 1:
				cout << "E" << endl;
				break;
			case 0:
				cout << "A" << endl;
				break;
			case -1:
				cout << "G" << endl;
				break;
			}
		}else if (count == 1){
			switch(check_n(math[i+1])){
			case 1:
				cout << "B" << endl;
				break;
			case 2:
				if(check_p(math[i+1])-check_p(math[i])==0){
					cout << "F" << endl;
				}else{
					cout << "D" << endl;
				}
				break;
			}
		}
	}
	return 0;
}