OJ Board

Code: Select all

#include<stdio.h>
struct asci{
	int val,pos;
};
void main()
{
	asci a[256],temp;
	int i=0,j=0;
	char line[1000];

	while(gets(line))
	{
		for(i=31;i<='z';i++)
		{
			a[i].pos=i;
			a[i].val=0;
		}
	for(i=0;line[i];i++)
		if(line[i]>31&&line[i]<='z')
			a[line[i]].val+=1;
	for(i=31;i<='z';i++)
		for(j=i+1;j<='z';j++)
		{

			if(a[i].val>a[j].val)
			{
				temp=a[i];
				a[i]=a[j];
				a[j]=temp;
			}
			else if(a[i].val==a[j].val)
			{
				if(a[i].pos<a[j].pos)
				{
					temp=a[i];
					a[i]=a[j];
					a[j]=temp;
				}
			}


		}
	for(i=31;i<='z';i++)
	{
		if(a[i].val)
			printf("%d %d\n",a[i].pos,a[i].val);
	}
	printf("\n");
	}


}

Code: Select all

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>
using namespace std;
int main()
{
	char str[3000],temp,ch[3000];
	int i,j,l,num[3000],m,t,k,count,c,a;	
	queue<char> Q;
	
	
	while(scanf("%s",str)!=EOF)
	{
		l=strlen(str);
		sort(str,str+l);
		
		for(i=0; i<l; i++)	
			Q.push(str[i]);
				
		m=0;
		num[m]=1;ch[m]=Q.front();
		Q.pop();
		
		while(!Q.empty())
		{
			if(Q.front()==ch[m])
			{
				Q.pop(); num[m]++;
			}
			else if(Q.front()!=ch[m])
			{
				m++;
				ch[m]=Q.front(); num[m]=1;
				Q.pop();
			}
				
		}
		
		
		for(i=0; i<=m-1; i++)
		{
			for(j=0; j<=m-1-i; j++)
			{
				if(num[j]>num[j+1])
				{
					t=num[j];
					num[j]=num[j+1];
					num[j+1]=t;
					temp=ch[j];
					ch[j]=ch[j+1];
					ch[j+1]=temp;
					
				}
				else if(num[j]==num[j+1])
				{
					if(ch[j]<ch[j+1])
					{
						temp=ch[j];
						ch[j]=ch[j+1];
						ch[j+1]=temp;
						
						t=num[j];
						num[j]=num[j+1];
						num[j+1]=t;
					}
				}
			}
		}
		
		for(i=0; i<=m; i++)	
			{c=ch[i]; cout <<c<<" "<< num[i]<<endl;}
			
		cout <<endl;

	}	 
	return 0;
}

Code: Select all

#include<stdio.h>
struct asci{
	int val,pos;
};
void main()
{
	//freopen("h:\\out2.txt","w",stdout);
	asci a[256],temp;
	int i=0,j=0,flag=0;
	char line[1000];

	while(gets(line))
	{
		if(flag)
			printf("\n");
		else
			flag=1;
		for(i=31;i<='z';i++)
		{
			a[i].pos=i;
			a[i].val=0;
		}
	for(i=0;line[i];i++)
		if(line[i]>31&&line[i]<='z')
			a[line[i]].val+=1;
	for(i=31;i<='z';i++)
		for(j=i+1;j<='z';j++)
		{

			if(a[i].val>a[j].val)
			{
				temp=a[i];
				a[i]=a[j];
				a[j]=temp;
			}
			else if(a[i].val==a[j].val)
			{
				if(a[i].pos<a[j].pos)
				{
					temp=a[i];
					a[i]=a[j];
					a[j]=temp;
				}
			}


		}
	for(i=31;i<='z';i++)
	{
		if(a[i].val)
			printf("%d %d\n",a[i].pos,a[i].val);
	}
	
	}

//fclose(stdout);
}

Code: Select all

//code removed

Code: Select all

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
char s[1001];
int counter[128];
void count();
 int main()
{int c,j;

     while(fgets(s,1001,stdin))
     {s[strlen(s) - 1 ] = '\0';

       for(c=0;c<128;c++)
            counter[c]=0;

          count();

       for(j=1;j<1001;j++)
          for(c=127;c>=32;c--)
            if(counter[c]==j)
             printf("%d %d\n",c,counter[c]);

        printf("\n");
     }
return 0;
}
void count()
{int i,c;
   for(c=0;s[c]!='\0';c++)
    for(i=32;i<128;i++)
     if(s[c]==i)
        counter[i]++;
return;
}

Code: Select all

#include <stdio.h>
#include <string.h>

int main()
{
    char ch[1001];
    int i,asc,temp,temp2,ch_temp,ch_temp2,ch_num;

    while (gets(ch))
    {
        int l[1001]={0},k[1001]={0},q=0,w=0,e;
        ch_num=strlen(ch);
        for (i=0;i<ch_num;i++)
        {
            asc=ch[i];
            l[asc]++;
        }
        for (i=32,e=0;i<128;i++)
        {
            if (l[i]!=NULL)
            {
                ch[e]=i;
                k[e]=l[i];
                e++;
            }
        }
        //sorting part according the frequencies
        for (i=0,temp=k[0],ch_temp=ch[0];i<e;i++)
        {
            if (temp>k[i])
            {
                temp2=temp;
                temp=k[i];
                k[i]=temp2;
                k[w]=temp;
                ch_temp2=ch_temp;
                ch_temp=ch[i];
                ch[i]=ch_temp2;
                ch[w]=ch_temp;
            }
            if (q==e-1)
            {
                w++;
                q=w-1;
                temp=k[w];
                ch_temp=ch[w];
                i=w-1;
            }
            q++;
        }
        //sorting part acording the ASCII, if the frequency is same
        for (i=0;i<e;i++)
        {
            if (k[i]==k[i+1])
            {
                if (ch[i]<ch[i+1])
                {
                    ch_temp=ch[i];
                    ch_temp2=ch[i+1];
                    ch[i]=ch_temp2;
                    ch[i+1]=ch_temp;
                    i=-1;
                }
            }
        }
        //print part
        for (i=0;i<e;i++)
        {
            printf("%d %d\n",ch[i],k[i]);
        }
        printf ("\n");
    }
}

Code: Select all

DELETED

Code: Select all

Thanks I get Accepted.