blocks|key|6478882|text|Mathematica，50字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6478883|r:=RandomInteger@5
Last/@Tally@Sort@Table[r%2Br,100]|code-block|syntax|javascript|6478884|简单的实现。如果从未达到任何和，则从列表中省略0。|unstyled|offset|length|style|CODE|entityMap^0|0|0|N|1^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@$J|R|K|S|L|M]]|9|@]|A|$]]]|N|$]]

<h1>Mathematica, 50 bytes</h1>

<pre><code>r:=RandomInteger@5
Last/@Tally@Sort@Table[r+r,100]
</code></pre>

<p>Straightforward implementation. If any sum is never achieved, the <code>0</code> is omitted from the list.</p>


blocks|key|6479046|text|马蒂尔，17字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6479047|6H100I$Yrs!11:Q=s|code-block|syntax|javascript|6479048|输出是由空格分隔的11个数字(其中一些可能为0)的列表，指示每对从2到12之间的次数。|unstyled|6479049|在网上试试！|6479050|作为比较，每对平均出现的理论平均次数可以计算为6:gtY%2B36/100*。|style|CODE|6479051|如果辊数增加，则得到的值方法为理论值。例如，请参见包含10000卷的得奖和理论值。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/nexus/matl#@2/mYWhg4KkSWVSsaGhoFWhb/P//17x83eTE5IxUAA|2|https://tio.run/nexus/matl#@29mlV4SqW1spm9oYKD1/z8A|3|https://en.wikipedia.org/wiki/Law_of_large_numbers|4|https://tio.run/nexus/matl#@2/mYZhq4qkSWVSsaGhoFWhb/P//17x83eTE5IxUAA|5|https://tio.run/nexus/matl#@29mlV4SqW1spm@YaqL1/z8A^0|0|3|0|0|0|0|0|6|1|0|N|D|N|D|2|0|C|2|3|Y|2|4|11|2|5^^$0|@$1|2|3|4|5|6|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]]|C|$]]|$1|D|3|E|5|F|7|1E|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1F|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|N|3|O|5|K|7|1K|8|@$A|1L|B|1M|P|Q]]|9|@$A|1N|B|1O|1|1P]]|C|$]]|$1|R|3|S|5|K|7|1Q|8|@]|9|@$A|1R|B|1S|1|1T]|$A|1U|B|1V|1|1W]|$A|1X|B|1Y|1|1Z]]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]|14|$5|V|W|X|C|$Y|15]]|16|$5|V|W|X|C|$Y|17]]|18|$5|V|W|X|C|$Y|19]]]]

<h1><a href="https://github.com/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 17 bytes</h1>

<pre><code>6H100I$Yrs!11:Q=s
</code></pre>

<p>Output is a list of 11 numbers (some of them possibly 0) separated by spaces, indicating the number of times for each pair from 2 to 12.</p>

<p><a href="https://tio.run/nexus/matl#@2/mYWhg4KkSWVSsaGhoFWhb/P//17x83eTE5IxUAA" rel="nofollow noreferrer" title="MATL – TIO Nexus">Try it online!</a></p>

<p>For comparison, the theoretical average number of times each pair will appear on average can be computed as <a href="https://tio.run/nexus/matl#@29mlV4SqW1spm9oYKD1/z8A" rel="nofollow noreferrer"><code>6:gtY+36/100*</code></a>.</p>

<p>If the number of rolls is increased the obtained values <a href="https://en.wikipedia.org/wiki/Law_of_large_numbers" rel="nofollow noreferrer">approach</a> the theorerical ones. See for example the <a href="https://tio.run/nexus/matl#@2/mYZhq4qkSWVSsaGhoFWhb/P//17x83eTE5IxUAA" rel="nofollow noreferrer">obtained</a> and <a href="https://tio.run/nexus/matl#@29mlV4SqW1spm@YaqL1/z8A" rel="nofollow noreferrer">theoretical</a> values with 10000 rolls.</p>


