OJ Board

Code: Select all

#include <stdio.h>

unsigned ways;
int chars[26];

unsigned pos (char *str) {
  unsigned i,ret,numforeach;

  if (strlen(str)==2) {
    chars[str[0]-'a']++;
    chars[str[1]-'a']++;
    if (str[0]!=str[1]) ways = 2; else ways = 1;
    return (str[0]>str[1]) ? 1 : 0;
  }

  ret = pos(str + 1);
  chars[str[0]-'a']++;
  ways = (ways*strlen(str))/chars[str[0]-'a'];
  numforeach = ways/strlen(str);
  for (i=0; i+'a'!=str[0]; i++) {
    ret += chars[i]*numforeach;
  }
  return ret;
}

int main () {
  char cur[31];

  while (scanf("%s\n", cur)==1) {
    ways=0;
    memset(chars, 0, sizeof(chars));
    if (cur[0]=='#') break;
    if (strlen(cur)>1) printf("%10u\n", pos(cur)+1);
    else printf("%10u\n", 1);
  }
  return 0;
}

Code: Select all

#include <cstdio> 
#include <algorithm> 

void main() 
{ 
 register int i,n;
 register char guardada[31],cad[31]; 

 while( gets(cad) ) 
 { 
   if( strcmp(cad,"#")==0 ) 
     break; 

   n=strlen(cad); 
   sscanf(cad,"%s",guardada);
   sort(cad,cad+n);

   for(i=1; strcmp(cad,guardada)!=0;++i) 
    next_permutation(cad,cad+n); 

   printf("%10d\n",i);
 } 
} 

Code: Select all

Program permalex;

Var I, J, K, N, Sol : LongInt;
    Ch : Char;
    S, SS : String;
    A : Array ['a' .. 'z'] Of LongInt;

Function GCD (A, B : LongInt) : LongInt;
Begin
  If A = 0 Then GCD := B
  Else GCD := GCD (B Mod A, A);
End;

Function Variantebi (N : LongInt) : LongInt;
Var I, J, K, C, DD, Sol : LongInt;
    B : Array [1 .. 30] Of LongInt;
    D : Array ['a' .. 'z'] Of LongInt;
Begin
  FillChar (D, SizeOf (D), 0);
  For I := 1 To N Do B [I] := I;
  For I := 1 To N Do
    If D [S [I]] = 0 Then Begin
      For J := 2 To A [S [I]] Do Begin
        C := J;
        For K := 0 To N Do Begin
          If C = 1 Then Break;
          DD := GCD (C, B [K]);
          C := C Div DD; B [K] := B [K] Div DD;
        End;
      End;
      D [S [I]] := 1;
    End;
  Sol := 1;
  For I := 1 To N Do Sol := Sol*B [I];
  Variantebi := Sol;
End;

Begin
  While True Do Begin
    ReadLn (S);
    If S [1] = '#' Then Break;
    SS := S; N := Length (S);
    Sol := 0;
    FillChar (A, SizeOf (A), 0);
    For I := 2 To N Do
      For J := 1 To I-1 Do
        If S [I] < S [J] Then Begin Ch := S [I]; S [I] := S [J]; S [J] := Ch; End;
    For I := 1 To N Do Inc (A [S [I]]);
    For K := 1 To N Do Begin
      For I := 1 To N Do Begin
        If S [I] = SS [K] Then Break;
        If ((I = 1) Or (S [I-1] <> S [I])) And (A [S [I]] > 0) Then Begin
          Dec (A [S [I]]);
          Inc (Sol, Variantebi (N-K));
          Inc (A [S [I]]);
        End;
      End;
      Dec (A [SS [K]]);
    End;
    Inc (Sol);
    Str (Sol, S);
    N := 10-Length (S);
    For I := 1 To N Do Write (' ');
    WriteLn (Sol);
  End;
End.

Code: Select all

pos=pos+ f*l;