|
A. Dislike of Threes
Description
Polycarp doesn’t like integers that are divisible by 3 or end with the digit 3 in their decimal representation. Integers that meet both conditions are disliked by Polycarp, too.
Polycarp starts to write out the positive (greater than 0) integers which he likes: 1,2,4,5,7,8,10,11,14,16,…. Output the k-th element of this sequence (the elements are numbered from 1).
Input
The first line contains one integer t (1≤t≤100) — the number of test cases. Then t test cases follow.
Each test case consists of one line containing one integer k (1≤k≤1000).
Output
For each test case, output in a separate line one integer x — the k-th element of the sequence that was written out by Polycarp.
Examples
input
10
1
2
3
4
5
6
7
8
9
1000
output
1
2
4
5
7
8
10
11
14
1666
题解：签到题，要求查询第k个符合不能被3整除且数字末尾不为3的数，注意k值不大，多次查询，先打表比较快。附代码：
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int res[1001];
int main(){
int t;
cin>>t;
int j=1;
for(int i=0;i<1000;i++){
while(j%3==0||j%10==3)j++;
res[i]=j;j++;
}
while(t--){
int tmp;
scanf("%d",&tmp);
printf("%d\n",res[tmp-1]);
}
return 0;
}
|