Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

type Point struct {
	x, y float64
}
func main() {
	for scanner.Scan() {
		buf1 := strings.Split(scanner.Text(), " ")
		line1 := make([]float64, len(buf1))
		for i := range line1 {
			line1[i], _ = strconv.ParseFloat(buf1[i], 64)
		}
		if line1[0] == 0 && line1[1] == 0 &&
			line1[2] == 0 && line1[3] == 0 {
				break
		}
		scanner.Scan()
		buf2 := strings.Split(scanner.Text(), " ")
		line2 := make([]float64, len(buf2))
		for i := range line2 {
			line2[i], _ = strconv.ParseFloat(buf2[i], 64)
		}
		scanner.Scan()
		buf3 := strings.Split(scanner.Text(), " ")
		line3 := make([]float64, len(buf3))
		for i := range line2 {
			line3[i], _ = strconv.ParseFloat(buf3[i], 64)
		}
		if !intersect(line1[0], line1[1], line1[2], line1[3], line2[0], line2[1], line2[2], line2[3]) ||
			!intersect(line2[0], line2[1], line2[2], line2[3], line3[0], line3[1], line3[2], line3[3]) ||
			!intersect(line3[0], line3[1], line3[2], line3[3], line1[0], line1[1], line1[2], line1[3]) {
				fmt.Println("kyo")
		} else {
			p1 := intersection(line1[0], line1[1], line1[2], line1[3], line2[0], line2[1], line2[2], line2[3])
			p2 := intersection(line2[0], line2[1], line2[2], line2[3], line3[0], line3[1], line3[2], line3[3])
			p3 := intersection(line3[0], line3[1], line3[2], line3[3], line1[0], line1[1], line1[2], line1[3])
			area := math.Abs((p2.x - p1.x) * (p3.y - p1.y) - (p2.y - p1.y) * (p3.x - p1.x))/2
			if area < 0.00000001 {
				fmt.Println("kyo")
			} else if 1899999.99999999 < area {
				fmt.Println("dai-kichi")
			} else if 999999.99999999 < area {
				fmt.Println("chu-kichi")
			} else if 99999.99999999 < area {
				fmt.Println("kichi")
			} else {
				fmt.Println("syo-kichi")
			}
		}
	}
}

func cross(x1, y1, x2, y2 float64) int {
	z :=  x1 * y2 - y1 * x2
	if 0 < z {
		return 1
	} else if z < 0 {
		return -1
	} else {
		return 0
	}
}

func intersect(x1, y1, x2, y2, x3, y3, x4, y4 float64) bool {
	if 0 <= cross(x2-x1, y2-y1, x3-x1, y3-y1) *
		cross(x2-x1, y2-y1, x4-x1, y4-y1) {
			return false
	}
	if 0 <= cross(x4-x3, y4-y3, x1-x3, y1-y3) *
		cross(x4-x3, y4-y3, x2-x3, y2-y3) {
			return false
	}
	return true
}

func intersection(x1, y1, x2, y2, x3, y3, x4, y4 float64) Point {
	if x3 == x4 {
		x1, x3 = x3, x1
		y1, y3 = y3, y1
		x2, x4 = x4, x2
		y2, y4 = y4, y2
	}
	ret := Point{}
	if x1 == x2 {
		// y軸に平行な直線の場合
		c := (y4 - y3) / (x4 - x3)
		d := y3 - c * x3
		x := x1
		y := c * x + d
		ret.x, ret.y = x, y
	} else {
		a := (y2 - y1) / (x2 - x1)
		b := y1 - a * x1
		c := (y4 - y3) / (x4 - x3)
		d := y3 - c * x3
		x := (d - b) / (a - c)
		y := a * x + b
		ret.x, ret.y = x, y
	}
	return ret
}

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

typedef complex<double> P;
typedef pair<P,P> L;
const double EPS = 1e-8;

double dot(P a, P b){ return real(conj(a)*b);}
double cross(P a, P b){ return imag(conj(a)*b);}

int ccw(P a, P b, P c){
    c -= a;
    b -= a;
    if(cross(b, c) > EPS) return 1;
    if(cross(b, c) < -EPS) return -1;
    if(dot(b,c) < -EPS) return 2;
    if(norm(b) < norm(c)) return -2;
    return 0;
}

bool isIntersect(L s1, L s2){
    return ( ccw(s1.first,s1.second,s2.first) * ccw(s1.first,s1.second,s2.second) <= 0 &&
             ccw(s2.first,s2.second,s1.first) * ccw(s2.first,s2.second,s1.second) <= 0);
}

