-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDislike_of_Threes.cpp
More file actions
65 lines (58 loc) · 1.22 KB
/
Copy pathDislike_of_Threes.cpp
File metadata and controls
65 lines (58 loc) · 1.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*Dislike of Threes
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Example
inputCopy
10
1
2
3
4
5
6
7
8
9
1000
outputCopy
1
2
4
5
7
8
10
11
14
1666
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
list<int> a;
for(int i=1;i<10000;i++){
if(i%3!=0 && i%10!=3){
a.push_back(i);
}
}
for(int j=0;j<n;j++){
int b;
cin>>b;
list<int>::iterator p;
p=a.begin();
advance(p,(b-1));
cout<<*p<<endl;
}
return 0;
}