answer1 = "tralalala";
q = new Array();

q['q1'] = 'a896b6a98a55c2acabba492cdc3cd92f4e4d7b7c';
q['q2'] = 'b01049fe33eb88dcddb0e8bc5204530f68fd9438';
q['q3'] = '3118e73f5dd300054745938bb0be72c696683bc5';
q['q4'] = 'd305fdca425e3f9775af14735effd553de25b3b1';
q['q5'] = 'a2b5f43a88f7da288ce00cf13d18a8367745898b';
q['q6'] = 'b6c6e8448981a8e44ddb41a583449e2842279db4';
q['q7'] = '8cdc7536989d59378df1a626ffaef1a41f30d206';
q['q8'] = 'e4d77d93811f1f6c1a18ac9e51a4ff4f7c8ae426';
q['q9'] = 'bf5c443893043ce9cd4375083168949a11d0a02d';
q['q10'] = '4833d99a002a0c3d337d11fe44c0dfc938101532';
q['q11'] = '42aafc72f51bfcac521fc7c7e82a473d9bf38128';
q['q12'] = '065541e0987fdf479d0491f71e9a30ecfb2356cb';
q['q13'] = 'b88bc7bdeb1ef187fddb896ac1b4f8554dfad45e';
q['q14'] = '8854464e66b9155ff405c27b500fed138668b475';
q['q15'] = 'f524955b92621583444b6bba8ea1813c828a2994';
q['q16'] = '557533caf84e90aa1255ac6c13aa714f40405f72';
q['q17'] = 'c67ad708c3d4df119c154a2addcea7f1eba0d581';
q['q18'] = 'b7d2316b1af957bb468d04ffe58d736821757eb4';
q['q19'] = '4027f18f4101e3a0ef196ed4041481c2bc088aa0';
q['q20'] = 'ecde08f186e815d59f0c2e346d40f9817801dbe2';
q['q21'] = '4cedc7865bcf359731904a1923ed40b58b633f6f';
q['q22'] = 'f8562637f62b313877a3711aa5a038ae61ca4cc5';
q['q23'] = 'e5e8cef2c87828858f59b44f1387728baef26216';
q['q24'] = '5078036662071928c0307168fb7a87bd8a17ca0c';
q['q25'] = '9e1f8735d54f5eed9c1146696dad50d67e6e69ca';
q['q26'] = '79aa0b56a057dac406370a651977afc7f7dce995';
q['q27'] = 'ded2b866eea308ba9daf924e4a3dd096f0ce0886';
q['q28'] = '73374641861f383f98042001dd1a7b7711f4ce0b';
q['q29'] = 'c9d49a225dc22f9894c8e690fc50b4656b280dea';
q['q30'] = '9254d1946aa96d8074ce617283e522c09e00e765';
q['q31'] = '8975e203d76a6352e7c95c67a1bedc82f43577ef';
q['q32'] = '31e7357665efdce60b742d0fc4a6e02a972690a3';

function izpisi_hash(str)
{
return document.write(sha1Hash(document.getElementById(str).value.toUpperCase()))
}

function checkQ(str) {
	if(sha1Hash(document.getElementById(str).value.toUpperCase()) == q[str])
	{
		validate1(str);
	}
	else
	{
		validate2(str);
	}
	
}
function validate1(qstr) {
	if(document.getElementById(qstr).disabled == false) {
	document.getElementById(qstr).disabled = true;
	document.getElementById(qstr).style.border = '2px solid #00FF00'; 
	document.getElementById('correct').innerHTML = document.getElementById('correct').innerHTML*1 + 1;
	}
}

function validate2(qstr) {
	if(document.getElementById(qstr).value=='') {
		document.getElementById(qstr).style.border = '1px solid #A5ACB2'; 
	}
	else
	{
	document.getElementById(qstr).style.border = '2px solid #FF0000'; 
	}
}


