Let the storm money come!

世界杯小组赛所有得分情况

复制代码
代码
<html>
<head>
<script src="jquery-1.4.2.min.js"></script>
</head>
<body>

<table id="result">
    
<tr>
        
<td></td><td></td><td></td>
    
</tr>
</table>

<script>
    
var condition = [];
    
var count = 0;
    
for (var win = 0; win <= 3; win++) {
        
for (var draw = 0; draw <= 3; draw ++) {
            
for (var lose = 0; lose <= 3; lose++) {
                
if (win + draw + lose == 3) {
                    condition[count
++= {"win" : win, "draw" : draw, "lose" : lose};
                }
            }
        }
    }

alert(count);
    
for (var team1 = 0; team1 < count; team1++) {
        
for (var team2 = 0; team2 < count; team2++) {
            
for (var team3 = 0; team3 < count; team3++) {
                
for (var team4 = 0; team4 < count; team4++) {
                    
if (condition[team1].win + condition[team2].win + condition[team3].win
                        
+ condition[team4].win == condition[team1].lose + condition[team2].lose + condition[team3].lose
                        
+ condition[team4].lose && (condition[team1].draw + condition[team2].draw 
                        
+ condition[team3].draw + condition[team4].draw) % 2 == 0 && AtLeast(team1, team2, team3, team4)) {

                        document.write(condition[team1].win 
+ " " + condition[team1].draw 
                        
+ " " + condition[team1].lose + " " + (condition[team1].win * 3 + condition[team1].draw * 1+ "" + "<br />");
                        document.write(condition[team2].win 
+ " " + condition[team2].draw 
                        
+ " " + condition[team2].lose +  " " + (condition[team2].win * 3 + condition[team2].draw * 1+ "" +"<br />");
                        document.write(condition[team3].win 
+ " " + condition[team3].draw 
                        
+ " " + condition[team3].lose + " " + (condition[team3].win * 3 + condition[team3].draw * 1+ "" + "<br />");
                        document.write(condition[team4].win 
+ " " + condition[team4].draw 
                        
+ " " + condition[team4].lose + " " + (condition[team4].win * 3 + condition[team4].draw * 1+ "" + "<br />");
                        document.write(
"<hr />");
                    }
                }
            }
        }
    }

    
function AtLeast(team1, team2, team3, team4) {
         
var winOk = true

        
for (var i = 1; i <= 4; i++) {
            
if (condition[eval('team' + i)].win > 0) {
                
var count = 0;
                
for (var j = 1; j <=4; j++) {
                    
if (j != i) {
                        
if (condition[eval('team' + j)].lose > 0)
                            count 
++;
                    }
                }
                winOk 
= winOk && condition[eval('team' + i)].win <= count;
            }
        }
        
var draw = true;
        
for (var i = 1; i <= 4; i++) {
            
if (condition[eval('team' + i)].draw > 0) {
                
var count = 0;
                
for (var j = 1; j <=4; j++) {
                    
if (j != i) {
                        
if (condition[eval('team' + j)].draw > 0)
                            count 
++;
                    }
                }
                draw 
= draw && condition[eval('team' + i)].draw <= count;
            }
        }
        
var lose = true
        
for (var i = 1; i <= 4; i++) {
            
if (condition[eval('team' + i)].lose > 0) {
                
var count = 0;
                
for (var j = 1; j <=4; j++) {
                    
if (j != i) {
                        
if (condition[eval('team' + j)].win > 0)
                            count 
++;
                    }
                }
                lose 
= lose && condition[eval('team' + i)].lose <= count;
            }
        }
        
return winOk && draw && lose;
    }

</script>
</body>
</html>
复制代码

 

posted @   精密~顽石  阅读(1529)  评论(0编辑  收藏  举报
编辑推荐:
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
阅读排行:
· TypeScript + Deepseek 打造卜卦网站:技术与玄学的结合
· 阿里巴巴 QwQ-32B真的超越了 DeepSeek R-1吗?
· 【译】Visual Studio 中新的强大生产力特性
· 【设计模式】告别冗长if-else语句:使用策略模式优化代码结构
· 10年+ .NET Coder 心语 ── 封装的思维:从隐藏、稳定开始理解其本质意义
< 2010年6月 >
30 31 1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 1 2 3
4 5 6 7 8 9 10
在通往地狱的路上,加班能使你更快到达。
点击右上角即可分享
微信分享提示