Change tabs to spaces

Author: dolphingarlic

APIO/APIO 10-commando.cpp

@@ -10,30 +10,30 @@ bool case1(long long x, long long y, long long i) {
 }
 
 bool case2(long long x, long long y, long long i) {
-	return ((dp[y] - dp[x] + a * (pref[y] * pref[y] - pref[x] * pref[x])) * (pref[i] - pref[y]) < (dp[i] - dp[y] + a * (pref[i] * pref[i] - pref[y] * pref[y])) * (pref[y] - pref[x]));
+    return ((dp[y] - dp[x] + a * (pref[y] * pref[y] - pref[x] * pref[x])) * (pref[i] - pref[y]) < (dp[i] - dp[y] + a * (pref[i] * pref[i] - pref[y] * pref[y])) * (pref[y] - pref[x]));
 }
 
 int main() {
   cin >> n >> a >> b >> c;
   FOR(i, 0, n) {
-	long long x;
-	cin >> x;
-	pref[i + 1] = pref[i] + x;
+    long long x;
+    cin >> x;
+    pref[i + 1] = pref[i] + x;
   }
 
   deque<long long> q;
   q.push_back(0);
   dp[0] = 0;
   FOR(i, 1, n + 1) {
-	while (q.size() > 1 && case1(q[0], q[1], i)) q.pop_front();
+    while (q.size() > 1 && case1(q[0], q[1], i)) q.pop_front();
 
-	long long x = q[0];
-	long long y = pref[i] - pref[x];
-	dp[i] = dp[x] + a * y * y + b * y + c;
+    long long x = q[0];
+    long long y = pref[i] - pref[x];
+    dp[i] = dp[x] + a * y * y + b * y + c;
 
-	while (q.size() > 1 && case2(q[q.size() - 2], q.back(), i)) q.pop_back();
+    while (q.size() > 1 && case2(q[q.size() - 2], q.back(), i)) q.pop_back();
 
-	q.push_back(i);
+    q.push_back(i);
   }
 
   cout << dp[n] << '\n';

Balkan/Balkan 15-happiness.cpp

@@ -56,10 +56,10 @@ bool check() {
 bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
     root = new Node(1, maxCoinSize);
     for (int i = 0; i < coinsCount; i++) root->update(coins[i], coins[i]);
-	return check();
+    return check();
 }
 
 bool is_happy(int event, int coinsCount, long long coins[]) {
-	for (int i = 0; i < coinsCount; i++) root->update(coins[i], event * coins[i]);
+    for (int i = 0; i < coinsCount; i++) root->update(coins[i], event * coins[i]);
     return check();
 }

Baltic/Baltic 09-candy.cpp

@@ -7,27 +7,27 @@ pair<pair<int, int>, int> out[100001];
 vector<int> wagons;
 
 int main() {
-	int n;
-	cin >> n;
-	FOR(i, 0, n) {
-		int s, t;
-		cin >> s >> t;
-		candies[i] = {t + s, t - s};
-	}
-	sort(candies, candies + n);
-	
-	FOR(i, 0, n) {
-		int a = candies[i].first, b = -candies[i].second;
-		int pos = lower_bound(wagons.begin(), wagons.end(), b) - wagons.begin();
-		if (pos == wagons.size()) wagons.push_back(b);
-		else wagons[pos] = b;
-		
-		out[i] = {{(a + b) / 2, (a - b) / 2}, pos + 1};
-	}
-	
-	cout << wagons.size() << '\n';
-	FOR(i, 0, n) {
-		cout << out[i].first.first << ' ' << out[i].first.second << ' ' << out[i].second << '\n';
-	}
-	return 0;
+    int n;
+    cin >> n;
+    FOR(i, 0, n) {
+        int s, t;
+        cin >> s >> t;
+        candies[i] = {t + s, t - s};
+    }
+    sort(candies, candies + n);
+    
+    FOR(i, 0, n) {
+        int a = candies[i].first, b = -candies[i].second;
+        int pos = lower_bound(wagons.begin(), wagons.end(), b) - wagons.begin();
+        if (pos == wagons.size()) wagons.push_back(b);
+        else wagons[pos] = b;
+        
+        out[i] = {{(a + b) / 2, (a - b) / 2}, pos + 1};
+    }
+    
+    cout << wagons.size() << '\n';
+    FOR(i, 0, n) {
+        cout << out[i].first.first << ' ' << out[i].first.second << ' ' << out[i].second << '\n';
+    }
+    return 0;
 }

Baltic/Baltic 11-lamp.cpp

@@ -9,42 +9,42 @@ int visited[501][501], dx[4]{-1, -1, 1, 1}, dy[4]{-1, 1, -1, 1};
 pair<int, int> dz[4]{{-1, -1}, {-1, 0}, {0, -1}, {0, 0}};
 
 bool inside(int x, int y) {
-	return (~x && x <= n && ~y && y <= m);
+    return (~x && x <= n && ~y && y <= m);
 }
 
 int main() {
-	cin >> n >> m;
+    cin >> n >> m;
 
-	FOR(i, 0, n) FOR(j, 0, m) {
-		char c;
-		cin >> c;
-		if (c == orientation[(i + j) & 1]) correct[i][j] = true;
-		else correct[i][j] = false;
-	}
+    FOR(i, 0, n) FOR(j, 0, m) {
+        char c;
+        cin >> c;
+        if (c == orientation[(i + j) & 1]) correct[i][j] = true;
+        else correct[i][j] = false;
+    }
 
-	deque<pair<int, pair<int, int>>> dq;
-	dq.push_back({1, {0, 0}});
-	while (dq.size()) {
-		int x, y, z;
-		tie(x, y) = dq.front().second;
+    deque<pair<int, pair<int, int>>> dq;
+    dq.push_back({1, {0, 0}});
+    while (dq.size()) {
+        int x, y, z;
+        tie(x, y) = dq.front().second;
         z = dq.front().first;
-		dq.pop_front();
+        dq.pop_front();
         if (visited[x][y]) continue;
         visited[x][y] = z;
 
-		FOR(i, 0, 4) {
-			int nx = x + dx[i], ny = y + dy[i];
-			if (inside(nx, ny) && !visited[nx][ny]) {
-				if (correct[x + dz[i].first][y + dz[i].second]) {
-					dq.push_front({z, {nx, ny}});
-				} else {
-					dq.push_back({z + 1, {nx, ny}});
-				}
-			}
-		}
-	}
+        FOR(i, 0, 4) {
+            int nx = x + dx[i], ny = y + dy[i];
+            if (inside(nx, ny) && !visited[nx][ny]) {
+                if (correct[x + dz[i].first][y + dz[i].second]) {
+                    dq.push_front({z, {nx, ny}});
+                } else {
+                    dq.push_back({z + 1, {nx, ny}});
+                }
+            }
+        }
+    }
 
-	if (visited[n][m]) cout << visited[n][m] - 1;
-	else cout << "NO SOLUTION";
-	return 0;
+    if (visited[n][m]) cout << visited[n][m] - 1;
+    else cout << "NO SOLUTION";
+    return 0;
 }

Baltic/Baltic 15-net.cpp

@@ -4,24 +4,24 @@ using namespace std;
 vector<int> graph[500001], leaves;
 
 void dfs(int node = 1, int parent = 0) {
-	if (graph[node].size() == 1) leaves.push_back(node);
-	for (int i : graph[node]) {
-		if (i != parent) dfs(i, node);
-	}
+    if (graph[node].size() == 1) leaves.push_back(node);
+    for (int i : graph[node]) {
+        if (i != parent) dfs(i, node);
+    }
 }
 
 int main() {
-	int n;
-	cin >> n;
-	for (int i = 1; i < n; i++) {
-		int a, b;
-		cin >> a >> b;
-		graph[a].push_back(b);
-		graph[b].push_back(a);
-	}
-	dfs();
+    int n;
+    cin >> n;
+    for (int i = 1; i < n; i++) {
+        int a, b;
+        cin >> a >> b;
+        graph[a].push_back(b);
+        graph[b].push_back(a);
+    }
+    dfs();
 
-	cout << (leaves.size() + 1) / 2 << '\n';
-	for (int i = 0; i + leaves.size() / 2 < leaves.size(); i++) cout << leaves[i] << ' ' << leaves[i + leaves.size() / 2] << '\n';
-	return 0;
+    cout << (leaves.size() + 1) / 2 << '\n';
+    for (int i = 0; i + leaves.size() / 2 < leaves.size(); i++) cout << leaves[i] << ' ' << leaves[i + leaves.size() / 2] << '\n';
+    return 0;
 }

CEOI/CEOI 14-question.cpp

@@ -5,11 +5,11 @@ int sets[925][12];
 
 void Init(int N){
     for (int i = 0, cnt = 1; i < (1<<12); i++) {
-		if (__builtin_popcount(i) == 6) {
-			for (int j = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][j] = 1; else sets[cnt][j] = 0;
-			cnt++;
-		}
-	}
+        if (__builtin_popcount(i) == 6) {
+            for (int j = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][j] = 1; else sets[cnt][j] = 0;
+            cnt++;
+        }
+    }
 }
 
 int Alice(int x,int y){

CEOI/CEOI 16-kangaroo.cpp

@@ -17,15 +17,15 @@ const long long MOD = 1e9 + 7;
 long long dp[2001][2001];
 
 int main() {
-	int n, a, b;
-	scanf("%d %d %d", &n, &a, &b);
-	dp[0][0] = 1;
-	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
-		if (i == a || i == b)
-			dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
-		else
-			dp[i][j] = (dp[i - 1][j + 1] * j + dp[i - 1][j - 1] * (j - (i > a) - (i > b))) % MOD;
-	}
-	printf("%lld\n", dp[n][1]);
-	return 0;
+    int n, a, b;
+    scanf("%d %d %d", &n, &a, &b);
+    dp[0][0] = 1;
+    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
+        if (i == a || i == b)
+            dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
+        else
+            dp[i][j] = (dp[i - 1][j + 1] * j + dp[i - 1][j - 1] * (j - (i > a) - (i > b))) % MOD;
+    }
+    printf("%lld\n", dp[n][1]);
+    return 0;
 }