blocks|key|1055750|text|Perl+6，30字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1055751|bag+[Z%2B]+(%5E6).pick+xx+100+xx+2|code-block|syntax|javascript|1055752|(%5E6).pick是一个从0到5的随机数。xx+100列出了这类数字的100元素列表.xx+2产生了两个这样的列表。[Z%2B]除了压缩这两个列表之外，还生成了一个由两个模具辊组成的100元素列表.最后，bag将该列表放入一个袋子中，这是一个具有多重性的集合。示例REPL输出：|unstyled|style|CODE|1055753|bag(1(4),+9(4),+0(4),+4(14),+5(18),+3(9),+10(2),+6(19),+7(13),+2(3),+8(10))|1055754|这意味着1、9和0分别发生了4次，4次发生了14次等等。由于此代码中的“骰子”生成一个从0到5的数字，在每个数字中添加两个以获得一对标准的1-6骰子将产生的卷。|entityMap|0|LINK|mutability|MUTABLE|url|http://perl6.org/^0|0|6|0|0|0|0|9|L|6|17|4|1M|4|2S|3|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@$A|14|B|15|L|M]|$A|16|B|17|L|M]|$A|18|B|19|L|M]|$A|1A|B|1B|L|M]|$A|1C|B|1D|L|M]]|9|@]|C|$]]|$1|N|3|O|5|F|7|1E|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1F|8|@]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]]]

<h1><a href="http://perl6.org/" rel="nofollow noreferrer">Perl 6</a>, 30 bytes</h1>

<pre><code>bag [Z+] (^6).pick xx 100 xx 2
</code></pre>

<p><code>(^6).pick</code> is a random number from zero through five.  <code>xx 100</code> makes a hundred-element list of such numbers.  <code>xx 2</code> produces two such lists.  <code>[Z+]</code> zips those two lists with addition, producing a hundred-element list of two-die rolls.  Finally, <code>bag</code> puts that list into a bag, which is a collection with multiplicity.  Example REPL output:</p>

<pre><code>bag(1(4), 9(4), 0(4), 4(14), 5(18), 3(9), 10(2), 6(19), 7(13), 2(3), 8(10))
</code></pre>

<p>That means 1, 9, and 0 occurred four times each, four occurred fourteen times, etc.  Since the "dice" in this code produce a number from 0-5, add two to each of these numbers to get the rolls a pair of standard 1-6 dice would produce.</p>


blocks|key|1055593|text|JavaScript+(ES6)，72字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1055594|考虑到“丑陋”的输出是允许的，下面将输出一个数组，其中包含2-12中每个分数被滚动的次数，并将另外89个元素设置为0。|unstyled|1055595|_=>(a=Array(100).fill(0)).map(_=>a[g()%2Bg()]%2B%2B,g=_=>Math.random()*6%7C0)&&a|code-block|syntax|javascript|1055596|f=
_=>(a=Array(100).fill(0)).map(_=>a[g()%2Bg()]%2B%2B,g=_=>Math.random()*6%7C0)&&a
o.innerText=f()|1055597|<pre+id=o>|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|Q|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|G|7|R|8|@]|9|@]|A|$H|I]]|$1|L|3|M|5|G|7|S|8|@]|9|@]|A|$H|I]]]|N|$]]

<h1>JavaScript (ES6), 72 bytes</h1>
<p>Seeing as &quot;ugly&quot; output is allowed, the following will output an array containing the number of times each score from 2-12 was rolled, with an additional 89 elements set to 0.</p>
<pre class="lang-js prettyprint-override"><code>_=&gt;(a=Array(100).fill(0)).map(_=&gt;a[g()+g()]++,g=_=&gt;Math.random()*6|0)&amp;&amp;a
</code></pre>
<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>f=
_=&gt;(a=Array(100).fill(0)).map(_=&gt;a[g()+g()]++,g=_=&gt;Math.random()*6|0)&amp;&amp;a
o.innerText=f()</code></pre>
<pre class="snippet-code-html lang-html prettyprint-override"><code>&lt;pre id=o&gt;</code></pre>
</div>
</div>
</p>