function sha1Hash(msg)
{
    // constants [4.2.1]
    var K = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];

    // PREPROCESSING 
 
    msg += String.fromCharCode(0x80);  // add trailing '1' bit to string [5.1.1]

    // convert string msg into 512-bit/16-integer blocks arrays of ints [5.2.1]
    var l = Math.ceil(msg.length/4) + 2;  // long enough to contain msg plus 2-word length
    var N = Math.ceil(l/16);              // in N 16-int blocks
    var M = new Array(N);

    for (var i=0; i<N; i++) {
        M[i] = new Array(16);
        for (var j=0; j<16; j++) {  // encode 4 chars per integer, big-endian encoding
            M[i][j] = (msg.charCodeAt(i*64+j*4)<<24) | (msg.charCodeAt(i*64+j*4+1)<<16) | 
                      (msg.charCodeAt(i*64+j*4+2)<<8) | (msg.charCodeAt(i*64+j*4+3));
        } // note running off the end of msg is ok 'cos bitwise ops on NaN return 0
    }
    // add length (in bits) into final pair of 32-bit integers (big-endian) [5.1.1]
    M[N-1][14] = ((msg.length-1) >>> 30) * 8;
    M[N-1][15] = ((msg.length-1)*8) & 0xffffffff;

    // set initial hash value [5.3.1]
    var H0 = 0x67452301;
    var H1 = 0xefcdab89;
    var H2 = 0x98badcfe;
    var H3 = 0x10325476;
    var H4 = 0xc3d2e1f0;

    // HASH COMPUTATION [6.1.2]

    var W = new Array(80); var a, b, c, d, e;
    for (var i=0; i<N; i++) {

        // 1 - prepare message schedule 'W'
        for (var t=0;  t<16; t++) W[t] = M[i][t];
        for (var t=16; t<80; t++) W[t] = ROTL(W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16], 1);

        // 2 - initialise five working variables a, b, c, d, e with previous hash value
        a = H0; b = H1; c = H2; d = H3; e = H4;

        // 3 - main loop
        for (var t=0; t<80; t++) {
            var s = Math.floor(t/20); // seq for blocks of 'f' functions and 'K' constants
            var T = (ROTL(a,5) + f(s,b,c,d) + e + K[s] + W[t]) & 0xffffffff;
            e = d;
            d = c;
            c = ROTL(b, 30);
            b = a;
            a = T;
        }

        // 4 - compute the new intermediate hash value
        H0 = (H0+a) & 0xffffffff;  // note 'addition modulo 2^32'
        H1 = (H1+b) & 0xffffffff; 
        H2 = (H2+c) & 0xffffffff; 
        H3 = (H3+d) & 0xffffffff; 
        H4 = (H4+e) & 0xffffffff;
    }

    return H0.toHexStr() + H1.toHexStr() + H2.toHexStr() + H3.toHexStr() + H4.toHexStr();
}

//
// function 'f' [4.1.1]
//
function f(s, x, y, z) 
{
    switch (s) {
    case 0: return (x & y) ^ (~x & z);
    case 1: return x ^ y ^ z;
    case 2: return (x & y) ^ (x & z) ^ (y & z);
    case 3: return x ^ y ^ z;
    }
}

//
// rotate left (circular left shift) value x by n positions [3.2.5]
//
function ROTL(x, n)
{
    return (x<<n) | (x>>>(32-n));
}

//
// extend Number class with a tailored hex-string method 
//   (note toString(16) is implementation-dependant, and  
//   in IE returns signed numbers when used on full words)
//
Number.prototype.toHexStr = function()
{
    var s="", v;
    for (var i=7; i>=0; i--) { v = (this>>>(i*4)) & 0xf; s += v.toString(16); }
    return s;
}
function resetForm() {
	
	for(i=1;i<34;i++) {
	document.getElementById('q'+i).disabled = false;
	}
	document.forms[0].reset();
}