Pagini recente » Cod sursa (job #3283322) | Cod sursa (job #2818506) | Cod sursa (job #1132974) | Cod sursa (job #1003130) | Cod sursa (job #1511338)
#include<iostream>
#include<fstream>
#include<cstdlib>
#include<ctime>
using namespace std;
int p,a[600000],ok;
bool upoz[600000];
inline void mod(int *x){
while(*x>=p) *x-=p;
}
int main(){
ifstream in("congr.in");
ofstream out("congr.out");
int i,s,pc;
in>>p;
for(i=1;i<p+p;++i){
in>>a[i];
mod(a+i);
}
while(!ok){
for(i=1;i<=p+p-1;++i) upoz[i]=0;
s=0;
for(i=1;i<=p;++i){
do{
pc=rand()%(p+p-1)+1;
}while(upoz[pc]==1);
upoz[pc]=1;
s+=a[pc];
mod(&s);
}
if(s==0) ok=1;
}
for(i=1;i<=2*p-1;++i) if(upoz[i]==1) out<<i<<' ';
out<<'\n';
}