Piem validator programme

Question

Write a program that defines a function that can check if a string variable called "anything you want or inputted by the user" is or not a piem. (piem = a story or poem in which the word lengths represent the digits of π (from Wikipedia))

Some examples:

myfunction("I am clearly wrong") # False
myfunction("How I want a drink, alcoholic of course, after the heavy lectures involving quantum mechanics") #True (Taken from Wikipedia)
myfunction("Law ' s fine") # True

You should delete any kind of punctuation or newline before processing. Pure code golf, the shortest wins

End date: evening of 1/10/2014

Various answers

• How many digits do we need to handle? More than 10
• As a matter of interest, how should 0's in PI be interpreted? Skipped or 10 letter words? As 10 letters words
• "a variable called piem" – so the name of the parameter must be piem? No, it hasn't, question text corrected
• A fun bonus might be a solution that is itself a piem If your solution is a piem you get *0.5 bonus
• For the sake of argument, is _ always punctuation? You can decide if it is punctuation or if it isn't
• It's unclear what is meant by "any kind of punctuation" I mean ,.'"?!;;()
• So digits should be counted? And Law's fine would be false? Digits should be treated as letters, Law's fine = False; Law ' s fine = True

Comments

• The APL solution should be counted in Bytes
• If your solution works for 100+ digits of pi you get *0.8 bonus
• Because of the great interest the end date is one day more in the future.

Answer 1

APL (39)

{N≡(≢N←≢¨('\w+'⎕S'\0')⍵)↑⍎¨'_. '~⍨99⍕○1}

It uses all the digits the APL interpreter's pi constant provides, to a limit of 99. In my case (Dyalog APL 14 32-bit) that was 16 digits. The 64-bit version likely has more digits. 16 digits is enough for the given examples to work, though.

Strings that have more than that amount of words will fail, even if all the digits it could check were true. (The same is true of other posts, as of this writing.) For example, if there were only 10 digits, the 'How I want a drink' one would fail. This can be fixed, but at the cost of 14 characters:

{(≢¨('\w+'⎕S'\0')⍵){∧/(⌊/≢¨⍺⍵)↑∨⌿⍺∘.=⍵}⍎¨'_. '~⍨99⍕○1}

That version will accept any string where the first N digits are correct.

Answer 2

JavaScript (169)(140)(137)(135) (63)for 17 digits of pi

In my version Law's fine and Law ' s fine return both true.

Newest Version (63) by Ingo Bürk and hsl

f=s=>!s.split(/\W+/).some((x,i)=>x.length-(Math.PI*1e16+'')[i])

New Version (135) for 17 digits of pi (Thanks to Ingo Bürk):

f=(s)=>{
s=s.split(/[!"#$%&'()*+, \-.\/:;<=>?@[\\\]^_`{|}~]+/);
p=Math.PI*1e16+'';
    r=0;
    for(a=s.length;a--;)r+=s[a].length!=p[a];
    return !r
}

Old version (169) for 32 digits of pi:

f=(s)=>{
s=s.split(/[!"#$%&'()*+, \-.\/:;<=>?@[\\\]^_`{|}~]+/);
p="31415926535897932384626433832795".split('');
    r=1;
    for(a=s.length;a--;)if(s[a].length!=p[a]){r=0};
    return r;
}

Answer 3

Ruby, 113 101 79 (98 * 0.8)

require"bigdecimal/math"
x=->p{!(BigMath.PI(999).to_s[2..-1]!~/^#{p.scan(/\w+/).map(&:size)*''}/)}

Explanation

• Input is taken as the argument to a lambda. It expects a String.
• Pi is calculated up to 999 decimals and turned into a String with the . removed.
• Punctuation marks are removed from the poem and it is split into individual words. "Let's" is counted as two words: "Let" and "s".
• Use Array#map to convert each word to the size of the word, concatenate them into a String.
• Using a Regexp, check if the two created Strings begin with the same characters.

I have applied the bonus for handling 100+ digits. _ is not handled as punctuation in this solution.

Answer 4

Mathematica, 123 bytes * 0.8 = 98.4

f=#&@@RealDigits[Pi,10,Length[d=StringLength/@StringSplit@StringReplace[#,RegularExpression@"[!-.:-?]
"->""]/. 10->0]]==d&;

Almost the longest submission so far, but:

• It works for any number of digits of Pi.
• It removes all the required ASCII characters and the line break, without splitting the words in those places.
• It handles 0-digits in Pi correctly (as 10-letter words)

Answer 5

Python 3 - 129

Doesn't account for punctuation:

import math
f=lambda p:all(1if len(p.split(' ')[i])!=int(str(math.pi).replace('.','')[i])else 1for i in range(len(p.split(' '))))

Answer 6

Python - 130 127 116 - 17 digits of pi

As in @flawr 's answer, Law ' s fine and Law's fine both return True.

Thanks to @Emil for removing 12 characters from the program.

import re
f=lambda x:all(j==int("31415926535897932"[i])for i,j in enumerate([len(s)for s in re.findall("[\w]+",x)]))

Answer 7

Java, 185

boolean f(String...s){s=s[0].replaceAll("\\W","~").replaceAll("~+","~").split("~");for(int i=0;i<s.length;){if(s[i].length()!=(int)(Math.PI*Math.pow(10,i++)%10))return 0>1;}return 1>0;}

Answer 8

python 3, 17 digits of pi, 104

import re;f=lambda s:all(map(int.__eq__, map(int, '31415926535897932'), map(len,re.findall('[\w]+',s))))

Answer 9

T-SQL 488 383

And now for a large T-SQL solution :)

CREATE FUNCTION F(@s VARCHAR(MAX))RETURNS CHAR(6) AS BEGIN DECLARE @ CHAR='T',@p VARCHAR(50)='31415926535897932384626433832795028841971693993751',@i INT=0WHILE @='T'AND @s<>''BEGIN SET @i=PATINDEX('%[^a-z0-9]%',@s)IF @i=0RETURN'#True'IF @i-1<>LEFT(@p,1)RETURN'#False'SET @p=STUFF(@p,1,1,'')SET @s=STUFF(@s,1,@i,'')SET @s=STUFF(@s,1,PATINDEX('%[a-z0-9]%',@s)-1,'')END RETURN'#True'END

This creates an inline table valued function that uses a recursive CTE to detect word boundaries.

Creates a scalar function that chews it's way through the words and PI to 31 decimals (first 0). It is called in the following way

SELECT dbo.f('SQL I golf, a large procedure is normal. Hefty not terse') --#True

Answer 10

CJam, 40

"
,.'\"?!;:"{-}/S%{,PAV#*iA%=V):V}/]0#)!

It's unclear what is meant by "any kind of punctuation"; this solution removes the ,.'"?!;; characters.

Answer 11

Bash and unix tools, 111

f() { grep ^"$(echo "$@"|grep -Po '[\w]+'|xargs -n1 sh -c 'echo ${#0}'|xargs|tr -d ' ')"<<<31415926535897932; 

Answer 12

NodeJS 32 digits 230 Bytes

I can't get it shorter with JS :D

var p = "31415926535897932384626433832795", i = 0;
console.log(process.argv[2].split(/[\s,.]+/).every(function(w) {
    if (parseInt(p.charAt(i)) !== w.length) {
        return false;
    }
    i++;
    return true;
}) ? 'True' : 'False');