Submission #605941
Source Code Expand
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
int main() {
string s; int k;
while(cin >> s >> k) {
set<string> a;
rer(i, 0, s.size() - k)
a.insert(s.substr(i, k));
cout << a.size() << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 高橋君とパスワード |
User |
anta |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1391 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
26 ms |
808 KB |
subtask0_sample_02.txt |
AC |
24 ms |
808 KB |
subtask0_sample_03.txt |
AC |
24 ms |
732 KB |
subtask1_01.txt |
AC |
24 ms |
916 KB |
subtask1_02.txt |
AC |
25 ms |
928 KB |
subtask1_03.txt |
AC |
26 ms |
800 KB |
subtask1_04.txt |
AC |
28 ms |
928 KB |
subtask1_05.txt |
AC |
26 ms |
816 KB |
subtask1_06.txt |
AC |
25 ms |
924 KB |
subtask1_07.txt |
AC |
24 ms |
920 KB |
subtask1_08.txt |
AC |
25 ms |
924 KB |
subtask1_09.txt |
AC |
26 ms |
928 KB |
subtask1_10.txt |
AC |
24 ms |
920 KB |
subtask1_11.txt |
AC |
26 ms |
808 KB |
subtask1_12.txt |
AC |
26 ms |
928 KB |
subtask1_13.txt |
AC |
26 ms |
796 KB |
subtask1_14.txt |
AC |
26 ms |
928 KB |
subtask1_15.txt |
AC |
26 ms |
916 KB |
subtask1_16.txt |
AC |
23 ms |
920 KB |
subtask1_17.txt |
AC |
26 ms |
924 KB |
subtask1_18.txt |
AC |
26 ms |
924 KB |
subtask1_19.txt |
AC |
25 ms |
928 KB |
subtask1_20.txt |
AC |
26 ms |
928 KB |
subtask1_21.txt |
AC |
26 ms |
924 KB |
subtask1_22.txt |
AC |
24 ms |
800 KB |
subtask1_23.txt |
AC |
23 ms |
800 KB |