1864A - Increasing and Decreasing - CodeForces Solution


constructive algorithms implementation math

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t;
	cin>>t;
		while(t--){
			int x,y,n;
			cin>>x>>y>>n;
			vector<int> a(n,0);
			a[n-1]=y;a[0]=x;
			for(int i=1;i<n-1;i++){
				a[n-i-1]=a[n-i]-i;
			}
			if(a[1]-a[0]>n-2){
				for (int i = 0; i < n; ++i)
				{
					cout<<a[i]<<" ";
				}cout<<endl;
			}else{
				cout<<-1<<endl;
			}
		}
	return 0;
}


Comments

Submit
0 Comments
More Questions

129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem