Pagini recente » Cod sursa (job #2416508) | Cod sursa (job #3210224) | Cod sursa (job #2313201) | Cod sursa (job #2055209) | Cod sursa (job #379824)
Cod sursa(job #379824)
#include <fstream>
#include <cstdlib>
using namespace std;
#define in "sdo.in"
#define out "sdo.out"
const int NMAX = 3000005;
int A[NMAX], N, K;
int Part( int st, int dr)
{
int i, j, pivot;
i = rand()%(dr-st+1)+st;
pivot = A[i];
i = st - 1, j = dr + 1;
while ( 1 )
{
do { j--; } while ( A[j] > pivot );
do { i++; } while ( A[i] < pivot );
if ( i < j )
{
A[i] ^= A[j];
A[j] ^= A[i];
A[i] ^= A[j];
}
else return j;
}
}
int Get( int K, int st, int dr )
{
return 1;
}
int main( void )
{
freopen ( in, "r", stdin );
freopen ( out, "w", stdout );
scanf ( "%d%d", &N, &K );
int i;
for ( i = 1; i <= N; scanf("%d",A+i++ ) );
printf ( "%d\n", Get(K,1,N) );
return 0;
}