WolframAlpha.com
WolframCloud.com
All Sites & Public Resources...
Products & Services
Wolfram|One
Mathematica
Wolfram|Alpha Notebook Edition
Finance Platform
System Modeler
Wolfram Player
Wolfram Engine
WolframScript
Enterprise Private Cloud
Application Server
Enterprise Mathematica
Wolfram|Alpha Appliance
Enterprise Solutions
Corporate Consulting
Technical Consulting
Wolfram|Alpha Business Solutions
Resource System
Data Repository
Neural Net Repository
Function Repository
Wolfram|Alpha
Wolfram|Alpha Pro
Problem Generator
API
Data Drop
Products for Education
Mobile Apps
Wolfram Player
Wolfram Cloud App
Wolfram|Alpha for Mobile
Wolfram|Alpha-Powered Apps
Services
Paid Project Support
Wolfram U
Summer Programs
All Products & Services »
Technologies
Wolfram Language
Revolutionary knowledge-based programming language.
Wolfram Cloud
Central infrastructure for Wolfram's cloud products & services.
Wolfram Science
Technology-enabling science of the computational universe.
Wolfram Notebooks
The preeminent environment for any technical workflows.
Wolfram Engine
Software engine implementing the Wolfram Language.
Wolfram Natural Language Understanding System
Knowledge-based broadly deployed natural language.
Wolfram Data Framework
Semantic framework for real-world data.
Wolfram Universal Deployment System
Instant deployment across cloud, desktop, mobile, and more.
Wolfram Knowledgebase
Curated computable knowledge powering Wolfram|Alpha.
All Technologies »
Solutions
Engineering, R&D
Aerospace & Defense
Chemical Engineering
Control Systems
Electrical Engineering
Image Processing
Industrial Engineering
Mechanical Engineering
Operations Research
More...
Finance, Statistics & Business Analysis
Actuarial Sciences
Bioinformatics
Data Science
Econometrics
Financial Risk Management
Statistics
More...
Education
All Solutions for Education
Trends
Machine Learning
Multiparadigm Data Science
Internet of Things
High-Performance Computing
Hackathons
Software & Web
Software Development
Authoring & Publishing
Interface Development
Web Development
Sciences
Astronomy
Biology
Chemistry
More...
All Solutions »
Learning & Support
Learning
Wolfram Language Documentation
Fast Introduction for Programmers
Wolfram U
Videos & Screencasts
Wolfram Language Introductory Book
Webinars & Training
Summer Programs
Books
Need Help?
Support FAQ
Wolfram Community
Contact Support
Premium Support
Paid Project Support
Technical Consulting
All Learning & Support »
Company
About
Company Background
Wolfram Blog
Events
Contact Us
Work with Us
Careers at Wolfram
Internships
Other Wolfram Language Jobs
Initiatives
Wolfram Foundation
MathWorld
Computer-Based Math
A New Kind of Science
Wolfram Technology for Hackathons
Student Ambassador Program
Wolfram for Startups
Demonstrations Project
Wolfram Innovator Awards
Wolfram + Raspberry Pi
Summer Programs
More...
All Company »
Search
WOLFRAM COMMUNITY
Connect with users of Wolfram technologies to learn, solve problems and share ideas
Join
Sign In
Dashboard
Groups
People
Message Boards
Answer
(
Unmark
)
Mark as an Answer
GROUPS:
Staff Picks
Authoring and Publishing
Education
Graphics and Visualization
Wolfram Language
Challenges
Wolfram Summer School
6
Anonymous Anonymous
[WSS21] Improving the question-answer database of EIWL book
Anonymous Anonymous
Posted
11 months ago
2497 Views
|
1 Reply
|
6 Total Likes
Follow this post
|
On improving the question-answer database of Elementary Introduction to Wolfram Language
Tuseeta Banerjee
Wolfram Research
Elementary Introduction to Wolfram Language (EIWL) is perhaps one of the best, concise and one-stop and free introductions to the Wolfram Language. It not only introduces Wolfram Language, but can also be considered a tool to improve one’s existing coding skills. Any individual, with a programming or non-programming background can read this book for free, and get at par with programming in Wolfram Language. The chapters of this book do an excellent job of capturing the richness and variety of Wolfram Language and the interface of submitting answers with automatic grading is also quite attractive. Students at WSS over the past few years solve various problems from EIWL before moving on to Wolfram Challenges questions. However, the answers to the problems in the book are not unique, and that issue is already mentioned in the book. A part of this project is to create alternate versions of answers to challenges that do not currently exist in the database of answers, so that they may be helpful in improving the learning experience of thousands of students online who use this book judiciously to improve their coding skills.
A second aspect of the project is to identify questions that have ambiguity in them and may be subject to multiple interpretations from the student. From an educational stand point, the question in turn does not become a metric of the knowledge of the student, but the ability of the student to actually “guess” what the question-maker asks for. A part of this project also addresses some of these questions.
Section 1: Database questions
This section deals with all the internal database questions, which might be updated regularly and hence the answers do not match to the existing answers.
1. Count the number of words in WordList[] that start with “q”
I am not sure if the WordList[] is updated which results in the incorrectness of the following two answers. However, I verified the solution with two very different approaches with String (and they both confirmed same answers).
I
n
[
]
:
=
(
C
o
u
n
t
s
@
S
t
r
i
n
g
T
a
k
e
[
T
o
L
o
w
e
r
C
a
s
e
@
W
o
r
d
L
i
s
t
[
]
,
1
]
)
[
"
q
"
]
O
u
t
[
]
=
1
9
4
I
n
[
]
:
=
L
e
n
g
t
h
@
S
e
l
e
c
t
[
W
o
r
d
L
i
s
t
[
]
,
S
t
r
i
n
g
M
a
t
c
h
Q
[
#
,
"
q
"
~
~
_
_
_
]
&
]
O
u
t
[
]
=
1
9
4
2. Make a line plot of the lengths of the first 1000 words in WordList[]
I
n
[
]
:
=
L
i
s
t
L
i
n
e
P
l
o
t
@
S
t
r
i
n
g
L
e
n
g
t
h
@
(
W
o
r
d
L
i
s
t
[
]
[
[
1
;
;
1
0
0
0
]
]
)
O
u
t
[
]
=
Plausible reason: WordList has been updated.
3. Plot together the historical frequencies of the words “science” and “technology
I have no idea if the WordFrequencyData for these words got updated, but they don’t seem to match. I even added PlotLegends to match the Expected Output, but it still did not work.
I
n
[
]
:
=
D
a
t
e
L
i
s
t
P
l
o
t
[
{
W
o
r
d
F
r
e
q
u
e
n
c
y
D
a
t
a
[
"
t
e
c
h
n
o
l
o
g
y
"
,
"
T
i
m
e
S
e
r
i
e
s
"
]
,
W
o
r
d
F
r
e
q
u
e
n
c
y
D
a
t
a
[
"
s
c
i
e
n
c
e
"
,
"
T
i
m
e
S
e
r
i
e
s
"
]
}
]
O
u
t
[
]
=
4. Make a labeled bar chart of the number of times each possible first letter occurs in words from WordList[].
I
n
[
]
:
=
B
a
r
C
h
a
r
t
[
C
o
u
n
t
s
@
S
t
r
i
n
g
T
a
k
e
[
T
o
L
o
w
e
r
C
a
s
e
@
W
o
r
d
L
i
s
t
[
]
,
1
]
,
C
h
a
r
t
L
a
b
e
l
s
A
l
p
h
a
b
e
t
[
]
]
O
u
t
[
]
=
5. Make an association giving the 5 most common first letters of words in WordList[] and their counts.
I
n
[
]
:
=
(
R
e
v
e
r
s
e
S
o
r
t
@
C
o
u
n
t
s
@
S
t
r
i
n
g
T
a
k
e
[
T
o
L
o
w
e
r
C
a
s
e
@
W
o
r
d
L
i
s
t
[
]
,
1
]
)
[
[
;
;
5
]
]
O
u
t
[
]
=
s
4
5
0
2
,
c
3
6
9
4
,
p
3
1
6
8
,
d
2
4
3
6
,
a
2
3
9
7
6. Find the 10 most common words in ExampleData[{“Text”,”AliceInWonderland”}]
I
n
[
]
:
=
K
e
y
s
@
(
(
R
e
v
e
r
s
e
S
o
r
t
@
C
o
u
n
t
s
@
T
e
x
t
W
o
r
d
s
@
T
o
L
o
w
e
r
C
a
s
e
@
E
x
a
m
p
l
e
D
a
t
a
[
{
"
T
e
x
t
"
,
"
A
l
i
c
e
I
n
W
o
n
d
e
r
l
a
n
d
"
}
]
)
[
[
1
;
;
1
0
]
]
)
O
u
t
[
]
=
{
t
h
e
,
a
n
d
,
a
,
t
o
,
s
h
e
,
o
f
,
i
t
,
w
a
s
,
i
n
,
a
l
i
c
e
}
7. Find the longest 10 words in WordList[].
I
n
[
]
:
=
(
R
e
v
e
r
s
e
S
o
r
t
@
A
s
s
o
c
i
a
t
i
o
n
T
h
r
e
a
d
[
W
o
r
d
L
i
s
t
[
]
-
>
S
t
r
i
n
g
L
e
n
g
t
h
/
@
W
o
r
d
L
i
s
t
[
]
]
)
[
[
1
;
;
1
0
]
]
O
u
t
[
]
=
e
l
e
c
t
r
o
e
n
c
e
p
h
a
l
o
g
r
a
p
h
i
c
2
3
,
e
l
e
c
t
r
o
e
n
c
e
p
h
a
l
o
g
r
a
p
h
2
1
,
u
n
c
h
a
r
a
c
t
e
r
i
s
t
i
c
a
l
l
y
2
0
,
m
a
g
n
e
t
o
h
y
d
r
o
d
y
n
a
m
i
c
s
2
0
,
i
n
t
e
r
n
a
t
i
o
n
a
l
i
z
a
t
i
o
n
2
0
,
e
l
e
c
t
r
o
e
n
c
e
p
h
a
l
o
g
r
a
m
2
0
,
c
o
u
n
t
e
r
r
e
v
o
l
u
t
i
o
n
a
r
y
2
0
,
c
o
m
p
a
r
t
m
e
n
t
a
l
i
z
a
t
i
o
n
2
0
,
b
u
c
k
m
i
n
s
t
e
r
f
u
l
l
e
r
e
n
e
2
0
,
s
t
r
a
i
g
h
t
f
o
r
w
a
r
d
n
e
s
s
1
9
8. Correct the program Counts[StringTake[#,2]&/@WordList[]]
I
n
[
]
:
=
C
o
u
n
t
s
[
S
t
r
i
n
g
T
a
k
e
[
#
,
2
]
&
/
@
S
e
l
e
c
t
[
W
o
r
d
L
i
s
t
[
]
,
S
t
r
i
n
g
L
e
n
g
t
h
[
#
]
>
2
&
]
]
Section 2: Ambiguous questions
1. Create a sound from the letters in CABBAGE, each playing for 0.3 seconds sounding like a guitar
This question is ambiguous and I kept guessing what I need to do with the letters of the word “CABBAGE”, LetterNumber made most sense, but apparently it is not what the question wants.
I
n
[
]
:
=
S
o
u
n
d
[
T
a
b
l
e
[
S
o
u
n
d
N
o
t
e
[
n
,
0
.
3
,
"
G
u
i
t
a
r
"
]
,
{
n
,
L
e
t
t
e
r
N
u
m
b
e
r
[
"
c
a
b
b
a
g
e
"
]
}
]
]
O
u
t
[
]
=
2. Display 100 polygons with side length 10 and opacity [0.5] and random choices of colors, sides between 3 and 8, and integer coordinates up to 100
The confusion to this question is about the words side length, are they the radius of the polygon or the side of the polygon, because although they are related, they are not the same.
I
n
[
]
:
=
G
r
a
p
h
i
c
s
@
T
a
b
l
e
[
{
R
a
n
d
o
m
C
o
l
o
r
[
]
,
O
p
a
c
i
t
y
[
0
.
5
]
,
R
e
g
u
l
a
r
P
o
l
y
g
o
n
[
{
R
a
n
d
o
m
I
n
t
e
g
e
r
[
1
0
0
]
,
R
a
n
d
o
m
I
n
t
e
g
e
r
[
1
0
0
]
}
,
1
0
,
R
a
n
d
o
m
I
n
t
e
g
e
r
[
{
3
,
8
}
]
]
}
,
{
i
,
1
0
0
}
]
O
u
t
[
]
=
3. Make a histogram of sentence length in the Wikipedia article on computers.
This is an ambiguous question: Is Sentence Length = # of words? # of characters? From the histogram of expected output it seems character Length. I tried both none of them were accepted.
I
n
[
]
:
=
H
i
s
t
o
g
r
a
m
@
(
L
e
n
g
t
h
/
@
(
T
e
x
t
W
o
r
d
s
/
@
T
e
x
t
C
a
s
e
s
[
W
i
k
i
p
e
d
i
a
D
a
t
a
[
"
c
o
m
p
u
t
e
r
s
"
]
,
"
S
e
n
t
e
n
c
e
"
]
)
)
O
u
t
[
]
=
I
n
[
]
:
=
H
i
s
t
o
g
r
a
m
[
S
t
r
i
n
g
L
e
n
g
t
h
/
@
T
e
x
t
C
a
s
e
s
[
W
i
k
i
p
e
d
i
a
D
a
t
a
[
"
c
o
m
p
u
t
e
r
s
"
]
,
"
S
e
n
t
e
n
c
e
"
]
]
O
u
t
[
]
=
Section 3: Entity questions
1. Get an image of an elephant
A simple answer from making a query to W|A resulted in the image, which seems correct, but is unacceptable by the database.
I
n
[
]
:
=
A
f
r
i
c
a
n
b
u
s
h
e
l
e
p
h
a
n
t
S
P
E
C
I
E
S
S
P
E
C
I
F
I
C
A
T
I
O
N
i
m
a
g
e
O
u
t
[
]
=
2. Compute the height of the Empire State Building divided by the height of the Great Pyramid
A simple answer from making a query to W|A resulted in the image, which seems correct, but is unacceptable by the database. There are multiple pyramids, so specifying which one of them would help clear the ambiguity here.
I
n
[
]
:
=
E
m
p
i
r
e
S
t
a
t
e
B
u
i
l
d
i
n
g
B
U
I
L
D
I
N
G
t
o
t
a
l
h
e
i
g
h
t
E
g
y
p
t
i
a
n
P
y
r
a
m
i
d
s
o
f
G
i
z
a
B
U
I
L
D
I
N
G
S
t
o
t
a
l
h
e
i
g
h
t
O
u
t
[
]
=
{
2
.
7
4
1
0
1
,
2
1
.
7
7
1
4
,
1
2
.
5
7
4
3
,
1
2
.
7
,
1
2
.
8
7
1
6
,
2
.
8
0
1
4
7
,
1
9
.
0
5
,
5
.
7
7
2
7
3
}
E
n
t
i
t
y
[
"
B
u
i
l
d
i
n
g
"
,
"
E
m
p
i
r
e
S
t
a
t
e
B
u
i
l
d
i
n
g
:
:
h
5
8
3
b
"
]
[
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
B
u
i
l
d
i
n
g
"
,
"
H
e
i
g
h
t
"
]
]
/
E
n
t
i
t
y
C
l
a
s
s
[
"
B
u
i
l
d
i
n
g
"
,
"
P
y
r
a
m
i
d
s
G
i
z
a
"
]
[
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
B
u
i
l
d
i
n
g
"
,
"
H
e
i
g
h
t
"
]
]
3. Find the dominant colors of an image collage of the flag images of all countries in Europe
I seem to not be getting the correct answers for any of the ImageCollage-s on the images of flags of countries in Europe, if I do either the W|A query input or the hard-coded Entity way of programming. Not sure where the answer database fails to match mine. I have not compared the answers to the already existing answers (because that is not how a student is expected to approach the problem). I believe it is in the way the question is structured. My guess is that it wants us to query for countries in European Union, and not the countries in continent Europe, but there remains an ambiguity in the question.
I
n
[
]
:
=
D
o
m
i
n
a
n
t
C
o
l
o
r
s
@
I
m
a
g
e
C
o
l
l
a
g
e
@
E
n
t
i
t
y
V
a
l
u
e
E
u
r
o
p
e
G
E
O
G
R
A
P
H
I
C
R
E
G
I
O
N
c
o
u
n
t
r
i
e
s
,
f
l
a
g
I
n
[
]
:
=
D
o
m
i
n
a
n
t
C
o
l
o
r
s
@
I
m
a
g
e
C
o
l
l
a
g
e
@
E
n
t
i
t
y
V
a
l
u
e
[
E
n
t
i
t
y
[
"
G
e
o
g
r
a
p
h
i
c
R
e
g
i
o
n
"
,
"
E
u
r
o
p
e
"
]
[
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
G
e
o
g
r
a
p
h
i
c
R
e
g
i
o
n
"
,
"
C
o
u
n
t
r
i
e
s
"
]
]
,
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
C
o
u
n
t
r
y
"
,
"
F
l
a
g
"
]
]
O
u
t
[
]
=
,
,
,
,
,
,
,
,
,
,
,
,
,
,
4. Make Pie Chart of the GDP of countries of Europe
I seem to not be getting the correct answers for any of the countries in Europe questions. My guess is that it wants us to query for countries in European Union, and not the countries in continent Europe, but there remains an ambiguity in the question. However, the pie chart looks exactly the same as the one given in Expected Answers, and thus I ran out of guesses as well!
I
n
[
]
:
=
P
i
e
C
h
a
r
t
@
E
n
t
i
t
y
V
a
l
u
e
E
u
r
o
p
e
G
E
O
G
R
A
P
H
I
C
R
E
G
I
O
N
c
o
u
n
t
r
i
e
s
,
G
D
P
n
o
m
i
n
a
l
P
i
e
C
h
a
r
t
@
E
n
t
i
t
y
V
a
l
u
e
[
E
n
t
i
t
y
[
"
G
e
o
g
r
a
p
h
i
c
R
e
g
i
o
n
"
,
"
E
u
r
o
p
e
"
]
[
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
G
e
o
g
r
a
p
h
i
c
R
e
g
i
o
n
"
,
"
C
o
u
n
t
r
i
e
s
"
]
]
,
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
C
o
u
n
t
r
y
"
,
"
G
D
P
"
,
{
"
C
u
r
r
e
n
c
y
U
n
i
t
"
"
C
u
r
r
e
n
t
U
S
D
o
l
l
a
r
"
}
]
]
O
u
t
[
]
=
5. Make ImageCollage of the flags of all countries in Europe. using the “FlagImage” property
I seem to not be getting the correct answers for any of the ImageCollage-s on the images of flags of countries in Europe, if I do either the W|A query input or the hard-coded Entity way of programming. Not sure where the answer database fails to match mine. I have not compared the answers to the already existing answers (because that is not how a student is expected to approach the problem). I believe it is in the way the question is structured. My guess is that it wants us to query for countries in European Union, and not the countries in continent Europe, but there remains an ambiguity in the question.
I
n
[
]
:
=
I
m
a
g
e
C
o
l
l
a
g
e
@
E
n
t
i
t
y
V
a
l
u
e
[
E
n
t
i
t
y
[
"
G
e
o
g
r
a
p
h
i
c
R
e
g
i
o
n
"
,
"
E
u
r
o
p
e
"
]
[
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
G
e
o
g
r
a
p
h
i
c
R
e
g
i
o
n
"
,
"
C
o
u
n
t
r
i
e
s
"
]
]
,
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
C
o
u
n
t
r
y
"
,
"
F
l
a
g
I
m
a
g
e
"
]
]
O
u
t
[
]
=
6. Get a list of distances to each planet using “DistanceFromEarth” property and convert all the results to light minutes
Not sure if the data is updated as a result of which the answers do not match.
I
n
[
]
:
=
U
n
i
t
C
o
n
v
e
r
t
p
l
a
n
e
t
s
P
L
A
N
E
T
S
d
i
s
t
a
n
c
e
f
r
o
m
E
a
r
t
h
,
"
L
i
g
h
t
M
i
n
u
t
e
s
"
O
u
t
[
]
=
8
.
0
6
8
8
1
l
i
g
h
t
m
i
n
u
t
e
s
,
1
1
.
9
9
6
8
l
i
g
h
t
m
i
n
u
t
e
s
,
0
.
l
i
g
h
t
m
i
n
u
t
e
s
,
2
0
.
5
7
8
6
l
i
g
h
t
m
i
n
u
t
e
s
,
3
5
.
3
0
4
4
l
i
g
h
t
m
i
n
u
t
e
s
,
7
4
.
9
5
3
3
l
i
g
h
t
m
i
n
u
t
e
s
,
1
6
7
.
7
0
7
l
i
g
h
t
m
i
n
u
t
e
s
,
2
4
5
.
1
2
5
l
i
g
h
t
m
i
n
u
t
e
s
7. Binarize each flag of Europe and make an image collage of the result.
I seem to not be getting the correct answers for any of the ImageCollage-s on the images of flags of countries in Europe, if I do either the W|A query input or the hard-coded Entity way of programming. Not sure where the answer database fails to match mine. I have not compared the answers to the already existing answers (because that is not how a student is expected to approach the problem). I believe it is in the way the question is structured. My guess is that it wants us to query for countries in European Union, and not the countries in continent Europe, but there remains an ambiguity in the question.
I
n
[
]
:
=
I
m
a
g
e
C
o
l
l
a
g
e
B
i
n
a
r
i
z
e
/
@
E
n
t
i
t
y
V
a
l
u
e
E
u
r
o
p
e
G
E
O
G
R
A
P
H
I
C
R
E
G
I
O
N
c
o
u
n
t
r
i
e
s
,
f
l
a
g
O
u
t
[
]
=
8. Make a pie chart of the GDP’s of the countries in the G5, labeling each wedge.
I
n
[
]
:
=
P
i
e
C
h
a
r
t
T
h
r
e
a
d
G
r
o
u
p
o
f
5
C
O
U
N
T
R
I
E
S
G
D
P
n
o
m
i
n
a
l
E
n
t
i
t
y
L
i
s
t
@
G
r
o
u
p
o
f
5
C
O
U
N
T
R
I
E
S
[
"
N
a
m
e
"
]
O
u
t
[
]
=
9. Make a pie chart of the GDP’s of the countries in the G5, giving a legend for each wedge.
I
n
[
]
:
=
P
i
e
C
h
a
r
t
Q
u
a
n
t
i
t
y
M
a
g
n
i
t
u
d
e
G
r
o
u
p
o
f
5
C
O
U
N
T
R
I
E
S
[
"
P
o
p
u
l
a
t
i
o
n
"
]
,
C
h
a
r
t
L
e
g
e
n
d
s
E
n
t
i
t
y
L
i
s
t
@
G
r
o
u
p
o
f
5
C
O
U
N
T
R
I
E
S
[
"
N
a
m
e
"
]
O
u
t
[
]
=
10. Make a word cloud of countries in Central America with the names of countries are proportional to the lengths of the Wikipedia article about them.
I
n
[
]
:
=
n
a
m
e
s
=
C
e
n
t
r
a
l
A
m
e
r
i
c
a
C
O
U
N
T
R
I
E
S
[
"
N
a
m
e
"
]
;
W
o
r
d
C
l
o
u
d
@
A
s
s
o
c
i
a
t
i
o
n
T
h
r
e
a
d
[
n
a
m
e
s
-
>
S
t
r
i
n
g
L
e
n
g
t
h
@
D
e
l
e
t
e
S
t
o
p
w
o
r
d
s
@
(
W
i
k
i
p
e
d
i
a
D
a
t
a
[
#
]
&
/
@
n
a
m
e
s
)
]
O
u
t
[
]
=
11. Find universities that can be referred to as “U of X” where x is any letter of the alphabet.
They are the same answers.
I
n
[
]
:
=
C
a
s
e
s
[
I
n
t
e
r
p
r
e
t
e
r
[
"
U
n
i
v
e
r
s
i
t
y
"
]
[
S
t
r
i
n
g
J
o
i
n
[
"
U
o
f
"
,
#
]
&
/
@
T
o
U
p
p
e
r
C
a
s
e
@
A
l
p
h
a
b
e
t
[
]
]
,
_
E
n
t
i
t
y
]
O
u
t
[
]
=
U
n
i
v
e
r
s
i
t
y
o
f
B
i
r
j
a
n
d
,
U
n
i
v
e
r
s
i
t
y
o
f
C
h
i
c
a
g
o
,
T
h
e
U
n
i
v
e
r
s
i
t
y
o
f
E
d
i
n
b
u
r
g
h
,
U
n
i
v
e
r
s
i
t
y
o
f
G
e
o
r
g
i
a
,
U
n
i
v
e
r
s
i
t
y
o
f
H
o
u
s
t
o
n
,
U
n
i
v
e
r
s
i
t
y
o
f
I
l
l
i
n
o
i
s
a
t
U
r
b
a
n
a
-
C
h
a
m
p
a
i
g
n
,
U
n
i
v
e
r
s
i
t
y
o
f
L
e
t
h
b
r
i
d
g
e
,
U
n
i
v
e
r
s
i
t
y
o
f
M
i
c
h
i
g
a
n
-
A
n
n
A
r
b
o
r
,
U
n
i
v
e
r
s
i
t
y
o
f
P
h
o
e
n
i
x
-
O
n
l
i
n
e
C
a
m
p
u
s
,
U
n
i
v
e
r
s
i
t
y
o
f
R
e
g
i
n
a
,
U
n
i
v
e
r
s
i
t
y
o
f
S
a
s
k
a
t
c
h
e
w
a
n
,
U
n
i
v
e
r
s
i
t
y
o
f
T
o
r
o
n
t
o
Section 4: Manipulate questions
11. Make a Manipulate to rotate an image of a cat between 0
°
and 180
°
This has been observed in many Manipulate question. Many a times, the step size is not mentioned, as a result of which there can be ambiguities, do you want continuous step sizes or in some size differences. This is just an example
I
n
[
]
:
=
M
a
n
i
p
u
l
a
t
e
R
o
t
a
t
e
,
i
,
{
i
,
0
°
,
1
8
0
°
}
O
u
t
[
]
=
Section 5: Apparently correct answers
1. Find the distance from 0 latitude 0 longitude to Eiffel Tower
This answer is actually correct and matches the answer provided but the answer is not accepted.
G
e
o
D
i
s
t
a
n
c
e
G
e
o
P
o
s
i
t
i
o
n
E
i
f
f
e
l
T
o
w
e
r
B
U
I
L
D
I
N
G
,
G
e
o
P
o
s
i
t
i
o
n
[
{
0
,
0
}
]
2.Make a 12x12 multiplication table with white type on black background
This grid did not actually evaluate properly in the cloud and the answer did not match the existing answers.
I
n
[
]
:
=
G
r
i
d
[
T
a
b
l
e
[
i
*
j
,
{
i
,
1
2
}
,
{
j
,
1
2
}
]
,
B
a
c
k
g
r
o
u
n
d
B
l
a
c
k
,
I
t
e
m
S
t
y
l
e
W
h
i
t
e
]
O
u
t
[
]
=
3. Flatten to generate a table from 1 to 50 where even numbers are colored red.
This look right, and use the functions also mentioned in the question
I
n
[
]
:
=
F
l
a
t
t
e
n
@
T
a
b
l
e
[
{
i
,
S
t
y
l
e
[
2
*
i
,
R
e
d
]
}
,
{
i
,
2
5
}
]
O
u
t
[
]
=
{
1
,
2
,
2
,
4
,
3
,
6
,
4
,
8
,
5
,
1
0
,
6
,
1
2
,
7
,
1
4
,
8
,
1
6
,
9
,
1
8
,
1
0
,
2
0
,
1
1
,
2
2
,
1
2
,
2
4
,
1
3
,
2
6
,
1
4
,
2
8
,
1
5
,
3
0
,
1
6
,
3
2
,
1
7
,
3
4
,
1
8
,
3
6
,
1
9
,
3
8
,
2
0
,
4
0
,
2
1
,
4
2
,
2
2
,
4
4
,
2
3
,
4
6
,
2
4
,
4
8
,
2
5
,
5
0
}
4. Make a 3D plot of heights generated from Mod[i,j] with i and j going upto 100
This plot look very similar to the Expected Output but it was not accepted.
I
n
[
]
:
=
L
i
s
t
P
l
o
t
3
D
@
F
l
a
t
t
e
n
[
T
a
b
l
e
[
{
i
,
j
,
M
o
d
[
i
,
j
]
}
,
{
i
,
1
0
0
}
,
{
j
,
1
0
0
}
]
,
{
1
,
2
}
]
O
u
t
[
]
=
5. Generate a 3D list plot using the image data from a binarized size-200 letter “W” as heights.
This plot look very similar to the Expected Output but it was not accepted.
I
n
[
]
:
=
L
i
s
t
P
l
o
t
3
D
@
I
m
a
g
e
D
a
t
a
@
B
i
n
a
r
i
z
e
@
R
a
s
t
e
r
i
z
e
@
S
t
y
l
e
[
"
W
"
,
2
0
0
]
O
u
t
[
]
=
6. Make a graphics of 1000-step 2D random walk which starts at {0,0}, and in which at each step a pair of random numbers between -1 and 1 are added to the coordinates
The output look similar to the Expected Output.
I
n
[
]
:
=
G
r
a
p
h
i
c
s
@
L
i
n
e
@
N
e
s
t
L
i
s
t
[
#
+
{
R
a
n
d
o
m
R
e
a
l
[
{
-
1
,
1
}
]
,
R
a
n
d
o
m
R
e
a
l
[
{
-
1
,
1
}
]
}
&
,
{
0
,
0
}
,
1
0
0
0
]
O
u
t
[
]
=
7. Make a graphics of 1000 - step 3 D random walk which starts at {0, 0,0}, and in which at each step a pair of random numbers between - 1 and 1 are added to the coordinates
I
n
[
]
:
=
G
r
a
p
h
i
c
s
3
D
@
L
i
n
e
@
N
e
s
t
L
i
s
t
[
#
+
{
R
a
n
d
o
m
R
e
a
l
[
{
-
1
,
1
}
]
,
R
a
n
d
o
m
R
e
a
l
[
{
-
1
,
1
}
]
,
R
a
n
d
o
m
R
e
a
l
[
{
-
1
,
1
}
]
}
&
,
{
0
,
0
,
0
}
,
1
0
0
0
]
O
u
t
[
]
=
8. Make a LinePlot that takes lengths of Roman numerals up to 100 that PlotRange would be sufficient for all numerals up to 1000
This answer actually matches if I explicitly say Range {0,12}, although we do not need to go upto 12, and PlotRange -> All/Automatic were sufficient.
I
n
[
]
:
=
L
i
s
t
L
i
n
e
P
l
o
t
[
S
t
r
i
n
g
L
e
n
g
t
h
/
@
R
o
m
a
n
N
u
m
e
r
a
l
@
R
a
n
g
e
[
1
0
0
]
,
P
l
o
t
R
a
n
g
e
{
F
u
l
l
,
{
0
,
1
2
}
}
]
O
u
t
[
]
=
9. Start with a size-50 “A”, then make a list of nestedly applying frame and random rotations 5 times
I am not sure about why not a single approach was accepted. I tried various approaches and the output look similar to the Expected Output
I
n
[
]
:
=
N
e
s
t
L
i
s
t
[
F
r
a
m
e
d
@
R
o
t
a
t
e
[
#
,
R
a
n
d
o
m
I
n
t
e
g
e
r
[
1
8
0
]
D
e
g
r
e
e
]
&
,
S
t
y
l
e
[
"
A
"
,
5
0
]
,
5
]
I
n
[
]
:
=
N
e
s
t
L
i
s
t
[
F
r
a
m
e
d
@
R
o
t
a
t
e
[
#
,
R
a
n
d
o
m
I
n
t
e
g
e
r
[
1
8
0
]
D
e
g
r
e
e
]
&
,
T
e
x
t
@
S
t
y
l
e
[
"
A
"
,
5
0
]
,
5
]
I
n
[
]
:
=
N
e
s
t
L
i
s
t
[
F
r
a
m
e
d
@
R
o
t
a
t
e
[
#
,
R
a
n
d
o
m
I
n
t
e
g
e
r
[
1
8
0
]
D
e
g
r
e
e
]
&
,
R
a
s
t
e
r
i
z
e
@
T
e
x
t
@
S
t
y
l
e
[
"
A
"
,
5
0
]
,
5
]
10. Generate a graph with 200 connections, each between nodes with numbers chosen randomly between 0 and 100
This answer is very similar to a previously accepted answer and indeed we make 200 connections randomly between nodes numbered from 0 to 100
I
n
[
]
:
=
G
r
a
p
h
@
F
l
a
t
t
e
n
@
T
a
b
l
e
[
{
i
R
a
n
d
o
m
I
n
t
e
g
e
r
[
{
0
,
1
0
0
}
]
,
i
R
a
n
d
o
m
I
n
t
e
g
e
r
[
{
0
,
1
0
0
}
]
}
,
{
i
,
0
,
1
0
0
}
]
O
u
t
[
]
=
11. Generate a plot that shows communities in a random graph with nodes numbered between 0 and 100, and 200 connections
I
n
[
]
:
=
C
o
m
m
u
n
i
t
y
G
r
a
p
h
P
l
o
t
[
G
r
a
p
h
@
F
l
a
t
t
e
n
@
T
a
b
l
e
[
{
i
-
>
R
a
n
d
o
m
I
n
t
e
g
e
r
[
{
0
,
1
0
0
}
]
,
i
-
>
R
a
n
d
o
m
I
n
t
e
g
e
r
[
{
0
,
1
0
0
}
]
}
,
{
i
,
1
,
1
0
0
}
]
]
O
u
t
[
]
=
12. Generate a graph obtained by nestedly finding bordering countries starting from the United States, and going 4 iterations.
I
n
[
]
:
=
N
e
s
t
G
r
a
p
h
[
#
[
E
n
t
i
t
y
P
r
o
p
e
r
t
y
[
"
C
o
u
n
t
r
y
"
,
"
B
o
r
d
e
r
i
n
g
C
o
u
n
t
r
i
e
s
"
]
]
&
,
E
n
t
i
t
y
[
"
C
o
u
n
t
r
y
"
,
"
U
n
i
t
e
d
S
t
a
t
e
s
"
]
,
4
]
O
u
t
[
]
=
13. Make a list of all the different strings that can be obtained by permuting the characters in “hello”
I
n
[
]
:
=
S
t
r
i
n
g
J
o
i
n
/
@
P
e
r
m
u
t
a
t
i
o
n
s
[
C
h
a
r
a
c
t
e
r
s
[
"
h
e
l
l
o
"
]
]
O
u
t
[
]
=
{
h
e
l
l
o
,
h
e
l
o
l
,
h
e
o
l
l
,
h
l
e
l
o
,
h
l
e
o
l
,
h
l
l
e
o
,
h
l
l
o
e
,
h
l
o
e
l
,
h
l
o
l
e
,
h
o
e
l
l
,
h
o
l
e
l
,
h
o
l
l
e
,
e
h
l
l
o
,
e
h
l
o
l
,
e
h
o
l
l
,
e
l
h
l
o
,
e
l
h
o
l
,
e
l
l
h
o
,
e
l
l
o
h
,
e
l
o
h
l
,
e
l
o
l
h
,
e
o
h
l
l
,
e
o
l
h
l
,
e
o
l
l
h
,
l
h
e
l
o
,
l
h
e
o
l
,
l
h
l
e
o
,
l
h
l
o
e
,
l
h
o
e
l
,
l
h
o
l
e
,
l
e
h
l
o
,
l
e
h
o
l
,
l
e
l
h
o
,
l
e
l
o
h
,
l
e
o
h
l
,
l
e
o
l
h
,
l
l
h
e
o
,
l
l
h
o
e
,
l
l
e
h
o
,
l
l
e
o
h
,
l
l
o
h
e
,
l
l
o
e
h
,
l
o
h
e
l
,
l
o
h
l
e
,
l
o
e
h
l
,
l
o
e
l
h
,
l
o
l
h
e
,
l
o
l
e
h
,
o
h
e
l
l
,
o
h
l
e
l
,
o
h
l
l
e
,
o
e
h
l
l
,
o
e
l
h
l
,
o
e
l
l
h
,
o
l
h
e
l
,
o
l
h
l
e
,
o
l
e
h
l
,
o
l
e
l
h
,
o
l
l
h
e
,
o
l
l
e
h
}
14. Make an array plot from the numbers of the letters in the first 1000 characters in the Wikipedia article on “Computers”, with 30 letters per row.
I
n
[
]
:
=
A
r
r
a
y
P
l
o
t
@
P
a
r
t
i
t
i
o
n
[
L
e
t
t
e
r
N
u
m
b
e
r
/
@
C
h
a
r
a
c
t
e
r
s
@
S
t
r
i
n
g
T
a
k
e
[
W
i
k
i
p
e
d
i
a
D
a
t
a
[
"
c
o
m
p
u
t
e
r
s
"
]
,
1
0
0
0
]
,
3
0
]
O
u
t
[
]
=
15. Riffle periods in the string “UNCLE” to make “U.N.C.L.E.”
I
n
[
]
:
=
S
t
r
i
n
g
R
i
f
f
l
e
[
C
h
a
r
a
c
t
e
r
s
@
"
U
N
C
L
E
"
,
"
.
"
]
O
u
t
[
]
=
U
.
N
.
C
.
L
.
E
16. Make a list of array plots, each 50 rows high and with image size 50, of successive possible 8-tuples of 0 and 1.
I
n
[
]
:
=
I
m
a
g
e
R
e
s
i
z
e
[
#
,
5
0
]
&
/
@
(
A
r
r
a
y
P
l
o
t
/
@
P
a
r
t
i
t
i
o
n
[
T
u
p
l
e
s
[
{
0
,
1
}
,
8
]
,
5
0
]
)
O
u
t
[
]
=
17. Generate 1000 random sequences of 4 letters, and make a list of ones that appear in WordList[]
I
n
[
]
:
=
I
n
t
e
r
s
e
c
t
i
o
n
[
S
t
r
i
n
g
J
o
i
n
/
@
T
a
b
l
e
[
R
a
n
d
o
m
S
a
m
p
l
e
[
A
l
p
h
a
b
e
t
[
]
,
4
]
,
{
i
,
1
0
0
0
}
]
,
W
o
r
d
L
i
s
t
[
]
]
O
u
t
[
]
=
{
b
e
s
t
,
b
r
o
w
,
g
a
i
n
,
g
l
o
w
,
h
a
v
e
,
p
l
o
d
}
18. Make a word cloud of country names in the Wikipedia article on “gunpowder”.
I
n
[
]
:
=
W
o
r
d
C
l
o
u
d
@
D
e
l
e
t
e
D
u
p
l
i
c
a
t
e
s
@
T
e
x
t
C
a
s
e
s
[
W
i
k
i
p
e
d
i
a
D
a
t
a
[
"
g
u
n
p
o
w
d
e
r
"
]
,
"
C
o
u
n
t
r
y
"
]
O
u
t
[
]
=
19. Find all nouns in “She sells seashells by the sea shore”
I
n
[
]
:
=
T
e
x
t
C
a
s
e
s
[
"
S
h
e
s
e
l
l
s
s
e
a
s
h
e
l
l
s
b
y
t
h
e
s
e
a
s
h
o
r
e
"
,
"
N
o
u
n
"
]
O
u
t
[
]
=
{
s
e
a
s
h
e
l
l
s
,
s
e
a
,
s
h
o
r
e
}
20. Use TextCases to find the number of nouns, verbs and adjectives in the first 1000 characters of the Wikipedia article on computers.
I
n
[
]
:
=
V
a
l
u
e
s
@
(
L
e
n
g
t
h
/
@
T
e
x
t
C
a
s
e
s
[
S
t
r
i
n
g
T
a
k
e
[
W
i
k
i
p
e
d
i
a
D
a
t
a
[
"
c
o
m
p
u
t
e
r
s
"
]
,
1
0
0
0
]
,
{
"
N
o
u
n
"
,
"
V
e
r
b
"
,
"
A
d
j
e
c
t
i
v
e
"
}
]
)
O
u
t
[
]
=
{
5
4
,
2
5
,
1
9
}
56. Generate 10 random strings made of 5 letters, in which consonants (non-vowels) alternate with vowels (aeiou).
I
n
[
]
:
=
T
a
b
l
e
[
S
t
r
i
n
g
J
o
i
n
@
R
i
f
f
l
e
[
R
a
n
d
o
m
C
h
o
i
c
e
[
C
o
m
p
l
e
m
e
n
t
[
A
l
p
h
a
b
e
t
[
]
,
{
"
a
"
,
"
e
"
,
"
i
"
,
"
o
"
,
"
u
"
}
]
,
3
]
,
R
a
n
d
o
m
C
h
o
i
c
e
[
{
"
a
"
,
"
e
"
,
"
i
"
,
"
o
"
,
"
u
"
}
,
2
]
]
,
1
0
]
O
u
t
[
]
=
{
c
u
j
o
l
,
c
u
l
i
n
,
n
u
l
a
y
,
l
i
h
u
t
,
c
a
d
a
b
,
c
i
p
i
t
,
k
u
x
u
j
,
h
a
h
i
q
,
w
u
x
e
d
,
y
a
v
i
y
}
21. Define a function evenodd that gives Black if its argument is even and white otherwise, but gives red, if the argument is o.
I
n
[
]
:
=
e
v
e
n
o
d
d
[
x
_
]
:
=
W
h
i
c
h
[
x
0
,
R
e
d
,
E
v
e
n
Q
[
x
]
,
B
l
a
c
k
,
T
r
u
e
,
W
h
i
t
e
]
22. Find the 5 longest integer names for integers up to 100.
I
n
[
]
:
=
(
R
e
v
e
r
s
e
S
o
r
t
@
A
s
s
o
c
i
a
t
i
o
n
T
h
r
e
a
d
[
I
n
t
e
g
e
r
N
a
m
e
[
R
a
n
g
e
[
1
0
0
]
]
-
>
S
t
r
i
n
g
L
e
n
g
t
h
/
@
I
n
t
e
g
e
r
N
a
m
e
[
R
a
n
g
e
[
1
0
0
]
]
]
)
[
[
1
;
;
5
]
]
O
u
t
[
]
=
s
e
v
e
n
t
y
-
e
i
g
h
t
1
3
,
s
e
v
e
n
t
y
-
s
e
v
e
n
1
3
,
s
e
v
e
n
t
y
-
t
h
r
e
e
1
3
,
n
i
n
e
t
y
-
e
i
g
h
t
1
2
,
n
i
n
e
t
y
-
s
e
v
e
n
1
2
23. find the 5 English names for integers up to 100 that have the largest number of “e”s in them.
I
n
[
]
:
=
(
K
e
y
s
@
R
e
v
e
r
s
e
S
o
r
t
@
A
s
s
o
c
i
a
t
i
o
n
T
h
r
e
a
d
[
I
n
t
e
g
e
r
N
a
m
e
[
R
a
n
g
e
[
1
0
0
]
]
-
>
(
L
e
n
g
t
h
/
@
S
t
r
i
n
g
P
o
s
i
t
i
o
n
[
I
n
t
e
g
e
r
N
a
m
e
[
R
a
n
g
e
[
1
0
0
]
]
,
"
e
"
]
)
]
)
[
[
1
;
;
5
]
]
O
u
t
[
]
=
{
s
e
v
e
n
t
y
-
s
e
v
e
n
,
s
e
v
e
n
t
y
-
t
h
r
e
e
,
s
e
v
e
n
t
e
e
n
,
n
i
n
e
t
y
-
s
e
v
e
n
,
n
i
n
e
t
y
-
t
h
r
e
e
}
Section 6: Time and day related questions
There is a common pattern for these questions, they are hard to verify with the expected output, and follow a pattern for next few days (some mention today, some not, in that case the length of the output had to be compared), and some discrepancies are just hard to verify.
1. Compute the number of days since January 1 1900
This answer is hard to verify with the Expected Answer (the Expected Output for such questions need to be updated on a daily basis). Also, the queries from W|A actually match the code as well. Not sure why it is not accepted.
I
n
[
]
:
=
Q
u
a
n
t
i
t
y
[
D
a
y
C
o
u
n
t
[
D
a
t
e
O
b
j
e
c
t
[
{
1
9
0
0
,
1
,
1
}
]
,
T
o
d
a
y
]
,
"
d
a
y
s
"
]
O
u
t
[
]
=
4
4
3
8
5
d
a
y
s
I
n
[
]
:
=
O
u
t
[
]
=
4
4
3
8
5
d
a
y
s
2. Find the length of daylight today by subtracting today’s sunrise form today’s sunset
I have tried this question in different ways, however, I never got it to accept.
I
n
[
]
:
=
S
u
n
s
e
t
[
T
o
d
a
y
]
-
S
u
n
r
i
s
e
[
T
o
d
a
y
]
O
u
t
[
]
=
8
8
9
m
i
n
I
n
[
]
:
=
U
n
i
t
C
o
n
v
e
r
t
[
S
u
n
s
e
t
[
T
o
d
a
y
]
-
S
u
n
r
i
s
e
[
T
o
d
a
y
]
,
M
i
x
e
d
R
a
d
i
x
[
"
H
o
u
r
s
"
,
"
M
i
n
u
t
e
s
"
]
]
O
u
t
[
]
=
1
4
h
4
9
m
i
n
I
n
[
]
:
=
S
u
n
S
T
A
R
d
a
i
l
y
t
i
m
e
a
b
o
v
e
h
o
r
i
z
o
n
O
u
t
[
]
=
1
4
h
4
8
.
m
i
n
I
n
[
]
:
=
S
u
n
s
e
t
[
H
e
r
e
,
T
o
d
a
y
]
-
S
u
n
r
i
s
e
[
H
e
r
e
,
T
o
d
a
y
]
O
u
t
[
]
=
8
8
9
m
i
n
I
n
[
]
:
=
U
n
i
t
C
o
n
v
e
r
t
[
S
u
n
s
e
t
[
H
e
r
e
,
T
o
d
a
y
]
-
S
u
n
r
i
s
e
[
H
e
r
e
,
T
o
d
a
y
]
,
M
i
x
e
d
R
a
d
i
x
[
"
H
o
u
r
s
"
,
"
M
i
n
u
t
e
s
"
]
]
O
u
t
[
]
=
1
4
h
4
9
m
i
n
3. Generate list of icons for the moon phases from today until 10 days from now
Many of these questions refer to from today until 10 days from now, and often require which days to be included. This particular answer never got accepted and I did not expect the Expected Output to match either
I
n
[
]
:
=
M
o
o
n
P
h
a
s
e
[
#
,
"
I
c
o
n
"
]
&
/
@
D
a
t
e
R
a
n
g
e
[
D
a
y
P
l
u
s
[
T
o
d
a
y
,
1
]
,
D
a
y
P
l
u
s
[
T
o
d
a
y
,
1
0
]
]
O
u
t
[
]
=
4. How many weeks have elapsed since January 1, 1900?
Again the coded interpretation match the W|A query but none match the answer in the database. Not sure if it a Round/Floor error, which seem to be the case. There is some ambiguity here.
I
n
[
]
:
=
Q
u
a
n
t
i
t
y
[
R
o
u
n
d
[
N
@
D
a
y
C
o
u
n
t
[
D
a
t
e
O
b
j
e
c
t
[
{
1
9
0
0
,
1
,
1
}
]
,
T
o
d
a
y
]
/
7
]
,
"
w
e
e
k
"
]
O
u
t
[
]
=
6
3
4
1
w
k
I
n
[
]
:
=
O
u
t
[
]
=
6
3
4
1
.
w
k
5. Show in a column the times of the sunrise for the next 10 days starting today
Many of these questions refer to from today until n days from today and often require which days to be included. I often match the number of outputs in the Expected answer but this case it never got accepted.
I
n
[
]
:
=
C
o
l
u
m
n
@
T
a
b
l
e
[
S
u
n
r
i
s
e
[
H
e
r
e
,
D
a
y
P
l
u
s
[
T
o
d
a
y
,
n
]
]
,
{
n
,
0
,
9
,
1
}
]
O
u
t
[
]
=
M
i
n
u
t
e
:
S
a
t
1
0
J
u
l
2
0
2
1
0
5
:
3
3
G
M
T
-
5
M
i
n
u
t
e
:
S
u
n
1
1
J
u
l
2
0
2
1
0
5
:
3
4
G
M
T
-
5
M
i
n
u
t
e
:
M
o
n
1
2
J
u
l
2
0
2
1
0
5
:
3
4
G
M
T
-
5
M
i
n
u
t
e
:
T
u
e
1
3
J
u
l
2
0
2
1
0
5
:
3
5
G
M
T
-
5
M
i
n
u
t
e
:
W
e
d
1
4
J
u
l
2
0
2
1
0
5
:
3
6
G
M
T
-
5
M
i
n
u
t
e
:
T
h
u
1
5
J
u
l
2
0
2
1
0
5
:
3
7
G
M
T
-
5
M
i
n
u
t
e
:
F
r
i
1
6
J
u
l
2
0
2
1
0
5
:
3
8
G
M
T
-
5
M
i
n
u
t
e
:
S
a
t
1
7
J
u
l
2
0