1/14 [编程题]扭蛋机

#include<bits/stdc++.h>
using namespace std;
#define line cout << "-----------" << endl;typedef long long ll;
const int maxn = 2e5 + 10;
const int MAXN = 1e6 + 10;
const int N = 2020;int n;
int a[maxn];int main(){scanf("%d", &n);int cnt = 0;while(n){if(n%2 == 1){a[cnt++] = 2;n = (n-1) / 2;}else{a[cnt++] = 3;n = (n-2) / 2;}}for(int i = cnt-1; i >= 0; i--){printf("%d", a[i]);}return 0;
}

2/14[编程题]脸滚键盘

#include<bits/stdc++.h>
using namespace std;
#define line cout << "-----------" << endl;typedef long long ll;
const int maxn = 2e5 + 10;
const int MAXN = 1e6 + 10;
const int N = 2020;struct node{char c;int id;int cnt;
};bool cmp(node a, node b){return a.id < b.id;
}int main(){int k;while(scanf("%d", &k) != EOF){getchar();char s[maxn];gets(s);int len = strlen(s);map<char, node> mp;int id = 0;for(int i = 0; i < len; i++){if(mp[s[i]].cnt == 0) mp[s[i]].id = id++;mp[s[i]].c = s[i];mp[s[i]].cnt++;}map<char, node>::iterator it;node p[maxn];int cnt = 0;for(it = mp.begin(); it != mp.end(); it++){if(it->second.cnt == 1){p[cnt].c = it->first;p[cnt].cnt = 1;p[cnt++].id = it->second.id;}//printf("%c  %d  %d\n", it->first, it->second.id, it->second.cnt);}sort(p, p+cnt, cmp);if(cnt < k) printf("Myon~\n");else printf("[%c]\n", p[k-1].c);mp.clear();}return 0;
}
/*
2 misakamikotodaisuki
3 !bakabaka~ bakabaka~ 1~2~9!
3 3.1415926535897932384626433832795028841971693993751o582097494459211451488946419191919l91919hmmhmmahhhhhhhhhh
7 www.bilibili.com/av170001
1 111
*/

3/14 简单表达式计算

while(line = readline()){if(line!="END"){print(eval(line)); }
}

4/14 小A最多会新认识的多少人

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define line cout<<"-----------"<<endltypedef long long ll;
const int maxn = 2e5 + 10;
const int MAXN = 1e6 + 10;int pre[maxn];
int n, id, t;int Find(int x){if(x == pre[x]) return x;else return pre[x] = Find(pre[x]);
}int main(){int num = 0;scanf("%d%d%d", &n, &id, &t);for(int i = 0; i <= n; i++)pre[i] = i;while(t--){int u, v;scanf("%d,%d", &u, &v);if(u == id || v == id) num ++;int fu = Find(u);int fv = Find(v);if(fu != fv){pre[fu] = fv;}}int fa = Find(id);int ans = 0;for(int i = 0; i < n; i++){if(Find(i) == Find(fa)) ans++;}cout << ans-num-1 << endl;return 0;
}

[编程题]山寨金闪闪

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define line cout<<"-----------"<<endltypedef long long ll;
const int maxn = 2e5 + 10;
const int MAXN = 1e7 + 10;int n, m;
int a[MAXN];int main(){clr(a);scanf("%d", &n);for(int i = 1; i <= n; i++){scanf("%d", &a[i]);}scanf("%d", &m);int cnt = 0;while(m--){int l, r;scanf("%d%d", &l, &r);if(r-l+1 >= 47) cnt++;else if(r-l+1 < 3) continue;else{   vector<int>ve;for(int i = l; i <= r; i++)ve.push_back(a[i]);sort(ve.begin(), ve.end());for(int i = 0; i < ve.size()-2; i++){if(ve[i] + ve[i+1] > ve[i+2]){cnt++;break;}}}}printf("%d\n", cnt);return 0;
}

[编程题]比较两个版本字符串version1和version2

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define line cout<<"-----------"<<endltypedef long long ll;
const int maxn = 2e5 + 10;
const int MAXN = 1e7 + 10;
char a[maxn], b[maxn];
int na[maxn], nb[maxn];int main(){scanf("%s %s", a, b);int la = strlen(a);int lb = strlen(b);int x = 0, cnta = 0, cntb = 0;for(int i = 0; i < la; i++){if(a[i] =='.'){na[cnta++] = x;x = 0;}else {x = x * 10 + (a[i] - '0');}}na[cnta++] = x;x = 0;for(int i = 0; i < lb; i++){if(b[i] =='.'){nb[cntb++] = x;x = 0;}else {x = x * 10 + (b[i] - '0');}}nb[cntb++] = x;x = 0;for(int i = 0; i < max(cnta, cntb); i++){if(na[i] == nb[i]) continue;else if(na[i] > nb[i]){printf("1\n");return 0;}else {printf("-1\n");return 0;}}printf("0\n");return 0;
}

[编程题]精灵鼠从入口到出口的最少减少速度

#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define line cout<<"-----------"<<endltypedef long long ll;
const int maxn = 2e5 + 10;
const int MAXN = 1e6 + 10;
const int N = 10000 + 10;int mp[N][N], dp[N][N];
int n;int main(){scanf("%d", &n);for(int i = 1; i <= n; i++){for(int j = 1; j < n; j++){scanf("%d,", &mp[i][j]);dp[i][j] = mp[i][j];}scanf("%d", &mp[i][n]);dp[i][n] = mp[i][n];}for(int i = 1; i <= n; i++){dp[i][1] = dp[i-1][1] + mp[i][1];dp[1][i] = dp[1][i-1] + mp[1][i];}for(int i = 2; i <= n; i++){for(int j = 2; j <= n; j++){dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + mp[i][j];}}/*for(int i = 1; i <= n; i++){for(int j = 1; j <= n; j++){printf("%d ", dp[i][j]);}cout << endl;}*/printf("%d\n", dp[n][n]);return 0;
}
/*
3
5,5,7
6,7,8
2,2,4*/

哔哩哔哩 2019秋招编程题合集相关推荐

哔哩哔哩 2019秋招编程题---山寨金闪闪
分析:这是一道关于能否构成三角形的题目构成三角形的条件:a+b>c(前提a<=b<=c,也就是排序)再加上a>0&&b>0&&c> ...
拼多多2019秋招编程题——选靓号
编程要求: 时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32M,其他语言64M 题目内容: A 国的手机号码由且仅由 N 位十进制数字(0-9)组成.一个手机号码中有至少 K 位数 ...
2018深信服java笔试题,深信服2018秋招编程题
深信服2018秋招编程题深信服2018秋招编程题第一题: 其中,reverse函数的代码实现如下: 1. unsigned int reverse(unsigned int num) { unsi ...
京东2018秋招编程题
C++开发工程师京东 2018秋招编程题 (代码后续更新...) 1.神奇数将一个数n的各数位分成两部分,两部分之和相等,则称这个数为神奇数.比如242分成[2,2].[4].输入一个范围[l, ...
滴滴2018秋招编程题
滴滴 2018秋招编程题 1.寻找丑数丑数的定义是,只包含因子2.3和5的数称作丑数.比如6和8是丑数,14不是丑数,因为含有因子7.输入一个整数n,输出第n个丑数.我们认为第一个丑数是1. 解析 ...
今日头条2018秋招编程题
今日头条 2018秋招 Android方向编程题 1.手串作为一个手串艺人,有金主向你订购了一条包含n个杂色串珠的手串–每个串珠要么无色,要么涂了若干种颜色.为了使手串的色彩看起来不那么单调,金主 ...
网易2017秋招编程题集合
[编程题]回文序列如果一个数字序列逆置之后跟原序列是一样的就称这样的数字序列为回文序列.例如: {1, 2, 1}, {15, 78, 78, 15} , {112} 是回文序列, {1, 2, ...
【2023秋招】近期硬件公司秋招内推合集以及笔试面试准备
1.近期秋招内推硬件公司整理公司名称网申时间招聘岗位投递链接英特尔 6月28日-9月初 FPGA Development Engineer,AI Frameworks Engineer,5G ...
system verilog编程题_拼多多2020校招部分算法编程题合集
拼多多2020校招部分算法编程题2道,多多的魔术盒子和多多的排列函数其实根据他的匹配职位我们可以看到,这5道题的难度还是并不高,只是作为一个初步筛选,我这边选择了前两道跟大家分享 [编程题一] 多多 ...

哔哩哔哩 2019秋招编程题合集

1/14 [编程题]扭蛋机

2/14[编程题]脸滚键盘

3/14 简单表达式计算

4/14 小A最多会新认识的多少人

[编程题]山寨金闪闪

[编程题]比较两个版本字符串version1和version2

[编程题]精灵鼠从入口到出口的最少减少速度

哔哩哔哩 2019秋招编程题合集相关推荐

最新文章

热门文章