answer1 = "tralalala";
q = new Array();

q['q1'] = 'b5e131315befa99953173f88131f0883c9225c0a';
q['q2'] = 'f6d98ecf7a08164ea130caee15496c4d1b70bd15';
q['q3'] = 'c03792cac79e4dc3d9c3385f587dd66ef800d271';
q['q4'] = '3bff170a7a674312431fd9a5f8c22dbed99e044b';
q['q5'] = 'daa05b5d5baf4e99b021d5e400b184ffcb2b9ae2';
q['q6'] = '2198d1b54b93739f8f68598fed736292204d9c5b';
q['q7'] = '14b0ff6a728e90f117a44c695b3e93ab03e8f8cc';
q['q8'] = '90eb60616a2f14b681853f1183064186293f9910';
q['q9'] = 'da012e95385dc9d5370ecbcdfba6bd934ba753f9';
q['q10'] = '547045ba7fdcea150bd43bc6ecd708f5c33388e9';
q['q11'] = '55e24b9e9aa1db2a058cac1cdac7220c3fb11e8d';
q['q12'] = '0f7295c1cd050c2433b13eaf879947c7e482352a';
q['q13'] = '2b3a1c31734f89d8989e3accbbdf1144b99a8781';
q['q14'] = 'c4339819d536b3fa9a8391f2d168ada0d83373c9';
q['q15'] = 'bceab24e0232e75ae916c58847b07c26445c193e';
q['q16'] = '06ff9f8c53e7cf1174afb39f9a0fee23b929d30b';
q['q17'] = '249acf214d2b89d791897d332cbc4dc1174705ea';
q['q18'] = 'e07042c97c2fd8e7ab1b8567172ce4b2354def0e';
q['q19'] = '8e40ca7b101862d8b05af65cf823e56b7b73c080';
q['q20'] = '51eb3e2d2c16e8fee552b5ff47a6c556a02776e4';
q['q21'] = '2965b47e8f175f8c3af05b8f27a6b496b1863856';
q['q22'] = '309bbaf95a9f250103b7c372c852413806d94871';
q['q23'] = '057083c274ad23cd552e244ca7b7b5745604b187';
q['q24'] = 'de464db668ed1f3eb0296b0b40988410e5a7e436';
q['q25'] = 'f00a3ea24db6f95fdca37e127206e32d3e4104c4';
q['q26'] = 'e2100184a4eabea27a3c84f213da49660d361ddf';
q['q27'] = 'f1b352f6c814f03d0149109c3b03cbb69e72eb12';
q['q28'] = '8e28fd068faa0c8b6af90ca355d0d390904dd447';
q['q29'] = 'cb9de8ec44a39057fff4a10f2bbca7c729e565ca';
q['q30'] = '9387da1ad92becd91951a98c2bf401a4f881a81a';
q['q31'] = '6322116ace5ecdee979e898eca74a0f11119be0f';
q['q32'] = '362a5af06d1d4cde6895b2eee1bbc9870c9f5a4e';
q['q33'] = '7248e8c47fe7e4876f9df1aa34049d42a8fc65d0';



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;
    }

//     alert (H0.toHexStr() + H1.toHexStr() + H2.toHexStr() + H3.toHexStr() + H4.toHexStr());
    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();
}