CEOI/CEOI 17-sure.cpp

@@ -4,20 +4,20 @@ using namespace std;
 double a[100000], b[100000];
 
 int main() {
-	int n;
-	cin >> n;
-	for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
-	sort(a, a + n, greater<double>());
-	sort(b, b + n, greater<double>());
-	
-	double ans = 0, l = 0, r = 0;
-	int lptr = 0, rptr = 0;
-	for (int i = 1; i <= 2 * n; i++) {
-		if (lptr < n && (rptr == n || l < r)) l += a[lptr++];
-		else r += b[rptr++];
-		ans = max(ans, min(l, r) - i);
-	}
-	
-	cout << fixed << setprecision(4) << ans;
-	return 0;
+    int n;
+    cin >> n;
+    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
+    sort(a, a + n, greater<double>());
+    sort(b, b + n, greater<double>());
+    
+    double ans = 0, l = 0, r = 0;
+    int lptr = 0, rptr = 0;
+    for (int i = 1; i <= 2 * n; i++) {
+        if (lptr < n && (rptr == n || l < r)) l += a[lptr++];
+        else r += b[rptr++];
+        ans = max(ans, min(l, r) - i);
+    }
+    
+    cout << fixed << setprecision(4) << ans;
+    return 0;
 }

FXCUP/FXCUP4_cross.cpp

