Pagini recente » Cod sursa (job #972181) | Cod sursa (job #1074208) | Cod sursa (job #2760830) | Cod sursa (job #1831631) | Cod sursa (job #2750439)
//#include <iostream>
#include <fstream>
using namespace std;
class Node{
public:
Node* next;
int value;
};
int main()
{
ifstream cin ("schi.in");
ofstream cout ("schi.out");
Node* first = new Node();
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
Node* current = new Node();
Node* prev = first;
current->value = i+1;
int steps;
cin >> steps;
for(int j = 1; j < steps; j++)
prev = prev->next;
current->next = prev->next;
prev->next = current;
}
first = first->next;
for(int i = 0; i < n; i++)
{
cout << first->value << "\n";
first = first->next;
}
return 0;
}