Pagini recente » Cod sursa (job #771571) | Diferente pentru runda/cercel_e_gay_runda_2 intre reviziile 2 si 3 | Cod sursa (job #1979791) | Arhiva de probleme | Cod sursa (job #1248839)
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<ctime>
using namespace std;
int i,n,a[600005],rs[600005],gmb,fnc;
long long sum;
int main()
{
freopen("congr.in","r",stdin);
freopen("congr.out","w",stdout);
srand(time(NULL));
scanf("%d",&n);
for(i=1;i<n+n;++i)
{
scanf("%d",&a[i]); rs[i]=i;
if(i<=n) sum+=a[i];
}
while(sum%n)
{
gmb=rand()%n+1;
fnc=rand()%(n-1)+n+1;
sum-=a[gmb]; sum+=a[fnc];
swap(rs[gmb],rs[fnc]);
swap(a[gmb],a[fnc]);
}
for(i=1;i<=n;++i) printf("%d ",rs[i]);
return 0;
}