HackerEarth Robotic moves problem solution YASH PAL, 31 July 2024 In this HackerEarth Robotic moves problem solution, A robot’s initial position is (0,0) and it can only move along X-axis. It has N moves to make and in each move, it will select one of the following options: Go to (X – 1,0) from (X,0) Go to (X + 1,0) from (X,0) Remain at its current position Your task is to calculate sigma(abs(X) + abs(Y)) for all reachable (X,Y). HackerEarth Robotic moves problem solution. #include<bits/stdc++.h>using namespace std;#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)#define mod 1000000007#define endl "n"#define test ll txtc; cin>>txtc; while(txtc--)typedef long long int ll;typedef long double ld;int main() { FIO; test { ll n; cin>>n; ll ans=n*(n+1); cout<<ans<<endl; } return 0;} second solution t = int(input())while t > 0: t -= 1 n = int(input()) print(n * (n + 1)) coding problems
i have submitted this but it is partially accepted i dont know why?#includeusing namespace std;int main(){ int t,n; cin>>t; while(t–){ cin>>n; cout<<n*(n+1)<<endl; }}