You can just count letters

Edited by author 25.03.2021 01:13

http://ideone.com/06yGHW

Maybe someone could improve that solution and get AC with it.  Current status of that code is WA#8. I think it is quite boring and tedious to upgrade it to AC.  Maybe you can see how to upgrade it with small effort.

Here is my program,I have taken WA on the test of 2, I think it is correct,please tell me what is wrong,please if you can..

program fillword;
var a:array[1..10] of string;
    b,k:array[1..100] of string;
    i,j,n,m,p,t:integer;
    ch:char;
    l,r:string;
begin
 read(n,m,p);
 readln;
 for i:=1 to n do
  readln(a[i]);
 for j:=1 to p do
  readln(b[j]);
 for i:=1 to p do
  for j:=1 to n do
   if b[i]=a[j] then begin t:=t+1; k[t]:=b[i];  break; end;
 for i:=1 to t do
  begin
   r:='';
   l:=k[i];
   for ch:='A' to 'Z' do
    for j:=1 to m do
     if ch=l[j] then r:=r+ch;
   writeln(r);
  end;
end.

It's not clear if each word must be found in the grid only once. Maybe task should be edited.

I am Output Limit Exceed. my source is in C++. Here this is:

#include<iostream.h>
#include<string.h>
main()
{
int len,temp,i;
int n,m,j,p;
char ch[12][12],word[15];
char letter;
long int array[30];
for(i=0;i<27;i++)
array[i]=0;
cin>>n>>m>>p;
for(i=1;i<=n;i++)
cin>>ch[i];
for(i=1;i<=p;i++){
cin>>word;
len=strlen(word);
for(int k=0;k<len;k++){
temp=word[k];
array[temp-64]--;
}}
for(i=1;i<=n;i++)
for(j=0;j<m;j++){
temp=ch[i][j];
array[temp-64]++;
}
for(i=1;i<27;i++){
temp=array[i];
letter=i+64;
while(temp!=0){
cout<<letter;
temp--;
}}
cout<<endl;
return 0;
}

I use one array of int. It size is 256. Good luck!!!

var a:array[0..25] of integer; i,j,n,m,p:integer; ch:char;

begin
readln(m,n,p);

for i:=1 to n do begin
for j:=1 to m do begin
read(ch);
inc(a[ord(ch)-ord('A')]);
end;
readln;
end;

for i:=1 to p do begin
while not eoln do begin
read(ch);
dec(a[ord(ch)-ord('A')]);
end;
readln; end;

for i:=0 to 25 do
if a[i]>0 then for j:=1 to a[i] do write(chr(ord('A')+i));
end.

//---------------------------------------------------------------------------
...
scanf("%d %d %d\n",&M,&N,&P);
...
I have used a simple algo, but got WA... maybe format mistake?




Edited by author 03.10.2008 14:24

Please send me the meaning of problem to snipious@mail.ru!!!

I know I can calculate the anwser directly,but I used DFS algorithm at first.I think it can solve this problem too,but I got WA on test #10,who can tell me WHY? thx.

My code:

/* ural1164 */

#include<iostream>
#include<string.h>

using namespace std;

const way[4][2]={{1,0},{0,-1},{-1,0},{0,1}};

int m,n,p;
char map[15][15];
bool check[15][15];
bool flag,fflag;
char word[150][300];

void init()
{
    int i,j;
    cin>>n>>m>>p;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++) cin>>map[i][j];
    for(i=1;i<=p;i++) cin>>word[i];
    fflag=false;
}

void find(int x,int y,int d,int l)
{
    int i,xx,yy;
    if(flag) return;
    check[x][y]=true;
    if(l==strlen(word[d])+1)
    {
        flag=true;
        return;
    }
    for(i=0;i<=3;i++)
    {
        xx=x+way[i][0];
        yy=y+way[i][1];
        if(map[xx][yy]==word[d][l-1] && !check[xx][yy])
            find(xx,yy,d,l+1);
    }
    if(flag) return;
    check[x][y]=false;
    return;
}


void out()
{
    int i,j,l;
    char w;
    char ans[300],*p;
    p=ans;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            if(!check[i][j])
                *(p++)=map[i][j];
    *p='\0';
    l=strlen(ans);
    for(i=l-1;i>=0;i--)
        for(j=0;j<=i-1;j++)
            if(ans[j]>ans[j+1])
            {
                w=ans[j];
                ans[j]=ans[j+1];
                ans[j+1]=w;
            }
    cout<<ans<<endl;
}


