Codeforces Round #479 (Div. 3)

链接：点击打开链接

A:

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
	int n, k;
	cin >> n >> k;
	while (k--) {
		if(n % 10 == 0) {
			n /= 10;	
		}
		else {
	    n--;  		
	  }	
	}
	cout << n;
	return 0;
}

字符处理：

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
	int n, k, num = 0;
	string s;
	cin >> s >> k;
	n = s.length() - 1;
	while(true) {
	  if(k - num <= s[n] - '0' + 1) {
		  break;
	  }
	  num += s[n--] - '0' + 1;
	}
	for(int i = 0; i < n; i++) {
	  cout << s[i];	
	}
	if (s[n] - k + num != '/') {
    printf("%c", s[n] - k + num);
  }
	return 0;
}

B:

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>

using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	string s;
	int n;
	cin >> n >> s;
	char a = s[0], b = s[1];
	int num, k = 1;
	for (int i = 0; i < s.length() - 1; i++) {
		num = 1;
	  for (int j = i + 1; j < s.length() - 1; j++) {
		  if(s[i] == s[j] && s[i + 1] == s[j + 1]) {
		  	num++;	
		  }
	  }
	  if (num >= k) {
	  	if (num == k) {
	  		if (a > s[i]) {
	  		  a = s[i];
			    b = s[i + 1];
	  		}
	  		else {
	  			if (a == s[i] && b > s[i + 1]) {
	  				
	  			  b = s[i + 1];	
	  			}	
	  		}
	  	}
	  	else {
	      k = num;
			  a = s[i];
			  b = s[i + 1];
			}
	  }
	}
	cout << a << b;
	return 0;
}

C:

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, k;
	cin >> n >> k;
	int a[n + 2];
	a[0] = 1;
	a[n + 1] = 1000000001;
	for (int i = 1; i <= n; i++) {
	  cin >> a[i];
  }
  sort(a + 1, a + n + 2);
  if (a[k] == a[k + 1]) {
    cout << -1;	
  }
  else {
    cout << a[k];
  }
	return 0;
}