P11449 35分re求调QWQ
查看原帖
P11449 35分re求调QWQ
1049409
I_have_a_plan楼主2024/12/28 20:30
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long

const int N = 1e5+10;
int T;
int a[N], sum[N] = {0}, maxn = 0;

int nihao(int n){
	int su = 0;
	for(int i = 1, j = 5; i <= n; i++, j *= 10) su += j;
	return su;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin >> T;
	for(int i = 1; i <= T; i++){
		cin >> a[i];
		maxn = max(maxn, a[i]);
	}
	
    ull an = 10;
	for(int i = 2; i <= 5; i++){
		an *= 10;
		for(int j = an - nihao(i)/*(an*4) + (an>>1) + 1 - ((an/10)>>1)*/; j < (an>>1)/*an*5*/; j++){
			sum[j] = 1;
		}
		
	}
	
	for(int i = 1; i <= maxn+10; i++) sum[i] += sum[i-1];
	
	for(int i = 1; i <= T; i++) cout << sum[a[i]] << endl;
	return 0;
}
2024/12/28 20:30
加载中...