제출 #337860

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337860		amunduzbaev	홀-짝 수열 (IZhO11_oddeven)	C++14	0 / 100	1 ms	364 KiB

oddeven

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 305;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, last, szz;
bool ok;
int tstr(int a){
	int ans = 0;
	while(a){
		ans ++;
		a/=10;
	}
	return ans;
}

void add(int cnt){
	last++;
	for(int i=0;i<cnt;i++){
		szz += tstr(last);
		if(szz >= n){
			return; 
			ok = 1;
		}
		last += 2;
	}
	last-=2;
	return;
}

void solve(){
	fastios 
	int i = 2;
	szz = 1, last = 1, ok = 0;
	cin>>n;
	while(!ok && szz < n){
		//cout<<i<<endl;
		add(i);	
		i++;
	}
	
	szz -= n;
	string ans = "";
	while(last){
		ans.pb((last%10)+'0');
		last /= 10;
	}
	cout<<ans[szz]<<"\n";
	return;
}

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

• Subtask 1: 0 / 100