Advertisement
Guest User

Untitled

a guest
Mar 19th, 2018
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.26 KB | None | 0 0
  1. template <>
  2. const char maxS(const char * tab, int n)
  3. {
  4.     char najdluzszy_lancuch=tab[0];
  5.     for (int i=0; i<n; i++)
  6.     {
  7.         if (strlen(tab[i])>strlen(najdluzszy_lancuch))
  8.             najdluzszy_lancuch=tab[i];
  9.     }
  10.     return najdluzszy_lancuch;
  11. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement