-
Notifications
You must be signed in to change notification settings - Fork 0
/
Nugget.cpp
86 lines (73 loc) · 1.46 KB
/
Nugget.cpp
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <bits/stdc++.h>
using namespace std;
int ans[150];
int ans1[150];
int main(){
int n;
int sml,med,large;
int x,mark,y;
x = 0;
y = 0;
sml = 6;
med = 9;
large = 20;
mark = 0;
scanf("%d", &n);
for(int i = 6 ; i <= n ; i+= 3){
ans[x] = i;
x++;
mark ++;
}
for(int i = 20 ; i <= n ; i+= 3){
if(i == 23){
continue;
}
ans[x] = i;
x++;
mark ++;
}
for(int i = 40 ; i <= n ; i+= 3){
if(i == 43){
continue;
}
ans[x] = i;
x++;
mark ++;
}
for(int i = 60 ; i <= n ; i+= 3){
if(i == 63){
continue;
}
ans[x] = i;
x++;
mark ++;
}
for(int i = 80 ; i <= n ; i+= 3){
if(i == 83){
continue;
}
ans[x] = i;
x++;
mark ++;
}
sort(ans,ans+x);
for(int i = 0 ; i < x ; i++){
if(ans[i] != ans[i+1]){
ans1[y] = ans[i];
y++;
}
else{
continue;
}
}
sort(ans1,ans1+y);
if(mark != 0){
for(int i = 0 ; i < y ; i++){
printf("%d\n",ans1[i]);
}
}
else{
printf("no");
}
return 0;
}