目录
7-1 Hello World!
思路:无
坑点:无
#include<bits/stdc++.h>
using namespace std;
int main() {
cout << "Hello World!" << endl;
}
7-2 计算摄氏温度
思路:
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
int main() {
printf("fahr = 100, celsius = %d", 5*(100-32)/9);
}
7-3 念数字
思路:
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
string s[] = {
"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"
};
int main() {
string n; cin >> n;
int i = 0;
if(n[0] == '-') printf("fu "), i++;
for(; i < n.size(); i++) {
cout << s[n[i]-'0'];
if(i+1 != n.size()) cout << " ";
}
}
7-4 求整数段和
思路:
坑点:注意换行。
代码:
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
int ji = 0;
for(int i = n; i <= m; i++) {
sum += i;
ji++;
printf("%5d", i);
if(ji%5==0) {
printf("\n");
ji = 0;
}
}
if(ji == 0) printf("Sum = %d", sum);
else printf("\nSum = %d", sum);
}
7-5 个位数统计
思路:用字符串读入,用桶计数
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
int d[10];
int main() {
string s;
cin >> s;
for(int i = 0; i < s.size(); i++) {
d[s[i]-'0']++;
}
for(int i = 0; i <= 9; i++) {
if(d[i]) {
printf("%d:%d\n", i, d[i]);
}
}
}
7-6 考试座位号
思路:用map记录即可
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
map<int, string> ma;
int main() {
int n;
cin >> n;
string s, t;
int k;
for(int i = 0; i < n; i++) {
cin >> s >> k >> t;
s += " ";
s += t;
ma[k] = s;
}
cin >> n;
while(n--) {
cin >> k;
cout << ma[k] << endl;
}
}
7-7 打印沙漏
思路:先求出有多少层,然后再模拟题意即可
坑点:注意不一定用完所有字符
代码:
#include<bits/stdc++.h>
using namespace std;
int main() {
char s;
int n; cin >> n >> s;
int ce = 1, zn = 1;
if(n == 0) {
puts("");
return 0;
}
int i;
for(i = 2; ; i++) {
zn += 2*(2*i-1);
if(zn > n) break;
ce++;
}
zn -= 2*(2*i-1);
int len = ce;
int slen = len*2-1;
for(int i = len; i >= 1; i--) {
int yon = i*2-1;
for(int j = 0; j < (slen-yon)/2; j++) printf(" ");
for(int j = 0; j < yon; j++) printf("%c", s);
puts("");
}
for(int i = 2; i <= len; i++) {
int yon = i*2-1;
for(int j = 0; j < (slen-yon)/2; j++) printf(" ");
for(int j = 0; j < yon; j++) printf("%c", s);
puts("");
}
printf("%d", n-zn);
}
7-8 连续因子
思路:可以发现连续因子最多的时侯不超过20个,于是就可以枚举每一个因子,暴力判断即可
坑点:
代码:
#include<bits/stdc++.h>
using namespace std;
vector<int> ve;
int main() {
int n; cin >> n;
int q = sqrt(n);
int Max = 0, l = 0;
for(int i = 2; i <= q; i++) {
if(n%i == 0) {
int m = n / i;
int cn = 1;
for(int j = i+1; ; j++) {
if(m % j == 0) {
cn++;
m /= j;
} else break;
}
if(cn > Max) {
Max = cn;
l = i;
}
}
}
if(Max == 0) {
printf("1\n");
printf("%d\n", n);
return 0;
}
printf("%d\n", Max);
for(int i = l; i < l + Max; i++) {
printf("%d%c", i, "*\n"[i+1 == l+Max]);
}
}
7-9 城市间紧急救援
思路:直接迪杰斯特拉写就可以,相同最短路情况下累计路径数,更新最大的遇到的消防队。
坑点:变量有点多,别写错了。惨!
代码:
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
struct node {
int to, next, w;
}e[N];
int head[N], cnt;
void add(int u, int v, int w) {
e[++cnt] = node {v, head[u], w};
head[u] = cnt;
e[++cnt] = node {u, head[v], w};
head[v] = cnt;
}
int n, m, s, d;
int val[N], pre[N], dis[N], Max[N], vis[N], siz[N];
#define pii pair<int, int>
#define se second
#define fi first
priority_queue<pii, vector<pii>, greater<pii> > q;
void dij() {
for(int i = 0; i < n; i++) {
dis[i] = 100000000;
pre[i] = -1;
}
dis[s] = 0;
siz[s] = 1;
Max[s] = val[s];
q.push(make_pair(0, s));
while(!q.empty()) {
pii nw = q.top();
int u = nw.se;
q.pop();
if(vis[nw.se]) continue;
vis[nw.se] = 1;
for(int i = head[u]; i ; i = e[i].next) {
int v = e[i].to;
if(dis[v] > e[i].w + dis[u] ) {
dis[v] = e[i].w + dis[u];
siz[v] = siz[u];
Max[v] = Max[u] + val[v];
pre[v] = u;
q.push(make_pair(dis[v], v));
} else if( dis[v] == e[i].w + dis[u] ) {
if(Max[v] < Max[u] + val[v]) {
pre[v] = u;
Max[v] = Max[u] + val[v];
}
siz[v] += siz[u];
}
}
}
}
int vvv[N];
int main() {
cin >> n >> m >> s >> d;
for(int i = 0; i < n; i++) cin >> val[i];
for(int i = 1, u, v, w; i <= m; i++) {
cin >> u >> v >> w;
add(u, v, w);
}
dij();
printf("%d %d\n", siz[d], Max[d]);
cnt = 0;
while(d != -1) {
vvv[++cnt] = d;
d = pre[d];
}
for(int i = cnt; i >= 1; i--) {
printf("%d%c", vvv[i], " \n"[i==1]);
}
}
7-10 月饼
思路:简单的贪心,按照单价排序,从大往小取
坑点:虽然题目说了都是正整数。, 但是实测样例有浮点数。
代码:
#include<bits/stdc++.h>
using namespace std;
struct node {
double kc, zsj;
bool operator < (const node &a) const {
return zsj*a.kc > a.zsj * kc;
}
} e[2005];
int main() {
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> e[i].kc;
//assert((int)e[i].kc == e[i].kc);
}
for(int i = 1; i <= n; i++) {
cin >> e[i].zsj;
// assert((int)e[i].zsj == e[i].zsj);
}
sort(e+1, e+1+n);
double ans = 0;
for(int i = 1; i <= n; i++) {
if(m >= e[i].kc) {
m -= e[i].kc;
ans += e[i].zsj;
} else {
ans += m * (e[i].zsj * 1.0 / e[i].kc);
m = 0;
}
}
printf("%.2lf", ans);
}
7-11 链表去重
思路:发现地址都不大,于是用数组来模拟链表。
a[x]代表x的下一个地址是多少
zhi[x]代表地址x存的数值是多少
ton[]用来判断数字是否出现
坑点:注意控制好格式即可
代码:
#include<bits/stdc++.h>
using namespace std;
int a[100005];
int zhi[100005];
bool ton[100005];
vector<int> sc;
int main() {
int n, k, la, ne, x;
cin >> n >> k;
while(k--) {
scanf("%d %d %d", &la, &x, &ne);
a[la] = ne;
zhi[la] = x;
}
int st = n;
ton[abs(zhi[st])] = 1;
int nw = a[st];
while(nw != -1) {
if(ton[abs(zhi[nw])]) {
a[st] = a[nw];
sc.push_back(nw);
nw = a[nw];
} else {
ton[abs(zhi[nw])] = 1;
st = nw;
nw = a[nw];
}
}
st = n;
while(st != -1) {
printf("%05d %d ", st, zhi[st]);
if(a[st] == -1) printf("-1\n");
else printf("%05d\n", a[st]);
st = a[st];
}
n = sc.size();
for(int i = 0; i < n-1; i++) {
printf("%05d %d %05d\n", sc[i], zhi[sc[i]], sc[i+1]);
}
if(n != 0) {
printf("%05d %d -1\n", sc[n-1], zhi[sc[n-1]]);
}
}
7-12 搜索树判断
思路:先按照题目意思把树建立出来,判断是否是搜索树的话直接执行一次中序遍历,判断是否是有序的即可。注意到镜像搜索树和普通搜索树区别不大,可以少写一些函数。
坑点:注意输出格式
代码:
#include<bits/stdc++.h>
using namespace std;
int a[1005];
struct node {
int nw;
node *l, *r;
};
node* dfs(int l, int r, int f) {
if(l > r) return NULL;
int nw = l+1;
node *rt = new node;
rt->nw = a[l];
if(f==0)
for(; nw <= r; nw++) {
if(a[nw] >= a[l]) break;
}
else for(; nw <= r; nw++) {
if(a[nw] < a[l]) break;
}
rt->l = dfs(l+1, nw-1, f);
rt->r = dfs(nw, r, f);
return rt;
}
int vis[1005], cnt;
void dfs1(node *rt) {
if(rt == NULL) return ;
if(rt->l) dfs1(rt->l);
vis[++cnt] = rt->nw;
if(rt->r) dfs1(rt->r);
}
void prin(node *rt) {
if(rt == NULL) return ;
if(rt->l) prin(rt->l);
if(rt->r) prin(rt->r);
vis[++cnt] = rt->nw;
}
bool pd(node *rt, int f) {
cnt = 0;
dfs1(rt);
if(f)
for(int i = 1; i < cnt; i++) {
if(vis[i] > vis[i+1]) return 0;
}
else for(int i = 1; i < cnt; i++) {
if(vis[i] < vis[i+1]) return 0;
}
return 1;
}
int main() {
int n;cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
node *rt;
rt = dfs(1, n, 0);
if(pd(rt, 1)) {
cnt = 0;
printf("YES\n");
prin(rt);
for(int i = 1; i <= cnt; i++) {
printf("%d%c", vis[i], " \n"[i == cnt]);
}
return 0;
}
rt = dfs(1, n, 1);
if(pd(rt, 0)) {
cnt = 0;
printf("YES\n");
prin(rt);
for(int i = 1; i <= cnt; i++) {
printf("%d%c", vis[i], " \n"[i == cnt]);
}
return 0;
}
puts("NO");
}
7-13 凑零钱
思路:先dp判断是否有解,若有解直接搜索求答案。注意先排序一下,可以优化很大一部分的搜索时间。
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
int s[10004];
int dp[105];
int vi[105], n;
void dfs(int st, int sum, int la) {
if(sum == 0) {
for(int i = 0; i < st; i++) {
printf("%d%c", vi[i], " \n"[i == st-1]);
}
exit(0);
}
for(int i = la+1; i <= n; i++) {
if(sum >= s[i]) {
vi[st] = s[i];
dfs(st+1, sum - s[i], i);
}
}
}
int main() {
int m;
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> s[i];
}
dp[0] = 1;
sort(s+1, s + 1 + n);
for(int i = 1; i <= n; i++) {
for(int j = m; j >= s[i]; j--) {
dp[j] = max(dp[j], dp[j-s[i]]);
}
}
if(dp[m]) {
dfs(0, m, 0);
} else {
printf("No Solution");
}
}
7-14 社交集群
思路:用一个二维vector,把有相同兴趣的放在同一个vector里,然后并查集合并,多少个不同的集合就是判断多少个根。
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
vector<int > ve[1005];
int a[1005];
int Find(int x) {
return x == a[x] ? x : a[x] = Find(a[x]);
}
void merge(int x, int y) {
int fx = Find(x), fy = Find(y);
if(fx != fy) {
a[fx] = fy;
}
}
int val[1005];
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
int m;
scanf("%d:", &m);
for(int j = 0, x; j < m; j++) {
cin >> x;
ve[x].push_back(i);
}
}
for(int i = 1; i <= n; i++) {
a[i] = i;
}
for(int i = 1; i <= 1000; i++) {
int siz = ve[i].size();
for(int j = 0; j < siz-1; j++) {
merge(ve[i][j], ve[i][j+1]);
}
}
int si = 0;
for(int i = 1; i <= n; i++) {
if(Find(i) == i) si++;
val[Find(i)]++;
}
cout << si << endl;
sort(val + 1, val + 1 + 1000, [](int a, int b) {
return a > b;
});
for(int i = 1; i <= si; i++) {
printf("%d%c", val[i], " \n"[i==si]);
}
}
7-15 特殊堆栈
思路:比较水的说,可惜被另一题卡住了。主要是求中值问题,可以用树状数组+二分写,也可以直接用平衡树,前者好写一点的说。
坑点:无
代码:
#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x & (-x)
const int N = 1e5;
int c[N+5];
char s[15];
void upd(int pos, int val) {
for(pos; pos <= N; pos += lowbit(pos)) c[pos] += val;
}
int qry(int pos) {
int res = 0;
for(; pos; pos -= lowbit(pos)) {
res += c[pos];
}
return res;
}
int sum;
stack<int> st;
int qry1(int x) {
int l = 1, r = N, ans = 0;
while(l <= r) {
int mid = l + r >> 1;
if( qry(mid) >= x) {
ans = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
return ans;
}
int main() {
int n, x;
scanf("%d", &n);
// freopen("123.txt", "w", stdout);
for(int i = 1; i <= n; i++) {
scanf("%s", s);
switch (s[1]) {
case 'u': {
scanf("%d", &x);
st.push(x);
upd(x, 1);
sum++;
break;
}
case 'o':
if(sum == 0) printf("Invalid\n");
else {
x = st.top();
st.pop();
printf("%d\n", x);
upd(x, -1);
sum--;
}
break;
case 'e':
if(sum == 0) printf("Invalid\n");
else {
printf("%d\n", qry1(sum+1>>1));
}
break;
}
}
}