codeforces#667 div3

A

#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
	int n;	
	int a,b;
	cin>>n;
	while(n--)
	{
	
		cin>>a>>b;
		int sum=abs(a-b);
		if(sum%10==0)
		{
			cout<<sum/10<<endl;
		}
		else
		{
			cout<<sum/10+1<<endl;
		}
	}
	
} 

B

#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
	int t,a,b,x,y,n;
	cin>>t;
	while(t--){
		cin>>a>>b>>x>>y>>n;
		int ax = a-x;
		int by = b-y;
		int na,ma;
		int nb,mb;
		if(ax<n){
			na = x;
			if(n>ax+by)
				ma = y;
			else
				ma = b-(n-ax);
		}
		else{
			na = a-n,ma=b;
		}
		if(by<n){
			nb = y;
			if(n>ax+by)
				mb = x;
			else
				mb = a-(n-by);
		}
		else{
			nb = b-n,mb=a;
		}
		cout<<min(1ll*na*ma,1ll*nb*mb)<<endl;
	}
	return 0;
}

C

#include <algorithm>
using namespace std;
 
int main(){
	int t,x,y,n;
	cin>>t;
	while(t--){
		cin>>n>>x>>y;
		int d = y-x;
		int m;
		for(m = n-1;;m--)
			if(d%m==0)
				break;
		m = d/m;
		for(int i=1;y-m>0&&i<n;i++)
			y-=m;
		for(int i=0;i<n;i++)
		{
			cout<<y<<" ";
			y+=m;
		}
		cout<<endl;
	}
	return 0;
}