Snail Chess: Problem Solving (Guaranteed to be no less than 80 points......)

C2024010 2024-07-15 18:45:08 2024-07-21 10:16:33

#include<bits/stdc++.h>

using namespace std;

typedef long long L_L;

struct Snail_Chess{

L_L starting_point_x;

L_L go_ahead_y;

L_L Back_z;

L_L Analyzing_conditions_k;

L_L After_step_s;

};

Snail_Chess a[100005];

int main() {

L_L t; cin>>t;

for(int i=0;i<t;i++){

	cin>>a[i].starting_point_x>>a[i].go_ahead_y>>a[i].Back_z;

	cin>>a[i].Analyzing_conditions_k>>a[i].After_step_s;

	for(int j=0;j<a[i].After_step_s;j++){

		if(a[i].starting_point_x<a[i].Analyzing_conditions_k)

			a[i].starting_point_x+=a[i].go_ahead_y;

		else

		    a[i].starting_point_x-=a[i].Back_z;

	}

	cout<<a[i].starting_point_x<<endl;

}

return 0;

}