%% 
%%  The LaTeX Graphics Companion, 2ed (first printing May 2007)
%% 
%%  Example 11-4-33 on page 791.
%% 
%%  Copyright (C) 2007 Michel Goossens, Frank Mittelbach, Denis Roegel, Sebastian Rahtz, Herbert Vo\ss 
%% 
%%  It may be distributed and/or modified under the conditions
%%  of the LaTeX Project Public License, either version 1.3
%%  of this license or (at your option) any later version.
%% 
%%  See http://www.latex-project.org/lppl.txt for details.
%% 

% Show page(s) 1,2,3,4

\documentclass{ttctbeamer}
% graphic converted to gray in book

\StartShownPreambleCommands
\documentclass{beamer}
\usetheme{Malmoe}
\useoutertheme{sidebar}
\usecolortheme{dove}
\StopShownPreambleCommands

\begin{document}
\begin{frame}[fragile]
 \frametitle{An Algorithm For Finding Prime Numbers.}
 \framesubtitle{Use of semiverbatim}
 \setbeamercolor{alerted text}{fg=blue}
 \begin{semiverbatim}
  \uncover<1->{\alert<0>{int main (void)}}
  \uncover<1->{\alert<0>{\{}}
  \uncover<1->{\alert<1>{  \alert<4>{\color{red}std::}vector<bool> is_prime (100, true);}}
  \uncover<1->{\alert<1>{  for (int i = 2; i < 100; i++)}}
  \uncover<2->{\alert<2>{    if (is_prime[i])}}
  \uncover<2->{\alert<0>{      \{}}
  \uncover<3->{\alert<3>{        \alert<4>{\color{red}std::}cout << i << " ";}}
  \uncover<3->{\alert<3>{        for (int j = i; j < 100;}}
  \uncover<3->{\alert<3>{             is_prime [j] = false, j+=i);}}
  \uncover<2->{\alert<0>{      \}}}
  \uncover<1->{\alert<0>{  return 0;}}
  \uncover<1->{\alert<0>{\}}}
 \end{semiverbatim}
 \visible<4>{Note the use of \alert{\color{red}\texttt{std::}}.}
\end{frame}
\end{document}