blocks|key|5731632|text|Python+2，29|type|header-two|depth|inlineStyleRanges|entityRanges|data|5731633|lambda+x:len(x)/(x!='google')|code-block|syntax|javascript|5731634|在ZeroDivisionError上给出一个"google"，而长度则是。这利用了Python的布尔值等于0和1。|unstyled|offset|length|style|CODE|entityMap^0|0|0|1|H|N|8|1I|1|1K|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]|$J|T|K|U|L|M]|$J|V|K|W|L|M]|$J|X|K|Y|L|M]]|9|@]|A|$]]]|N|$]]

<h2>Python 2, 29</h2>

<pre class="lang-python prettyprint-override"><code>lambda x:len(x)/(x!='google')
</code></pre>

<p>Gives a <code>ZeroDivisionError</code> on <code>"google"</code>, and the length otherwise. This takes advantage of Python's booleans equaling <code>0</code> and <code>1</code>.</p>


blocks|key|5733177|text|Excel，23个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|5733178|将其粘贴到A1以外的单元格中，并在A1中键入搜索查询。|unstyled|5733179|=LEN(A1)/(A1<>"google")|code-block|syntax|javascript|5733180|例如：|5733181|📷|atomic|offset|length|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://i.stack.imgur.com/TseqO.png|imageAlt^0|0|0|0|0|0|1|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|10|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|11|8|@]|9|@]|A|$]]|$1|L|3|M|5|N|7|12|8|@]|9|@$O|13|P|14|1|15]]|A|$]]]|Q|$R|$5|S|T|U|A|$V|W|X|-4]]]]

<h1>Excel, 23 characters</h1>

<p>Paste this into a cell other than A1 and type your search query into A1.</p>

<pre><code>=LEN(A1)/(A1&lt;&gt;"google")
</code></pre>

<p>For example:</p>

<p><a href="https://i.stack.imgur.com/TseqO.png"><img src="https://i.stack.imgur.com/TseqO.png" alt="GoogleGoogle"></a></p>


blocks|key|5732532|text|C#，43字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5732533|对萨拉赫·阿拉米的回答的改进。递归在提供"google“时抛出堆栈溢出异常|unstyled|5732534|int+g(string+s)=>s!="google"?s.Length:g(s);|code-block|syntax|javascript|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h1>C#, 43 bytes</h1>

<p>An improvement over Salah Alami's answer. Recurses to throw a stack overflow exception on providing "google"</p>

<pre class="lang-c# prettyprint-override"><code>int g(string s)=&gt;s!="google"?s.Length:g(s);
</code></pre>


blocks|key|5732041|text|TI-BASIC，15字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5732042|见鬼，而我们到了，也许也能在这里得到一个TI-基本答案。|unstyled|offset|length|5732043|输入格式为"string":prgmNAME。首先要归功于郭炳泉找到了它！|style|CODE|5732044|length(Ans)%2Blog(Ans≠"GOOGLE|code-block|syntax|javascript|5732045|(指南:每个小写字母加一个字节，代替大写字母.)s/GOOGLE/google/g+=>+%2B6+bytes.)|5732046|啊哈测试用例！|5732047|"GOGGLE":prgmG
+++++++++++++++6
"BING":prgmG
+++++++++++++++4
"GOOGLE":prgmG
+++++++++++Error|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/questions/58891/dont-google-google#comment141887_58895|1|https://codegolf.stackexchange.com/users/39328/thomas-kwa^0|0|4|4|0|0|5|H|T|3|1|0|0|O|T|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|15|8|@]|9|@$E|16|F|17|1|18]]|A|$]]|$1|G|3|H|5|D|7|19|8|@$E|1A|F|1B|I|J]]|9|@$E|1C|F|1D|1|1E]]|A|$]]|$1|K|3|L|5|M|7|1F|8|@]|9|@]|A|$N|O]]|$1|P|3|Q|5|D|7|1G|8|@$E|1H|F|1I|I|J]]|9|@]|A|$]]|$1|R|3|S|5|6|7|1J|8|@]|9|@]|A|$]]|$1|T|3|U|5|M|7|1K|8|@]|9|@]|A|$N|O]]]|V|$W|$5|X|Y|Z|A|$10|11]]|12|$5|X|Y|Z|A|$10|13]]]]

<h1>TI-BASIC, 15 bytes</h1>
<p>Heck, while <a href="https://codegolf.stackexchange.com/questions/58891/dont-google-google#comment141887_58895">we're at it</a>, might as well get a TI-BASIC answer in here.</p>
<p>Input format is <code>&quot;string&quot;:prgmNAME</code>. Credit to <a href="https://codegolf.stackexchange.com/users/39328/thomas-kwa">Thomas Kwa</a> for finding it first!</p>
<pre><code>length(Ans)+log(Ans≠&quot;GOOGLE
</code></pre>
<p>(Guide: add 1 byte for each lowercase letter replacing an upper-case one. So <code>s/GOOGLE/google/g =&gt; +6 bytes</code>.)</p>
<h3>ahhhhh test cases!</h3>
<pre><code>&quot;GOGGLE&quot;:prgmG
               6
&quot;BING&quot;:prgmG
               4
&quot;GOOGLE&quot;:prgmG
           Error
</code></pre>


blocks|key|5733344|text|APL+(14)|type|header-two|depth|inlineStyleRanges|entityRanges|data|5733345|(⍴÷'google'∘≢)|code-block|syntax|javascript|5733346|解释：|unstyled|5733347|⍴：长度|unordered-list-item|offset|length|style|CODE|5733348|÷：除以|5733349|'google∘≢：参数不等于'google‘。|5733350|⍴给出字符串的长度，如果字符串不等于google+(返回长度不变)，则除以1；如果字符串等于google+(给出错误)，则除以0。|entityMap^0|0|0|0|0|1|0|0|1|0|0|9|F|7|0|0|1|I|6|1A|6^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Y|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Z|8|@]|9|@]|A|$]]|$1|J|3|K|5|L|7|10|8|@$M|11|N|12|O|P]]|9|@]|A|$]]|$1|Q|3|R|5|L|7|13|8|@$M|14|N|15|O|P]]|9|@]|A|$]]|$1|S|3|T|5|L|7|16|8|@$M|17|N|18|O|P]|$M|19|N|1A|O|P]]|9|@]|A|$]]|$1|U|3|V|5|I|7|1B|8|@$M|1C|N|1D|O|P]|$M|1E|N|1F|O|P]|$M|1G|N|1H|O|P]]|9|@]|A|$]]]|W|$]]

<h1>APL (14)</h1>

<pre><code>(⍴÷'google'∘≢)
</code></pre>

<p>Explanation:</p>

<ul>
<li><code>⍴</code>: length</li>
<li><code>÷</code>: divided by</li>
<li><code>'google∘≢</code>: argument is not equal to <code>'google</code>'. </li>
</ul>

<p><code>⍴</code> gives the length of the string, which is divided by 1 if the string does not equal <code>google</code> (which gives the length back unchanged), or by 0 if the string <em>does</em> equal <code>google</code> (giving an error).</p>


blocks|key|302073|text|Haskell，24字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|302074|g+s%7Cs/="google"=length+s|unstyled|offset|length|style|CODE|302075|输出：|302076|Main>+g+"google"

Program+error:+pattern+match+failure:+g+"google"

Main>+g+"bing"
4|code-block|syntax|javascript|entityMap^0|0|0|O|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@$E|S|F|T|G|H]]|9|@]|A|$]]|$1|I|3|J|5|D|7|U|8|@]|9|@]|A|$]]|$1|K|3|L|5|M|7|V|8|@]|9|@]|A|$N|O]]]|P|$]]

<h2>Haskell, 24 bytes</h2>

<p><code>g s|s/="google"=length s</code></p>

<p>Output:</p>

<pre><code>Main&gt; g "google"

Program error: pattern match failure: g "google"

Main&gt; g "bing"
4
</code></pre>


blocks|key|301446|text|倍频程，63字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|301447|我知道它比Matlab解决方案更长(它也适用于Octave+)，但它特别邪恶。我正在使用单元格数组(邪恶)文字(邪恶)创建一个匿名函数(邪恶)，它包含依赖于必须通过参数传递的回调函数(因此是递归的、邪恶的)的函数句柄。然后，我创建了另一个匿名函数，它基本上将函数简化为string参数，并将f的第二个参数修正为f+(非常邪恶)。任何理智的人都不会这样做，因为它几乎和Perl或regex+(或cjam/pyth/任何其他esolang)一样不可读。|unstyled|offset|length|style|CODE|301448|因此，如果字符串不是“google”，则调用单元格数组的第二个参数，该参数输出字符串的长度。否则，将调用第一个函数，该函数作为回调传递(并将自身作为回调传递给自己)，这之后就是函数本身。该误差基本上是一些最大递归深度误差。|301449|f=@(s,f){@()f(s,f),numel(s)}{2-strcmp(s,'google')}();@(s)f(s,f)|code-block|syntax|javascript|entityMap^0|0|41|1|4B|1|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@$E|S|F|T|G|H]|$E|U|F|V|G|H]]|9|@]|A|$]]|$1|I|3|J|5|D|7|W|8|@]|9|@]|A|$]]|$1|K|3|L|5|M|7|X|8|@]|9|@]|A|$N|O]]]|P|$]]

<h1>Octave, 63 bytes</h1>
<p>I know it is longer than the Matlab solution (which would work in Octave too), but it is particularly evil. I am making an anonymous function (evil) using cell array (evil) literals (evil) containing function handles dependent on a callback function (itself, thus recursive, evil) that must be passed via argument. Then I create another anonymous that basically reduces the function to the string argument and fixes the second argument of <code>f</code> as <code>f</code> (very evil). Any sane human would never do this, because it is almost as unreadable as Perl or regex (or cjam/pyth/any other esolang).</p>
<p>So if the string is not 'google' the second argument of the cell array will be called which outputs the length of the string. Otherwise the first function will be called, which is passed as a callback (and passes itself as callback to itself too) which later is the function itself. The error is basically some maximum recursion depth error.</p>
<pre><code>f=@(s,f){@()f(s,f),numel(s)}{2-strcmp(s,'google')}();@(s)f(s,f)
</code></pre>


blocks|key|300860|text|CJam，16个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|300861|{_,\"google"=!/}|code-block|syntax|javascript|300862|如果字符串不是google，则将长度除以1，否则除以0。这个想法并不新颖，但我是独立提出的。|unstyled|300863|在网上试试。|offset|length|300864|是如何工作的|300865|_+++++++++++++++++Push+a+copy+of+the+string+on+the+stack.
+,++++++++++++++++Compute+the+length+of+the+copy.
++\+++++++++++++++Swap+the+length+and+the+original+string.
+++"google"=++++++Push+1+if+the+string+is+"google",+0+otherwise.
++++++++++++!+++++Apply+logical+NOT.+Maps+1+to+0+and+0+to+1.
+++++++++++++/++++Divide+the+length+by+the+Boolean.|entityMap|0|LINK|mutability|MUTABLE|url|http://cjam.aditsu.net/#code=q%2520e%2523%2520Read%2520input%2520from%2520STDIN.%250A%250A%257B_%252C%255C%2522google%2522%253D!%252F%257D%250A%250A~%2520e%2523%2520Execute%2520the%2520function.&input=google^0|0|0|0|0|6|0|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|10|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|11|8|@]|9|@$L|12|M|13|1|14]]|A|$]]|$1|N|3|O|5|6|7|15|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|16|8|@]|9|@]|A|$E|F]]]|R|$S|$5|T|U|V|A|$W|X]]]]

<h1>CJam, 16 characters</h1>

<pre><code>{_,\"google"=!/}
</code></pre>

<p>This divides the length by 1 if the string is not <em>google</em> and by 0 otherwise. The idea is not novel, but I came up with it independently.</p>

<p><a href="http://cjam.aditsu.net/#code=q%20e%23%20Read%20input%20from%20STDIN.%0A%0A%7B_%2C%5C%22google%22%3D!%2F%7D%0A%0A~%20e%23%20Execute%20the%20function.&amp;input=google">Try it online.</a></p>

<h3>How it works</h3>

<pre><code>_                 Push a copy of the string on the stack.
 ,                Compute the length of the copy.
  \               Swap the length and the original string.
   "google"=      Push 1 if the string is "google", 0 otherwise.
            !     Apply logical NOT. Maps 1 to 0 and 0 to 1.
             /    Divide the length by the Boolean.
</code></pre>


blocks|key|302183|text|JavaScript，25+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|302184|漂亮而简单的JavaScript示例：|unstyled|302185|e=>e!='google'?e.length:g|code-block|syntax|javascript|302186|如果输入"google“，它就会传递一个ReferenceError。|offset|length|style|CODE|302187|示例|302188|alert((e=>e!='google'?e.length:g)('test'))|entityMap^0|0|0|0|K|E|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|W|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|X|8|@$L|Y|M|Z|N|O]]|9|@]|A|$]]|$1|P|3|Q|5|D|7|10|8|@]|9|@]|A|$]]|$1|R|3|S|5|G|7|11|8|@]|9|@]|A|$H|I]]]|T|$]]

<h1>JavaScript, 25 Bytes</h1>

<p>Nice and simple JavaScript example:</p>

<pre><code>e=&gt;e!='google'?e.length:g
</code></pre>

<p>If "google" is entered then it passes a <code>ReferenceError</code></p>

<p>Example
<div class="snippet" data-lang="js" data-hide="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>alert((e=&gt;e!='google'?e.length:g)('test'))</code></pre>
</div>
</div>
</p>


blocks|key|5732505|text|R，46字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5732506|g=function(x)ifelse(x!="google",nchar(x),)|code-block|syntax|javascript|5732507|除非我误读，否则最初的文章从未指定代码必须是正确的语法。|unstyled|5732508|示例：|5732509|>+g("bing")
[1]+4
>+g("google")
Error+in+ifelse(x+!=+"google",+nchar(x),+)+:+
++argument+"no"+is+missing,+with+no+default|5732510|我从未为ifelse语句的"no“参数添加任何内容，因此如果该参数被调用，它将返回一个错误。|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|S|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|T|8|@]|9|@]|A|$]]|$1|L|3|M|5|D|7|U|8|@]|9|@]|A|$E|F]]|$1|N|3|O|5|I|7|V|8|@]|9|@]|A|$]]]|P|$]]

<h1>R, 46 bytes</h1>

<pre><code>g=function(x)ifelse(x!="google",nchar(x),)
</code></pre>

<p>Unless I'm misreading, the original post never specified that the code had to be correct syntax.</p>

<p>Example:</p>

<pre><code>&gt; g("bing")
[1] 4
&gt; g("google")
Error in ifelse(x != "google", nchar(x), ) : 
  argument "no" is missing, with no default
</code></pre>

<p>I never added anything for the "no" parameter of the ifelse statement so it will return an error if this parameter is evoked.</p>


blocks|key|300708|text|Haskell+-30个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|300709|g"google"=error"!";g+s=length+s

>g+"google"
+*Exception:+!
>g+"str"
+3|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h2>Haskell - 30 characters</h2>
<pre><code>g&quot;google&quot;=error&quot;!&quot;;g s=length s

&gt;g &quot;google&quot;
 *Exception: !
&gt;g &quot;str&quot;
 3
</code></pre>


blocks|key|300823|text|Python+3，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|300824|lambda+n:len(n)if+n!='google'else+d|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Python 3, 35 bytes</h1>

<pre><code>lambda n:len(n)if n!='google'else d
</code></pre>


blocks|key|300935|text|C%2B%2B11，54+(代码)%2B+14+(#include)+=+68|type|header-two|depth|inlineStyleRanges|entityRanges|data|300936|除以零只是一个未定义的行为，我不会称之为错误。所以我的方法。|unstyled|300937|#include<ios>
[](std::string+s){return+s!="google"?s.size():throw;};|code-block|syntax|javascript|300938|用法|300939|[](std::string+s){return+s!="google"?s.size():throw;}("google");|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|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|S|8|@]|9|@]|A|$H|I]]]|N|$]]

