Cod sursa(job #2326139)
| Utilizator | Data | 23 ianuarie 2019 12:52:50 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | simulare_preoli | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include<string.h>
using namespace std;
int main()
{
int n,m,i;
char f[100],cuvant[15],aux[100],beep[10]="beep";
ifstream e("beep.in");
ofstream g("beep.out");
e.getline(cuvant,15);
e.getline(f,100);
n=strlen(cuvant);
m=strlen(f);
for(i=0;i<m;i++)
{
if(strstr(f+i,cuvant)!=0)
{
if(f[i]==cuvant[0] && f[i+strlen(cuvant)-1]==cuvant[n-1])
{
strcpy(aux,f+i+n);
strcpy(f+i,beep);
strcpy(f+i+4,aux);
}
}
}
g<<f;
return 0;
}
