Skip to content

Commit e6a7eba

basu-96 basu-96

authored

July Challenge 2020 Div 2

1 parent 290020c commit e6a7ebaCopy full SHA for e6a7eba

File tree

1 file changed

+37

-0

lines changed

CHEFSTR1.cpp

1 file changed

+37

-0

lines changed

`‎CHEFSTR1.cpp`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+#include<bits/stdc++.h>`
	`2`	`+using namespace std;`
	`3`	`+`
	`4`	`+#define f(i,a,b) for(i=a;i<b;i++)`
	`5`	`+#define rep(i,n) f(i,0,n)`
	`6`	`+#define fd(i,a,b) for(i=a;i>=b;i--)`
	`7`	`+#define lli long long int`
	`8`	`+#define vi vector<int>`
	`9`	`+#define vll vector<lli>`
	`10`	`+#define pb push_back`
	`11`	`+#define all(v) v.begin(),v.end()`
	`12`	`+`
	`13`	`+void solve(){`
	`14`	`+ lli n,i,ans=0;`
	`15`	`+ cin >> n;`
	`16`	`+ lli arr[n];`
	`17`	`+ cin >> arr[0];`
	`18`	`+ f(i,1,n){`
	`19`	`+ cin >> arr[i];`
	`20`	`+ ans+=abs(arr[i]-arr[i-1]) - 1;`
	`21`	`+ }`
	`22`	`+ cout << ans << endl;`
	`23`	`+}`
	`24`	`+`
	`25`	`+int main(){`
	`26`	`+ ios::sync_with_stdio(0);`
	`27`	`+ cin.tie(0);`
	`28`	`+ cout.tie(0);`
	`29`	`+`
	`30`	`+ int test_cases;`
	`31`	`+ //test_cases = 1;`
	`32`	`+ cin >> test_cases;`
	`33`	`+ while(test_cases--){`
	`34`	`+ solve();`
	`35`	`+ }`
	`36`	`+ return 0;`
	`37`	`+}`

0 commit comments

Comments

(0)