Submission #432759
Source Code Expand
#include <tuple>
#include <sstream>
#include <queue>
#include <map>
#include <numeric>
#include <list>
#include <limits.h>
#include <vector>
#include <utility>
#include <string>
#include <iostream>
#include <array>
#include <algorithm>
#include <stdio.h>
#include <stack>
#include <float.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <set>
#include <unordered_set>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define INITVAL INT_MAX
#define REP(i, N) for(int i = 0; i < N; ++i)
#define MP(a, b) make_pair(a, b)
#define X first
#define Y second
#define WHITE first
#define BLACK second
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define INPUT(type, name) type name; cin >> name;
#define IN_H(h) (0 <= (h) && (h) < H)
#define IN_W(w) (0 <= (w) && (w) < W)
#define CELL(cell, h, w) (IN_H(h) && IN_W(w) ? cell[h][w] : INT_MAX)
#define BETWEEN(x1, x, x2) (x1 <= x && x < x2)
#define PUSH(x, y) (t[y][x] == 0){q.push(pii(x, y));t[y][x] = 1;}
#define sq(x) ((x)*(x))
#ifdef _MSC_VER
#include <intrin.h>
#include <stdint.h>
#define __builtin_popcount __popcnt
#define __builtin_ctz ctz
#define __builtin_clz clz
static uint32_t inline ctz(uint32_t x)
{
unsigned long r = 0;
_BitScanReverse(&r, x);
return r;
}
static uint32_t inline clz(uint32_t x)
{
unsigned long r = 0;
_BitScanForward(&r, x);
return r;
}
#endif
class Timer
{
public:
Timer() :start_(system_clock::now()){}
double elapsed() const
{
#ifndef TEST
duration<double> d = system_clock::now() - start_;
return d.count();
#else
return 0;
#endif
}
private:
system_clock::time_point start_;
};
//if (tim.elapsed() > 2)
//{
// cout << -1 << endl;
// return 1;
//}
ll combi(int n, int r, int dup)
{
int i, j, nn;
vector<ll> a(n, 0);
ll retv;
nn = (dup) ? (n + r - 1) : n;
if (nn - r<r) r = nn - r;
if (r == 0) return 1; if (r == 1) return nn;
for (i = 1; i<r; i++) a[i] = i + 2;
for (i = 3; i <= nn - r + 1; i++){
a[0] = i;
for (j = 1; j<r; j++) a[j] += a[j - 1];
}
retv = a[r - 1];
return retv;
}
template<int N>
class UnionFind
{
vi parent;
public:
UnionFind() :parent(N){ REP(i, N)parent[i] = i; }
bool isSame(int A, int B){ return root(A) == root(B); }
void unite(int A, int B)
{
A = root(A);
B = root(B);
if (A != B)
{
parent[B] = A;
}
}
private:
int root(int x)
{
if (parent[x] == x)
{
return x;
}
else
{
return parent[x] = root(parent[x]);
}
}
};
int solve(istream& cin, ostream& cout)
{
INPUT(string, S);
INPUT(int, N);
cout << S[(N-1) / 5 ] << S[(N-1) % 5 ] << endl;
return 0;
}
#ifndef TEST
int main(int argv, char* argc[])
{
return solve(cin, cout);
}
#else
class TestCase
{
public:
string input;
string expect;
TestCase(string in, string expc) :input(in), expect(expc){}
};
vector<TestCase> inputs;
#define ADDTEST(i,o) inputs.push_back(TestCase(i,o));
void createTestCase()
{
ADDTEST(
"abcde\n"
"8\n"
,
"bc\n");
ADDTEST(
"aeiou\n"
"22\n"
,
"ue\n");
ADDTEST(
"vwxyz\n"
"25\n"
,
"zz\n");
}
int main(int argv, char* argc[])
{
createTestCase();
for (size_t i = 0; i < inputs.size(); ++i)
{
cout << "Case " << i + 1 << " is ";
istringstream iss(inputs[i].input);
ostringstream oss;
solve(iss, oss);
string actual = oss.str();
if (actual == inputs[i].expect)
{
cout << "OK" << endl;
}
else
{
cout << "NG" << endl;
cout << "\texpected :" << inputs[i].expect << endl;
cout << "\tactual :" << actual << endl;
}
}
return 0;
}
#endif
Submission Info
Submission Time |
|
Task |
A - 25個の文字列 |
User |
abesy8688 |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
3946 Byte |
Status |
AC |
Exec Time |
31 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 |
26 ms |
808 KB |
sample-02.txt |
AC |
25 ms |
924 KB |
sample-03.txt |
AC |
23 ms |
804 KB |
test-01.txt |
AC |
25 ms |
924 KB |
test-02.txt |
AC |
25 ms |
924 KB |
test-03.txt |
AC |
24 ms |
928 KB |
test-04.txt |
AC |
25 ms |
932 KB |
test-05.txt |
AC |
26 ms |
804 KB |
test-06.txt |
AC |
28 ms |
792 KB |
test-07.txt |
AC |
26 ms |
732 KB |
test-08.txt |
AC |
25 ms |
920 KB |
test-09.txt |
AC |
25 ms |
916 KB |
test-10.txt |
AC |
25 ms |
920 KB |
test-11.txt |
AC |
25 ms |
920 KB |
test-12.txt |
AC |
25 ms |
800 KB |
test-13.txt |
AC |
25 ms |
732 KB |
test-14.txt |
AC |
25 ms |
792 KB |
test-15.txt |
AC |
24 ms |
920 KB |
test-16.txt |
AC |
23 ms |
924 KB |
test-17.txt |
AC |
24 ms |
804 KB |
test-18.txt |
AC |
24 ms |
788 KB |
test-19.txt |
AC |
26 ms |
728 KB |
test-20.txt |
AC |
26 ms |
796 KB |
test-21.txt |
AC |
28 ms |
916 KB |
test-22.txt |
AC |
26 ms |
732 KB |
test-23.txt |
AC |
24 ms |
924 KB |
test-24.txt |
AC |
25 ms |
920 KB |
test-25.txt |
AC |
24 ms |
728 KB |
test-26.txt |
AC |
31 ms |
732 KB |
test-27.txt |
AC |
26 ms |
800 KB |
test-28.txt |
AC |
26 ms |
920 KB |
test-29.txt |
AC |
26 ms |
728 KB |
test-30.txt |
AC |
25 ms |
924 KB |