PKU 1989. The Cow Lineup. [판정:WA]

스파킹 미안 -_-;

난 이게 한계임

#include <iostream> int N, K; int *cows; int seek( int ary[] ); int main() { int i; scanf("%d %d", &N, &K); cows = new int[N]; for( i = 0; i < N; i++ ) { scanf("%d", &cows[i]); } printf("%d\n", seek(cows)); return 0; } int seek( int ary[] ) { if( K == 1 ) return N+1; if( K > N ) return 1; int x, y, z; int *check; int power = 1; // K's exponent, caution: overflow int bound; if( N % K == 0 ) bound = N / K; else bound = N / K + 1; for( x = 1; x <= bound; x++ ) { check = new int[x]; for( y = 1; y <= x; y++ ) { power *= K; } for( y = 0; y < power; y++ ) { int temp = y; // Knary likes Binary, or Keiadecimal likes Hexadecimal :) for( z = x-1; ; z-- ) { check[z] = temp % K + 1; temp /= K; if( temp <= 0 ) break; } temp = 0; for( z = 0; (z < N) && (temp < bound); z++ ) { if( ary[z] == check[temp] ) temp++; } if( temp != bound ) return bound; } delete[] check; } return bound+1; }