<h1>C++11, 54 (code) + 14 (#include) = 68</h1>

<p>Well, division by zero is just undefined behaviour, which I would not call an error. So my approach.</p>

<pre><code>#include&lt;ios&gt;
[](std::string s){return s!="google"?s.size():throw;};
</code></pre>

<p>usage</p>

<pre><code>[](std::string s){return s!="google"?s.size():throw;}("google");
</code></pre>


blocks|key|301027|text|JavaScript，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|301028|又好又简单。|unstyled|301029|编辑:现在遵守规则|301030|function+f(g){if(g=="google")a;return+g.length}|code-block|syntax|javascript|301031|测试|301032|引发|301033|错误的|301034|function+f(g){if(g=="google")a;return+g.length}

alert(f("Hello"))
alert(f("google"))
alert(f("hi"))|301035|没有引发|301036|错误|301037|function+f(g){if(g=="google")a;return+g.length}

alert(f("Hello"))
alert(f("bing"))
alert(f("hi"))|entityMap^0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@]|A|$]]|$1|E|3|F|5|D|7|12|8|@]|9|@]|A|$]]|$1|G|3|H|5|I|7|13|8|@]|9|@]|A|$J|K]]|$1|L|3|M|5|6|7|14|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|15|8|@]|9|@]|A|$]]|$1|P|3|Q|5|6|7|16|8|@]|9|@]|A|$]]|$1|R|3|S|5|I|7|17|8|@]|9|@]|A|$J|K]]|$1|T|3|U|5|6|7|18|8|@]|9|@]|A|$]]|$1|V|3|W|5|D|7|19|8|@]|9|@]|A|$]]|$1|X|3|Y|5|I|7|1A|8|@]|9|@]|A|$J|K]]]|Z|$]]

<h1>JavaScript, 47 bytes</h1>

<p>Nice and simple.</p>

<p><strong><em>Edit:</em></strong> Now complies with the rules</p>

<pre><code>function f(g){if(g=="google")a;return g.length}
</code></pre>

<h2>Testing</h2>

<h3>Error thrown</h3>

<p><div class="snippet" data-lang="js" data-hide="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>function f(g){if(g=="google")a;return g.length}

alert(f("Hello"))
alert(f("google"))
alert(f("hi"))</code></pre>
</div>
</div>
</p>

<h3>No error thrown</h3>

<p><div class="snippet" data-lang="js" data-hide="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>function f(g){if(g=="google")a;return g.length}

alert(f("Hello"))
alert(f("bing"))
alert(f("hi"))</code></pre>
</div>
</div>
</p>


blocks|key|5733687|text|Windows批处理，118个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|5733688|IF+/I+"%25string%25"=="google"+exit
echo+%25string%25>+string.txt
for+%25%25?+in+(string.txt)+do+(+SET+/A+stringlength=%25%25~z?+-+2+)|code-block|syntax|javascript|5733689|输出为%25字符串长度%25。|unstyled|5733690|完整代码：|5733691|@echo+off
del+string.txt
cls
echo+Type+your+string
echo.
set+/p+string=String:
IF+/I+"%25string%25"=="google"+goto+err
echo+%25string%25>+string.txt
for+%25%25?+in+(string.txt)+do+(+SET+/A+stringlength=%25%25~z?+-+2+)
cls
echo+%25stringlength%25
pause
del+string.txt
:err
color+c
echo+There+seems+to+be+an+error+with+your+input...
pause>nul|5733692|修改后的约书亚霍尼格的答案，这里。|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/a/8566001/4910495^0|0|0|0|0|0|E|2|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|10|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|11|8|@]|9|@]|A|$]]|$1|L|3|M|5|D|7|12|8|@]|9|@]|A|$E|F]]|$1|N|3|O|5|I|7|13|8|@]|9|@$P|14|Q|15|1|16]]|A|$]]]|R|$S|$5|T|U|V|A|$W|X]]]]

<h1>Windows Batch, 118 characters</h1>
<pre><code>IF /I &quot;%string%&quot;==&quot;google&quot; exit
echo %string%&gt; string.txt
for %%? in (string.txt) do ( SET /A stringlength=%%~z? - 2 )
</code></pre>
<p>Output is %stringlength%.</p>
<p>Full code:</p>
<pre><code>@echo off
del string.txt
cls
echo Type your string
echo.
set /p string=String:
IF /I &quot;%string%&quot;==&quot;google&quot; goto err
echo %string%&gt; string.txt
for %%? in (string.txt) do ( SET /A stringlength=%%~z? - 2 )
cls
echo %stringlength%
pause
del string.txt
:err
color c
echo There seems to be an error with your input...
pause&gt;nul
</code></pre>
<p>Modified from Joshua Honig's answer, <a href="https://stackoverflow.com/a/8566001/4910495">here</a>.</p>


blocks|key|5734090|text|卡住了，16+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5734091|s_l1u"google"=-/|code-block|syntax|javascript|5734092|对于大多数人来说，采用类似的方法，将导致输入"google“上的0错误。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://esolangs.org/wiki/Stuck^0|0|3|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|F|7|W|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|X|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

<h1><a href="http://esolangs.org/wiki/Stuck" rel="nofollow">Stuck</a>, 16 Bytes</h1>

<pre><code>s_l1u"google"=-/
</code></pre>

<p>Following a similar method to most people, will cause a divide by 0 error on "google" being input.</p>


blocks|key|5735623|text|杰夫特，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5735624|U¥`goog¤`?Þ:Ul|code-block|syntax|javascript|5735625|在这里试试！|unstyled|5735626|解释|5735627|U¥`goog¤`?Þ:Ul++
U+++++++++++++++++++++//+U+is+the+input
+¥++++++++++++++++++++//+¥+is+the+Unicode+shortcut+for+==
++goog¤+++++++++++++++//+"google"+compressed
+`++++++`+++++++++++++//+backticks+are+used+to+uncompress+goog¤
++++++++++Þ+++++++++++//+An+undefined+variable
++++++++++++Ul++++++++//+l+is+a+built-in+that+returns+the+length+of+U
++++++++++++++++++++++//+Implicit:+output+result+of+last+expression|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|http://ethproductions.github.io/japt/?v=1.4.3&code=VaVgZ29vZ6RgP946VWw=&input=Imdvb2dsZSI=^0|0|3|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="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 14 bytes</h1>

<pre><code>U¥`goog¤`?Þ:Ul
</code></pre>

<p><a href="http://ethproductions.github.io/japt/?v=1.4.3&amp;code=VaVgZ29vZ6RgP946VWw=&amp;input=Imdvb2dsZSI=" rel="nofollow noreferrer">Try it here!</a></p>

<h3>Explanation</h3>

<pre><code>U¥`goog¤`?Þ:Ul  
U                     // U is the input
 ¥                    // ¥ is the Unicode shortcut for ==
  goog¤               // "google" compressed
 `      `             // backticks are used to uncompress goog¤
          Þ           // An undefined variable
            Ul        // l is a built-in that returns the length of U
                      // Implicit: output result of last expression
</code></pre>


blocks|key|301393|text|C#+.NET，65字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|301394|int+g(string+s){return(s!="google")?s.Length:(1/int.Parse("0"));}|code-block|syntax|javascript|301395|测试：|unstyled|301396|Console.WriteLine(g("str"));
Console.WriteLine(g("google"));|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>C# .NET, 65 bytes</h1>
<pre><code>int g(string s){return(s!=&quot;google&quot;)?s.Length:(1/int.Parse(&quot;0&quot;));}
</code></pre>
<p>Test:</p>
<pre><code>Console.WriteLine(g(&quot;str&quot;));
Console.WriteLine(g(&quot;google&quot;));
</code></pre>


blocks|key|302653|text|Scala，48|type|header-two|depth|inlineStyleRanges|entityRanges|data|302654|def+g(s:String)=if(s=="google")0/0+else+s.length|code-block|syntax|javascript|302655|打电话：|unstyled|302656|+g("bing")++++++//>+res1:+Int+=+4
+g("google")++++//>+java.lang.ArithmeticException:+/+by+zero|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>Scala, 48</h1>

<pre><code>def g(s:String)=if(s=="google")0/0 else s.length
</code></pre>

<p>To call:</p>

<pre><code> g("bing")      //&gt; res1: Int = 4
 g("google")    //&gt; java.lang.ArithmeticException: / by zero
</code></pre>


blocks|key|5736753|text|朱莉娅，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5736754|x->length(x)[x!="google"]|code-block|syntax|javascript|5736755|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://julialang.org/|1|https://tio.run/##yyrNyUw0rPifbvu/QtcuJzUvvSRDo0IzukLRVik9Pz89J1Up9n9JanFJsYKtQjSXkru/v7uPqxKXUlJmXjqQSilNzgbh9HwgB6qBK5aLKy2/SKFEITNPAayXSwEICooy80py8jRKNFG46UABTa7UvJT/AA^0|0|3|0|0|0|0|6|1^^$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|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://julialang.org/" rel="nofollow noreferrer">Julia</a>, 25 bytes</h1>

<pre class="lang-julia prettyprint-override"><code>x-&gt;length(x)[x!=&quot;google&quot;]
</code></pre>
<p><a href="https://tio.run/##yyrNyUw0rPifbvu/QtcuJzUvvSRDo0IzukLRVik9Pz89J1Up9n9JanFJsYKtQjSXkru/v7uPqxKXUlJmXjqQSilNzgbh9HwgB6qBK5aLKy2/SKFEITNPAayXSwEICooy80py8jRKNFG46UABTa7UvJT/AA" rel="nofollow noreferrer" title="Julia 1.0 – Try It Online">Try it online!</a></p>


blocks|key|301300|text|CoffeeScript+43字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|301301|(g)->return+g.length+if+g!="google";throw-1|code-block|syntax|javascript|301302|创建一个匿名函数，如果字符串为"google"，则抛出-1，否则返回其长度。不过，没有我想要的那么模糊。|unstyled|offset|length|style|CODE|301303|链接到在线测试环境。|301304|另一个变体，长1字节：|301305|(g)->if+g!="google"then+g.length+else+throw-1|entityMap|0|LINK|mutability|MUTABLE|url|http://coffeescript.org/#try:g=(g)-%253Ereturn%2520g.length%2520if%2520g!=^0|0|0|F|8|0|0|2|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|12|8|@$J|13|K|14|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|15|8|@]|9|@$J|16|K|17|1|18]]|A|$]]|$1|P|3|Q|5|I|7|19|8|@]|9|@]|A|$]]|$1|R|3|S|5|D|7|1A|8|@]|9|@]|A|$E|F]]]|T|$U|$5|V|W|X|A|$Y|Z]]]]

<h1>CoffeeScript 43 bytes</h1>

<pre><code>(g)-&gt;return g.length if g!="google";throw-1
</code></pre>

<p>Makes an anonymous function that throws -1 if the string is <code>"google"</code>, and returns it's length otherwise. Not as obfuscated as I wanted, though.</p>

<p><a href="http://coffeescript.org/#try:g%3D(g)-%3Ereturn%20g.length%20if%20g!%3D%22google%22%3Bthrow-1%0A%0A%0Aalert%20g%20%22test%22%0Aalert%20g%20%22googl2%22%0Aalert%20g%20%22google%22%0Aalert%20g%20%22lalal!%22" rel="nofollow">Link</a> to the online testing environment. </p>

<p>Another variation, 1 byte longer:</p>

<pre><code>(g)-&gt;if g!="google"then g.length else throw-1
</code></pre>


blocks|key|301531|text|Lua，42+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|301532|这个挑战让我意识到在Lua造成错误是多么的困难。|unstyled|301533|x=io.read()print(x~="google"and+#x+or+t())|code-block|syntax|javascript|301534|接受输入，如果输入不是google，而是打印输入的长度，如果不调用不存在的函数t，则抛出一个错误。|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|$]]|$1|E|3|F|5|G|7|O|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|P|8|@]|9|@]|A|$]]]|L|$]]

<h2>Lua, 42 Bytes</h2>
<p>This challenge has made me realize how hard it is to cause an error in Lua.</p>
<pre><code>x=io.read()print(x~=&quot;google&quot;and #x or t())
</code></pre>
<p>Takes an input and if that input isn't google than print the length of the input, if not call a function t which doesn't exist, throwing an error.</p>


blocks|key|302216|text|Prolog+-+32字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|302217|"google"*_:-x.
X*Y:-length(X,Y).|code-block|syntax|javascript|302218|定义谓词(*)/2，该谓词为输入“google”抛出ERROR:+*/2:+Undefined+procedure:+x/0：|unstyled|offset|length|style|CODE|302219|?-+"bing"+*+Length.
Length+=+4.

?-+"google"+*+Length.
ERROR:+*/2:+Undefined+procedure:+x/0
+++Exception:+(8)+x+?+no+debug|entityMap^0|0|0|4|5|Q|10|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|S|8|@$J|T|K|U|L|M]|$J|V|K|W|L|M]]|9|@]|A|$]]|$1|N|3|O|5|D|7|X|8|@]|9|@]|A|$E|F]]]|P|$]]

<h2>Prolog – 32 bytes</h2>

<pre><code>"google"*_:-x.
X*Y:-length(X,Y).
</code></pre>

<p>Defines a predicate <code>(*)/2</code> that throws <code>ERROR: */2: Undefined procedure: x/0</code> for the input "google":</p>

<pre><code>?- "bing" * Length.
Length = 4.

?- "google" * Length.
ERROR: */2: Undefined procedure: x/0
   Exception: (8) x ? no debug
</code></pre>


blocks|key|302544|text|rs，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|302545|%5E(google)%7C(.*)$/((%5E%5E\2))%5E%5E(1\1)|code-block|syntax|javascript|302546|在rs中，%5E%5E是长度和重复运算符。在一元形式中使用，它将获得以下文本(%5E%5E\2)的长度。以二进制形式使用，它将重复LHS+RHS时代的((%5E%5E\2))%5E%5E(1\1)。|unstyled|style|CODE|302547|接受输入bing。输入不是google，所以第二个组将匹配，而不是第一个。一旦替换发生，结果就是((%5E%5Ebing))%5E%5E(1)。%5E%5E获得导致(4)%5E%5E(1)的长度，结果被重复1次以得到4。|302548|但是，如果输入是google，则第一个组将匹配。这将导致替换后的((%5E%5E))%5E%5E(1google)。%5E%5E只会得到空字符串(0)的长度，所以应用%5E%5E后的结果将是(0)%5E%5E(1google)。现在，重复操作符可以不执行它的work...or。它将尝试重复0+1google的时间。由于1google不是一个数字，所以输出如下：|302549|Traceback (most recent call last):
  File "c callback", line 6, in <module>
  File "<string>", line 5, in <module>
++File "<string>", line 167, in main
++File "<string>", line 125, in run
++File "<string>", line 72, in expand
ValueError: invalid literal for int() with base 10: '1google'|302550|现场演示。+(将输入文本放在左下角的框中)。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/kirbyfan64/rs|1|http://kirbyfan64.github.io/rs/index.html?script=%255E%2528google%2529%257C%2528.*%2529%2524%252F%2528%2528%255E%255E%255C2%2529%2529%255E%255E%25281%255C1%2529&input=^0|0|2|0|0|0|5|2|Y|6|1V|F|0|4|4|D|6|1C|F|1S|2|1Y|8|2K|1|0|8|6|W|H|1E|2|1Z|2|27|E|3H|1|3J|7|3W|7|0|0|0|5|1^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@$A|1A|B|1B|L|M]|$A|1C|B|1D|L|M]|$A|1E|B|1F|L|M]]|9|@]|C|$]]|$1|N|3|O|5|K|7|1G|8|@$A|1H|B|1I|L|M]|$A|1J|B|1K|L|M]|$A|1L|B|1M|L|M]|$A|1N|B|1O|L|M]|$A|1P|B|1Q|L|M]|$A|1R|B|1S|L|M]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1T|8|@$A|1U|B|1V|L|M]|$A|1W|B|1X|L|M]|$A|1Y|B|1Z|L|M]|$A|20|B|21|L|M]|$A|22|B|23|L|M]|$A|24|B|25|L|M]|$A|26|B|27|L|M]|$A|28|B|29|L|M]]|9|@]|C|$]]|$1|R|3|S|5|F|7|2A|8|@]|9|@]|C|$G|H]]|$1|T|3|U|5|K|7|2B|8|@]|9|@$A|2C|B|2D|1|2E]]|C|$]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]]]

<h1><a href="https://github.com/kirbyfan64/rs" rel="nofollow noreferrer">rs</a>, 31 bytes</h1>
<pre><code>^(google)|(.*)$/((^^\2))^^(1\1)
</code></pre>
<p>In rs, <code>^^</code> is the length and repetition operator. Used in the unary form, it will get the length of the following text <code>(^^\2)</code>. Used in binary form, it will repeat the LHS RHS times <code>((^^\2))^^(1\1)</code>.</p>
<p>Take the input <code>bing</code>. The input is not <code>google</code>, so the second group will match, not the first. Once the substitutions take place, the result is <code>((^^bing))^^(1)</code>. <code>^^</code> gets the length to result in <code>(4)^^(1)</code>, and the result gets repeated 1 time to result in <code>4</code>.</p>
<p>However, if the input is <code>google</code>, the first group will match. That will result in <code>((^^))^^(1google)</code> after substitutions. <code>^^</code> will just get the length of the empty string (0), so the result after <code>^^</code> is applied will be <code>(0)^^(1google)</code>. Now the repetition operator can do its work...or not. See it will try to repeat <code>0</code> <code>1google</code> times. As <code>1google</code> isn't a number, the output will be:</p>
<pre><code>Traceback (most recent call last):
  File &quot;c callback&quot;, line 6, in &lt;module&gt;
  File &quot;&lt;string&gt;&quot;, line 5, in &lt;module&gt;
  File &quot;&lt;string&gt;&quot;, line 167, in main
  File &quot;&lt;string&gt;&quot;, line 125, in run
  File &quot;&lt;string&gt;&quot;, line 72, in expand
