Arato Station
Arato Station (荒砥駅, Arato eki) is a railway station in Shirataka, Yamagata, Japan, operated by the Yamagata Railway.
Arato Station 荒砥駅 | |
|---|---|
 Arato Station in March 2007 | |
| Location | Ōaza Arato-kō, Shirataka, Nishiokitama, Yamagata （山形県西置賜郡白鷹町大字荒砥甲） Japan |
| Coordinates | 38°11′17″N 140°05′51″E |
| Operated by | Yamagata Railway |
| Line(s) | Flower Nagai Line |
| Connections |
|
| History | |
| Opened | 1923 |
Lines
Arato Station is a terminal station on the Flower Nagai Line, and is located 30.5 rail kilometers from the opposing terminus of the line at Akayu Station.
Station layout
Arato Station has a single side platform.
History
Arato Station opened on 22 April 1923. The station was absorbed into the JR East network upon the privatization of JNR on 1 April 1987, and became a station on the Yamagata Railway from 25 October 1988.
Surrounding area
- Shirataka Town Hall
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; if (bees[i1] == 0) { if (bees[i1] = 64) {} } bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); sort(q, 8); printf("%s", q);}```
gollark: Interesting.
gollark: tio!debug
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); sort(q, 8); printf("%s", q);}```
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); printf("%s", q);}```
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.