var_c vs var_f
Problem: two-sum
A→B9%B→A9%Shared fingerprints5
24tokens in the longest matched region
var_c
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n; long long t;
cin >> n >> t;
unordered_map<long long, int> seen;
seen.reserve(2 * n);
int idx = 1;
while (idx <= n) {
long long x;
cin >> x;
long long need = t - x;
auto it = seen.find(need);
if (seen.end() != it) {
cout << it->second << ' ' << idx << '\n';
return 0;
}
seen[x] = idx;
idx = idx + 1;
}
return 0;
}
var_f
#include <bits/stdc++.h>
using namespace std;
static int runs = 0;
void banner() {
// deliberately original code around the lifted part
runs++;
}
// ---- lifted from the original solution (this is the copied part) ----
int solve(int n, long long t) {
unordered_map<long long, int> seen;
seen.reserve(n * 2);
for (int idx = 1; idx <= n; idx++) {
long long x;
cin >> x;
auto it = seen.find(t - x);
if (it != seen.end()) {
cout << it->second << ' ' << idx << '\n';
return 0;
}
seen[x] = idx;
}
return 1;
}
// ---------------------------------------------------------------------
int main() {
banner();
int n; long long t;
if (!(cin >> n >> t)) return 1;
int status = solve(n, t);
banner();
return status == 0 ? 0 : 2;
}