Cod sursa(job #1241051)

Utilizator AeroHHorea Stefan AeroH Data 12 octombrie 2014 15:40:37
Problema Potrivirea sirurilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.27 kb
//#include <iostream>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define NMAX 2000000
#define punct pair<ll,ll>
#define punctd pair<double,double>
#include <iomanip>
#include <complex>
#define ll long long int
#include <ctime>
#include <cstdlib>
#define ld long double
#define pb push_back
#define x first
#define y second
#define eps 0.000000001
double PI = 3.1415926535897932384626433832795;
using namespace std;
//ifstream f(".in");
//ofstream g(".out");
//int DX[]={1,1,1,0,0,-1,-1,-1};
//int DY[]={1,0,-1,1,-1,1,0,-1};
long long int i,j,n,t,ok,K,rasp=20,N,M,nrx,T,k,l,x,y;

//X=cos-sin;
//Y=sin+cos;
char S[NMAX+5],s[NMAX+5],*p;
int v[NMAX];
int main()
{

    ios_base::sync_with_stdio(false);
    //cout.tie();
    //#ifndef ONLINE_JUDGE
        ifstream cin("strmatch.in");
        ofstream cout("strmatch.out");
    //#endif
    cin.get(s,NMAX);cin.get();
    cin.get(S,NMAX);
    p=S;N=strlen(S);
    while(p)
        {
            p=strstr(p,s);
            if(p){++p;
            v[++n]=(p-S)-1;}
        }
    cout<<n<<'\n';
    for(i=1;i<=n;++i)
        cout<<v[i]<<" ";
    return 0;

}