diff --git a/ortools/constraint_solver/samples/nqueens_cp.cc b/ortools/constraint_solver/samples/nqueens_cp.cc
index 964b82bdf5..e75b44e3bb 100644
--- a/ortools/constraint_solver/samples/nqueens_cp.cc
+++ b/ortools/constraint_solver/samples/nqueens_cp.cc
@@ -1,4 +1,4 @@
-// Copyright 2011-2021 Google LLC
+// Copyright 2010-2021 Google LLC
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
 // You may obtain a copy of the License at
diff --git a/ortools/constraint_solver/solver_parameters.proto b/ortools/constraint_solver/solver_parameters.proto
index b6545f3be0..16fdb4acb0 100644
--- a/ortools/constraint_solver/solver_parameters.proto
+++ b/ortools/constraint_solver/solver_parameters.proto
@@ -29,7 +29,7 @@ message ConstraintSolverParameters {
   enum TrailCompression {
     NO_COMPRESSION = 0;
         COMPRESS_WITH_ZLIB = 1;
-  };
+  }
 
   // This parameter indicates if the solver should compress the trail
   // during the search. No compression means that the solver will be faster,
diff --git a/ortools/gurobi/environment.cc b/ortools/gurobi/environment.cc
index b2a5223cbe..b2ebfb2dbf 100644
--- a/ortools/gurobi/environment.cc
+++ b/ortools/gurobi/environment.cc
@@ -43,7 +43,6 @@ bool GurobiIsCorrectlyInstalled() {
 // See the comment at the top of the script.
 
 // This is the 'define' section.
-
 std::function<int(GRBenv**, const char*, const char*, const char*, int,
                   const char*)>
     GRBisqp = nullptr;
diff --git a/ortools/linear_solver/samples/assignment_groups_mip.cc b/ortools/linear_solver/samples/assignment_groups_mip.cc
index 34767dbd28..8826fe1886 100644
--- a/ortools/linear_solver/samples/assignment_groups_mip.cc
+++ b/ortools/linear_solver/samples/assignment_groups_mip.cc
@@ -10,6 +10,7 @@
 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 // See the License for the specific language governing permissions and
 // limitations under the License.
+
 // [START program]
 // Solve a simple assignment problem.
 // [START import]
diff --git a/ortools/linear_solver/samples/assignment_task_sizes_mip.cc b/ortools/linear_solver/samples/assignment_task_sizes_mip.cc
index 793b11c6eb..3627b5d5ef 100644
--- a/ortools/linear_solver/samples/assignment_task_sizes_mip.cc
+++ b/ortools/linear_solver/samples/assignment_task_sizes_mip.cc
@@ -10,6 +10,7 @@
 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 // See the License for the specific language governing permissions and
 // limitations under the License.
+
 // [START program]
 // Solve a simple assignment problem.
 // [START import]
diff --git a/ortools/linear_solver/samples/assignment_teams_mip.cc b/ortools/linear_solver/samples/assignment_teams_mip.cc
index 26bbfd9fe1..14b3c6d519 100644
--- a/ortools/linear_solver/samples/assignment_teams_mip.cc
+++ b/ortools/linear_solver/samples/assignment_teams_mip.cc
@@ -10,6 +10,7 @@
 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 // See the License for the specific language governing permissions and
 // limitations under the License.
+
 // [START program]
 // Solve a simple assignment problem.
 // [START import]