Submission #433407

---

Source Code Expand

#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, ll> P;
typedef pair<ll, P> Pl;

#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())
#define ub(vec,a) upper_bound(vec.begin(),vec.end())
#define uniq(vec) vec.erace(unique(vec.begin(),vec.end(),vec.end))
#define mp1(a,b,c) P1(a,P(b,c))

int main(){
	//stirng str,str1;
	char a[5];
	double n;
	rep(i, 5){
		cin >> a[i];
	}
	cin >> n;
	//int n=str.length();
	sort(a, a + 5);

	//cout<<a[n/5]<<a[n%5-1]<<endl;
	int temp;

	if (n / 5 <= 1)cout << a[0];
	else if (n / 5 <= 2)cout << a[1];
	else if (n / 5 <= 3)cout << a[2];
	else if (n / 5 <= 4)cout << a[3];
	else if (n / 5 <= 5)cout << a[4];

	int m = n;
	if (m%5>0)
		cout << a[m % 5 - 1] << endl;
	else
		cout << a[4] << endl;

}

Submission Info

Judge Result