blocks|key|6479389|text|S.I.L.O.S，99字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6479390|i=100
lbla
x=rand*6%2Brand*6
a=get+x
a%2B1
set+x+a
i-1
if+i+a
lblb
c=get+b
printInt+c
b%2B1
d=11-b
if+d+b|code-block|syntax|javascript|6479391|在网上试试！|unstyled|6479392|滚动骰子，并将它们存储在堆的前11个点中，然后遍历堆打印每个计数器。这是rand关键字与赋值操作符相结合的第一次记录使用之一。|6479393|值得注意的是，可以做一些修改，以输出轧辊的直方图。|6479394|📷|atomic|6479395|不幸的是，它必须从离线解释器中运行。|6479396|i=4000
lbla
x=rand*6%2Brand*6
a=get+x
a%2B1
set+x+a
i-1
if+i+a
canvas+1100+1000+Output
lblb
c=get+b
printInt+c
d=c*1
y=1000-d
x=b*100
newObj+0+100+d
moveObj+b+x+y
b%2B1
d=11-b
if+d+b
wait+10000|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/rjhunjhunwala/S.I.L.O.S|1|https://tio.run/nexus/silos#Jcu7DYAwDITh/qZwDYqEG7oMwBh2wsMSCghSsDh1CFDdX3xXzHPXYdVVcPlDUmz69h@In8dMF6RlnG@RwBzDJrKa9aMIn1Hsh6U8pEwBWnn0zE5fGUlLudPmgoRlfAA|2|IMAGE|IMMUTABLE|imageUrl|https://i.stack.imgur.com/Ca4ZH.png|imageAlt|3|https://github.com/rjhunjhunwala/S.I.L.O.S/blob/master/Silos.java^0|0|9|0|0|0|0|6|1|0|0|0|0|1|2|0|9|5|3|0^^$0|@$1|2|3|4|5|6|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|D|3|E|5|F|7|1H|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1I|8|@]|9|@$A|1J|B|1K|1|1L]]|C|$]]|$1|L|3|M|5|K|7|1M|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1N|8|@]|9|@]|C|$]]|$1|P|3|Q|5|R|7|1O|8|@]|9|@$A|1P|B|1Q|1|1R]]|C|$]]|$1|S|3|T|5|K|7|1S|8|@]|9|@$A|1T|B|1U|1|1V]]|C|$]]|$1|U|3|V|5|F|7|1W|8|@]|9|@]|C|$G|H]]]|W|$X|$5|Y|Z|10|C|$11|12]]|13|$5|Y|Z|10|C|$11|14]]|15|$5|16|Z|17|C|$18|19|1A|-4]]|1B|$5|Y|Z|10|C|$11|1C]]]]

<h1><a href="https://github.com/rjhunjhunwala/S.I.L.O.S" rel="nofollow noreferrer">S.I.L.O.S</a>, 99 bytes</h1>

<pre><code>i=100
lbla
x=rand*6+rand*6
a=get x
a+1
set x a
i-1
if i a
lblb
c=get b
printInt c
b+1
d=11-b
if d b
</code></pre>

<p><a href="https://tio.run/nexus/silos#Jcu7DYAwDITh/qZwDYqEG7oMwBh2wsMSCghSsDh1CFDdX3xXzHPXYdVVcPlDUmz69h@In8dMF6RlnG@RwBzDJrKa9aMIn1Hsh6U8pEwBWnn0zE5fGUlLudPmgoRlfAA" rel="nofollow noreferrer" title="S.I.L.O.S – TIO Nexus">Try it online!</a></p>

<p>Rolls the dice, and stores them in the first 11 spots of the heap, then just iterates through the heap printing each counter. This is one of the first recorded uses of the rand keyword combined with an assignment operator. </p>

<p>It is worth noting, that a few modifications can be made to output a histogram of the rolls. <a href="https://i.stack.imgur.com/Ca4ZH.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Ca4ZH.png" alt="enter image description here"></a></p>

<p>Unfortunately it must be run from the <a href="https://github.com/rjhunjhunwala/S.I.L.O.S/blob/master/Silos.java" rel="nofollow noreferrer">offline interpreter</a>. </p>

<pre><code>i=4000
lbla
x=rand*6+rand*6
a=get x
a+1
set x a
i-1
if i a
canvas 1100 1000 Output
lblb
c=get b
printInt c
d=c*1
y=1000-d
x=b*100
newObj 0 100 d
moveObj b x y
b+1
d=11-b
if d b
wait 10000
</code></pre>


