I used next_permutation and get AC

There are at LEAST, 70 tests.

int main(int argc,char *argv[]){
    //freopen("data.txt","r",stdin);
    int n,i,key = 0,count = 0;
    char p[105],input[105];
    scanf("%d",&n);
    getchar();
    for(i = 0; i < n; i++){
        scanf("%c",&input[i]);
        getchar();
    }
    input[i] = '\0';
    strcpy(p,input);
    while(next_permutation(p,p+n)){
        if(strcmp(p,input) == 0){
            break;
        }
        else {
            count++;
            if(count >= 5){
                printf("Yes\n");
                return 0;
            }
        }
    }
    if(count >= 5){
        printf("Yes\n");
    }
    else {
        printf("No\n");
    }
}

I didn't know anything about combinations but now I know, so I can give link(explaining on Russian) http://www.mathprofi.ru/zadachi_po_kombinatorike_primery_reshenij.html
Sorry if I have some mistakes with English :)

next_permutation() generates distinct permutations of a given iterable object (vector, string, etc). Just make 6 permutations, and save each of them in a set<vector<int> >. Finally, check if the size of the set is 6, because the set only saves different elements. Pretty easy solution.

wrong ans #26.Is there any test.

// code deleted

Edited by author 17.06.2015 01:38

I'm wondering if anyone knows the 13th test... i think it's some kind of special case.

i had 9 wroung attempts, 10 was AC lol

My code:

/*
Code deleted.
*/

we get the WA12.

What's the problem?

Edited by author 09.11.2013 22:57

tried tons of optimizations but Scala solution still TLE, any suggestions?

if you deal with n>5 and n<=5 cases separately. The former does not require any factorial calculation

Edited by author 18.02.2014 14:04

Ребята будьте внимательный когда читаете условия. Я потратил пол часа пока понял что нужно составить не менее 6 а не не менее n слов...

I test the 13th case which has been given before but it gives WA for test 13.
please can any body tell me what's the wrong