void search(int x)
{
    bool check1[15][15];
    int i,j;
    if(x==p+1)
    {
        out();
        fflag=true;
    }
    if(fflag) return;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            if(map[i][j]==word[x][0] && !check[i][j])
            {
                memmove(check1,check,sizeof(check));
                flag=false;
                find(i,j,x,2);
                if(flag) search(x+1);
                memmove(check,check1,sizeof(check1));
            }
}



void work()
{
    memset(check,false,sizeof(check));
    search(1);
}



int main()
{
    init();
    work();
    return 0;
}

I use a recursive algorithm, but get TIME LIMIT EXCED.

#include <stdio.h>

void main()
{
    long n,m,p,i,j,a[27]={0};
    char c;
    scanf("%ld %ld %ld\n",&n,&m,&p);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            scanf("%c",&c);
            a[c-64]++;
        }
    }
    for(i=1;i<=p;i++)
    {
    zy:    scanf("%c",&c);
        if(c=='\n') goto zy;
        else a[c-64]--;
        while(c>='A'&&c<='Z')
        {
            scanf("%c",&c);
            a[c-64]--;
        }
    }
    for(i=1;i<=26;i++)
        for(j=1;j<=a[i];j++)
            printf("%c",i+64);
}

Why I got WA!!!HelpHelpHelp!This is my grogram:

var
  Save : array ['A' .. 'Z'] of longint;
  n, m, p, i, j : longint;
  c : char;
begin
  fillchar (Save, sizeof (Save), 0);
  readln (n, m, p);
  for i := 1 to n do
    begin
      for j := 1 to m do
        begin
          read (c);
          Save [c] := Save [c] + 1;
        end;
      readln;
    end;
  for i := 1 to p do
    begin
      for j := 1 to m do
        begin
          read (c);
          Save [c] := Save [c] - 1;
        end;
      readln;
    end;
  for c := 'A' to 'Z' do
    for i := 1 to Save [c] do
      write (c);
end.

const
 max=10;
 maxp=100;

var
 g:array[1..max,1..max]of char;
 lt:array[1..max,1..max]of byte;
 pri:array['A'..'Z']of byte;
 m,n,p,mark:integer;
 s:string;
procedure find_work(t,x,y:integer);
  var i,j:integer;
 begin
  if t>m then begin mark:=1;exit;end;
   for i:=1 to n do
    for j:=1to m do
     if(s[t]=g[i,j])and((abs(i-x)+abs(j-y)=1)or((x=0)and(y=0)))
      then begin
       inc(lt[i,j]);
       find_work(t+1,i,j);
       if mark=1 then exit;
       dec(lt[i,j]);
      end;
 end;
procedure init_work;
  var i,j:integer;
 begin
  fillchar(g,sizeof(g),0);
  fillchar(lt,sizeof(lt),0);
  fillchar(pri,sizeof(pri),0);
  readln(n,m,p);
  for i:=1 to n do
   begin
    for j:=1 to m do read(g[i,j]);
    readln;
   end;
  for i:=1 to p do
   begin
    readln(s);
    mark:=0;
    find_work(1,0,0);
   end;
  end;
procedure outit_work;
  var ch:char;
      i,j:integer;
 begin
  for i:=1 to n do for j:=1 to m do if lt[i,j]=0 then inc(pri[g
[i,j]]);
  for ch:='A' to 'Z' do
   for i:=1 to pri[ch] do write(ch);
 end;
begin
 init_work;
 outit_work;
end.

Maybe I did not understand my task right?!
Here is my program:

program p1164;
var
   n,m,p : integer;
   a : array['A'..'Z'] of integer;
   i : integer;
   j : integer;
   ch : char;
begin
  fillchar(a,sizeof(a),0);
  readln(n,m,p);
  for i:=1 to n do
  begin
    for j:=1 to m-1 do
    begin
      read(ch);
      inc(a[ch]);
    end;
    readln(ch);
    inc(a[ch]);
  end;
  for i:=1 to p do
  begin
    for j:=1 to m-1 do
    begin
      read(ch);
      dec(a[ch]);
    end;
    readln(ch);
    dec(a[ch]);
  end;

 for ch:='A' to 'Z' do
 begin
   for i:=1 to a[ch] do Write(ch);
 end;
 writeln;
end.

subj