blocks|key|6479757|text|Java+8,104个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6479758|返回频率的int[]的灯。分配给Supplier<int[]>。|unstyled|offset|length|style|CODE|6479759|()->{int+o[]=new+int[11],i=0;while(i%2B%2B<100)o[(int)(Math.random()*6)%2B(int)(Math.random()*6)]%2B%2B;return+o;}|code-block|syntax|javascript|6479760|在网上试试|6479761|Ungolfed+lambda|6479762|()+->+{
++++int
++++++++o[]+=+new+int[11],
++++++++i+=+0
++++;
++++while+(i%2B%2B+<+100)
++++++++o[(int)+(Math.random()+*+6)+%2B+(int)+(Math.random()+*+6)]%2B%2B;
++++return+o;
}|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##bc8xb4MwEAXgGX6FR7s0FixdCJG6dMvEiBhccMgRc6b2mSiK@O3UUSq1Q9d796T3jWpROztrHPvLNodPAx3rjPKeHRUgu6fJ7GBRpJknRTE8ASrDxliTgcDIU8COwKKswzwb0G4PSE17YD10ug7Th9NfnlUbF7vDPUbMNm2F@soeb0XRvkKVl9czGM0hy/ZFngvb8BgKflR0lk5hbycuXt5E9v@5zbLSaQoOmS3XLSnTOPop@dm8WOjZFD28Jgc4NC1TbvDiwUvqmyc9SRtIRiqSQf6re3dO3bwk@yzyvyg5aOJCiDJN1nTdvgE^0|0|5|5|G|F|0|0|0|5|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@$E|12|F|13|G|H]|$E|14|F|15|G|H]]|9|@]|A|$]]|$1|I|3|J|5|K|7|16|8|@]|9|@]|A|$L|M]]|$1|N|3|O|5|D|7|17|8|@]|9|@$E|18|F|19|1|1A]]|A|$]]|$1|P|3|Q|5|6|7|1B|8|@]|9|@]|A|$]]|$1|R|3|S|5|K|7|1C|8|@]|9|@]|A|$L|M]]]|T|$U|$5|V|W|X|A|$Y|Z]]]]

<h1>Java 8, 104 bytes</h1>

<p>A lambda returning an <code>int[]</code> of frequencies. Assign to <code>Supplier&lt;int[]&gt;</code>.</p>



<pre class="lang-java prettyprint-override"><code>()-&gt;{int o[]=new int[11],i=0;while(i++&lt;100)o[(int)(Math.random()*6)+(int)(Math.random()*6)]++;return o;}
</code></pre>

<p><a href="https://tio.run/##bc8xb4MwEAXgGX6FR7s0FixdCJG6dMvEiBhccMgRc6b2mSiK@O3UUSq1Q9d796T3jWpROztrHPvLNodPAx3rjPKeHRUgu6fJ7GBRpJknRTE8ASrDxliTgcDIU8COwKKswzwb0G4PSE17YD10ug7Th9NfnlUbF7vDPUbMNm2F@soeb0XRvkKVl9czGM0hy/ZFngvb8BgKflR0lk5hbycuXt5E9v@5zbLSaQoOmS3XLSnTOPop@dm8WOjZFD28Jgc4NC1TbvDiwUvqmyc9SRtIRiqSQf6re3dO3bwk@yzyvyg5aOJCiDJN1nTdvgE" rel="nofollow noreferrer">Try It Online</a></p>

<h2>Ungolfed lambda</h2>

<pre class="lang-java prettyprint-override"><code>() -&gt; {
    int
        o[] = new int[11],
        i = 0
    ;
    while (i++ &lt; 100)
        o[(int) (Math.random() * 6) + (int) (Math.random() * 6)]++;
    return o;
}
</code></pre>


