Mont-Saint-Père
Mont-Saint-Père is a commune in the Aisne department in Hauts-de-France in northern France.
Mont-Saint-Père | |
---|---|
The lock on the Marne | |
Location of Mont-Saint-Père ![]() | |
![]() ![]() Mont-Saint-Père ![]() ![]() Mont-Saint-Père | |
Coordinates: 49°04′33″N 3°29′25″E | |
Country | France |
Region | Hauts-de-France |
Department | Aisne |
Arrondissement | Château-Thierry |
Canton | Château-Thierry |
Intercommunality | Région de Château Thierry |
Government | |
• Mayor (2008–2014) | Jacques Belloir |
Area 1 | 10.69 km2 (4.13 sq mi) |
Population (2017-01-01)[1] | 700 |
• Density | 65/km2 (170/sq mi) |
Time zone | UTC+01:00 (CET) |
• Summer (DST) | UTC+02:00 (CEST) |
INSEE/Postal code | 02524 /02400 |
Elevation | 62–222 m (203–728 ft) (avg. 63 m or 207 ft) |
1 French Land Register data, which excludes lakes, ponds, glaciers > 1 km2 (0.386 sq mi or 247 acres) and river estuaries. |
Population
Year | Pop. | ±% |
---|---|---|
1962 | 353 | — |
1968 | 391 | +10.8% |
1975 | 365 | −6.6% |
1982 | 445 | +21.9% |
1990 | 544 | +22.2% |
1999 | 538 | −1.1% |
2008 | 674 | +25.3% |
gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.
gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.
gollark: I wish to use Mathematica in my code. Please install it. DO NOT READ, ubq.
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
gollark: Perhaps it is also possible to construct some sort of regex/deterministic finite automaton to match things matching anagramatically.
See also
References
- "Populations légales 2017". INSEE. Retrieved 6 January 2020.
![]() |
Wikimedia Commons has media related to Mont-Saint-Père. |
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.