Cod sursa(job #548574)
Utilizator | Data | 7 martie 2011 16:28:17 | |
---|---|---|---|
Problema | Tricouri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
char a[100001], b[100001];
int modul(int n)
{
if (n>=0)
return n;
else
return -n;
}
int dist(char *a, char *b)
{
int rez,i,j,v;
rez=0;
for (i=0;b[i]!='\0';i++)
{
v=strlen(b);
for (j=0;a[j]!='\0';j++)
if (b[i]==a[j] && modul (j-i)<v)
v=modul(j-i);
rez+=v;
}
return rez;
}
int main()
{
gets(a);
gets(b);
cout<<dist(a,b);
return 0;
}