Pagini recente » Cod sursa (job #1072223) | Cod sursa (job #265184) | Cod sursa (job #1327378) | Cod sursa (job #2266983) | Cod sursa (job #1819893)
#include <bits/stdc++.h>
using namespace std;
int n;
long long counter;
bool m[10000][130];
char cuvant[10000][62];
int verificare (int x, int y)
{
int k = strlen(cuvant[y]);
for (int i = 0; i<k; ++i)
if (m[x][cuvant[y][i]] == 0)
return 0;
return 1;
}
int main()
{
ifstream fin ("input.txt");
ofstream fout ("output.txt");
fin >> n;
fin.get();
char c;
int j, i, r, k;
for (i=0; i<n; ++i)
{
j = 0;
c = fin.get();
while (c && c != '\n')
{
r = c;
if (m[i][r] == 0)
{cuvant[i][j] = c;
++j;
m[i][r] = 1;}
c = fin.get();
}
}
for (i = 0; i<n-1; ++i)
for (j = i+1; j<n; ++j)
counter = counter + verificare(i, j) + verificare (j, i);
fout << counter;
return 0;
}