Pagini recente » Borderou de evaluare (job #2022114) | Cod sursa (job #3174981) | Cod sursa (job #328903) | Cod sursa (job #3253581) | Cod sursa (job #999194)
Cod sursa(job #999194)
#include <iostream>
#include <fstream>
#include <ctime>
#include <cstdlib>
#include <vector>
#define nmax 600005
using namespace std;
vector <int> used, unused;
int v[nmax];
int p, x, y, aux, s = 0;
int main() {
srand((unsigned)time(0));
ifstream f("congr.in");
ofstream g("congr.out");
f>>p;
for(int i=1; i<2*p; i++) {
f>>v[i];
v[i] %= p;
}
for(int i=1; i<=p; i++) {
used.push_back(i);
s += v[i];
}
for(int i=p+1; i<2*p; i++) unused.push_back(i);
while(s % p != 0) {
x = rand() % used.size();
y = rand() % unused.size();
s = s - v[used[x]] + v[unused[y]];
aux = used[x];
used[x] = unused[y];
unused[y] = aux;
}
for(int i=0; i<used.size(); i++)
g<<used[i]<<" ";
g<<"\n";
return 0;
}