| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 815602 | serifefedartar | PIN (CEOI10_pin) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 1000005
#define int long long
int temp[4], same[4];
int cnt[40][40][40][40];
int get(char ch) {
if (ch >= '0' && ch <= '9')
return ch-'0';
return ch-'a'+10;
}
ll main() {
fast
int N, D;
cin >> N >> D;
vector<string> PIN(N);
for (int i = 0; i < N; i++) {
cin >> PIN[i];
for (int mask = 0; mask < 16; mask++) {
for (int plc = 0; plc < 4; plc++) {
if ((1<<plc) & mask)
temp[plc] = get(PIN[i][plc]);
else
temp[plc] = 36;
}
cnt[temp[0]][temp[1]][temp[2]][temp[3]]++;
}
}
for (int plc1 = 0; plc1 <= 36; plc1++) {
for (int plc2 = 0; plc2 <= 36; plc2++) {
for (int plc3 = 0; plc3 <= 36; plc3++) {
for (int plc4 = 0; plc4 <= 36; plc4++) {
int same_plc = (plc1 < 36) + (plc2 < 36) + (plc3 < 36) + (plc4 < 36);
same[same_plc] += (cnt[plc1][plc2][plc3][plc4] * (cnt[plc1][plc2][plc3][plc4] - 1)) / 2;
}
}
}
}
if (D == 1)
cout << same[3] << "\n";
else if (D == 2)
cout << same[2] - 3 * same[3] << "\n";
else if (D == 3)
cout << same[1] - 2 * same[2] + 3 * same[3] << "\n";
else
cout << same[0] - same[1] + same[2] - same[3] << "\n";
}