zoukankan      html  css  js  c++  java
  • 万恶之源(上课随机点名用)

    <!doctype html>
    <html>
    <head>
    <meta charset="utf-8">
    <title>无标题文档</title>
    <link rel="stylesheet" href="lib/zTree_v3-master/css/demo.css">
    <link rel="stylesheet" href="lib/zTree_v3-master/css/zTreeStyle/zTreeStyle.css">
    <script>
    var object= null;
    var nameArr = ["1","2","3","4","5","6","7","8"];//名字
    var thinkArr = ["唱歌","说绕口令","真心话","大冒险"];//惩罚
    function dianming(obj){
        var cpdom = document.getElementById('cp');
        if(obj.getAttribute('data') == "start"){
            obj.setAttribute('data',"qwe");
            obj.innerHTML = "停止";
            object = setInterval(function(){
                cpdom.value = nameArr[parseInt(Math.random()*nameArr.length)]+"->"+thinkArr[parseInt(Math.random()*thinkArr.length)];
            },10);
        }else{
            clearInterval(object);
            obj.innerHTML = "开始";
            obj.setAttribute('data',"start");
        }
          
    }
    
    </script>
    </head>
    
    <body>
    <button onClick="dianming(this)" data="start">点名</button>
    
    <input id="cp" type="text">
    
    </iframe>
    </body>
    </html>
  • 相关阅读:
    [HAOI2015] 数组游戏
    [HAOI2015] 数字串拆分
    [HAOI2015] 按位或
    [HAOI2009] 毛毛虫
    [HAOI2009] 巧克力
    [HAOI2011] Problem C
    [HAOI2011] 防线修建
    [HAOI2011] Problem A
    [HAOI2010] 最长公共子序列
    [HAOI2010] 工厂选址
  • 原文地址:https://www.cnblogs.com/sword082419/p/9412191.html
Copyright © 2011-2022 走看看