Originally Posted by
ZuK
That doesn't look much like replacing, more like a set difference.
Anyway, what have you tried so far ?
Kurt
Code:
#include <cstring>
#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#define sz size()
#define pb push_back
#define _(x,a) memset(x,a,sizeof(x))
#define LET(x,a) typeof(a) x(a)
#define GFOR(i,a,b) for(LET(i,a);i!=(b);++i)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,n) for(int i=0;i<n;i++)
#define EACH(i,v) GFOR(i,(v).begin(),(v).end())
#define LL long long
#define GI ({int t;scanf("%d",&t);t;})
#define GL ({LL t;scanf("%lld",&t);t;})
#define GD ({double t;scanf("%lf",&t);t;})
template<class T> inline void checkmax(T &a,T b){if(b>a) a=b;}
template<class T> inline void checkmin(T &a,T b){if(b<a) a=b;}
using namespace std;
int main (int argc, char const* argv[]) {
int l,count=0;
int rep,v=0,pla=0;
int m,n;int nu[100];
ifstream fin;
fin.open("replace.txt");
int a[100], b[100], c[100][100];int im=0;
while(fin>>n) {
int ora=0;
nu[ora]=n;
cout<<"before";
pla++;ora++;
REP(j,(n+1)) fin>>c[im][j];REP(j,(n+1))cout<<c[im][j]<<" ";cout<<endl;
im++;}
REP(i,pla) cout<<"strlen"<<endl<<nu[i]<<endl;
REP(i,pla)
{ cout<<"done";
{REP(j,(n+1))cout<<c[i][j]<<" ";cout<<endl;
}}
REP(i,pla) cout<<"strlen"<<endl<<nu[i]<<endl;
cout<<pla; cout<<"done";
cout<<endl<<endl<<endl<<endl;
ifstream fin1;
fin1.open("file.txt");
while(fin1>>m)
REP(i,m) fin1>>a[i];
REP(i,m) cout<<a[i];
cout<<endl<<endl<<endl<<endl;
REP(io,pla)
{nu[io]=nu[io];
int g; g = ((m+1)-n);
cout<<endl<<"g="<<g<<endl;
}
/* REP(i,pla)
{ int nxt=-1;
REP(k,g){nxt++;count=0;
REP(j,m)
if(c[i][j+nxt]==a[j+nxt]) count++;
if (count=3)
{REP(i,nxt) cout<<a[i]<<" ";
cout<<a[m];
REP(i,n) cout<<c[(nxt+m-1+i)];
}
}//kg
REP(i,n) cout<<c[i];
}//ipla
cout<<"1";
*/
int zx;
cin>>zx;
return 0;
}// int main