Pagini recente » Cod sursa (job #1528110) | Cod sursa (job #571364) | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #2015678)
#include <fstream>
#define dim 1001
using namespace std;
short int urm[dim],i,ii,j,N,k,p;
int main()
{
ifstream f("portocal.in");
ofstream g("portocal.out");
short int poz,k2,m;
bool ok=1;
f>>N>>k>>p;
/******************************************/
for(i=0;i<N;++i)
urm[i]=i+1;
urm[N]=1;
//eliminari
poz=N;
for(ii=1;ii<N;++ii) //vor fi N-1 eliminari
{
k2=k%(N-ii+1);
if(k2==0) k2=(N-ii+1);
for(j=1;j<k2;j++)
poz=urm[poz];
//elimin urm[poz]
// g<<" *Elimin din sir "<<urm[poz]<<'\n';
urm[poz]=urm[urm[poz]];
}
//g<<" *Mai ramane in sir "<<poz<<'\n'<<'\n';
/******************************************/
if(poz<=p)
m=p-poz+1;
else
m=N+p-poz+1;
g<<m<<'\n';
return 0;
}