Cod sursa(job #2480794)
| Utilizator | Data | 26 octombrie 2019 10:20:20 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int l1, l2, prefix[2000005];
char a[2000005], b[2000005], c;
void create_pc()
{
prefix[0]=0;
for (int i=1; i<l1; ++i)
{
}
}
int main()
{
// l1=1;
// l2=1;
// f >> c;
// while(c!='\n')
// {
// a[l1++]=c;
// f >> c;
}
cout << "YE";
//create_prefix();
return 0;
}