blocks|key|6479292|text|奇比，45字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6479293|[100%7Ch=_r1,6%7C%2B_r1,6%7C-2┘g(h)=g(h)%2B1][0,z%7C?g(b)|code-block|syntax|javascript|6479294|解释：|unstyled|6479295|[100%7C+++++++++FOR+a+=+1+to+100
h=_r1,6%7C+++++++set+h+to+a+random+value+between+1-6
+%2B_r1,6%7C+++++++%2B+another+rnd(1,6)+(2,+3+...+11,+12)
+-2++++++++++++-+2+(index:+0+...+10
┘+++++++++++++Syntactic+linebreak
g(h)++++++++++When+using+array+parenthesis+on+an+undefined+array,
++++++++++++++it+is+interpreted+as+an+array+with+10+indexes+of+all+zeroes.+++++++++++
++++=+++++++++Of+array+g,+set+the+value+of+index+h+(0+...+11)
++++++g(h)%2B1++to+one+higher+(all+indices+start+out+as+0)
++++++++++++++Note+that+we+need+to+track+11+values.+Fortunately,+QBasic'set
++++++++++++++empty,+10-sized+array+has+11+indices,+because+of+base+0+/+base+1+ambiguity.
]+++++++++++++NEXT+set+of+dice
[0,z%7C+++++++++FOR+b+=+0+to+10
?g(b)+++++++++++PRINT+the+tracker+array|entityMap|0|LINK|mutability|MUTABLE|url|https://drive.google.com/drive/folders/0B0R1Jgqp8Gg4cVJCZkRkdEthZDQ^0|0|2|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|10|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]]]

<h2><a href="https://drive.google.com/drive/folders/0B0R1Jgqp8Gg4cVJCZkRkdEthZDQ" rel="nofollow noreferrer">QBIC</a>, 45 bytes</h2>
<pre><code>[100|h=_r1,6|+_r1,6|-2┘g(h)=g(h)+1][0,z|?g(b)
</code></pre>
<p>Explanation:</p>
<pre><code>[100|         FOR a = 1 to 100
h=_r1,6|       set h to a random value between 1-6
 +_r1,6|       + another rnd(1,6) (2, 3 ... 11, 12)
 -2            - 2 (index: 0 ... 10
┘             Syntactic linebreak
g(h)          When using array parenthesis on an undefined array,
              it is interpreted as an array with 10 indexes of all zeroes.           
    =         Of array g, set the value of index h (0 ... 11)
      g(h)+1  to one higher (all indices start out as 0)
              Note that we need to track 11 values. Fortunately, QBasic'set
              empty, 10-sized array has 11 indices, because of base 0 / base 1 ambiguity.
]             NEXT set of dice
[0,z|         FOR b = 0 to 10
?g(b)           PRINT the tracker array
</code></pre>


blocks|key|6479541|text|><>，93字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6479542|00[0[v
v+1\v/4
v+2xxx5
v+3/%5E\6
>l2(?%5E%2B]laa*=?v0[
++/&1%2B&\+v1&0]<
=?/+:?!\}>:@@:@
oa&0n&}<+%5E%2B1|code-block|syntax|javascript|6479543|在网上试试，或者在鱼场看它！|unstyled|6479544|丑陋的输出格式是由换行符分隔的数字序列，其中n_th数表示和是_n的次数--这很难看，因为它永远打印所有正整数n，尽管大多数行都是0。(+TIO链接被修改为在n=12之后停止，代价是5个字节。)|6479545|鱼场相当慢--以最快的速度打印到n=12上需要大约3.5分钟--所以您可能需要修改它，将第5行的aa*改为a(即，a后面跟着两个空格)，以滚动10对骰子，而不是100。|style|CODE|6479546|随机掷骰子是由这一点完成的：|6479547|1\v/4
2xxx5
3/%5E\6|6479548|xs随意改变鱼的方向。假设这是以相同的概率实现的，很明显，模具辊的结果是对称的均匀分布。|6479549|一旦鱼掷了100对骰子，它就会计算和这个数字之和为n的次数(为了清晰起见，从左上角开始)：|6479550|v+++++++/&1%2B&\
>:@@:@=?/+:?!\}
%5E+++%2B1oa&0n&}<|6479551|我们将n保持在堆栈的前面，并使用寄存器来计算n出现的次数。|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/Fish|1|https://tio.run/##DcW9CsMgEADg3ae4LlIqxTP9GWzM@R4aQaQlgZAMhcMlj93Z5lu@z/ydWkMMGFgwmMj6ftzVWh/HN53iUwxLd6akxiXniyPGIAC0NEpGYCNx7IUjDZZOcR@s99aLLUtc5d5DUuZFrtjWfut2LblM7z8|2|https://fishlanguage.com/playground^0|0|3|0|0|0|0|5|1|9|2|2|0|0|1C|3|1H|1|1L|1|0|0|0|0|1|0|0|0^^$0|@$1|2|3|4|5|6|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|D|3|E|5|F|7|1I|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]|$A|1N|B|1O|1|1P]]|C|$]]|$1|L|3|M|5|K|7|1Q|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1R|8|@$A|1S|B|1T|P|Q]|$A|1U|B|1V|P|Q]|$A|1W|B|1X|P|Q]]|9|@]|C|$]]|$1|R|3|S|5|K|7|1Y|8|@]|9|@]|C|$]]|$1|T|3|U|5|F|7|1Z|8|@]|9|@]|C|$G|H]]|$1|V|3|W|5|K|7|20|8|@$A|21|B|22|P|Q]]|9|@]|C|$]]|$1|X|3|Y|5|K|7|23|8|@]|9|@]|C|$]]|$1|Z|3|10|5|F|7|24|8|@]|9|@]|C|$G|H]]|$1|11|3|12|5|K|7|25|8|@]|9|@]|C|$]]]|13|$14|$5|15|16|17|C|$18|19]]|1A|$5|15|16|17|C|$18|1B]]|1C|$5|15|16|17|C|$18|1D]]]]

<h2><a href="https://esolangs.org/wiki/Fish" rel="nofollow noreferrer">>&lt;></a>, 93 bytes</h2>

<pre><code>00[0[v
v 1\v/4
v 2xxx5
v 3/^\6
&gt;l2(?^+]laa*=?v0[
  /&amp;1+&amp;\ v1&amp;0]&lt;
=?/ :?!\}&gt;:@@:@
oa&amp;0n&amp;}&lt; ^+1
</code></pre>

<p><a href="https://tio.run/##DcW9CsMgEADg3ae4LlIqxTP9GWzM@R4aQaQlgZAMhcMlj93Z5lu@z/ydWkMMGFgwmMj6ftzVWh/HN53iUwxLd6akxiXniyPGIAC0NEpGYCNx7IUjDZZOcR@s99aLLUtc5d5DUuZFrtjWfut2LblM7z8" rel="nofollow noreferrer" title="&gt;&lt;&gt; – Try It Online">Try it online</a>, or watch it at the <a href="https://fishlanguage.com/playground" rel="nofollow noreferrer">fish playground</a>!</p>

<p>The ugly output format is a sequence of numbers separated by newlines, where the <em>n</em>th number says how many times the sum was <em>n</em> — it's ugly because it prints forever, for all positive integers <em>n</em>, although most of the lines will be 0. (The TIO link is modified to stop after <em>n</em>=12, at the cost of 5 bytes.)</p>

<p>The fish playground is fairly slow — it takes about three and a half minutes to print up to <em>n</em>=12 at top speed — so you may want to modify it to roll 10 pairs of dice instead of 100 by changing the <code>aa*</code> in the 5th line to <code>a  </code> (that is, <code>a</code> followed by two spaces).</p>

<p>The random dice rolls are done by this bit:</p>

<pre><code>1\v/4
2xxx5
3/^\6
</code></pre>

<p>The <code>x</code>s change the fish's direction randomly. Assuming that's implemented with equal probabilities, it's clear that the die roll result is a uniform distribution by symmetry.</p>

<p>Once the fish has rolled 100 pairs of dice, it counts how many times the sum was <em>n</em> with this bit (unwrapped for clarity, and starting in the top left):</p>

<pre><code>v       /&amp;1+&amp;\
&gt;:@@:@=?/ :?!\}
^   +1oa&amp;0n&amp;}&lt;
</code></pre>

<p>We keep <em>n</em> at the front of the stack, and use the register to count the number of times <em>n</em> appears.</p>


blocks|key|1056280|text|Pyth，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1056281|V100aY,O6O6)VTlfqsTNY|code-block|syntax|javascript|1056282|输出创建卷的每一步，然后在一条单独的行上输出每个和0-+10的频率。|unstyled|1056283|V100aY,O6O6)VTlfqsTNY+Full+program,+no+input,+outputs+to+stdout
V100++++++++++++++++++For+N+from+0+to+100
++++a+,O6O6+++++++++++Append+a+pair+of+random+ints+below+6
+++++Y++++++++++++++++To+a+list+Y,+initialized+to+the+empty+list
+++++++++++)++++++++++Then
++++++++++++VT++++++++For+N+from+0+to+10
++++++++++++++f+++++Y+Print+Y+filtered+to+only+include+pairs
++++++++++++++++q++N++For+which+N+is+equal+to
+++++++++++++++++sT+++The+sum+of+the+pair|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|O|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|P|8|@]|9|@]|A|$E|F]]]|L|$]]

