diff --git a/contests/ICPC_SA17/E.cpp b/contests/ICPC_SA17/E.cpp
index cd14793e21e8cb1b455dd9ac63153d887abe80ec..e6575a3af3fe880483a990d96d54604c9dd043a1 100644
--- a/contests/ICPC_SA17/E.cpp
+++ b/contests/ICPC_SA17/E.cpp
@@ -45,7 +45,6 @@ bool solve(int i, int r) {
   return dp[i][r] = false;
 }
 
-
 int main() {
   ios::sync_with_stdio(0);
   cin.tie(0);
diff --git a/contests/ICPC_SA17/I.cpp b/contests/ICPC_SA17/I.cpp
index 41f470e05d7b966e4649dd9d17a5a60c3116a175..c49145e12a492ca9ec1292a045c78f0015d83167 100644
--- a/contests/ICPC_SA17/I.cpp
+++ b/contests/ICPC_SA17/I.cpp
@@ -33,14 +33,12 @@ void make_set(int x) {
   size[x] = 1;
 }
 
-
 int find_set(int x) {
   if (pare[x] != x)
     pare[x] = find_set(pare[x]);
   return pare[x];
 }
 
-
 void union_set(int x, int y) {
   x = find_set(x);
   y = find_set(y);
@@ -55,7 +53,6 @@ void union_set(int x, int y) {
   size[y] += size[x];
 }
 
-
 int kruskal() {
   sort(all(edges), [&](const iii &a, const iii &b) {
     return a.se < b.se;    
@@ -107,14 +104,12 @@ void dfs(int v, int p = -1, int c = 0) {
       dfs(u.fi, v, u.se);
 }
 
-
 void preprocess(int v) {
   memset(par, -1, sizeof par);
   memset(cost, 0, sizeof cost);
   dfs(v);
 }
 
-
 int query(int p, int q) {
   int ans = 0;
 
@@ -141,7 +136,6 @@ int query(int p, int q) {
   else return max(ans, max(cost[p][0], cost[q][0]));
 }
 
-
 int main() {
   ios::sync_with_stdio(0);
   cin.tie(0);