Pagini recente » Cod sursa (job #2668567) | Cod sursa (job #2808898) | Cod sursa (job #817809) | Cod sursa (job #738012) | Cod sursa (job #1189237)
/*
subsir infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))
#define IN_FILE "subsir.in"
#define OUT_FILE "subsir.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);
//variables
string a;
string b;
PII ans;
//other functions
void reading()
{
f >> a >> b;
f.close();
}
void solving()
{
string c=a;
FORN(i, a.length())
{
FOR(j, i+1, a.length())
{
int loc = b.find(a.substr(i,j-i));
if (loc > -1)
{
if (a.substr(i, j - i).length() > ans.X)
{
string test = a.substr(i, j - i);
ans.X = a.substr(i, j - i).length();
ans.Y = 1;
a = a.substr(i + 1);
i = -1;
break;
}
else if (a.substr(i, j - i).length() == ans.X)
{
++ans.Y;
}
}
}
}
}
void write_data()
{
g << ans.Y%666013;
}
int main()
{
reading();
solving();
write_data();
}