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

q['q1'] = '3d88c39c7b83435ce0c61552d13a783346f31f96';
q['q2'] = '1d65fcd5596ef55f72305f32da63fdbcfe08bd4d';
q['q3'] = '8dead7cf3e67ecf67ea6861d978725b9a7fad42c';
q['q4'] = '3192a9b4ea09ac38f3983353a5dc0457568d194b';
q['q5'] = '4ad7dade4380df121a084df493d776f88b464f83';
q['q6'] = '826f0888147dc57346b8c51ad99235e05874a6ec';
q['q7'] = 'a5b96fff469f37e624be5d89fd9347430992734e';
q['q8'] = '6534b2d5789130067c07346e2775854ecf3bacc8';
q['q9'] = 'ac0ffa357fcf8d5005dfcb892c07227912b42715';
q['q10'] = '4c347670c674ecd3b82fe9d6c59f739690aa2142';
q['q11'] = '57ed338e03768aa8322fe3ee2c4fc6d97bf4161c';
q['q12'] = '60f7ccbf0b089b38eeac0764ac34d599142afc7d';
q['q13'] = '21581f04d5ceb12433ec58a1b8f6f85d0e4e2ccd';
q['q14'] = 'aabe5255cd68a63bf8cdce43490569f047422c1e';
q['q15'] = '1f2e1eba2ea078758762f7215df23a243a2b45a9';
q['q16'] = '50ae3c9d7183a89a46e75b5b5adf68aa4a651b8e';
q['q17'] = '987db57256ece274598cc40ef46090659203c8a6';
q['q18'] = 'd3716233b9e126175211ff6d181b933e4b475e86';
q['q19'] = 'fd4a3cf23cf4111ac115e296d063450951b779d0';
q['q20'] = '508d8927cb9c9b65c45ba9c41a871f2cac2b5548';
q['q21'] = 'ce0c8a9dd932ec980cec32ec718617e2eb3fad2c';
q['q22'] = '7a2694fb3f2fe6b3d9524361783188e2700c5c07';
q['q23'] = 'c70955654ea88df351e78db4933964fa95b39fce';
q['q24'] = '2abfdc70e9eab08e1e43881a6607cf5ee86cc6c0';



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();
}