A

# include <bits/stdc++.h>
using namespace std;
int n,k; 
int main() {
	cin >> n >> k;
	while (k--) {
		if (n % 10) n--;
		else n /= 10;
	}
	cout << n;
}

B

# include <bits/stdc++.h>
using namespace std;

long long n;

int main() {
	cin >> n;
	if (n == 1) {
		cout << "WA";
		return 0;
	}
	for (int i=2; 1ll*i*i<=n; ++i) 
	{
		if (n%i == 0) {
			cout << "WA";
			return 0;
		}
	}
	cout << "AC";
} 

C

# include <bits/stdc++.h>
using namespace std;

int n,a[100010];
long long sum;

int main() {
	cin >> n;
	for (int i=1; i<=n; ++i) cin >> a[i], sum += a[i];
	sum /= n-1;
	for (int i=1; i<=n; ++i) cout << sum - a[i] << " ";
} 

D

# include <bits/stdc++.h>
using namespace std;

struct stone{
	int id;
	string logo;
	string data;
	int val;
}a[1010];

int n;

bool cmp(stone x, stone y) {
	if (x.data != y.data) return x.data < y.data;
	if (x.val != y.val) return x.val > y.val;
	return x.id < y.id;
}

int main() {
	cin >> n;
	for (int i=1; i<=n; ++i)
		cin >> a[i].id >> a[i].logo >> a[i].data >> a[i].val;
		
	sort(a+1, a+n+1, cmp);
	
	for (int i=1; i<=n; ++i) {
		cout << a[i].id << " " << a[i].logo << " " << a[i].data << " " << a[i].val << "\n";	
	}
}

E

#include<bits/stdc++.h>
using namespace std;
int n,a[5010];
long long ans;
int main(){
	cin >> n;
	for (int i=1; i<=n; ++i) cin >> a[i];
	for (int j=1; j<=n; ++j) {
		int x=0, y=0;
		for (int i=1; i<j; ++i) if (a[i] > a[j]) x++;
		for (int i=j+1; i<=n; ++i) if (a[i] > a[j]) y++;
		ans += x*y;
	} 
	cout << ans;
	return 0;
}

F

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t;
	cin >> t;
	for(int i = 1; i <= t; i++){
		int a, b, sum = 0;
		cin >> a >> b;
		while(1){
			if(a == 0 || b == 0){
				break;
			}else if(a <= b){
				sum+=b/a;
				b %= a;
			}else if(b < a){
				sum+=a/b;
				a %= b;
			}
		}
		cout << sum << endl;
	}
	return 0;
}