Pagini recente » Istoria paginii runda/simulare_oji2015/clasament | Istoria paginii runda/test1234qwerty | Istoria paginii utilizator/horatiuros | Istoria paginii runda/de_ce_sa_ne_certam_iubi/clasament | Cod sursa (job #2451830)
#include <fstream>
using namespace std;
ifstream in ("caesar.in");
ofstream out ("dbftbs.out");
int main ()
{
int c1;
in>>c1;
if (c1==1)
{
int N,W,X,P,sol=0;
in>>N>>W>>X>>P;
if (W < P - 1)
sol=W;
if (W >= P - 1 && P >= X + 1)
sol= W + X;
if (W >= P-1 && P < X + 1 && W <= N -1 )
sol= P-1+W;
if (W >= P - 1 && P < X + 1 && W >= N)
sol= P-1 + ( ( X - ( P - 1 ) ) / N + 1 ) * N + ( W - N ) + ( X - ( P - 1 ) ) % N;
out<<sol;
}
else;
return 0;
}