比赛地址
A:
考点:转义字符
#include<stdio.h>
int main() {
printf("\"kunshen NB!\"");
}
B:
计算题 + 输入格式
#include<stdio.h>
#include<math.h> // 绝对值函数abs头文件
int main() {
int x, y, a, b;
char s;
scanf("%d:%d", &a, &b);
scanf("%d:%d", &x, &y);
b += a* 60;
y += x * 60;
printf("%d",abs(y - b));
return 0;
}
C:
按题意模拟
#include<iostream>
using namespace std;
typedef long long LL;
string s;
int main() {
cin >> s;
LL cnt = 0 , sum = 0, flag;
for(int i = 0; i < s.length(); ++i) {
if(s[i] == 'w') {
cnt++;
flag = 1;
} else {
if(flag) sum += 2*cnt-1;
cnt = 0;
flag = 0;
}
}
if(cnt) sum += 2*cnt-1;
cout << sum << endl;
return 0;
}
D:
找出有几个数相同
#include<iostream>
#include<algorithm>
using namespace std;
int a[5];
int main() {
int cnt = 0;
for(int i = 1; i <= 4; ++i) {
cin >> a[i];
}
sort(a+1,a+4+1);
for(int i = 1; i < 4; ++i) {
if(a[i] == a[i+1]){
cnt++;
}
}
cout << cnt << endl;
}
E :
统计有多少人的分数比焌焌小即可
#include<stdio.h>
int n, k, j, m;//j为焌焌的分数,m记录参赛选手分数
int main() {
scanf("%d%d%d", &n,&k,&j);
int t = n;
for(int i = 1; i <= n-1; ++i) {
scanf("%d", &m);
if(j >= m) {
t--;
}
}
if(t <= k)printf("%d\n",t);
else puts("gg");
return 0;
}
F:
strstr寻找子串的函数
#include<stdio.h>
#include<string.h>
int t;
char s[1005];
int main() {
char s1[] = "six", s2[] = "fk", s3[] ="st", s4[] = "plmm";
scanf("%d", &t);
while(t--) {
scanf("%s", s);
if(strstr(s,s1) != NULL || strstr(s,s2) != NULL|| strstr(s,s3) != NULL|| strstr(s,s4) != NULL) {
puts("shufule!");
} else puts("I feel unwell!");
}
return 0;
}
G:
法一:九进制模拟
#include<bits/stdc++.h>
using namespace std;
int n, t;
long long p, sum, x;
int main() {
cin >> n;
for(int i = 0; i < n; i++){
p = 1;
sum = 0;
cin >> x;
string s = to_string(x);
for(int i = 0; i < s.size(); i++) {
if(s[i] == '7') {
s[i] = '6';
for(int j = i+1; j < s.size(); j++) {
s[j] = '9';
}
break;
}
}
x = 0;
for(int i = 0; i < s.size(); i++) {
x = x * 10 + s[i]-'0';
}
while (x){
t=x%10;
if (t >= 7) t--;
sum+=p*t;
x /= 10;
p *= 9;
}
cout << sum <<endl;
}
}
记忆化搜索
——来自某某X
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;
int a[15];
LL dp[15][2];
int dfs(int step, bool limit, bool limit1) {
if(!step) return limit1;
if(!limit && ~dp[step][limit1]) return dp[step][limit1];
int r = limit ? a[step] : 9;
LL ans = 0;
for(int i = 0; i <= r; i++) {
ans += dfs(step-1, limit && a[step] == i, limit1 || (i == 7));
}
if(!limit) dp[step][limit1] = ans;
return ans;
}
LL solve(LL x) {
int cnt = 0;
while(x) {
a[++cnt] = x % 10;
x /= 10;
}
return dfs(cnt, 1, 0);
}
int main() {
int t;
LL x;
cin >> t;
memset(dp, -1, sizeof dp);
while(t--) {
cin >> x;
cout << x - solve(x) << endl;
}
}
H:
数学题 or 二分答案
#include<iostream>
#include <iomanip>
using namespace std;
double s, a, b, x;
int main(){
// ___x___s-2x____x____;x为人走的路程
cin >> s >> a >> b;
x = (2*a*s)/(3*a+b);
cout <<fixed<<setprecision(6) << x/a+(s-x)/b << endl;
return 0;
}
I:
贪心 + 大数减法
——来自陶某某
#include<bits/stdc++.h>
using namespace std;
const int N = 100;
int x[100]={0},y[100]={0},z[105]={0};
void sub(int x[],int y[],int len) //大数减法
{
int i,j;
for(i=0;i<len;i++)
{
if(x[i]>=y[i])//如果x[i]>=y[i],不用向前一位借1,可直接减
z[i]=x[i]-y[i];
else //如果x[i]<y[i],向前一位借1,同时前一位应减1
{
z[i]=x[i]+10-y[i];
x[i+1]=x[i+1]-1;
}
}
for(i=len-1;i>0;i--)//删除前缀0
{
if(z[i]==0)
len--;
else
break;
}
for(i=len-1;i>=0;i--) //倒序输出数组
printf("%d",z[i]);
printf("\n");
}
bool cmp(int x,int y) //让sort倒序函数
{
return x > y;
}
int main()
{
char a[N],b[N];
int c[N],d[N],e[N]={0},l,q[N],w[N];
scanf("%s%s",a,b);
l=strlen(a);
for(int i=0;i<l;i++) c[i]=a[i]-'0';
for(int i=0;i<l;i++) d[i]=b[i]-'0';
sort(c,c+l);//必赢的bobo
sort(d,d+l,cmp);//必输的lulu
for (int i=0;i<l;i++){ //7889 5567 22278
for(int j=0;j<l;j++) //6544 6554 65432
{
if(c[j]==d[i]) {e[i]=c[j];c[j]=0; break;}
if(c[j]>d[i]) {
e[i]=c[j];c[j]=0;
for(j=0;j<l;j++) {if(c[j]>0) {i++;e[i]=c[j];}if(i==l-1) goto loop;}
}
}
}
loop:
for(int i=l-1,j=0;i>=0;i--)//将两个字符串中的字符转化为数字,并倒序储存到数组中,即字符串为123456,则数组为654321
q[j++]=e[i];
for(int i=l-1,k=0;i>=0;i--)
w[k++]=d[i];
sub(q,w,l);
return 0;
}
来自某某X
#include<bits/stdc++.h>
using namespace std;
int a[10];
string cha(string &s, string &t) {
int len = s.size();
int tmp = 0;
for(int i = len-1; i >= 0; i--) {
if(s[i] - t[i] - tmp >= 0) {
s[i] -= t[i] - '0' + tmp;
tmp = 0;
} else {
s[i] = (10 + s[i]-'0' - (t[i] - '0') - tmp + '0');
tmp = 1;
}
}
for(int i = 0; s[i]; ++i) {
if(s[i]-'0' > 0) return s.substr(i);
}
}
int main() {
string s, t;
cin >> s >> t;// Bobo, Lulu
sort(s.begin(), s.end());
reverse(s.begin(), s.end());
sort(t.begin(), t.end());
reverse(t.begin(), t.end());
int n = s.size();
for(int i = 0; i < n; ++i) {
a[s[i]-'0']++;
}
string ans;
for(int i = 0; i < n; ++i) {
int f = 0;
for(int j = t[i]-'0'; j <= 9; ++j) {
if(a[j]) {
f = j; a[j]--; break;
}
}
ans += char(f+'0');
if(f != t[i] - '0') break;
}
for(int i = 0; i <= 9; ++i) {
while(a[i]) ans += char (i + '0'), a[i]--;
}
cout << cha(ans, t);
return 0;
}