Contest Duration: ~ (local time) (120 minutes) Back to Home

Submission #432793

Source Code Expand

Copy
```#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int main(){
string s;
cin >> s;
int n;
cin >> n;
cout << s[(n-1)/5] << s[(n-1)%5] << endl;
}
```

#### Submission Info

Submission Time 2015-06-27 21:18:13+0900 A - 25個の文字列 yokozuna57 C++11 (GCC 4.9.2) 100 1112 Byte AC 26 ms 932 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample-01.txt, sample-02.txt, sample-03.txt
All 100 / 100 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 25 ms 928 KB
sample-02.txt 25 ms 924 KB
sample-03.txt 24 ms 928 KB
test-01.txt 24 ms 928 KB
test-02.txt 25 ms 800 KB
test-03.txt 24 ms 924 KB
test-04.txt 24 ms 924 KB
test-05.txt 25 ms 924 KB
test-06.txt 24 ms 844 KB
test-07.txt 24 ms 800 KB
test-08.txt 24 ms 928 KB
test-09.txt 24 ms 800 KB
test-10.txt 22 ms 924 KB
test-11.txt 24 ms 928 KB
test-12.txt 24 ms 924 KB
test-13.txt 24 ms 800 KB
test-14.txt 24 ms 804 KB
test-15.txt 23 ms 804 KB
test-16.txt 24 ms 916 KB
test-17.txt 26 ms 804 KB
test-18.txt 23 ms 920 KB
test-19.txt 25 ms 796 KB
test-20.txt 23 ms 920 KB
test-21.txt 24 ms 920 KB
test-22.txt 24 ms 932 KB
test-23.txt 24 ms 932 KB
test-24.txt 24 ms 920 KB
test-25.txt 25 ms 924 KB
test-26.txt 24 ms 928 KB
test-27.txt 24 ms 800 KB
test-28.txt 22 ms 800 KB
test-29.txt 23 ms 928 KB
test-30.txt 24 ms 924 KB