Submission #1540573
Source Code Expand
#include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <iostream> #include <algorithm> #include <queue> #include <map> #include <stack> using namespace std; const int MAXN = 2e6 + 5; char s[MAXN]; int a[MAXN]; int vis[50]; int main() { scanf("%s",&s); int n = strlen(s); int t = 0; for(int i = 1; i <= n; i++) vis[s[i]]++; for(int i = 'a'; i <= 'z'; i++){ if(vis[i] != 0) t++; } int ans = n*(t-1); if(ans == 0) printf("1\n"); else printf("%d\n",n*(t-1)); }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | Amazing |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 553 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 2304 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17:18: warning: format ‘%s’ expects argument of type ‘char*’, but argument 2 has type ‘char (*)[2000005]’ [-Wformat=] scanf("%s",&s); ^ ./Main.cpp:17:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",&s); ^
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 | WA | 2 ms | 2304 KB |
sample_02.txt | AC | 2 ms | 2304 KB |
sample_03.txt | AC | 2 ms | 2304 KB |
subtask_1_01.txt | WA | 2 ms | 2304 KB |
subtask_1_02.txt | AC | 2 ms | 2304 KB |
subtask_1_03.txt | WA | 2 ms | 2304 KB |
subtask_1_04.txt | AC | 2 ms | 2304 KB |
subtask_1_05.txt | WA | 2 ms | 2304 KB |
subtask_1_06.txt | WA | 2 ms | 2304 KB |
subtask_1_07.txt | WA | 2 ms | 2304 KB |
subtask_1_08.txt | WA | 2 ms | 2304 KB |
subtask_1_09.txt | WA | 2 ms | 2304 KB |
subtask_1_10.txt | WA | 2 ms | 2304 KB |
subtask_1_11.txt | WA | 2 ms | 2304 KB |
subtask_1_12.txt | WA | 2 ms | 2304 KB |
subtask_1_13.txt | WA | 2 ms | 2304 KB |
subtask_1_14.txt | AC | 2 ms | 2304 KB |
subtask_1_15.txt | WA | 2 ms | 2304 KB |
subtask_1_16.txt | WA | 2 ms | 2304 KB |
subtask_1_17.txt | WA | 2 ms | 2304 KB |