Submission #432358
Source Code Expand
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>
using namespace std;
inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef long long ll;
typedef unsigned long long ull;
#define For(i,a,b) for(int (i) = (a);i < (b);(i)++)
#define rep(i,n) For(i,0,n)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define sz(a) (sizeof(a))
#define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)
const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int mod = 1000000007;
const int INF = 1e9;
int main()
{
int n;
string s;
cin >> s;
cin >> n;
set<string> S;
rep(i, s.size())rep(j, s.size()){
string t;
t = string(1,s[i]) + string(1,s[j]);
S.insert(t);
}
int c = 0;
for (auto i : S){
c++;
if (c == n){
cout << i << endl;
break;
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 25個の文字列 |
User |
omu |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1579 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
932 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt, sample-02.txt, sample-03.txt |
All |
test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name |
Status |
Exec Time |
Memory |
sample-01.txt |
AC |
25 ms |
804 KB |
sample-02.txt |
AC |
24 ms |
924 KB |
sample-03.txt |
AC |
25 ms |
804 KB |
test-01.txt |
AC |
23 ms |
924 KB |
test-02.txt |
AC |
24 ms |
932 KB |
test-03.txt |
AC |
25 ms |
924 KB |
test-04.txt |
AC |
23 ms |
800 KB |
test-05.txt |
AC |
25 ms |
924 KB |
test-06.txt |
AC |
23 ms |
920 KB |
test-07.txt |
AC |
26 ms |
808 KB |
test-08.txt |
AC |
25 ms |
800 KB |
test-09.txt |
AC |
23 ms |
800 KB |
test-10.txt |
AC |
25 ms |
924 KB |
test-11.txt |
AC |
23 ms |
800 KB |
test-12.txt |
AC |
25 ms |
928 KB |
test-13.txt |
AC |
25 ms |
916 KB |
test-14.txt |
AC |
23 ms |
924 KB |
test-15.txt |
AC |
25 ms |
732 KB |
test-16.txt |
AC |
24 ms |
924 KB |
test-17.txt |
AC |
24 ms |
928 KB |
test-18.txt |
AC |
26 ms |
764 KB |
test-19.txt |
AC |
25 ms |
924 KB |
test-20.txt |
AC |
25 ms |
800 KB |
test-21.txt |
AC |
23 ms |
928 KB |
test-22.txt |
AC |
25 ms |
800 KB |
test-23.txt |
AC |
24 ms |
924 KB |
test-24.txt |
AC |
24 ms |
928 KB |
test-25.txt |
AC |
25 ms |
928 KB |
test-26.txt |
AC |
25 ms |
920 KB |
test-27.txt |
AC |
26 ms |
808 KB |
test-28.txt |
AC |
24 ms |
876 KB |
test-29.txt |
AC |
24 ms |
928 KB |
test-30.txt |
AC |
24 ms |
760 KB |