<h1>Pyth, 21 bytes</h1>
<pre><code>V100aY,O6O6)VTlfqsTNY
</code></pre>
<p>Outputs each step in the creation of the rolls, then outputs frequency of each sum 0 - 10 on a separate line.</p>
<hr />
<pre><code>V100aY,O6O6)VTlfqsTNY Full program, no input, outputs to stdout
V100                  For N from 0 to 100
    a ,O6O6           Append a pair of random ints below 6
     Y                To a list Y, initialized to the empty list
           )          Then
            VT        For N from 0 to 10
              f     Y Print Y filtered to only include pairs
                q  N  For which N is equal to
                 sT   The sum of the pair
</code></pre>


blocks|key|6479889|text|Java+(OpenJDK+8)，95字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6479890|a->{int+r[]=new+int[11],i=0,d=0;for(;i%2B%2B<200;)r[d%2B=Math.random()*6]%2B=i%252<1?1-(d=0):0;return+r;}|code-block|syntax|javascript|6479891|在网上试试！|unstyled|6479892|解释|6479893|a->{
++int+r[]+=+new+int[11],+++++//+Rolls+or+result
++++++i+++=+0,+++++++++++++++//+Iteration
++++++d+++=+0;+++++++++++++++//+Dice+accumulator
++for+(;i%2B%2B<200;)
++++r[d%2B=Math.random()*6]+%2B=+//+Accumulate+a+new+die+and+start+an+addition
+++++i+%25+2+<+1+++++++++++++++//+Accumulate+up+to+two+dice
+++++++?+1+-+(d+=+0)+++++++++//+If+we're+at+2+dice,+reset+the+accumulator+and+add+1
+++++++:+0;++++++++++++++++++//+If+we+only+have+one+die,+add+0
++return+r;
}|entityMap|0|LINK|mutability|MUTABLE|url|http://openjdk.java.net/|1|https://tio.run/##RU89b4MwEN3zK26pZBewTIYONU7VpVvUISNicPhITY2NzJEKRfx2akiqnnR69/nuXquuKnF9bdvqe@nHs9EllEYNAxyVtnDbATyqAyoMcHW6gi70yAm9tpe8AOUvA91GAdrAx0bUhjWjLVE7yz4eQfZ5busSY9AW8@IADchFJYdbSMHnhbT1z9ZK0yLWkseV5KJxnggdRdmec0F9XkXyqPCLeWUr1xH6/FJEUj/ts/QtTUjYoK9c@BpHb8GLeYHNxPbayrXe0iCBiwAZpCtG0d/zAKdpwLpjbkTWB3VoLPlX9O69mgaG7q6cNEz1vZmIHY2hlN6vzLvV5@UX^0|0|G|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="http://openjdk.java.net/" rel="nofollow noreferrer">Java (OpenJDK 8)</a>, 95 bytes</h1>