ValueError: invalid literal for int() with base 10: '1google'
</code></pre>
<p><a href="http://kirbyfan64.github.io/rs/index.html?script=%5E%28google%29%7C%28.*%29%24%2F%28%28%5E%5E%5C2%29%29%5E%5E%281%5C1%29&amp;input=" rel="nofollow noreferrer">Live demo.</a> (Put the input text in the box at the bottom left.)</p>


blocks|key|302851|text|C#+4.0，51字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|302852|int+g(string+s){return+s.Length/(s!="google"?1:0);}|unstyled|offset|length|style|CODE|302853|示例：|302854|string+userInput+=+Console.ReadLine();
Console.WriteLine(g(userInput));|code-block|syntax|javascript|302855|输出：|302856|//+"pogi"+4
//+"google"+DivideByZeroException+was+unhandled|entityMap^0|0|0|1F|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@$E|W|F|X|G|H]]|9|@]|A|$]]|$1|I|3|J|5|D|7|Y|8|@]|9|@]|A|$]]|$1|K|3|L|5|M|7|Z|8|@]|9|@]|A|$N|O]]|$1|P|3|Q|5|D|7|10|8|@]|9|@]|A|$]]|$1|R|3|S|5|M|7|11|8|@]|9|@]|A|$N|O]]]|T|$]]

<h1>C# 4.0, 51 bytes</h1>

<p><code>int g(string s){return s.Length/(s!="google"?1:0);}</code></p>

<p>Sample:</p>

<pre><code>string userInput = Console.ReadLine();
Console.WriteLine(g(userInput));
</code></pre>

<p>Output:</p>

<pre><code>// "pogi" 4
// "google" DivideByZeroException was unhandled
</code></pre>


blocks|key|303299|text|C%2B%2B14，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|303300|[](auto+s){return+s=="google"?throw:s.size();};|code-block|syntax|javascript|303301|这是C%2B%2B14中一个通用的lambda表达式，它只检查参数(字符串)是否为"google“，如果是，则调用terminate，否则它将返回字符串的长度。|unstyled|offset|length|style|CODE|303302|可以这样称呼它：|303303|[](auto+s){return+s=="google"?throw:s.size();}("some_string"s);|303304|这里用C%2B%2B11写了一个非常相似的答案，因为这是C%2B%2B14，所以我可以把它发出去。|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/58906/41899^0|0|0|1H|9|0|0|0|0|2|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|12|8|@$J|13|K|14|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|15|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|16|8|@]|9|@]|A|$E|F]]|$1|R|3|S|5|I|7|17|8|@]|9|@$J|18|K|19|1|1A]]|A|$]]]|T|$U|$5|V|W|X|A|$Y|Z]]]]

<h1>C++14, 47 bytes</h1>

<pre class="lang-cpp prettyprint-override"><code>[](auto s){return s==&quot;google&quot;?throw:s.size();};
</code></pre>
<p>This is a generic lambda expression in C++14. It simply checks if the argument (string) is &quot;google&quot; and calls <code>terminate</code> if it is - else it returns the length of the string.</p>
<p>It can be called as such:</p>
<pre class="lang-cpp prettyprint-override"><code>[](auto s){return s==&quot;google&quot;?throw:s.size();}(&quot;some_string&quot;s);
</code></pre>
<p>Zereges has a very similar answer <a href="https://codegolf.stackexchange.com/a/58906/41899">here</a> written in C++11. Since this was C++14 it was O.K. by him for me to post this.</p>


blocks|key|304276|text|TI+89+BASIC，34字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304277|我在TI+89做这个是为了好玩。必须有一个更优化的方法，但这是目前我能想到的最好的方法。|unstyled|304278|f(x)
getNum(x/"google")&""0%2Bdim(x)|code-block|syntax|javascript|304279|基本上滥用了这样一个事实，即由自身除以的字符串变成1。|304280|从计算中删除字符串是必需的，否则您将返回(“好玩”%2B+3)，我认为这不符合规则。|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|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|D|7|S|8|@]|9|@]|A|$]]]|N|$]]

<h1> TI 89 BASIC, 34 bytes</h1> 

<p>I did this in TI 89 for fun. There has got to be a more optimized method, but this is the best I could come up with for the moment.</p>

<pre><code>f(x)
getNum(x/"google")&amp;""0+dim(x)
</code></pre>

<p>Basically abuses the fact that a string divided by itself becomes 1.</p>

<p>0 is necessary to remove the string from the calculation otherwise you would return ("fun" + 3) which i don't think is compliant to the rules.</p>


blocks|key|304427|text|C%2B%2B14，42+chars|type|header-two|depth|inlineStyleRanges|entityRanges|data|304428|对于咯咯笑，因为我没有看到一个非常好的c%2B%2B解决方案。我的TI-89解决方案在34个字节上有优势。|unstyled|offset|length|304429|[](auto+s){return+s.size()/(s!="google");}|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/76275/52252^0|0|13|5|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@$E|U|F|V|1|W]]|A|$]]|$1|G|3|H|5|I|7|X|8|@]|9|@]|A|$J|K]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>C++14, 42 chars</h1>

<p>For giggles, as I did not see a very good c++ solution. My TI-89 solution is superior at <a href="https://codegolf.stackexchange.com/a/76275/52252">34 bytes</a></p>

<pre><code>[](auto s){return s.size()/(s!="google");}
</code></pre>


