#include <iostream.h>
#include <fstream.h>
#include <string.h>
int main()
{
char a[100][30],b[100][30];
int i,j;
int T1,T2;
int flag1[10],flag2[10];
ifstream f1("a.txt");
ifstream f2("b.txt");
for(i=0;i<10;i++)
flag1[i]=flag2[i]=0;
for(i=0;i<100;i++)
{
 f1>>a[i];
 if(strcmp(a[i],"0")==0)
 {
  T1=i;
  break;
 }
}
for(i=0;i<100;i++)
{
 if(f2>>b[i]) ;
 if(strcmp(b[i],"0")==0)
 {
  T2=i;
  break;
 }
}
f1.close();
f2.close();
cout<<"a.txt";
for(i=5;i<=20;i++)
cout<<" ";
cout<<"   ";
cout<<"b.txt";
for(i=5;i<=20;i++)
cout<<" ";
cout<<"type\n";
for(i=0;i<=22;i++)
cout<<"-";
cout<<"+";
for(i=0;i<=21;i++)
cout<<"-";
cout<<"+----";
cout<<endl;
for(i=0;i<T1;i++)
{
 int flag=0,pos;
 for(j=0;j<T2;j++)
 if(strcmp(a[i],b[j])==0)
 {
  flag=1;
  pos=j;
  break;
 }
 if(flag==1) {flag1[i]=1;flag2[pos]=1;}
 else
  flag1[i]=2;
}
i=0;j=0;
while(1)
{
 int p,k;
 if(i<T1)
 {
 if(flag1[i]==1)
 {
  cout<<a[i];
  for(p=strlen(a[i]);p<=20;p++)
   cout<<" ";
  cout<<"   ";
  cout<<a[i];
  for(p=strlen(a[i]);p<=20;p++)
   cout<<" ";
  cout<<"   OK\n";
 }
 else
 {
  cout<<a[i];
  for(p=strlen(a[i]);p<=20;p++)
   cout<<" ";
  cout<<"   -";
  for(p=0;p<20;p++)
   cout<<" ";
  cout<<"  Del\n";
 }
 i++;
 }
 if(j<T2)
 {
 if(flag2[j]!=1)
 {
  cout<<"-";
  for(p=0;p<20;p++)
   cout<<" ";
  cout<<"   ";
  cout<<b[j];
  for(p=strlen(b[j]);p<=20;p++)
   cout<<" ";
  cout<<"  Add\n";
 }
 j++;
 }
 if(i==T1 && j==T2)
  break;
}
}

a.txt

girl
nellsehreiber
Louse
numbered
assume
0

b.txt

girl
symmetrical
nellsehreiber
routine
numbered
design
assume
0

output:

a.txt                   b.txt                type
-----------------------+----------------------+----
girl                    girl                    OK
nellsehreiber           nellsehreiber           OK
-                       symmetrical            Add
Louse                   -                      Del
numbered                numbered                OK
-                       routine                Add
assume                  assume                  OK
-                       design                 Add

评论