<pre class="lang-java prettyprint-override"><code>a-&gt;{int r[]=new int[11],i=0,d=0;for(;i++&lt;200;)r[d+=Math.random()*6]+=i%2&lt;1?1-(d=0):0;return r;}
</code></pre>

<p><a href="https://tio.run/##RU89b4MwEN3zK26pZBewTIYONU7VpVvUISNicPhITY2NzJEKRfx2akiqnnR69/nuXquuKnF9bdvqe@nHs9EllEYNAxyVtnDbATyqAyoMcHW6gi70yAm9tpe8AOUvA91GAdrAx0bUhjWjLVE7yz4eQfZ5busSY9AW8@IADchFJYdbSMHnhbT1z9ZK0yLWkseV5KJxnggdRdmec0F9XkXyqPCLeWUr1xH6/FJEUj/ts/QtTUjYoK9c@BpHb8GLeYHNxPbayrXe0iCBiwAZpCtG0d/zAKdpwLpjbkTWB3VoLPlX9O69mgaG7q6cNEz1vZmIHY2hlN6vzLvV5@UX" rel="nofollow noreferrer" title="Java (OpenJDK 8) – Try It Online">Try it online!</a></p>

<h2>Explanations</h2>

<pre class="lang-java prettyprint-override"><code>a-&gt;{
  int r[] = new int[11],     // Rolls or result
      i   = 0,               // Iteration
      d   = 0;               // Dice accumulator
  for (;i++&lt;200;)
    r[d+=Math.random()*6] += // Accumulate a new die and start an addition
     i % 2 &lt; 1               // Accumulate up to two dice
       ? 1 - (d = 0)         // If we're at 2 dice, reset the accumulator and add 1
       : 0;                  // If we only have one die, add 0
  return r;
}
</code></pre>


