夢追い人

"It takes a dreamer to make a dream come true."―Vincent Willem van Gogh

地震すごいね。

久しぶりに来た地震はめちゃくちゃ大きかったですねw

しかも合宿場所だったところにまた津波警報(神栖市)。

やばいっすね。


ちなみに昆布についてはあの後正式に部長さんからお誘いを受けて月曜から入ることになりました☆


さてさて、前置きはこのくらいにしてAOJです。
ちょっと幾何は直感的にわからないので先に0013をやりました。

0013

 /*
This figure shows railway tracks for reshuffling cars. The rail tracks end in the bottom and the top-left rail track is used for the entrace and the top-right rail track is used for the exit. Ten cars, which have numbers from 1 to 10 respectively, use the rail tracks.

We can simulate the movement (comings and goings) of the cars as follow:

An entry of a car is represented by its number.
An exit of a car is represented by 0
For example, a sequence

1 6 0 8 10
demonstrates that car 1 and car 6 enter to the rail tracks in this order, car 6 exits from the rail tracks, and then car 8 and car 10 enter.

Write a program which simulates comings and goings of the cars which are represented by the sequence of car numbers. The program should read the sequence of car numbers and 0, and print numbers of cars which exit from the rail tracks in order. At the first, there are no cars on the rail tracks. You can assume that 0 will not be given when there is no car on the rail tracks.
 */
 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	vector<int> cars(100000), ans;
	int temp, i=0, m;
	while (cin >> temp) {
		if (temp != 0) {
			cars[i] = temp;
			i++;
		} else {
			int p = i-1;
			if (p >= 0) {
				ans.push_back(cars[p]);
				i--;
			}
		}
	}
	for (int j=0; j<ans.size(); j++)
		cout << ans[j] << endl;
	return 0;
}

またもや大分配列の扱いに苦しんだ(;´Д`)
あとp < 0にする凡ミスもしたしw

vectorの関数に頼ってもまったく無知なのもどちらもダメなんすねw

広告を非表示にする