@@ -5,18 +5,18 @@ typedef long long ll;
 using namespace std;
 
 ll SelectCross(int K, vector<int> I, vector<int> O) {
-	int N = I.size();
-	vector<pair<ll, ll>> crosses;
-	FOR(i, 0, N) crosses.push_back({I[i], O[i]});
-	sort(crosses.begin(), crosses.end(), greater<pair<ll, ll>>());
+    int N = I.size();
+    vector<pair<ll, ll>> crosses;
+    FOR(i, 0, N) crosses.push_back({I[i], O[i]});
+    sort(crosses.begin(), crosses.end(), greater<pair<ll, ll>>());
 
-	priority_queue<ll> pq;
-	ll ans = 0;
-	FOR(i, 0, N) {
-		pq.push(-crosses[i].second);
-		if (i >= K) pq.pop();
-		if (i >= K - 1) ans = max(ans, -pq.top() * crosses[i].first * 2 - crosses[i].first * crosses[i].first);
-	}
+    priority_queue<ll> pq;
+    ll ans = 0;
+    FOR(i, 0, N) {
+        pq.push(-crosses[i].second);
+        if (i >= K) pq.pop();
+        if (i >= K - 1) ans = max(ans, -pq.top() * crosses[i].first * 2 - crosses[i].first * crosses[i].first);
+    }
 
-	return ans;
+    return ans;
 }

IOI/IOI 00-median.cpp

@@ -5,35 +5,35 @@
 std::vector<int> minmax;
 
 int quickselect(int pos, std::vector<int> candidates) {
-	if (candidates.size() == 1) return candidates[0];
-	
-	int pivot = candidates[rand() % candidates.size()];
-	std::vector<int> l, g;
-	l.push_back(pivot);
-	for (int i : candidates) {
-	    if (i == pivot) continue;
-		if (Med3(minmax[0], i, pivot) == pivot) g.push_back(i);
-		else l.push_back(i);
-	}
-	
-	if (l.size() >= pos) return quickselect(pos, l);
-	else return quickselect(pos - l.size(), g);
+    if (candidates.size() == 1) return candidates[0];
+    
+    int pivot = candidates[rand() % candidates.size()];
+    std::vector<int> l, g;
+    l.push_back(pivot);
+    for (int i : candidates) {
+        if (i == pivot) continue;
+        if (Med3(minmax[0], i, pivot) == pivot) g.push_back(i);
+        else l.push_back(i);
+    }
+    
+    if (l.size() >= pos) return quickselect(pos, l);
+    else return quickselect(pos - l.size(), g);
 }
 
 int Median(int N) {
     for (int i = 1; i <= N; i++) {
-    	minmax.push_back(i);
-    	while (minmax.size() > 2) {
-    		int med = Med3(minmax[0], minmax[1], minmax[2]);
-    		if (med == minmax[0]) minmax.erase(minmax.begin());
-    		else if (med == minmax[1]) minmax.erase(minmax.begin() + 1);
-    		else minmax.erase(minmax.begin() + 2);
-    	}
+        minmax.push_back(i);
+        while (minmax.size() > 2) {
+            int med = Med3(minmax[0], minmax[1], minmax[2]);
+            if (med == minmax[0]) minmax.erase(minmax.begin());
+            else if (med == minmax[1]) minmax.erase(minmax.begin() + 1);
+            else minmax.erase(minmax.begin() + 2);
+        }
     }
 
     std::vector<int> candidates;
     for (int i = 1; i <= N; i++) if (i != minmax[0] && i != minmax[1])
-    	candidates.push_back(i);
+        candidates.push_back(i);
 
     return quickselect(N / 2, candidates);
 }