Cod sursa(job #2980419)
Utilizator | Data | 16 februarie 2023 14:57:09 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
#define MAX 1234
#define EMAX 500000
#define mod 9773
using namespace std;
string a, b;
ifstream fin ("sr.in");
ofstream fout ("sr.out");
int main()
{
fin >> a >> b;
int j = 0;
for(int i = 0;i < b.size(); ++i)
{
while(b[i] != a[j])
j++;
fout << j + 1 << ' ';
j++;
}
}