blocks|key|1056347|text|维沙尔，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1056348|₁ƛ6℅6℅%2B;Ċ|code-block|syntax|javascript|1056349|在网上试试！|unstyled|1056350|返回[roll,+count]的列表。如果滚动总数没有发生，那么它就不包括在列表中。|style|CODE|1056351|解释了|1056352|₁ƛ6℅6℅%2B;Ċ
₁ƛ++++++++#+for+each+item+in+range(1,+100+%2B+1):
++6℅6℅++++#+++push+a+random+number+from+range(1,+6+%2B+1)+and+then+another+random+number+from+that+range
++++++%2B+++#+++and+add+them+together
+++++++;++#+end+map+-+this+leaves+100+random+dice+rolls+in+a+list.
++++++++Ċ+#+get+the+count+of+each+item|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://vyxal.pythonanywhere.com/#WyIiLCIiLCLigoHGmzbihIU24oSFKzvEiiIsIiIsIiJd^0|0|3|0|0|0|0|6|1|0|2|D|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|K|7|1B|8|@$A|1C|B|1D|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|6|7|1E|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1F|8|@]|9|@]|C|$G|H]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a>, 9 bytes</h1>
<pre><code>₁ƛ6℅6℅+;Ċ
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyIiLCIiLCLigoHGmzbihIU24oSFKzvEiiIsIiIsIiJd" rel="nofollow noreferrer">Try it Online!</a></p>
<p>Returns a list of <code>[roll, count]</code>. If a roll total didn't happen, then it isn't included in the list.</p>
<h2>Explained</h2>
<pre><code>₁ƛ6℅6℅+;Ċ
₁ƛ        # for each item in range(1, 100 + 1):
  6℅6℅    #   push a random number from range(1, 6 + 1) and then another random number from that range
      +   #   and add them together
       ;  # end map - this leaves 100 random dice rolls in a list.
        Ċ # get the count of each item
</code></pre>


blocks|key|6480141|text|滑稽表演，18字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6480142|1J6rn200.%2B2CO)%2B%2Bf:|code-block|syntax|javascript|6480143|在网上试试！|unstyled|6480144|1J6rn+#+Infinite+random+d6+rolls
200.%2B+#+Take+first+200
2CO+++#+Chunks+of+2
)%2B%2B+++#+MapSum
f:++++#+Frequency+list|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/FMNSSun/Burlesque|1|https://tio.run/##SyotykktLixN/f/f0MusKM/IwEBP28jZX1NbO83q/38A^0|0|4|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/FMNSSun/Burlesque" rel="nofollow noreferrer">Burlesque</a>, 18 bytes</h1>
<pre><code>1J6rn200.+2CO)++f:
</code></pre>
<p><a href="https://tio.run/##SyotykktLixN/f/f0MusKM/IwEBP28jZX1NbO83q/38A" rel="nofollow noreferrer" title="Burlesque – Try It Online">Try it online!</a></p>
<pre><code>1J6rn # Infinite random d6 rolls
200.+ # Take first 200
2CO   # Chunks of 2
)++   # MapSum
f:    # Frequency list
</code></pre>


<p>Suppose you have two six-sided dice. Roll the pair 100 times, calculating the sum of each pair. Print out the number of times each sum occurred. 
If a sum was never rolled, you must include a zero or some way to identify that that particular sum was never rolled.</p>

<p>Example Output:
[3, 3, 9, 11, 15, 15, 11, 15, 7, 8, 3] </p>

<p>The number of times a sum was rolled is represented in the sums index - 2</p>

<p>In this example, a sum of two was rolled 3 times ([2-2]), a sum of three 3 times ([3-2]), a sum of four 9 times ([4-2]), and so on. It does not matter the individual dice rolls to arrive at a sum (5 and 2 would be counted as the same sum as 6 and 1)</p>

<p>"Ugly" outputs are fine (loads of trailing zeros, extra output, strange ways of representing data, etc.) as long as you explain how the data should be read.</p>


Sums of 100 Rolls of Two Six Sided Dice

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

假设你有两个六面骰子。滚动对100次，计算每对的和。打印出每个和发生的次数。如果从未滚动过和，则必须包括零或以某种方式来标识该特定和从未滚动。输出示例：3、3、9、11、15、15、11、15、7、8、3和被滚动的次数在和索引-2中表示。在本例中，2的和被滚动3次(2-2)，3次和(3-2)，4次9次的和(4-2)，等等。每个骰子得到一笔钱并不重要(5和2将算作与6和1相同的金额)。“丑陋”输出很

问两个六边骰子100卷的总和
EN

回答 12

Code Golf用户

Mathematica，50字节

Code Golf用户

马蒂尔，17字节

Code Golf用户

Perl 6，30字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问两个六边骰子100卷的总和EN

回答 12

Code Golf用户

Mathematica，50字节

Code Golf用户

马蒂尔，17字节

Code Golf用户

Perl 6，30字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问两个六边骰子100卷的总和
EN