blocks|key|5735452|text|胡恩，32字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5735453|%7C*
a/*
?<
=(a+"google")
(lent+a)|code-block|syntax|javascript|5735454|使用湿门来避免指定a/tape而不是a/*，断言a不等于"google“或恐慌，返回磁带的长度。|unstyled|style|CODE|5735455|>+%25.++"abc"
++%7C*
++a/*
++?<
++=(a+"google")
++(lent+a)
3
>+%25.++"google"
++%7C*
++a/*
++?<
++=(a+"google")
++(lent+a)
ford:+build+failed+~[/g/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/use/dojo/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/inn/hand+/g/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/use/hood/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/out/dojo/drum/phat/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/dojo+/d+//term/1]|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/urbit/urbit^0|0|2|0|0|0|9|6|I|3|O|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|@$A|12|B|13|L|M]|$A|14|B|15|L|M]|$A|16|B|17|L|M]]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]]]

<h2><a href="https://github.com/urbit/urbit" rel="nofollow noreferrer">Hoon</a>, 32 bytes</h2>
<pre><code>|*
a/*
?&lt;
=(a &quot;google&quot;)
(lent a)
</code></pre>
<p>Uses a wet gate to avoid having to specify <code>a/tape</code> instead of <code>a/*</code>, assert that <code>a</code> doesn't equal &quot;google&quot; or panic, return the length of the tape.</p>
<pre><code>&gt; %.  &quot;abc&quot;
  |*
  a/*
  ?&lt;
  =(a &quot;google&quot;)
  (lent a)
3
&gt; %.  &quot;google&quot;
  |*
  a/*
  ?&lt;
  =(a &quot;google&quot;)
  (lent a)
ford: build failed ~[/g/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/use/dojo/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/inn/hand /g/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/use/hood/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/out/dojo/drum/phat/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/dojo /d //term/1]
</code></pre>


blocks|key|5735485|text|碲，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5735486|这门语言比问题新，所以我想是非竞争性的。|unstyled|5735487|i?google%7Cd]L%5E|code-block|syntax|javascript|5735488|这个程序使用i获取输入，并检查输入是否为"google“。如果是的话，它会尝试将"google“除以零(d)+--好吧，这不起作用，所以它会抛出一个错误。|style|CODE|5735489|如果输入不是google，它会使用L%5E输出所选单元格值的长度(即输入)。|entityMap|0|LINK|mutability|MUTABLE|url|http://m654z.github.io/^0|0|1|0|0|0|0|6|1|1G|1|0|H|2^^$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|$]]|$1|G|3|H|5|I|7|13|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|14|8|@$A|15|B|16|N|O]|$A|17|B|18|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|F|7|19|8|@$A|1A|B|1B|N|O]]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]]]

<h1><a href="http://m654z.github.io" rel="nofollow">Tellurium</a>, 13 bytes</h1>

<p>This language is newer than the question, so non-competing I guess.</p>

<pre><code>i?google|d]L^
</code></pre>

<p>This program gets input using <code>i</code>, and checks if the input is "google". If it is, it tries dividing "google" by zero (<code>d</code>) well, that doesn't work (duh) so it throws an error.</p>

<p>If the input <em>isn't</em> google, it outputs the length of the selected cell's value (which is the input) using <code>L^</code>.</p>


blocks|key|304519|text|JavaScript，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304520|p=>p=='google'?_:p.length|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>JavaScript, 25 bytes</h1>
<pre><code>p=&gt;p=='google'?_:p.length
</code></pre>


blocks|key|5736008|text|Pyth+-+15字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5736009|?qz"google"'0lz|code-block|syntax|javascript|5736010|我最喜欢的部分是我的错误。我使用'函数，它接受一个字符串，但是传递0，它不是字符串。|unstyled|offset|length|style|CODE|entityMap^0|0|0|G|1|X|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]|$J|T|K|U|L|M]]|9|@]|A|$]]]|N|$]]

<h1>Pyth - 15 bytes</h1>
<pre><code>?qz&quot;google&quot;'0lz
</code></pre>
<p>My favorite part of this is how I error. I use the <code>'</code> function which takes a string, but pass <code>0</code>, which is not a string.</p>


blocks|key|5736278|text|布氏对数，12字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5736279|"google"∧∈%7Cl|code-block|syntax|javascript|5736280|在网上试试！|unstyled|5736281|由于Brachylog+简单地失败一个试图除以0的谓词.，这里的错误来自试图将输出与包含一个完全未实例化变量的列表相统一。如果输入可以与google统一，则会出错，否则该谓词将输出输入的长度(在末尾再添加一个字节w，使其成为打印长度的完整程序)。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JCumin/Brachylog|1|https://tio.run/##SypKTM6ozMlPN/r/qG3Do6bG8v9K6fn56TmpSo86lj/q6KjJ@Q8SSQeJAAA|2|https://tio.run/##SypKTM6ozMlPN/r/39DaQP//fwA^0|0|4|0|0|0|0|6|1|0|1W|6|2Y|1|C|G|2^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@$A|1A|B|1B|N|O]|$A|1C|B|1D|N|O]]|9|@$A|1E|B|1F|1|1G]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

<h1><a href="https://github.com/JCumin/Brachylog" rel="nofollow noreferrer">Brachylog</a>, 12 bytes</h1>

<pre><code>"google"∧∈|l
</code></pre>

<p><a href="https://tio.run/##SypKTM6ozMlPN/r/qG3Do6bG8v9K6fn56TmpSo86lj/q6KjJ@Q8SSQeJAAA" rel="nofollow noreferrer" title="Brachylog – Try It Online">Try it online!</a></p>

<p>Since Brachylog <a href="https://tio.run/##SypKTM6ozMlPN/r/39DaQP//fwA" rel="nofollow noreferrer" title="Brachylog – Try It Online">simply fails a predicate that tries to divide by 0</a>, the error here comes from trying to unify the output with a list containing an entirely un-instantiated variable instead. If the input can be unified with <code>google</code>, it errors, and otherwise this predicate outputs the length of the input (add one more byte <code>w</code> to the end to make it a full program that prints the length).</p>


blocks|key|5736857|text|维沙尔，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5736858|‛»Ǒ≠/÷L|code-block|syntax|javascript|5736859|在网上试试！|unstyled|5736860|‛»Ǒ≠/÷L
‛»Ǒ+++++#+"google"
+++≠++++#+↑+!=+input
++++/+++#+split+input+into+↑+even+pieces.+If+input+is+"google",+this+will+be+0,+consequently+causing+an+error
+++++÷L+#+Get+the+length+of+the+item|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Lyxal/Vyxal|1|http://lyxal.pythonanywhere.com/?flags=&code=%25E2%2580%259B%25C2%25BB%25C7%2591%25E2%2589%25A0%252F%25C3%25B7L&inputs=google&header=&footer=^0|0|3|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/Lyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a>, 7 bytes</h1>
<pre><code>‛»Ǒ≠/÷L
</code></pre>
<p><a href="http://lyxal.pythonanywhere.com?flags=&amp;code=%E2%80%9B%C2%BB%C7%91%E2%89%A0%2F%C3%B7L&amp;inputs=google&amp;header=&amp;footer=" rel="nofollow noreferrer">Try it Online!</a></p>
<pre class="lang-python prettyprint-override"><code>‛»Ǒ≠/÷L
‛»Ǒ     # &quot;google&quot;
   ≠    # ↑ != input
    /   # split input into ↑ even pieces. If input is &quot;google&quot;, this will be 0, consequently causing an error
     ÷L # Get the length of the item
</code></pre>


blocks|key|306081|text|红色，34字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|306082|func[g][length?+any[g+="google"g]]|code-block|syntax|javascript|306083|在网上试试！+(代码非常密集以至于程序崩溃)。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://www.red-lang.org/|1|https://tio.run/##K0pN@R@UmqIQHauQlp9v9T@tNC85Oj02Oic1L70kw14hMa8yOl3BVik9Pz89J1UpPTb2f0FRZl4JSLWCkhIXEicpMy8dRQCq5z8A^0|0|2|0|0|0|0|6|1^^$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|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://www.red-lang.org" rel="nofollow noreferrer">Red</a>, 34 bytes</h1>
<pre><code>func[g][length? any[g =&quot;google&quot;g]]
</code></pre>
<p><a href="https://tio.run/##K0pN@R@UmqIQHauQlp9v9T@tNC85Oj02Oic1L70kw14hMa8yOl3BVik9Pz89J1UpPTb2f0FRZl4JSLWCkhIXEicpMy8dRQCq5z8A" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a> (the code so dense that it crashes the program).</p>


blocks|key|301151|text|CoffeeScript，36字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|301152|f=(x)->throw+0if'google'==x;x.length|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h2>CoffeeScript, 36 bytes</h2>

<pre class="lang-coffee prettyprint-override"><code>f=(x)-&gt;throw 0if'google'==x;x.length
</code></pre>


blocks|key|301418|text|STATA，44字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|301419|pr+de+a
if"google"==`0'+f
di+length(`0')
end|code-block|syntax|javascript|301420|当输入为"google“时，打印”无法识别的命令:+f“。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h2>STATA, 44 bytes</h2>

<pre><code>pr de a
if"google"==`0' f
di length(`0')
end
</code></pre>

<p>prints "unrecognized command:  f" when input is "google"</p>


blocks|key|5733095|text|F#，33个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|5733096|function"google"->0/0%7Cs->s.Length|code-block|syntax|javascript|5733097|当"google"作为输入提供时，它会生成一个DevideByZeroException。|unstyled|offset|length|style|CODE|5733098|用法：|5733099|let+g+=+function"google"->0/0%7Cs->s.Length

g+"bing"+++//+4
g+"google"+//+DivideByZeroException|entityMap^0|0|0|1|8|N|L|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@$J|V|K|W|L|M]|$J|X|K|Y|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|Z|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|10|8|@]|9|@]|A|$E|F]]]|R|$]]

<h1>F#, 33 Characters</h1>

<pre class="lang-fs prettyprint-override"><code>function"google"-&gt;0/0|s-&gt;s.Length
</code></pre>

<p>When <code>"google"</code> is provided as input, it produces a <code>DevideByZeroException</code>.</p>

<p>Usage:</p>

<pre><code>let g = function"google"-&gt;0/0|s-&gt;s.Length

g "bing"   // 4
g "google" // DivideByZeroException
</code></pre>


blocks|key|5733121|text|><>，108个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5733122|i:"g"=1-?v\]
i:"o"=1-?v\
i:"o"=1-?v\
i:"g"=1-?v\
i:"l"=1-?v\
i:"e"=1-?v\
i:01-=1-?v\
>i:0)?v~l+n;
%5E+++++<++<|code-block|syntax|javascript|5733123|在这里试试|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/Fish|1|http://fishlanguage.com/playground/pCaNgesNxD8PQHCZu^0|0|3|0|0|0|0|5|1^^$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|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

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

<pre><code>i:"g"=1-?v\]
i:"o"=1-?v\
i:"o"=1-?v\
i:"g"=1-?v\
i:"l"=1-?v\
i:"e"=1-?v\
i:01-=1-?v\
&gt;i:0)?v~l n;
^     &lt;  &lt;
</code></pre>

<p><a href="http://fishlanguage.com/playground/pCaNgesNxD8PQHCZu" rel="nofollow">Try it here</a></p>


blocks|key|5733293|text|Java1.8，33个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5733294|(s)->s.length()/(s=="google"?0:1)|code-block|syntax|javascript|5733295|解释|5733296|lambda接受一个名为s的字符串，查找长度，如果不是"google"，则将其除以1，否则除以零并导致异常。|unstyled|offset|length|style|CODE|5733297|使用|5733298|请注意，必须导入java.util.function.Function。|5733299|Function<String,+Integer>+f+=+(s)->s.length()/(s=="google"?0:1);+//Assign+function+to+variable
++++//Note+that+java+type+inferencing+automatically+handles+the+String+type

System.out.println(f.apply("elgoog"));+//Prints+6
System.out.println(f.apply("google"));+//ArithmeticException:+Divide+by+zero|entityMap^0|0|0|0|C|1|0|0|8|R|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Y|8|@]|9|@]|A|$]]|$1|I|3|J|5|K|7|Z|8|@$L|10|M|11|N|O]]|9|@]|A|$]]|$1|P|3|Q|5|6|7|12|8|@]|9|@]|A|$]]|$1|R|3|S|5|K|7|13|8|@$L|14|M|15|N|O]]|9|@]|A|$]]|$1|T|3|U|5|D|7|16|8|@]|9|@]|A|$E|F]]]|V|$]]

<h1>Java 1.8, 33 bytes</h1>

<pre><code>(s)-&gt;s.length()/(s=="google"?0:1)
</code></pre>

<h2>Explanation</h2>

<p>The lambda takes a String named <code>s</code>, finds the length, and if it isn't "google", divides it by one, otherwise dividing it by zero and causing an Exception.</p>

<h2>Usage</h2>

<p>Note that <code>java.util.function.Function</code> has to be imported.
</p>

<pre><code>Function&lt;String, Integer&gt; f = (s)-&gt;s.length()/(s=="google"?0:1); //Assign function to variable
    //Note that java type inferencing automatically handles the String type

System.out.println(f.apply("elgoog")); //Prints 6
System.out.println(f.apply("google")); //ArithmeticException: Divide by zero
</code></pre>


blocks|key|302130|text|Lua，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|302131|print(assert(arg[1]~="google")and+arg[1]:len())|code-block|syntax|javascript|302132|如果是"google“，抛出”断言失败“|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Lua, 47 bytes</h1>

<pre><code>print(assert(arg[1]~="google")and arg[1]:len())
</code></pre>

<p>Throws "assertion failed" if it's "google"</p>


blocks|key|302623|text|哈辛，52+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|302624|func+g(s){if(s=="google")throw("");return+s.length;}|code-block|syntax|javascript|302625|运行并查看扩展的这里|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://hassiumlang.com/|1|http://hassiumlang.com/Hassium/index.php?code=bd91a6aa6ba6462c23093ca1c57a1757^0|0|2|0|0|0|8|2|1^^$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|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://HassiumLang.com" rel="nofollow">Hassium</a>, 52 Bytes</h1>

<pre><code>func g(s){if(s=="google")throw("");return s.length;}
</code></pre>

<p>Run and see expanded <a href="http://HassiumLang.com/Hassium/index.php?code=bd91a6aa6ba6462c23093ca1c57a1757" rel="nofollow">here</a></p>


blocks|key|302678|text|Haskell，24个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|302679|g+n%7Cn/="google"=length+n|code-block|syntax|javascript|302680|“非穷尽模式”，如果你传递“谷歌”。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Haskell, 24 characters</h1>
<pre><code>g n|n/=&quot;google&quot;=length n
</code></pre>
<p>&quot;Unexhaustive patterns&quot; if you pass it &quot;google&quot;.</p>


blocks|key|302754|text|C+-+72字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|302755|g(char*s){char*p=s;for(;*p=="google"[p-s];p%2B%2B);for(;*p;p%2B%2B);return+p-s;}|code-block|syntax|javascript|302756|产出：|unstyled|302757|g("test")++++#+4
g("googles")+#+7
g("google")++#+Segmentation+fault+(core+dumped)|302758|这个解决方案非常简单，没有棘手的位操作(但也没有库函数)：在第一个循环中匹配google字符串，如果还剩下字符，则继续到字符串的末尾。返回指针之间的差异作为长度。|302759|bug:给定字符串"google“，第一个循环不会终止，导致它溢出和取消内存位置，直到它发生分段错误。|302760|它还有一个额外的错误:如果你给它输入字符串"google\0“，它会成功，但返回错误的长度。|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|W|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|X|8|@]|9|@]|A|$]]|$1|P|3|Q|5|I|7|Y|8|@]|9|@]|A|$]]]|R|$]]

<h1>C - 72 characters</h1>

<pre><code>g(char*s){char*p=s;for(;*p=="google"[p-s];p++);for(;*p;p++);return p-s;}
</code></pre>

<p>output:</p>

<pre><code>g("test")    # 4
g("googles") # 7
g("google")  # Segmentation fault (core dumped)
</code></pre>

<p>This solution is pretty straightforward, no tricky bit manipulation (but also no library functions): match the string google in the first loop, and if there are still characters left continue to the end of the string. Return the difference between the pointers as the length.</p>

<p>The bug: given the string "google" the first loop does not terminate, causing it to overrun and dereference memory locations until it segfaults.</p>

<p>It also has a bonus bug: if you feed it the string "google\0" it succeeds but returns the wrong length.</p>


blocks|key|5733763|text|JS，48字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5733764|对Beta衰变的JS的改进：|unstyled|5733765|function+f(g){g=="google"?g.s.s:alert(g.length)}|code-block|syntax|javascript|5733766|供参考的原件：|5733767|function+f(g){if(g=="google")throw+1;alert(g.length)}|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|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|S|8|@]|9|@]|A|$H|I]]]|N|$]]

<h1>JS, 48 bytes</h1>
<p>An improvement over Beta Decay's JS:</p>
<pre><code>function f(g){g==&quot;google&quot;?g.s.s:alert(g.length)}
</code></pre>
<p>The original for reference:</p>
<pre><code>function f(g){if(g==&quot;google&quot;)throw 1;alert(g.length)}
</code></pre>


blocks|key|302813|text|Burlesque，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|302814|J"google"!={L[}j{vvg_}jie|code-block|syntax|javascript|302815|代码可以在无政府状态高尔夫球检查机上运行。单击“使用表单”，选择“滑稽”，将代码复制/粘贴到表单中，然后输入。跑。|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|http://golf.shinh.org/check.rb^0|0|0|5|C|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Burlesque, 25 bytes</h1>
<pre><code>J&quot;google&quot;!={L[}j{vvg_}jie
</code></pre>
<p>Code can be run at <a href="http://golf.shinh.org/check.rb" rel="nofollow noreferrer">Anarchy Golf checker</a>. Click 'use form' choose 'burlesque', copy/paste code into the form, and input goes under it. Run.</p>


blocks|key|5733882|text|XPath+2.0+(如果将XPath表达式视为以上下文项为参数的函数)：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5733883|简单解决方案：|5733884|if+(.='google')+then+error()+else+string-length()|code-block|syntax|javascript|5733885|如果将返回空序列视为错误，则|5733886|string-length(.[.!='google'])|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|P|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|Q|8|@]|9|@]|A|$]]|$1|K|3|L|5|F|7|R|8|@]|9|@]|A|$G|H]]]|M|$]]

<p>XPath 2.0 (if you treat an XPath expression as a function with the context item as its argument):</p>

<p>Simple solution:</p>

<pre><code>if (.='google') then error() else string-length()
</code></pre>

<p>If you treat returning an empty sequence as an error, then</p>

<pre><code>string-length(.[.!='google'])
</code></pre>


blocks|key|5734013|text|ECMA6，30+6，30|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734014|g=(s)=>s=="google"?-1:s.length|code-block|syntax|javascript|5734015|由于字符串长度为-1是一个错误，我认为这是Javascript+(ECMA6)中的一个有效答案。|unstyled|5734016|我最初的灵感来自于蟒蛇的伎俩，那就是在顶部附近引起零的除法。但是，这在Javascript中不起作用，因为您可以除以零并获得“无限”，而不会抛出错误，因此我查看了其他选项。|5734017|这在Chrome中是可行的，您可以将其复制到dev控制台，然后通过调用g(“这里的某个字符串”)来运行它。我认为任何其他对ECMA6有部分支持的浏览器都应该能够运行它。|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|$E|F]]|$1|G|3|H|5|I|7|Q|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|I|7|S|8|@]|9|@]|A|$]]]|N|$]]

<p><strong>ECMA6,30</strong></p>

<pre><code>g=(s)=&gt;s=="google"?-1:s.length
</code></pre>

<p>Since a string length of -1 is an error I think this is a valid answer in Javascript (ECMA6). </p>

<p>I was initially inspired by the python trick of causing a division by zero mentioned near the top. However this does not work in Javascript because you can divide by zero and get "Infinity" without throwing an error so I looked into other options.</p>

<p>This works in Chrome you can copy this into the dev console and then run it by calling g("some string here"). I assume any other browser that has partial support for ECMA6 should be able to run it.</p>


blocks|key|5734189|text|TSQL+2012，87|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734190|CREATE+FUNCTION+g(@p+CHAR(9))RETURNS+INT+AS+BEGIN+RETURN+IIF(@p='google',@p,LEN(@p))END|code-block|syntax|javascript|5734191|如何使用：|unstyled|5734192|5734193|选择dbo.g(“gogle”)|5734194|5734195|-返回5|5734196|选择dbo.g('google')|5734197|5734198|-将varchar值“google”转换为数据类型int时，返回转换失败。|entityMap^0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|V|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|W|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|X|8|@]|9|@]|A|$]]|$1|J|3|-4|5|I|7|Y|8|@]|9|@]|A|$]]|$1|K|3|L|5|I|7|Z|8|@]|9|@]|A|$]]|$1|M|3|-4|5|I|7|10|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|11|8|@]|9|@]|A|$]]|$1|P|3|Q|5|I|7|12|8|@]|9|@]|A|$]]|$1|R|3|-4|5|I|7|13|8|@]|9|@]|A|$]]|$1|S|3|T|5|I|7|14|8|@]|9|@]|A|$]]]|U|$]]

<h2><strong>TSQL 2012, 87</strong></h2>

<pre><code>CREATE FUNCTION g(@p CHAR(9))RETURNS INT AS BEGIN RETURN IIF(@p='google',@p,LEN(@p))END
</code></pre>

<p>How to use :<br>
SELECT dbo.g('gogle')<br>
-- return 5</p>

<p>SELECT dbo.g('google')<br>
--return Conversion failed when converting the varchar value 'google   ' to data type int.</p>


blocks|key|5734270|text|AHK，75字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5734271|Inputbox,s
MsgBox+%25+a(s)
a(b)
{
if+(b!="google")
return+StrLen(b)
throw+b
}|code-block|syntax|javascript|5734272|在ahk中没有适当的stdin和stdout支持，所以im使用inputbox和msgbox，其概念是相同的。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://ahkscript.org/^0|0|3|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|F|7|W|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|X|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

<h2><a href="http://ahkscript.org/" rel="nofollow">AHK</a>, 75 bytes</h2>

<pre><code>Inputbox,s
MsgBox % a(s)
a(b)
{
if (b!="google")
return StrLen(b)
throw b
}
</code></pre>

<p>there is no proper stdin and stdout support in ahk so im using inputbox and msgbox, the concept is the same tho.</p>


blocks|key|5734481|text|><>，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734482|i:0(?\
?\ln;>~l6=
"\+"elgoog
!\{=?!\l+?
=<+;n6<|code-block|syntax|javascript|5734483|这是一个逐行的细分：|unstyled|5734484|i:0(?\|5734485|一个标准的><>输入循环，推送输入字符串，然后是-1。|offset|length|style|CODE|5734486|?\ln;>~l6=|5734487|从>开始。丢弃-1，检查长度等于6。如果是，移到下一行，否则得到长度、打印和退出。|5734488|"\+"elgoog|5734489|从\开始。推动‘谷歌’的反向。如果输入字符串是google，堆栈现在是googleelgoog。|5734490|!\{=?!\l+?|5734491|从第一个\开始。将堆栈一向左滚动。如果前两个元素不相等，则移到下一行。否则，如果堆栈的长度为零，则字符串是相等的，因此也要转到下一行。|5734492|=<+;n6<|5734493|如果字符串是'google‘，则在1号<开始。只有当堆栈为空时才能达到这一点，因此尝试弹出任意数量的值将导致错误--在本例中，使用=。如果字符串不是'google'，输出6并退出。|entityMap^0|0|0|0|0|O|2|0|0|1|1|0|0|1|1|N|6|Z|C|0|0|4|1|0|0|J|1|1T|1^^$0|@$1|2|3|4|5|6|7|18|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|19|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|1A|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|1B|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|1C|8|@$N|1D|O|1E|P|Q]]|9|@]|A|$]]|$1|R|3|S|5|D|7|1F|8|@]|9|@]|A|$E|F]]|$1|T|3|U|5|I|7|1G|8|@$N|1H|O|1I|P|Q]]|9|@]|A|$]]|$1|V|3|W|5|D|7|1J|8|@]|9|@]|A|$E|F]]|$1|X|3|Y|5|I|7|1K|8|@$N|1L|O|1M|P|Q]|$N|1N|O|1O|P|Q]|$N|1P|O|1Q|P|Q]]|9|@]|A|$]]|$1|Z|3|10|5|D|7|1R|8|@]|9|@]|A|$E|F]]|$1|11|3|12|5|I|7|1S|8|@$N|1T|O|1U|P|Q]]|9|@]|A|$]]|$1|13|3|14|5|D|7|1V|8|@]|9|@]|A|$E|F]]|$1|15|3|16|5|I|7|1W|8|@$N|1X|O|1Y|P|Q]|$N|1Z|O|20|P|Q]]|9|@]|A|$]]]|17|$]]

<h1>&gt;&lt;&gt;, 47 bytes</h1>
<pre><code>i:0(?\
?\ln;&gt;~l6=
&quot;\ &quot;elgoog
!\{=?!\l ?
=&lt; ;n6&lt;
</code></pre>
<p>Here's a line-by-line breakdown:</p>
<pre><code>i:0(?\
</code></pre>
<p>A standard &gt;&lt;&gt; input loop, pushes the input string followed by <code>-1</code>.</p>
<pre><code>?\ln;&gt;~l6=
</code></pre>
<p>Starts at <code>&gt;</code>. Discards the -1, checks the length is equal to 6. If it is, move to next line, otherwise gets the length, prints, and exits.</p>
<pre><code>&quot;\ &quot;elgoog
</code></pre>
<p>Starts at <code>\</code>. Pushes 'google' in reverse. If the input string was <code>google</code>, stack is now <code>googleelgoog</code></p>
<pre><code>!\{=?!\l ?
</code></pre>
<p>Starts at the first <code>\</code>. Rolls the stack one to the left. If top two elements aren't equal, moves to next line. Otherwise, if the stack is length is zero, the strings are equal, so also step to next line.</p>
<pre><code>=&lt; ;n6&lt;
</code></pre>
<p>Starts on the 1st <code>&lt;</code> if the string was 'google'. This is only reached when the stack is empty, so attempting to pop any number of values will cause an error - in this case, <code>=</code> is used. If the string wasn't 'google', outputs 6 and exits.</p>


blocks|key|5734581|text|J，18|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734582|+++#`%5E@.('google'-:])|code-block|syntax|javascript|5734583|用法：|unstyled|5734584|+++#`%5E@.('google'-:])+'googl'
5
+++#`%5E@.('google'-:])+'google'
%7Cdomain+error
%7C+++++++#`%5E@.('google'-:])'google'|5734585|解释|5734586|计数(#)如果y不匹配(-:])字符串'google'，但如果匹配，则计算e到字符串'google‘的威力，这是一个错误。|offset|length|style|CODE|entityMap^0|0|0|0|0|0|3|1|C|3|J|8^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|Y|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|Z|8|@$P|10|Q|11|R|S]|$P|12|Q|13|R|S]|$P|14|Q|15|R|S]]|9|@]|A|$]]]|T|$]]

<h1>J, 18</h1>

<pre><code>   #`^@.('google'-:])
</code></pre>

<p>Usage:</p>

<pre><code>   #`^@.('google'-:]) 'googl'
5
   #`^@.('google'-:]) 'google'
|domain error
|       #`^@.('google'-:])'google'
</code></pre>

<p>Explanation</p>

<p>Count (<code>#</code>) if y does not match (<code>-:]</code>) the string <code>'google'</code>, but if it does match, compute e to the power of the string 'google', which is an error.</p>


blocks|key|5734749|text|MS+T，63字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734750|CREATE+PROC+g+@p+CHAR(9)+AS+SELECT+IIF(@p='google',1/0,LEN(@p))|code-block|syntax|javascript|5734751|未打高尔夫球的代码；|unstyled|5734752|CREATE+PROC+g
++++@p+CHAR(9)
AS
++++SELECT+IIF(@p='google',1/0,LEN(@p))|5734753|由EXEC+g+'string‘或简单g+'string’调用。|5734754|命令:+EXEC+g+'gogle‘|5734755|结果:5|5734756|命令:执行“谷歌”|5734757|结果:+Msg+8134，16级，状态1，程序g，行1除以零误差。|entityMap^0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|10|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|11|8|@]|9|@]|A|$]]|$1|P|3|Q|5|I|7|12|8|@]|9|@]|A|$]]|$1|R|3|S|5|I|7|13|8|@]|9|@]|A|$]]|$1|T|3|U|5|I|7|14|8|@]|9|@]|A|$]]]|V|$]]

<p><strong>MS T-SQL, 63 bytes</strong></p>

<pre><code>CREATE PROC g @p CHAR(9) AS SELECT IIF(@p='google',1/0,LEN(@p))
</code></pre>

<p>Ungolfed code;</p>

<pre><code>CREATE PROC g
    @p CHAR(9)
AS
    SELECT IIF(@p='google',1/0,LEN(@p))
</code></pre>

<p>Called by either EXEC g 'string' or simply g 'string'</p>

<p>Command: EXEC g 'gogle'</p>

<p>Result: 5</p>

<p>Command: EXEC g 'google'</p>

<p>Result: Msg 8134, Level 16, State 1, Procedure g, Line 1 Divide by zero error encountered.</p>


blocks|key|303853|text|银河1.0.0，18字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|303854|这种语言是在发布挑战之后创建的。|unstyled|303855|'?{"google"b~z~y!}|code-block|syntax|javascript|303856|解释|303857|'+++++++++++++++++++#+read+input+from+command+line
+?{+++++++++~+~++}++#+if-else+statement
+++"google"+++++++++#+push+"google"+to+the+stack
+++++++++++b++++++++#+==+on+top+two+stack+items+(input+and+"google")
+++++++++++++z++++++#+non-existent+opcode+raises+an+exception
+++++++++++++++y++++#+push+the+length+of+the+TOS+to+the+stack
++++++++++++++++!+++#+output+the+TOS|303858|银河系(当前版本)，18字节|303859|'?{"google"b_z_y!}|303860|使用|303861|代码通过命令行调用，如下所示：|303862|./mw+<path-to-code>+-i+<input>|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/zachgates7/Milky-Way|1^0|0|7|0|0|0|0|0|0|0|9|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|F|7|1B|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|1C|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|6|7|1D|8|@]|9|@]|C|$]]|$1|N|3|O|5|I|7|1E|8|@]|9|@]|C|$J|K]]|$1|P|3|Q|5|6|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|R|3|S|5|I|7|1J|8|@]|9|@]|C|$J|K]]|$1|T|3|U|5|6|7|1K|8|@]|9|@]|C|$]]|$1|V|3|W|5|F|7|1L|8|@]|9|@]|C|$]]|$1|X|3|Y|5|I|7|1M|8|@]|9|@]|C|$J|K]]]|Z|$10|$5|11|12|13|C|$14|15]]|16|$5|11|12|13|C|$14|15]]]]

<h1><a href="https://github.com/zachgates7/Milky-Way" rel="nofollow">Milky Way 1.0.0</a>, 18 bytes</h1>

<p>This language was created after the challenge was posted.</p>

<pre><code>'?{"google"b~z~y!}
</code></pre>

<hr>

<h3>Explanation</h3>

<pre><code>'                   # read input from command line
 ?{         ~ ~  }  # if-else statement
   "google"         # push "google" to the stack
           b        # == on top two stack items (input and "google")
             z      # non-existent opcode raises an exception
               y    # push the length of the TOS to the stack
                !   # output the TOS
</code></pre>

<hr>

<h1><a href="https://github.com/zachgates7/Milky-Way" rel="nofollow">Milky Way (current version)</a>, 18 bytes</h1>

<pre><code>'?{"google"b_z_y!}
</code></pre>

<hr>

<h3>Usage</h3>

<p>The code is called via the command line as follows:</p>

<pre><code>./mw &lt;path-to-code&gt; -i &lt;input&gt;
</code></pre>


blocks|key|5734877|text|Java，96+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734878|这应该是可行的，但是IDK是肯定的，因为我目前无法评估计算机：|unstyled|5734879|高尔夫球：|5734880|+int+g(String+s){if(s.equals("google"))throw+new
+IllegalArgumentException();return+s.length();}|code-block|syntax|javascript|5734881|未高尔夫球：|5734882|int+g(String+s){+
++++if(s.equals("google"))+throw+new+IllegalArgumentException();
++++return+s.length();+}|5734883|我意识到我可以大大缩短这一点，让我知道在评论中。|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$]]|$1|E|3|F|5|D|7|U|8|@]|9|@]|A|$]]|$1|G|3|H|5|I|7|V|8|@]|9|@]|A|$J|K]]|$1|L|3|M|5|D|7|W|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|X|8|@]|9|@]|A|$J|K]]|$1|P|3|Q|5|D|7|Y|8|@]|9|@]|A|$]]]|R|$]]

<h2>Java, 96 Bytes</h2>

<p>This should work, but IDK for sure since I cant assess a computer at the moment:</p>

<p>Golfed:</p>

<pre><code> int g(String s){if(s.equals("google"))throw new
 IllegalArgumentException();return s.length();}
</code></pre>

<p>Ungolfed:</p>

<pre><code>int g(String s){ 
    if(s.equals("google")) throw new IllegalArgumentException();
    return s.length(); }
</code></pre>

<p>I realize I could proably shorten this, let me know in the comments. </p>


blocks|key|5734971|text|Lua，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734972|function+g(s)return+#(s~='google'and+s)end|code-block|syntax|javascript|5734973|这创建了一个函数g，它以参数S为参数，并(假设它是一个字符串)返回评估s~='google'and+s的结果的长度(#)，如果不是'google'，它等于S，如果不是‘google’，则等于false。因为没有长度的错误，如果S是谷歌，这将是错误的，否则，它将返回长度。简单有效。|unstyled|offset|length|style|CODE|5734974|我知道还有其他Lua的答案，我可以通过使用io.read()来缩短这一点，但我要忽略这两个问题，原因是相同的:它们实际上并不使用函数，就像具体要求的问题一样。|5734975|如果我错了，因为它不需要是一个函数，我们可以通过以下操作将其削减到32个字节：|5734976|s=io.read()g=#(s~='google'and+s)|entityMap^0|0|0|Z|G|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@$J|X|K|Y|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|Z|8|@]|9|@]|A|$]]|$1|P|3|Q|5|I|7|10|8|@]|9|@]|A|$]]|$1|R|3|S|5|D|7|11|8|@]|9|@]|A|$E|F]]]|T|$]]

<h1>Lua, 42 bytes</h1>

<pre><code>function g(s)return #(s~='google'and s)end
</code></pre>

<p>This creates a function g that takes an argument s and (assuming it is a string) returns the length (#) of the result of the evaluation <code>s~='google'and s</code>, which equates to s if s is not 'google', or false if it is. Since there is no length of false, if s is google, this will error, else, it will return the length. Simple and effective.</p>

<p>I know there are other Lua answers, and that I could shorten this by using io.read(), but I'm going to disregard both of those for the same reason: they don't actually use functions, like the question specifically calls for.</p>

<p>If I'm wrong in that it doesn't need to be a function, we can cut this to <strong>32 bytes</strong> by doing:</p>

<pre><code>s=io.read()g=#(s~='google'and s)
</code></pre>


blocks|key|5735088|text|Mathcad，23“字节”|type|header-two|depth|inlineStyleRanges|entityRanges|data|5735089|📷|atomic|offset|length|5735090|甚至适用于外语..。|unstyled|5735091|5735092|注意:+Mathcad以红色显示表达式，显示错误；单击表达式显示错误消息。|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://i.stack.imgur.com/Vdgfw.jpg|imageAlt|1|https://i.stack.imgur.com/7cBQ0.jpg^0|0|0|1|0|0|0|0|1|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@$E|Y|F|Z|1|10]]|A|$]]|$1|G|3|H|5|I|7|11|8|@]|9|@]|A|$]]|$1|J|3|C|5|D|7|12|8|@]|9|@$E|13|F|14|1|15]]|A|$]]|$1|K|3|L|5|I|7|16|8|@]|9|@]|A|$]]]|M|$N|$5|O|P|Q|A|$R|S|T|-4]]|U|$5|O|P|Q|A|$R|V|T|-4]]]]

<h1>Mathcad, 23 "bytes"</h1>

<p><a href="https://i.stack.imgur.com/Vdgfw.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Vdgfw.jpg" alt="enter image description here"></a></p>

<p>And it even works with foreign languages ...</p>

<p><a href="https://i.stack.imgur.com/7cBQ0.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/7cBQ0.jpg" alt="enter image description here"></a></p>

<p>Note: Mathcad displays errors by showing the expression in red; clicking on the expression shows the error message.</p>


blocks|key|304451|text|Rust，41+chars|type|header-two|depth|inlineStyleRanges|entityRanges|data|304452|铁锈解决方案，提供了一个朋友谁确实有一个代表10张贴(并要求我张贴它代表他)。|unstyled|304453|%7Cx:str%7C{if+x=="google"{panic!();}x.len()}|code-block|syntax|javascript|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h1>Rust, 41 chars</h1>

<p>rust solution, provided by a friend who does have a rep of 10 to post (and asked me to post it on his behalf).</p>

<pre><code>|x:str|{if x=="google"{panic!();}x.len()}
</code></pre>


blocks|key|5735382|text|TI-83+Basic，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5735383|简单的解决办法。(小写标记各为两个字节)。|unstyled|5735384|length(Ans)/(Ans≠"google|code-block|syntax|javascript|5735385|备选解决方案(22个字节)：|5735386|If+Ans="google
.
length(Ans|5735387|备选解决方案(23个字节)：|5735388|length(Ans)%2B0/(Ans≠"google|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|U|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|V|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|W|8|@]|9|@]|A|$H|I]]|$1|N|3|O|5|D|7|X|8|@]|9|@]|A|$]]|$1|P|3|Q|5|G|7|Y|8|@]|9|@]|A|$H|I]]]|R|$]]

<h1>TI-83 Basic, 21 bytes</h1>
<p>Simple solution. (Lowercase tokens are two bytes each).</p>
<pre><code>length(Ans)/(Ans≠&quot;google
</code></pre>
<p>Alternate solution (22 bytes):</p>
<pre><code>If Ans=&quot;google
.
length(Ans
</code></pre>
<p>Alternate solution (23 bytes):</p>
<pre><code>length(Ans)+0/(Ans≠&quot;google
</code></pre>


blocks|key|5735420|text|分子+(v5.6%2B)，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5735421|I_"google"=?p¿#|code-block|syntax|javascript|5735422|解释：|unstyled|5735423|I_"google"=?p¿#
I_++++++++++++++duplicate
++"google"=+++++add+google+and+compare
+++++++++++?p¿++if+true,+do+a+primality+test+on+"google"
++++++++++++++#+get+length|5735424|这样，如果程序对字符串进行了原始性测试，程序就会出错和关闭。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lvivtotoro/molecule^0|0|2|0|0|0|0|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|@]|C|$]]|$1|L|3|M|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|13|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]]]

<h1><a href="https://github.com/lvivtotoro/molecule" rel="nofollow">Molecule</a> (v5.6+), 16 bytes</h1>

<pre><code>I_"google"=?p¿#
</code></pre>

<p>Explanation:</p>

<pre><code>I_"google"=?p¿#
I_              duplicate
  "google"=     add google and compare
           ?p¿  if true, do a primality test on "google"
              # get length
</code></pre>

<p>This way the program will error and shutdown if it does a primality test on a string.</p>


blocks|key|304475|text|Pyth，12字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304476|/lznz"google|code-block|syntax|javascript|304477|/input()！=“google”|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h2>Pyth, 12 bytes</h2>
<pre><code>/lznz&quot;google
</code></pre>
<p>len(input())/input()!=&quot;google&quot;</p>


blocks|key|5735587|text|Ruby，26字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5735588|不是比现有的更短，而是另一种解决方案。|unstyled|5735589|->x{(x=='google'%7C%7Cx).size}|code-block|syntax|javascript|5735590|如果给定google，则尝试执行导致错误的true.size：|offset|length|style|CODE|5735591|NoMethodError:+undefined+method+`size'+for+true:TrueClass|entityMap^0|0|0|0|4|6|L|9|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|U|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|V|8|@$L|W|M|X|N|O]|$L|Y|M|Z|N|O]]|9|@]|A|$]]|$1|P|3|Q|5|G|7|10|8|@]|9|@]|A|$H|I]]]|R|$]]

<h1>Ruby, 26 bytes</h1>

<p>Not shorter than the existing ones, but an alternative solution.</p>

<pre class="lang-ruby prettyprint-override"><code>-&gt;x{(x=='google'||x).size}
</code></pre>

<p>If given <code>google</code>, it tries to do <code>true.size</code> which results in an error:</p>

<pre><code>NoMethodError: undefined method `size' for true:TrueClass
</code></pre>


blocks|key|304570|text|编辑处理JS:+68字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304571|var+a+=function(i){if(i==="google"){throw"a";}else{print(i.length);}};|code-block|syntax|javascript|304572|使用编辑后的处理版本。当运行这里时，您可以看到它是有效的。如果您输入google，那么错误伙伴就会弹出，没有任何消息。这是我第一次打高尔夫球！|unstyled|offset|length|304573|编辑后的处理版本(没有通过自己的版本欺骗)+https://github.com/Khan/processing-js|entityMap|0|LINK|mutability|MUTABLE|url|https://www.khanacademy.org/computer-programming/new-program/5822532111368192|1|https://github.com/Khan/processing-js^0|0|0|E|2|0|0|M|11|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@]|9|@$J|13|K|14|1|15]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]|U|$5|P|Q|R|A|$S|V]]]]

<h1>Edited processing JS: 68 bytes</h1>

<pre><code>var a =function(i){if(i==="google"){throw"a";}else{print(i.length);}};
</code></pre>

<p>Used a edited version of processing. When run <a href="https://www.khanacademy.org/computer-programming/new-program/5822532111368192" rel="nofollow noreferrer">here</a> you can see it works. If you input google then the error buddy pops up without any message. This is my first golf!</p>

<p>Edited version of processing (didn't cheat by making my own version) <a href="https://github.com/Khan/processing-js" rel="nofollow noreferrer">https://github.com/Khan/processing-js</a></p>


blocks|key|5735693|text|05AB1E，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5735694|g¹“Š¹“Ê÷|code-block|syntax|javascript|5735695|使用CP-1252编码。在网上试试！|unstyled|offset|length|5735696|解释：|5735697|+++++++++++#+Implicit+input
+g+++++++++#+Take+length
++¹++++++++#+Get+first+input
+++“Š¹“Ê+++#+!=+compressed+form+of+"google"
++++++++÷++#+Integer+division+(Zero+Division+Error+if+invalid)|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/nexus/05ab1e#@59@aOejhjlHF4Cpw12Ht///n5Gak5MPAA^0|0|0|C|6|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|13|8|@]|9|@]|A|$E|F]]]|P|$Q|$5|R|S|T|A|$U|V]]]]

<h1>05AB1E, 8 bytes</h1>
<pre><code>g¹“Š¹“Ê÷
</code></pre>
<p>Uses the <strong>CP-1252</strong> encoding. <a href="https://tio.run/nexus/05ab1e#@59@aOejhjlHF4Cpw12Ht///n5Gak5MPAA" rel="nofollow noreferrer">Try it online!</a></p>
<p>Explanation:</p>
<pre><code>           # Implicit input
 g         # Take length
  ¹        # Get first input
   “Š¹“Ê   # != compressed form of &quot;google&quot;
        ÷  # Integer division (Zero Division Error if invalid)
</code></pre>


blocks|key|304720|text|C，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304721|-Df(s)=strlen(s)/strcmp(s,"google")|code-block|syntax|javascript|304722|)返回提供的字符串的长度。如果是google，它会抛出一个Floating+point+exception。|unstyled|offset|length|style|CODE|entityMap^0|0|0|G|6|T|O^^$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]|$J|T|K|U|L|M]]|9|@]|A|$]]]|N|$]]

<h1>C, 35 bytes</h1>

<pre><code>-Df(s)=strlen(s)/strcmp(s,"google")
</code></pre>

<p>Compiler flag :) Returns the length of the string provided. If it's <code>google</code> it throws a <code>Floating point exception</code>.</p>


blocks|key|304774|text|Mathematica，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304775|#=="google"&&1/0%7C%7CStringLength@#&|code-block|syntax|javascript|304776|TFW+Length不适用于字符串。>.>|unstyled|offset|length|style|CODE|entityMap^0|0|0|4|6^^$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, 33 bytes</h1>

<pre><code>#=="google"&amp;&amp;1/0||StringLength@#&amp;
</code></pre>

<p>TFW <code>Length</code> doesn't work on strings. >.></p>


blocks|key|304806|text|05AB1E，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|304807|“Š¹“Qi.0ëg|code-block|syntax|javascript|304808|在网上试试！|unstyled|304809|“Š¹“+++++++#+Push+"google".
++++Qi+++#+If+input+==+"google"...
++++++.0+++#+Divide+by+0.
+++++ë+++#+Else...
++++++g++++#+Return+length+of+input.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##MzBNTDJM/f//UcOcowsO7QRSgZl6BodXp///n56fn56T@l83BQA^0|0|6|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/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 10 bytes</h1>

<pre><code>“Š¹“Qi.0ëg
</code></pre>

<p><a href="https://tio.run/##MzBNTDJM/f//UcOcowsO7QRSgZl6BodXp///n56fn56T@l83BQA" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>

<hr>

<pre><code>“Š¹“       # Push "google".
    Qi   # If input == "google"...
      .0   # Divide by 0.
     ë   # Else...
      g    # Return length of input.
</code></pre>


blocks|key|304899|text|通用Lisp，50字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304900|(lambda(n)(assert(not(equal"google"n)))(length+n))|code-block|syntax|javascript|304901|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##LYpBDoAgDAS/QjhtDz6qaoMktUWo70cO3mYyc2gdbaL1apEwoXzvJ8MIPIb0gHlAnpc1F/eiko2IoGIlrrR45nVsf1v6AQ^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Common Lisp, 50 bytes</h1>
<pre><code>(lambda(n)(assert(not(equal&quot;google&quot;n)))(length n))
</code></pre>
<p><a href="https://tio.run/##LYpBDoAgDAS/QjhtDz6qaoMktUWo70cO3mYyc2gdbaL1apEwoXzvJ8MIPIb0gHlAnpc1F/eiko2IoGIlrrR45nVsf1v6AQ" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|5736070|text|斯塔克斯，9+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5736071|ôK▓ÿσ▄Ω?╠|code-block|syntax|javascript|5736072|在线运行和调试！|unstyled|5736073|好吧，打败了一些10人.|5736074|解释|5736075|使用解压版本来解释。|5736076|`!:X9`%7C%5Ehy%25
`!:X9`+++++++++"google"
++++++%7C%5E+++++++array+xor+(can't+use+`-`+here,+which+means+**set**+difference)
++++++++h++++++head+of+array,+error+if+it+is+empty
+++++++++y%25++++length+of+input|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/tomtheisen/stax|1|https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax|2|https://staxlang.xyz/#p=934bb298e5dcea3fcc&i=bing%250Agoogle&a=1&m=2^0|0|4|0|7|3|1|0|0|0|8|2|0|0|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]|$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|L|3|M|5|K|7|1G|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1H|8|@]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1I|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1J|8|@]|9|@]|C|$G|H]]]|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]]]]

<h1><a href="https://github.com/tomtheisen/stax" rel="nofollow noreferrer">Stax</a>, 9 <a href="https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>ôK▓ÿσ▄Ω?╠
</code></pre>
<p><a href="https://staxlang.xyz/#p=934bb298e5dcea3fcc&amp;i=bing%0Agoogle&amp;a=1&amp;m=2" rel="nofollow noreferrer">Run and debug online!</a></p>
<p>Well, defeated some of the 10-byters ...</p>
<h2>Explanation</h2>
<p>Uses the unpacked version to explain.</p>
<pre><code>`!:X9`|^hy%
`!:X9`         &quot;google&quot;
      |^       array xor (can't use `-` here, which means **set** difference)
        h      head of array, error if it is empty
         y%    length of input
</code></pre>


blocks|key|305379|text|JavaScript+(V8)，41字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|305380|s=>s[['length']['google'==s%7C0]].toFixed()|code-block|syntax|javascript|305381|在网上试试！|unstyled|305382|JavaScript+(V8)，33字节|305383|s=>[_=>s.length]['google'==s%7C0]()|305384|305385|JavaScript+(V8)，28字节|305386|s=>[s]['google'==s%7C0].length|305387|entityMap|0|LINK|mutability|MUTABLE|url|https://v8.dev/|1|https://tio.run/##bcyxDsIgFIXh3acgLEDSNo4uOPoShAHxFlDCNUCqpvbZscbFoePJn/NdzWSKzeFe@@nQRtmKPBalWITkqmdaMYfoIjApy3uv9VDxFJ5w4aJZTAUjDBEdp3gjtBs5pULsNsM5JPeNNb/IvO4fS8VCrKnWEw6CzP9PVn3GB2EdiGWb9BAjrmb7AA|2|3|https://tio.run/##bcxBCsIwEIXhvacI2SQDtbh0k16kFIlhmlSHjCShIrVnjxU3Lrp8/LzvZmebXZoe5Tif62hqNl1/MV1uCaMvYeiVZ/aEypj8Pg0aquOYmbAl9lryXchm1FICHHbDdYr@G0t6iWXbP03CKpwtLgiNIJb/pyoh8VOoBmHdJwMS8WbWDw|4|5|https://tio.run/##bcyxDsIgFIXh3ae4YQGS2ji64Is0HZDcQvWGa4DUmLbPTmtcHDqe/Dnfw042uzS@ynm61sHUbG5d7jvpmT2hNCYvl74ljL6E6jhmJmyJvRL8BNEMSgitT4fhPkb/jSV9YN73jxR6BWeLC6BQw/z/lCUkfoNsUK/HZEAi3s26AQ^0|0|F|0|0|0|0|6|1|0|0|F|2|0|0|0|6|3|0|0|F|4|0|0|0|6|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|@$A|1G|B|1H|1|1I]]|C|$]]|$1|L|3|M|5|6|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|N|3|O|5|F|7|1N|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1O|8|@]|9|@$A|1P|B|1Q|1|1R]]|C|$]]|$1|Q|3|R|5|6|7|1S|8|@]|9|@$A|1T|B|1U|1|1V]]|C|$]]|$1|S|3|T|5|F|7|1W|8|@]|9|@]|C|$G|H]]|$1|U|3|J|5|K|7|1X|8|@]|9|@$A|1Y|B|1Z|1|20]]|C|$]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]|14|$5|X|Y|Z|C|$10|11]]|15|$5|X|Y|Z|C|$10|16]]|17|$5|X|Y|Z|C|$10|11]]|18|$5|X|Y|Z|C|$10|19]]]]

<h1><a href="https://v8.dev/" rel="nofollow noreferrer">JavaScript (V8)</a>, 41 bytes</h1>



<pre class="lang-javascript prettyprint-override"><code>s=&gt;s[['length']['google'==s|0]].toFixed()
</code></pre>

<p><a href="https://tio.run/##bcyxDsIgFIXh3acgLEDSNo4uOPoShAHxFlDCNUCqpvbZscbFoePJn/NdzWSKzeFe@@nQRtmKPBalWITkqmdaMYfoIjApy3uv9VDxFJ5w4aJZTAUjDBEdp3gjtBs5pULsNsM5JPeNNb/IvO4fS8VCrKnWEw6CzP9PVn3GB2EdiGWb9BAjrmb7AA" rel="nofollow noreferrer" title="JavaScript (V8) – Try It Online">Try it online!</a></p>

<h1><a href="https://v8.dev/" rel="nofollow noreferrer">JavaScript (V8)</a>, 33 bytes</h1>



<pre class="lang-javascript prettyprint-override"><code>s=&gt;[_=&gt;s.length]['google'==s|0]()
</code></pre>

<p><a href="https://tio.run/##bcxBCsIwEIXhvacI2SQDtbh0k16kFIlhmlSHjCShIrVnjxU3Lrp8/LzvZmebXZoe5Tif62hqNl1/MV1uCaMvYeiVZ/aEypj8Pg0aquOYmbAl9lryXchm1FICHHbDdYr@G0t6iWXbP03CKpwtLgiNIJb/pyoh8VOoBmHdJwMS8WbWDw" rel="nofollow noreferrer" title="JavaScript (V8) – Try It Online">Try it online!</a></p>

<h1><a href="https://v8.dev/" rel="nofollow noreferrer">JavaScript (V8)</a>, 28 bytes</h1>



<pre class="lang-javascript prettyprint-override"><code>s=&gt;[s]['google'==s|0].length
</code></pre>

<p><a href="https://tio.run/##bcyxDsIgFIXh3ae4YQGS2ji64Is0HZDcQvWGa4DUmLbPTmtcHDqe/Dnfw042uzS@ynm61sHUbG5d7jvpmT2hNCYvl74ljL6E6jhmJmyJvRL8BNEMSgitT4fhPkb/jSV9YN73jxR6BWeLC6BQw/z/lCUkfoNsUK/HZEAi3s26AQ" rel="nofollow noreferrer" title="JavaScript (V8) – Try It Online">Try it online!</a></p>


blocks|key|305551|text|05AB1E，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|305552|'Š¹QiFëg|code-block|syntax|javascript|305553|在网上试试！|unstyled|305554|'Š¹QiFëg++#+full+program
++++i+++++#+if...
++++++++++#+implicit+input...
+++Q++++++#+is+equal+to...
'Š¹+++++++#+"google"...
+++++F++++#+then...
++++++++++#+(implicit)+do+nothing...
++++++++++#+implicit+input...
+++++F++++#+times
++++++ë+++#+else...
+++++++g++#+push+length+of...
++++++++++#+implicit+input
++++++++++#+implicit+output|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##yy9OTMpM/f9f/eiCQzsDM90Or07//z89Pz89JxUA^0|0|6|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/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 8 bytes</h1>
<pre><code>'Š¹QiFëg
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f9f/eiCQzsDM90Or07//z89Pz89JxUA" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>
<pre><code>'Š¹QiFëg  # full program
    i     # if...
          # implicit input...
   Q      # is equal to...
'Š¹       # &quot;google&quot;...
     F    # then...
          # (implicit) do nothing...
          # implicit input...
     F    # times
      ë   # else...
       g  # push length of...
          # implicit input
          # implicit output
</code></pre>


blocks|key|5736796|text|Whispers+v1，53字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5736797|>+Input
>+"google"
>>+#1
>>+1≠2
>>+3÷4
>>+Output+5|code-block|syntax|javascript|5736798|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##K8/ILC5ILSr@/99OwTOvoLSEy05BKT0/Pz0nVYnLzk5B2RBEGj7qXGAEYhgf3m4Cov1LS4BqFUz//4eoBQA^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Whispers v1, 53 bytes</h1>
<pre><code>&gt; Input
&gt; &quot;google&quot;
&gt;&gt; #1
&gt;&gt; 1≠2
&gt;&gt; 3÷4
&gt;&gt; Output 5
</code></pre>
<p><a href="https://tio.run/##K8/ILC5ILSr@/99OwTOvoLSEy05BKT0/Pz0nVYnLzk5B2RBEGj7qXGAEYhgf3m4Cov1LS4BqFUz//4eoBQA" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|305957|text|红色，46字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|305958|func[a][(length?+a)/+either+a+="google"[0][1]]|code-block|syntax|javascript|305959|在网上试试！|unstyled|305960|我第一次尝试用红色写一些严肃的东西|305961|布尔值中的叹息不能用作int。|entityMap|0|LINK|mutability|MUTABLE|url|http://www.red-lang.org/|1|https://tio.run/##K0pN@R@UmhIdy5Vk9T@tNC85OjE2WiMnNS@9JMNeIVFTXyE1syQjtUghUcFWKT0/Pz0nVSnaIDbaMDb2f0FRZl6JQpKCUroSF4Kdn4/K00vPQRUAGfEfAA^0|0|2|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|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|18|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="http://www.red-lang.org" rel="nofollow noreferrer">Red</a>, 46 bytes</h1>
<pre><code>func[a][(length? a)/ either a =&quot;google&quot;[0][1]]
</code></pre>
<p><a href="https://tio.run/##K0pN@R@UmhIdy5Vk9T@tNC85OjE2WiMnNS@9JMNeIVFTXyE1syQjtUghUcFWKT0/Pz0nVSnaIDbaMDb2f0FRZl6JQpKCUroSF4Kdn4/K00vPQRUAGfEfAA" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a></p>
<p>My first attempt on writing something somewhat serious with Red</p>
<p><em>sighs in boolean cannot be used as int</em></p>


blocks|key|306283|text|Python+3，30字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|306284|lambda+x:len(x)//(x!="google")|code-block|syntax|javascript|306285|在网上试试！+Python3+xnor的Python+2答案端口。地板分割操作符是必要的，以转换回一个整数，而不是离开它作为一个浮点。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/6fbhvzPycxNyklUaHCKic1T6NCU19fo0LRVik9Pz89J1VJ8/9/AA|2|https://codegolf.stackexchange.com/a/58895/104415^0|0|8|0|0|0|0|6|1|F|F|2^^$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]|$A|15|B|16|1|17]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]|U|$5|N|O|P|C|$Q|V]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3</a>, 30 bytes</h1>
<pre class="lang-python prettyprint-override"><code>lambda x:len(x)//(x!=&quot;google&quot;)
</code></pre>
<p><a href="https://tio.run/##K6gsycjPM/6fbhvzPycxNyklUaHCKic1T6NCU19fo0LRVik9Pz89J1VJ8/9/AA" rel="nofollow noreferrer">Try it online!</a> Python 3 port of <a href="https://codegolf.stackexchange.com/a/58895/104415">xnor's Python 2 answer</a>. The floor division operator is necessary to convert back to an integer instead of leaving it as a float.</p>


blocks|key|303450|text|Groovy，32个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|303451|e={(it=='google'?0:it).length()}|code-block|syntax|javascript|303452|一种类似于这里其他人的方法。闭包试图返回任一个|unstyled|303453|传递的字符串，如果它不等于google|unordered-list-item|offset|length|style|CODE|303454|整数0的长度，如果传递的字符串等于google，这将导致MissingMethodException，因为没有Integer.length()方法|303455|测试用|303456|e('bing')
e('google')
e('duckduckgo')|entityMap^0|0|0|0|D|6|0|2|1|H|6|1J|G|0|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Y|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Z|8|@]|9|@]|A|$]]|$1|J|3|K|5|L|7|10|8|@$M|11|N|12|O|P]]|9|@]|A|$]]|$1|Q|3|R|5|L|7|13|8|@$M|14|N|15|O|P]|$M|16|N|17|O|P]|$M|18|N|19|O|P]]|9|@]|A|$]]|$1|S|3|T|5|I|7|1A|8|@]|9|@]|A|$]]|$1|U|3|V|5|D|7|1B|8|@]|9|@]|A|$E|F]]]|W|$]]

<h1>Groovy, 32 chars</h1>

<pre><code>e={(it=='google'?0:it).length()}
</code></pre>

<p>A similar approach like a bunch of others here. The closure tries to return the length of either</p>

<ul>
<li>the passed string, if it's not equal to <code>google</code></li>
<li>the length of the integer <code>0</code>, if the passed string is equal to <code>google</code>, which results in a MissingMethodException as there's no <code>Integer.length()</code> method</li>
</ul>

<p>Tested with</p>

<pre><code>e('bing')
e('google')
e('duckduckgo')
</code></pre>


blocks|key|303544|text|Ruby，41个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|303545|def+g(s)puts+s!="google"?s.length:+a+end|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Ruby, 41 characters</h1>

<pre><code>def g(s)puts s!="google"?s.length: a end
</code></pre>


blocks|key|303591|text|锈蚀，170个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|303592|我没有看到任何生锈的东西，所以我想我应该做一个。希望有人能改进这一点！(或者可能是一个字节.看看我在那里做了什么;)|unstyled|303593|use+std::io;fn+main(){let+s=io::stdin();let+mut+b=String::new();s.read_line(&mut+b).unwrap();let+l=b.len();b.truncate(l-2);assert!(b!="google");println!("{}",+b.len());}|code-block|syntax|javascript|303594|抛出错误：|303595|thread+'<main>'+panicked+at+'assertion+failed:+buffer+!=+"google"',+main.rs:7|303596|当你尝试“谷歌”的时候|303597|未高尔夫球守则：|303598|use+std::io;
fn+main()+{
++++let+stdin+=+io::stdin();
++++let+mut+buffer+=+String::new();
++++stdin.read_line(&mut+buffer).unwrap();
++++let+leng+=+buffer.len();
++++buffer.truncate(leng-2);
++++assert!(buffer!="google");
++++println!("{}",+buffer.len());
}|entityMap^0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|W|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|X|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|Y|8|@]|9|@]|A|$H|I]]|$1|N|3|O|5|D|7|Z|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|10|8|@]|9|@]|A|$]]|$1|R|3|S|5|G|7|11|8|@]|9|@]|A|$H|I]]]|T|$]]

<h1>Rust, 170 bytes</h1>
<p>I didn't see anything in rust, so I figured I'd make one. Hopefully someone can improve this a bit! (or perhaps a byte... see what I did there ;) )</p>
<pre><code>use std::io;fn main(){let s=io::stdin();let mut b=String::new();s.read_line(&amp;mut b).unwrap();let l=b.len();b.truncate(l-2);assert!(b!=&quot;google&quot;);println!(&quot;{}&quot;, b.len());}
</code></pre>
<p>Throws the error:</p>
<pre><code>thread '&lt;main&gt;' panicked at 'assertion failed: buffer != &quot;google&quot;', main.rs:7
</code></pre>
<p>when you try &quot;google.&quot;</p>
<p>Ungolfed Code:</p>
<pre><code>use std::io;
fn main() {
    let stdin = io::stdin();
    let mut buffer = String::new();
    stdin.read_line(&amp;mut buffer).unwrap();
    let leng = buffer.len();
    buffer.truncate(leng-2);
    assert!(buffer!=&quot;google&quot;);
    println!(&quot;{}&quot;, buffer.len());
}
</code></pre>


blocks|key|303628|text|Clojure+(43字节)|type|header-two|depth|inlineStyleRanges|entityRanges|data|303629|我知道Clojure以前也有答案，也有更短的答案，但我喜欢这一次在传入"google“时生成StackOverflow错误的方式：|unstyled|303630|(defn+f[s](if(=+s+"google")(f+s)(count+s)))|code-block|syntax|javascript|303631|示例：|303632|user=>+(f+"google")+StackOverflowError用户/f+(NO_SOURCE_FILE:213)|blockquote|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Q|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|R|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|S|8|@]|9|@]|A|$]]|$1|L|3|M|5|N|7|T|8|@]|9|@]|A|$]]]|O|$]]

<h1>Clojure (43 bytes)</h1>

<p>I know Clojure has been answered before, and shorter too, but I love the way this one generates a StackOverflow error when "google" is passed in:</p>

<pre><code>(defn f[s](if(= s "google")(f s)(count s)))
</code></pre>

<p>Example:</p>

<blockquote>
  <p>user=> (f "google")</p>
  
  <p>StackOverflowError   user/f (NO_SOURCE_FILE:213)</p>
</blockquote>


blocks|key|5734651|text|游戏制造者语言，60字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5734652|a=argument0;if+a="google"a=1/0show_message(string_length(a))|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Game Maker Language, 60 bytes</h1>
<pre><code>a=argument0;if a=&quot;google&quot;a=1/0show_message(string_length(a))
</code></pre>


blocks|key|5735531|text|划痕，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5735532|📷|atomic|offset|length|5735533|unstyled|5735534|(评分所用)|5735535|5735536|停止项目是我能得到的最接近错误的东西。|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://i.cubeupload.com/utmUzk.png|imageAlt|1|LINK|MUTABLE|url|http://meta.codegolf.stackexchange.com/questions/673/golfing-in-scratch^0|0|0|1|0|0|0|1|4|1|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@$E|12|F|13|1|14]]|A|$]]|$1|G|3|-4|5|H|7|15|8|@]|9|@]|A|$]]|$1|I|3|J|5|H|7|16|8|@]|9|@$E|17|F|18|1|19]]|A|$]]|$1|K|3|-4|5|H|7|1A|8|@]|9|@]|A|$]]|$1|L|3|M|5|H|7|1B|8|@]|9|@]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T|U|-4]]|V|$5|W|Q|X|A|$Y|Z]]]]

<h1>Scratch, 16 bytes</h1>

<p><a href="https://i.cubeupload.com/utmUzk.png" rel="nofollow noreferrer"><img src="https://i.cubeupload.com/utmUzk.png" alt="Script"></a><br>
(<a href="http://meta.codegolf.stackexchange.com/questions/673/golfing-in-scratch">scoring used</a>)<br>
Stopping the project is the closest thing to an error that I can get.</p>


blocks|key|5735554|text|C%2B%2B，77+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|5735555|#include+<string>
int+G(std::string+S){1/int(S!="google");return+S.length();}|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>C++, 77 Bytes</h1>

<pre><code>#include &lt;string&gt;
int G(std::string S){1/int(S!="google");return S.length();}
</code></pre>


blocks|key|304499|text|Python2，46个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|304500|a=raw_input()
print+len(a)if+a!='google'else+b|code-block|syntax|javascript|304501|"google“输入出现错误，因为b是一个未定义的标识符，但在其他字符串上成功，因为在这些情况下，控件从未到达b。|unstyled|offset|length|style|CODE|entityMap^0|0|0|H|1|1J|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]|$J|T|K|U|L|M]]|9|@]|A|$]]]|N|$]]

<h1>Python 2, 46 bytes</h1>

<pre><code>a=raw_input()
print len(a)if a!='google'else b
</code></pre>

<p>Errors out on input of "google" because <code>b</code> is an undefined identifier, but succeeds on other strings since control never reaches <code>b</code> in those cases.</p>


blocks|key|5735731|text|shortC，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5735732|Df(s)Ss)/Ms,"google")|code-block|syntax|javascript|5735733|Df(s)定义了一个函数f，它接受一个参数s。|unordered-list-item|style|CODE|5735734|Ss)计算s的长度。|5735735|Ms,"google)将s比作"google“。|5735736|如果字符串相等，Ss)/Ms,"google")将s的长度除以0。如果它们相等，就会抛出floating+point+exception。|5735737|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com//github.com/aaronryank/shortC|1|https://tio.run/##K87ILypJ/v/fJU2jWDO4WFPft1hHKT0/Pz0nVUnz/38A^0|0|6|0|0|0|0|5|C|1|L|1|0|0|3|5|1|0|0|B|C|1|0|8|G|P|1|V|1|18|O|0|0|6|1^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|D|3|E|5|F|7|19|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1A|8|@$A|1B|B|1C|L|M]|$A|1D|B|1E|L|M]|$A|1F|B|1G|L|M]]|9|@]|C|$]]|$1|N|3|O|5|K|7|1H|8|@$A|1I|B|1J|L|M]|$A|1K|B|1L|L|M]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1M|8|@$A|1N|B|1O|L|M]|$A|1P|B|1Q|L|M]]|9|@]|C|$]]|$1|R|3|S|5|K|7|1R|8|@$A|1S|B|1T|L|M]|$A|1U|B|1V|L|M]|$A|1W|B|1X|L|M]|$A|1Y|B|1Z|L|M]]|9|@]|C|$]]|$1|T|3|U|5|V|7|20|8|@]|9|@$A|21|B|22|1|23]]|C|$]]]|W|$X|$5|Y|Z|10|C|$11|12]]|13|$5|Y|Z|10|C|$11|14]]]]

<h1><a href="//github.com/aaronryank/shortC" rel="nofollow noreferrer">shortC</a>, 21 bytes</h1>

<pre><code>Df(s)Ss)/Ms,"google")
</code></pre>

<ul>
<li><code>Df(s)</code> defines a function <code>f</code> that takes one argument <code>s</code>.</li>
<li><code>Ss)</code> calculates the length of <code>s</code>.</li>
<li><code>Ms,"google)</code> compares <code>s</code> to "google".</li>
<li><code>Ss)/Ms,"google")</code> divides the length of <code>s</code> by <code>0</code> if the strings are equal. This throws <code>floating point exception</code> if they're equal.</li>
</ul>

<p><a href="https://tio.run/##K87ILypJ/v/fJU2jWDO4WFPft1hHKT0/Pz0nVUnz/38A" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|5735759|text|西姆斯，18字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|5735760|{[#~{google}=!1/]}|code-block|syntax|javascript|5735761|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/CatsAreFluffy/syms|1|https://tio.run/##K67MLf5fXWvzvzpaua46PT8/PSe11lbRUD@29r@m3X@wAAA^0|0|3|0|0|0|0|6|1^^$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|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://github.com/CatsAreFluffy/syms" rel="nofollow noreferrer">Syms</a>, 18 bytes</h1>

<pre><code>{[#~{google}=!1/]}
</code></pre>

<p><a href="https://tio.run/##K67MLf5fXWvzvzpaua46PT8/PSe11lbRUD@29r@m3X@wAAA" rel="nofollow noreferrer" title="Syms – Try It Online">Try it online!</a></p>


blocks|key|305150|text|GameMaker语言，46字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|305151|x=argument0
return+string_length(x)/x!=google|code-block|syntax|javascript|305152|使用与这个Python的答案相同的逻辑，滥用GMLs类型强制，如果字符串等于google，则函数除以零。|unstyled|offset|length|305153|我也没有也不能测试这一点，因为我目前还没有安装GameMaker，这是从内存中生成的。|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/58896/82488^0|0|0|3|B|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@$J|X|K|Y|1|Z]]|A|$]]|$1|L|3|M|5|I|7|10|8|@]|9|@]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

<h1>GameMaker Language, 46 bytes</h1>
<pre><code>x=argument0
return string_length(x)/x!=google
</code></pre>
<p>Uses the same logic as <a href="https://codegolf.stackexchange.com/a/58896/82488">this Python answer</a>, abusing GMLs type coercion making the function divide by zero if the string equals google</p>
<p>I also haven't and can't test this because I currently don't have GameMaker installed, just made this from memory</p>


blocks|key|305197|text|木桶，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|305198|:`google`=[0/%7C÷!|code-block|syntax|javascript|305199|在网上试试！|unstyled|305200|google不在Keg的字典里，这一事实毁了他的企图。这就是我使用DuckDuckGo的原因，它至少在字典中包含了它的部分名称！|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JonoCode9374/Keg|1|https://tio.run/##y05N///fKiE9Pz89JzXBNtpAv@bwdsX//5My89L/62YUAQA^0|0|2|0|0|0|0|6|1|0|0|6^^$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|K|7|17|8|@$A|18|B|19|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/JonoCode9374/Keg" rel="nofollow noreferrer">Keg</a>, 16 bytes</h1>

<pre><code>:`google`=[0/|÷!
</code></pre>

<p><a href="https://tio.run/##y05N///fKiE9Pz89JzXBNtpAv@bwdsX//5My89L/62YUAQA" rel="nofollow noreferrer" title="Keg – Try It Online">Try it online!</a></p>

<p>Attempt ruined by the fact that <code>google</code> isn't in Keg's dictionary. That's why I use DuckDuckGo, which at least has parts of it's name in the dictionary!</p>


blocks|key|305497|text|Lua，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|305498|load'return+#(...=="google"or+...)'|code-block|syntax|javascript|305499|在网上试试！|unstyled|305500|Idea类似于@QuertyKeyboard的答案中的一个，但更好地优化了它：load用于创建函数，而对"googleness“的反向检查允许我们用or替换and来保存一个字节。|style|CODE|305501|同样，如果允许完整的程序，我们可以减少到29个字节！|305502|Lua，29字节|305503|print(#(...=="google"or+...))|305504|entityMap|0|LINK|mutability|MUTABLE|url|https://www.lua.org/|1|https://tio.run/##NY7NCsIwEITP9imWetgESkDBY97CuwTz08CSLZsUD@Kzx0jx9s0MMwztrhM/HUEEO8h5lNB2KXBWxhhr58ScKMwsMLTGHgc9ltoEcoG8uSz1jWvGBXANRAwvFvI/eTTxA56n0ya5NIX3UFsuacRjQf/tbRwgFQ9TT6H43i/X2xc|2|https://codegolf.stackexchange.com/a/70582/59169|3|4|https://tio.run/##yylN/P@/oCgzr0RDWUNPT8/WVik9Pz89J1Upv0gByNfU/P//P0QEAA^0|0|3|0|0|0|0|6|1|0|13|4|22|2|26|3|7|I|2|0|0|0|3|3|0|0|0|6|4^^$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|@$A|1G|B|1H|1|1I]]|C|$]]|$1|L|3|M|5|K|7|1J|8|@$A|1K|B|1L|N|O]|$A|1M|B|1N|N|O]|$A|1O|B|1P|N|O]]|9|@$A|1Q|B|1R|1|1S]]|C|$]]|$1|P|3|Q|5|K|7|1T|8|@]|9|@]|C|$]]|$1|R|3|S|5|6|7|1U|8|@]|9|@$A|1V|B|1W|1|1X]]|C|$]]|$1|T|3|U|5|F|7|1Y|8|@]|9|@]|C|$G|H]]|$1|V|3|J|5|K|7|1Z|8|@]|9|@$A|20|B|21|1|22]]|C|$]]]|W|$X|$5|Y|Z|10|C|$11|12]]|13|$5|Y|Z|10|C|$11|14]]|15|$5|Y|Z|10|C|$11|16]]|17|$5|Y|Z|10|C|$11|12]]|18|$5|Y|Z|10|C|$11|19]]]]

<h1><a href="https://www.lua.org/" rel="nofollow noreferrer">Lua</a>, 35 bytes</h1>

<pre class="lang-lua prettyprint-override"><code>load'return #(...==&quot;google&quot;or ...)'
</code></pre>
<p><a href="https://tio.run/##NY7NCsIwEITP9imWetgESkDBY97CuwTz08CSLZsUD@Kzx0jx9s0MMwztrhM/HUEEO8h5lNB2KXBWxhhr58ScKMwsMLTGHgc9ltoEcoG8uSz1jWvGBXANRAwvFvI/eTTxA56n0ya5NIX3UFsuacRjQf/tbRwgFQ9TT6H43i/X2xc" rel="nofollow noreferrer" title="Lua – Try It Online">Try it online!</a></p>
<p>Idea is like one in <a href="https://codegolf.stackexchange.com/a/70582/59169">@QuertyKeyboard's answer</a>, but better optimized: <code>load</code> is used to create function and inverting check for &quot;googleness&quot; allows us to save one byte by replacing <code>and</code> with <code>or</code>.</p>
<p>Again, if full programs are allowed, we can cut down to <strong>29</strong> bytes!</p>
<h1><a href="https://www.lua.org/" rel="nofollow noreferrer">Lua</a>, 29 bytes</h1>

<pre class="lang-lua prettyprint-override"><code>print(#(...==&quot;google&quot;or ...))
</code></pre>
<p><a href="https://tio.run/##yylN/P@/oCgzr0RDWUNPT8/WVik9Pz89J1Upv0gByNfU/P//P0QEAA" rel="nofollow noreferrer" title="Lua – Try It Online">Try it online!</a></p>


blocks|key|305610|text|VBScript，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|305611|sub+f(x)
msgbox+len(x)/abs(x<>"google")
end+sub|code-block|syntax|javascript|305612|VBScript将为True返回-1，因此我们必须对其进行abs()。并试图把它除以长度，就像蟒蛇的答案。|unstyled|offset|length|style|CODE|entityMap^0|0|0|A|4|G|2|T|5^^$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]|$J|T|K|U|L|M]|$J|V|K|W|L|M]]|9|@]|A|$]]]|N|$]]

<h1>VBScript, 47 bytes</h1>
<pre><code>sub f(x)
msgbox len(x)/abs(x&lt;&gt;&quot;google&quot;)
end sub
</code></pre>
<p>VBScript will return <code>-1</code> for <code>True</code>, so we have to <code>abs()</code> it. And attempts to divide it by the length, like the python answer.</p>


blocks|key|305835|text|骑士，17字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|305836|O/L=gP!?g"google"|code-block|syntax|javascript|305837|在网上试试！|unstyled|305838|需要一个修补程序来修复“黄金”C解释器“中的一个勘误表，它将在来自PROMPT的输入中留下一个换行符。这与AST解释器的行为和规范的措辞相匹配。|style|CODE|305839|这是简单的零除法。|305840|#+print+length(g+=+prompt())+/+(g+!=+"google")
OUTPUT+/+(LENGTH(=+g+PROMPT))+(!+(?+g+"google"))|305841|依靠零除法抛出异常。AST解释器总是在软件中抛出异常，但是对于金色解释器，它需要在硬件级别上抛出异常的x86行为。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/knight-lang/knight-lang|1|https://tio.run/##rVn/U9vKEf/Z/isOZ8CSLQdZ0Jk3NrInXyDDlAAPkr7OAA1CPtuaJ0uqJENoQv/00t29LzrZJm3ax0ws6@6ze7uf29vdc8LeLAyfX0VJGC8n/KAoJ1H6ej5qmiNxdFcbCsvHjK@A8iiZ1YbKaCEwEz6NEs7imMVpMqOPph79dPr5I@tXr5efLphXvf7lzQXbr16PTt@xX6rXi8@sX4GPTi4N7OnnEwP6@fTjm8s/W4XNLPzYYf/s/8nWs28uYVkxGc6DnHXsSsBEga1axWjE9qu508PfcDKBSfLoO8PvBwcrGFyGMOgmYOLYRmAN8/bs7IRA@DEmJwfom2HIxQcBAHnD1vsgXnLbvkpu7GaT/IBdubphPrtoHZ4dWc9nuyf@7HxrPGvN0nQW89azDeOtoQB3AM2DBcDhy7DZBN1ZkBfcstm3ZiNKShYNmw0YpXUc1pkukxBGSDiE93KROUWWXHk3/jfXcZ9ARyMCdYSHp4sDu7uoPsrYwzwqeZEFIW824HvMLRgHcUuY4bDWdXmdXE@vc/bt6erGsgevWjaZ0oimzNLW@qz9qm0zoUKNbsHodQLD3a4YATsbPC64OfAkzAnnPPydTdOcJcvFHc8LaQ@zomISzaJSaYXV0Z2@oz0Szw7ru6zLOtLybtdmPdZ227AEWhrZLOflMk@YigwhRsExXLXhPsij4C7mygowIk4feG6FsJ4yhH3/zpRxIb2FRMSXti3piTa4Hvl9B/bI18Mr1uFZkzEJkGSyzCzcUiY57TF4WzdYnPxCaBNmXLfblU2tttg0EAYPtFEMlECmgO9gWRYUJSvnHJQFeQlguQEdxShuaGijJ8pY4wC9aCx89m3a6EZFBpmPoVtGaQJmY8S6eEhCxUixzDIk3FZRpUZM@s34A9oNslGHCuUsgTiGrIWRKy0XrHxq66MtBo5wADPYADMXmqmCjJKecNVCu9HUII7T0Np3nb6NDuKwdoIcTJZxHOSPpqPV/lwY23Pe1pbRglJ@maxI0xJ9XEImhU2eHr59d/vr1sn7M8NfU@tdtFGtt652q6b3w/HlCxpLnpPKIJmwvy8D9Ypq780l9taXEP5/aGsqjjdQQcL7deE65okyZb5McIOGMvF2yrSwVKqk@IfILqOQ0ezdcnrl7d9IO8Q@71B20AYUGZyqcmoBFPzfjuNJS6UdKjwOKllVAGdCKxAlTaxfwx2w/l7dT3QeQ3HMWmW@5C0IQT2OEQnj0wASCE60MLBaFQnoJ/ouaw/R8eVtmsYwc1dn4EVfK7d@5FDn5z0yzbxbMzNGG5M/1EYI2jKNY8s01WGuAwXifzA5WTMZi/DHN@enDpZiEWjwenzVd10XwglcgVf1VkT/4F9Kho@hEaOGt8gAvDn44dHnnt9XFR0THBZ1fNCnJx57ADg6PjnssCnkxmFDh7ZcD7NwGGROzBNqAAyuVGskOINz9xIZq4JYmrCyYb2xImoloBQfEBdDqCkRTuq8ES6ylR0gkqKbKoUgTdENLlM8RGU4tzrAzFonhRyFWJ8gYw6UqOz0csg4lr3jfp3iH@6uQJ63B01W/YE5ZO6MlzG0btYOsbqDXGGtmkSJPWRNrEjRV5bl6SIrWcyDeyipLOEPKAMd9RQaP3Z@cfbx/NOXo@O/mgtEU4t2Bat6OM8xHzvU@thit3zoul7xZBJNm5UD1O2WORZNeNhU1IX5h@Co7gPxcGOviUVGuY9BJFNh5fTbih6B1zPvqhmUxH9SY4W5BQxuLoSTn6UZTyxjYaeVt6jwg1X@QtQ9CC/fc/d/oXHZKliiv5iC6RN0ChoyiEAHuzWAQydAb7gGLK2ixYJB1vWpscEDCEhbbhnoobVov1BDx2ee2YFUNFae/Aqe8K/QlOHhXfNzqxZE1OZvYWJaA56sRRusEtd5MeDvIeSkPxS4vsmyTmSyoLROqcm1sKTYqqaMRvt21SauZTclekmtnrVdoKB5wjYJA53QyJjrQmK0WxVUTWC14EEi1b5UkWQJMndApgrJwlnFAp4ucY1B0sR@1qhjOzt0N@r1EHojmtZrap4byqzt150C7LHgzWbqvOaG@cuyULuvY0J0bsKgrjaI0h6kP8ywGFrG9ojeuFHfbXHRRDR08UzFkif2HLtZOgxiAwiFw3jafeWlZ28O1TAo1UP2kP1uRZOtvqMuG3pLh56lzBHSr95adBrRjo133V4h1Kl2ZwMLq9V2Aw@dNR7Evm5iYbHBtQ5hfFMJCUBJsShT@u1ruLIhaNjrkT5JFFXA1Y0WjJa107/7Q2J2NxOz/UOh7c1CfyM2aw6JiwCNeaaXQ0m7YN1nvb5mmbBAfR/OWa8PZ6xvgr2fRB9AeqxhfR@htO5AjbiKciLaG7mSa8@m7qPjE//N1QNBk@QKVEpKsFhi4DveAOY85@2CJSm0xFFcRgl7CB6BNzZJ4YZZ8hnPQSZLE56UUYCXAjjJKXvgbB7ccwBKRQgv2SJIlhA@j69xFL27Q8aBCmKiWMYl/gRAi@uEpyA9E6OWXKHMlNOQFfWo72Wk@7IhGnZQQ7l02w5irI2P4HUyifmE3VZm32ot3/Cb6LOMRSpnRqis11PvNsEbEtoxTH/SefCAgnWl8GHSq@VFv54Vx8w8/AfmMUDRgfwJbYcJwJjV@j4adJiRDVGHKyRVyfVEHUDslg/VxuiCRnAoMbTSSTpgC74IMwyzhI1ux/@vK6M/wJWRcmVrgy@@9EW6Mn6ZfbHqBpNxesxqAE8jPFVAtzbZWb1o91TmMRVo83aq9Ie@bKoNY1NSphIt//2/kZc5yFCj5YftgYmutbmrWL/KuvXpn76XqN62upggrlG7nOhUSBjUeOPXpI00iRKI6Ha1mDD5N3BP/IZlNpo175jZu0ix43rXjlBDfuwN9gxaPogrg290WF2zALG1LiSRFw9Hn4W9WkN7KYheUTpcLXneppK3Z@s@wNPS@zT4HxoiNAyfuBWhbv51O2T2Rh54iKt2@9gkUYMg4l9M0oMQXXkSYHW4wgWQJMEz1WFGCUxGE/pNKAhLKFPt7bCNPSeO2OyFSykq0zUQukH5u8AiiBJsVlmQz0KHlHY68P3exl@f6LqK/yNjuWRN/Rr39Cz@Q@Bf4TQOZsVz73112fw3^0|0|2|0|0|0|0|6|1|0|X|6|0|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|L|3|M|5|K|7|1D|8|@$A|1E|B|1F|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1G|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1H|8|@]|9|@]|C|$G|H]]|$1|T|3|U|5|K|7|1I|8|@]|9|@]|C|$]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]]]

<h1><a href="https://github.com/knight-lang/knight-lang" rel="nofollow noreferrer">Knight</a>, 17 bytes</h1>

<pre class="lang-php prettyprint-override"><code>O/L=gP!?g&quot;google&quot;
</code></pre>
<p><a href="https://tio.run/##rVn/U9vKEf/Z/isOZ8CSLQdZ0Jk3NrInXyDDlAAPkr7OAA1CPtuaJ0uqJENoQv/00t29LzrZJm3ax0ws6@6ze7uf29vdc8LeLAyfX0VJGC8n/KAoJ1H6ej5qmiNxdFcbCsvHjK@A8iiZ1YbKaCEwEz6NEs7imMVpMqOPph79dPr5I@tXr5efLphXvf7lzQXbr16PTt@xX6rXi8@sX4GPTi4N7OnnEwP6@fTjm8s/W4XNLPzYYf/s/8nWs28uYVkxGc6DnHXsSsBEga1axWjE9qu508PfcDKBSfLoO8PvBwcrGFyGMOgmYOLYRmAN8/bs7IRA@DEmJwfom2HIxQcBAHnD1vsgXnLbvkpu7GaT/IBdubphPrtoHZ4dWc9nuyf@7HxrPGvN0nQW89azDeOtoQB3AM2DBcDhy7DZBN1ZkBfcstm3ZiNKShYNmw0YpXUc1pkukxBGSDiE93KROUWWXHk3/jfXcZ9ARyMCdYSHp4sDu7uoPsrYwzwqeZEFIW824HvMLRgHcUuY4bDWdXmdXE@vc/bt6erGsgevWjaZ0oimzNLW@qz9qm0zoUKNbsHodQLD3a4YATsbPC64OfAkzAnnPPydTdOcJcvFHc8LaQ@zomISzaJSaYXV0Z2@oz0Szw7ru6zLOtLybtdmPdZ227AEWhrZLOflMk@YigwhRsExXLXhPsij4C7mygowIk4feG6FsJ4yhH3/zpRxIb2FRMSXti3piTa4Hvl9B/bI18Mr1uFZkzEJkGSyzCzcUiY57TF4WzdYnPxCaBNmXLfblU2tttg0EAYPtFEMlECmgO9gWRYUJSvnHJQFeQlguQEdxShuaGijJ8pY4wC9aCx89m3a6EZFBpmPoVtGaQJmY8S6eEhCxUixzDIk3FZRpUZM@s34A9oNslGHCuUsgTiGrIWRKy0XrHxq66MtBo5wADPYADMXmqmCjJKecNVCu9HUII7T0Np3nb6NDuKwdoIcTJZxHOSPpqPV/lwY23Pe1pbRglJ@maxI0xJ9XEImhU2eHr59d/vr1sn7M8NfU@tdtFGtt652q6b3w/HlCxpLnpPKIJmwvy8D9Ypq780l9taXEP5/aGsqjjdQQcL7deE65okyZb5McIOGMvF2yrSwVKqk@IfILqOQ0ezdcnrl7d9IO8Q@71B20AYUGZyqcmoBFPzfjuNJS6UdKjwOKllVAGdCKxAlTaxfwx2w/l7dT3QeQ3HMWmW@5C0IQT2OEQnj0wASCE60MLBaFQnoJ/ouaw/R8eVtmsYwc1dn4EVfK7d@5FDn5z0yzbxbMzNGG5M/1EYI2jKNY8s01WGuAwXifzA5WTMZi/DHN@enDpZiEWjwenzVd10XwglcgVf1VkT/4F9Kho@hEaOGt8gAvDn44dHnnt9XFR0THBZ1fNCnJx57ADg6PjnssCnkxmFDh7ZcD7NwGGROzBNqAAyuVGskOINz9xIZq4JYmrCyYb2xImoloBQfEBdDqCkRTuq8ES6ylR0gkqKbKoUgTdENLlM8RGU4tzrAzFonhRyFWJ8gYw6UqOz0csg4lr3jfp3iH@6uQJ63B01W/YE5ZO6MlzG0btYOsbqDXGGtmkSJPWRNrEjRV5bl6SIrWcyDeyipLOEPKAMd9RQaP3Z@cfbx/NOXo@O/mgtEU4t2Bat6OM8xHzvU@thit3zoul7xZBJNm5UD1O2WORZNeNhU1IX5h@Co7gPxcGOviUVGuY9BJFNh5fTbih6B1zPvqhmUxH9SY4W5BQxuLoSTn6UZTyxjYaeVt6jwg1X@QtQ9CC/fc/d/oXHZKliiv5iC6RN0ChoyiEAHuzWAQydAb7gGLK2ixYJB1vWpscEDCEhbbhnoobVov1BDx2ee2YFUNFae/Aqe8K/QlOHhXfNzqxZE1OZvYWJaA56sRRusEtd5MeDvIeSkPxS4vsmyTmSyoLROqcm1sKTYqqaMRvt21SauZTclekmtnrVdoKB5wjYJA53QyJjrQmK0WxVUTWC14EEi1b5UkWQJMndApgrJwlnFAp4ucY1B0sR@1qhjOzt0N@r1EHojmtZrap4byqzt150C7LHgzWbqvOaG@cuyULuvY0J0bsKgrjaI0h6kP8ywGFrG9ojeuFHfbXHRRDR08UzFkif2HLtZOgxiAwiFw3jafeWlZ28O1TAo1UP2kP1uRZOtvqMuG3pLh56lzBHSr95adBrRjo133V4h1Kl2ZwMLq9V2Aw@dNR7Evm5iYbHBtQ5hfFMJCUBJsShT@u1ruLIhaNjrkT5JFFXA1Y0WjJa107/7Q2J2NxOz/UOh7c1CfyM2aw6JiwCNeaaXQ0m7YN1nvb5mmbBAfR/OWa8PZ6xvgr2fRB9AeqxhfR@htO5AjbiKciLaG7mSa8@m7qPjE//N1QNBk@QKVEpKsFhi4DveAOY85@2CJSm0xFFcRgl7CB6BNzZJ4YZZ8hnPQSZLE56UUYCXAjjJKXvgbB7ccwBKRQgv2SJIlhA@j69xFL27Q8aBCmKiWMYl/gRAi@uEpyA9E6OWXKHMlNOQFfWo72Wk@7IhGnZQQ7l02w5irI2P4HUyifmE3VZm32ot3/Cb6LOMRSpnRqis11PvNsEbEtoxTH/SefCAgnWl8GHSq@VFv54Vx8w8/AfmMUDRgfwJbYcJwJjV@j4adJiRDVGHKyRVyfVEHUDslg/VxuiCRnAoMbTSSTpgC74IMwyzhI1ux/@vK6M/wJWRcmVrgy@@9EW6Mn6ZfbHqBpNxesxqAE8jPFVAtzbZWb1o91TmMRVo83aq9Ie@bKoNY1NSphIt//2/kZc5yFCj5YftgYmutbmrWL/KuvXpn76XqN62upggrlG7nOhUSBjUeOPXpI00iRKI6Ha1mDD5N3BP/IZlNpo175jZu0ix43rXjlBDfuwN9gxaPogrg290WF2zALG1LiSRFw9Hn4W9WkN7KYheUTpcLXneppK3Z@s@wNPS@zT4HxoiNAyfuBWhbv51O2T2Rh54iKt2@9gkUYMg4l9M0oMQXXkSYHW4wgWQJMEz1WFGCUxGE/pNKAhLKFPt7bCNPSeO2OyFSykq0zUQukH5u8AiiBJsVlmQz0KHlHY68P3exl@f6LqK/yNjuWRN/Rr39Cz@Q@Bf4TQOZsVz73112fw3" rel="nofollow noreferrer" title="C (gcc) – Try It Online">Try it online!</a></p>
<p>Requires a patch to fix an errata in the &quot;&quot;&quot;golfed&quot;&quot;&quot; C interpreter, where it will leave a newline in the input from <code>PROMPT</code>. This matches the behavior of the AST interpreter and the wording of the spec.</p>
<p>This is the simple division by zero method.</p>
<pre class="lang-php prettyprint-override"><code># print length(g = prompt()) / (g != &quot;google&quot;)
OUTPUT / (LENGTH(= g PROMPT)) (! (? g &quot;google&quot;))
</code></pre>
<p>Relies on division by zero throwing an exception. The AST interpreter will always throw an exception in software, but for the golfed interpreter, it requires the x86 behavior of throwing an exception on the hardware level.</p>


<p>We all know that if you google the word "google" it will break the internet.</p>

<p>Your task is to create a function that accepts one string and returns its length, in the fewest possible Unicode characters.</p>

<p>However, if the given string is <code>google</code> (lowercase), it will cause an error.</p>

<p>For example, <code>g('bing')</code> will return <code>4</code> but <code>g('google')</code> will cause an error.</p>

<p>Please provide an example of usage, and the error if possible.</p>


问不要谷歌“谷歌”
EN

回答 89

Code Golf用户

Python 2，29

Code Golf用户

Excel，23个字符

Code Golf用户

C#，43字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问不要谷歌“谷歌”EN

回答 89

Code Golf用户

Python 2，29

Code Golf用户

Excel，23个字符

Code Golf用户

C#，43字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问不要谷歌“谷歌”
EN