P crossPoint(L l, L m){
    double A = cross(l.second - l.first, m.second - m.first);
    double B = cross(l.second - l.first, l.second - m.first);
    if(fabs(A) < EPS && fabs(B) < EPS) return m.first;
    else if(fabs(A) >= EPS) return m.first + B / A * (m.second - m.first);
}

double area(vector<P> v){
    double sum = 0.0;
    int n = v.size();
    for(int i=0;i<n;i++) sum += (real(v[i]) - real(v[(i+1)%n])) * (imag(v[i]) + imag(v[(i+1)%n]));
    return fabs(sum / 2.0);
}

string ans(vector<P> v){
    double a = area(v);
    if(a < EPS) return "kyo";
    if(a < 100000.0) return "syo-kichi";
    if(a < 1000000.0) return "kichi";
    if(a < 1900000.0) return "chu-kichi";
    return "dai-kichi";
}

int main(){
    double x1,y1,x2,y2;
    while(cin >> x1 >> y1 >> x2 >> y2 && (x1||y1||x2||y2)){
        L v[3];
        vector<P> p;
        bool f = false;
        v[0] = L(P(x1,y1),P(x2,y2));
        for(int i=1;i<3;i++) {
            cin >> x1 >> y1 >> x2 >> y2;
            v[i] = L(P(x1,y1),P(x2,y2));
            if(!isIntersect(v[0],v[i])) f = true;
            else p.push_back(crossPoint(v[0],v[i]));
        }
        if(!isIntersect(v[1],v[2])) f = true;
        else p.push_back(crossPoint(v[1],v[2]));

        if(!f){
            for(int i=0;i<3;i++){
                for(int j=i+1;j<3;j++){
                    if(abs(p[i]-p[j]) < EPS) f = true;
                }
            }
        }

        if(f) cout << "kyo" << endl;
        else cout << ans(p) << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <complex>
#include <assert.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define EPS (1e-7)

typedef complex<double> P;
struct Line : public vector<P>
{
  Line() {
  }
  Line(P a, P b) {
    push_back(a);
    push_back(b);
  }
};

double cross(P const& a, P const& b) {
  return imag(conj(a)*b);
}

bool is_cross_ss(Line const& a, Line const& b) {
  return ( cross(a[1]-a[0], b[0]-a[0]) * cross(a[1]-a[0], b[1]-a[0]) < EPS )
    && ( cross(b[1]-b[0], a[0]-b[0]) * cross(b[1]-b[0], a[1]-b[0]) < EPS );
}

P crosspoint_ss(Line const& a, Line const& b) {
  P vb = b[1]-b[0];
  double d1 = abs(cross(vb, a[0]-b[0]));
  double d2 = abs(cross(vb, a[1]-b[0]));
  double t = d1 / (d1+d2);
  return a[0] + (a[1]-a[0]) * t;
}

bool operator == (P const& a, P const& b) {
  return ( abs(a.real()-b.real()) < EPS && abs(a.imag()-b.imag()) < EPS );
}

int main() {
  
  while(1) {
    Line l[3];
    rep(i, 3) {
      double sx, sy, gx, gy;
      cin >> sx >> sy >> gx >> gy;
      if(i == 0 && sx == 0 && sy == 0 && gx == 0 && gy == 0) return 0;
      l[i] = Line(P(sx, sy), P(gx, gy));
    }
    
    
    vector<P> ps;
    rep(i, 3) {
      if(is_cross_ss(l[i], l[(i+1)%3])) {
        P cp = crosspoint_ss(l[i], l[(i+1)%3]);
        bool ok = 1;
        rep(j, (int)ps.size())
          if(ps[j] == cp) { ok = 0; }
        if(ok) {
          ps.push_back(cp);
        }
      }
    }
    
    if(ps.size() < 3) {
      cout << "kyo\n";
      continue;
    }
    if(ps.size() > 3) {
      assert(false && "sine");
    }
    
    double ans = abs(ps[1]-ps[0])*abs(ps[2]-ps[0]) / 2.;
    if(ans < 100000.) {
      cout << "syo-kichi\n";
    }
    else if(ans < 1000000.) {
      cout << "kichi\n";
    }
    else if(ans < 1900000) {
      cout << "chu-kichi\n";
    }
    else {
      cout << "dai-kichi\n";
    }
  }
  
  return 0;
}