Răspuns:
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("paresort.in");
ofstream g("paresort.out");
short fr[10000], num, i, j, n, m;
int main()
{
f >> n;
for (i=1; i<=n; ++i)
{
f >> num;
if (num%2==0)
{
++m; ++fr[num];
}
}
if (m==0) g << "nu exista";
else {
g << m << "\n";
for (i=2; i<10000; i+=2)
{
if (fr[i])
for (j=1; j<=fr[i]; ++j)
g << i << " ";
}
}
}
Explicație:
#include <iostream>
using namespace std;
int v[1001], w[1001];
int main()
{
int n, i, t, j;
cin >> n;
for (i=1; i<=n; ++i)
{
cin >> v[i]; w[i]=i;
}
for (i=1; i<n; ++i)
{
for (j=i+1; j<=n; ++j)
{
if (v[j]<v[i]) { t=v[i]; v[i]=v[j]; v[j]=t;
t=w[i]; w[i]=w[j]; w[j]=t; }
}
}
for (i=1; i<=n; ++i) cout << w[i] << " ";
cout << "\n";
return 0;
}