OJ Board

Code: Select all

Acc

Code: Select all

h
ghum
aylnlfdx
ircvs
xg
bw
fnqduxwf
fozvsrtkj
r
pggxrpnr
ystmwcysy
cqpe
ikeffmzni
kkas
w
renz
ycxfxtls
ypsf
dpooef
zbcoeju
pvabo


o
ylfpbn
ljvrvip
amyehwqn
rq
mxujjloov
owuxwh
sncbxcok
fzkvatxd

lyjyhfi
jswnkkufn
xx
rzb
nmgq
oketlyhn
oa
gz

cddiute
ojwa
yz
vsc
psajlf
gubfaao
lzy
n
#

Code: Select all

         1
         2
      2367
        32
         2
         1
      4212
     15090
         1
      1947
     23846
         6
     40332
         6
         1
        13
     17903
        22
        59
      4333
        91
         1
         1
         1
       659
       833
      2046
         2
     39961
        96
     16640
     14716
         1
      1773
     17573
         1
         4
        15
     26723
         2
         1
         1
        12
        16
         1
         6
       580
      1771
         2
         1

Code: Select all

#include <cstdio>
#include <cstring>
#define MAXLENGTH 32
using namespace std;

bool nextPer(char a[],int length)
{
	register int index,next_min;
	char tmp;
	for(index=length-2;index>=0;index--)
		if(a[index]<a[index+1])
			break;
	if(index<0)
		return false;
	next_min=index+1;
	for(int i=index+1;i<length;i++)
		if(a[i]>a[index]&&a[i]<a[next_min])
			next_min=i;
	tmp = a[index];
	a[index] = a[next_min];
	a[next_min] = tmp;
	
	for(int i=index+1;i<length-1;i++)
	{
		next_min = i;
		for(register int j=i+1;j<length;j++)
			if(a[j]<a[next_min])
				next_min=j;
		tmp = a[i];
		a[i] = a[next_min];
		a[next_min] = tmp;
	}
	return true;
}

int main()
{
	char string[MAXLENGTH],orig[MAXLENGTH],tmp;
	int index,length;

	while(scanf("%s",string),*string!='#')
	{
		length = strlen(string);
		strcpy(orig,string);
		for(int i=0;i<length-1;i++)
		{
			index = i;
			for(int j=i+1;j<length;j++)
				if(string[j]<string[index])
					index = j;
			tmp = string[index];
			string[index] = string[i];
			string[i] = tmp;
		}
		index = 1;
		do
		{
			if(!strcmp(string,orig))
				break;
			index++;
		}while(nextPer(string,length));

		printf("%10d\n",index);
	}	
	return 0;
}

Code: Select all

xzbcoeju
aboygp
eylfp
npljvrvi

Code: Select all

     34573
        11
        21
      8782

Code: Select all

xzbcoejuvp
aboygp
eylfp
npljvrvi

Code: Select all

   3225844
        11
        21
      2930

Code: Select all

Code Removed

Code: Select all

sdfretf
gggfrtttereee
dfffrrrdfdf
zzffffferrrre
aaseajwelrkjlsdj
ewrwerjwelrjwe
#

Code: Select all

     1826
   1801379
      1130
    535920
1468380809
   3265624

Code: Select all

using namespace std;
#include <iostream>
#include <stdlib.h>
#include <string>
#include <new>
#include <algorithm>
#include <iomanip>

/*
currently suffering the dreaded wrong output
-I know it works for arrays of length 1-5 (regardless of character values)
-I have looked on the help board and tried other peoples input and I have gotten identical output
-I am assuming either I am messing up the output or messing up some fringe cases
*/

int permutations(string);

//finds the permutations of a sorted string (does not double count)
int permutations(string list)
{
	int length=list.length();
	long int sum =1;
	if (length==0)
		return(0);
	if (length == 1)
		return(sum);

	for(int counter=2; counter<=length;counter++)
	{
		sum=sum*counter;
	}
	
	int count=1;
	for(int j=1;j<length;j++)
	{
		if(list[j-1]==list[j])
		{

			count++;
			sum=sum/count;
		}
		else
			count=1;
		
	}
	return(sum);
	
}

//runs the program
int main()
{
	string tested;
	cin>>tested;
	string test="#";
	while( tested!=test)
	{
		int length=tested.length();
		string sorted =tested;
		sort(sorted.begin(), sorted.end());
		long int sum=1;
		
		
		for(length;length>1;length--)
		{
			int i=0;
			while(sorted[i]!=tested[0])	//test for first letter and find its place
			{
				string temp=sorted;
				temp.erase(i,1);
				sum+=permutations(temp);
				while(sorted[i]==sorted[i+1])
				{
					i++;
				}
				i++;
			}
			
			tested.erase(0,1);
			sorted.erase(i,1);
		}
		std::cout << std::right << std::setw(11) << sum << std::endl;

		cin>>tested;
	}
}