Task: | Ruudukko |
Sender: | lady-stardust |
Submission time: | 2019-09-30 14:11:56 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | details |
#2 | WRONG ANSWER | 0.01 s | details |
#3 | WRONG ANSWER | 0.01 s | details |
#4 | RUNTIME ERROR | 0.01 s | details |
#5 | RUNTIME ERROR | 0.01 s | details |
#6 | RUNTIME ERROR | 0.01 s | details |
Code
#include <bits/stdc++.h>using namespace std;int fact(int x) {if (x <= 1)return 1;return x * fact(x - 1);}int main(){ios_base::sync_with_stdio(0);cin.tie(0);int n;cin >> n;map<string, int> charOrigins;for (int i = 0; i < n; i++) {string s;cin >> s;map<char, int> charOriginMap;string charOriginString = "";for (unsigned int j = 0; j < s.size(); j++) {if (!charOriginMap[s[j]]) {charOriginMap[s[j]] = j;}charOriginString += charOriginMap[s[j]];}if (charOrigins[charOriginString]) {charOrigins[charOriginString]++;} else {charOrigins[charOriginString] = 1;}}int totalPairs = 0;for (auto i : charOrigins) {totalPairs += fact(i.second) / (2*fact(i.second - 2));}cout << totalPairs;}
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
1 |
correct output |
---|
1 |
user output |
---|
0 |
Test 2
Verdict: WRONG ANSWER
input |
---|
2 |
correct output |
---|
1 2 2 1 |
user output |
---|
1 |
Test 3
Verdict: WRONG ANSWER
input |
---|
5 |
correct output |
---|
1 2 3 4 5 2 1 4 3 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
user output |
---|
10 |
Test 4
Verdict: RUNTIME ERROR
input |
---|
42 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 5
Verdict: RUNTIME ERROR
input |
---|
99 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 6
Verdict: RUNTIME ERROR
input |
---|
100 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |