URI Solution 1211 Economic Phonebook | Data Structures

URI Solution 1211 Economic Phonebook | Data Structures

URI Online Judge Solution  | Data structures
URI Main Problem Link - https://www.urionlinejudge.com.br/judge/en/problems/view/1211

Problem Name: URI Problem 1211 Economic Phonebook
Problem Number : URI Problem 1211 Economic Phonebook Solution
Online Judge : URI Online Judge Solution
Level: Data structures
Solution Language : C, C plus plus

URI Solution 1211 Economic PhonebookCode in CPP:

#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int i, j, sz;

bool compare(string a, string b)
{
 sz = a.length();

 for (i = 0; i < sz; ++i)
 {
  if(a[i] < b[i]) return 1;
  if(a[i] > b[i]) return 0;
 }

 return 1;
}

int main(int argc, char const *argv[])
{
 int n, l, c;
 char s[205];
 string base;

 while(scanf("%d", &n) == 1)
 {
  vector<string> v;
  c = 0;

  for (i = 0; i < n; ++i)
  {
   scanf("%s", s);
   v.push_back(s);
  }

  sort(v.begin(), v.end(), compare);
  base = v[0];
  l = base.length();

  for (i = 1; i < n; ++i)
  {
   for (j = 0; j < l; ++j)
   {
    if(base[j] == v[i][j]) c++;
    else break;
   }
   base = v[i];
  }

  printf("%d\n", c);
 }

 return 0;
}

Tag: Uri solve 1211 Economic Phonebook, Uri solution 1211 Economic Phonebook, URI 1211 Economic Phonebook oj Solve