Submission #1540582
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> #include<vector> #include<queue> using namespace std; int main(void){ char a[200010]; int b[100]; int c, d; int k; int n, m; int s, t; long long w,x, y, z; long long ans; for (int i = 0; i < 200010; i++)a[i] = 0; for (int i = 0; i < 100; i++)b[i] = 0; scanf("%s", a); x = strlen(a); for (long long i = 0; i < x;i++){ b[a[i] - 97]++; } ans = x*(x - 1); ans = ans / 2; for (int i = 0; i < 26; i++){ x = b[i] * (b[i] - 1); x = x / 2; ans = ans - x; } ans++; printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | MPL |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 628 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", a); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
sample_03.txt | AC | 1 ms | 384 KB |
subtask_1_01.txt | AC | 1 ms | 384 KB |
subtask_1_02.txt | WA | 2 ms | 384 KB |
subtask_1_03.txt | AC | 1 ms | 384 KB |
subtask_1_04.txt | AC | 1 ms | 384 KB |
subtask_1_05.txt | AC | 1 ms | 384 KB |
subtask_1_06.txt | AC | 1 ms | 384 KB |
subtask_1_07.txt | AC | 1 ms | 384 KB |
subtask_1_08.txt | AC | 1 ms | 384 KB |
subtask_1_09.txt | WA | 1 ms | 384 KB |
subtask_1_10.txt | WA | 1 ms | 384 KB |
subtask_1_11.txt | AC | 1 ms | 384 KB |
subtask_1_12.txt | WA | 1 ms | 384 KB |
subtask_1_13.txt | WA | 1 ms | 384 KB |
subtask_1_14.txt | WA | 2 ms | 384 KB |
subtask_1_15.txt | WA | 1 ms | 384 KB |
subtask_1_16.txt | WA | 1 ms | 384 KB |
subtask_1_17.txt | AC | 1 ms | 384 KB |