EXPTREE (JULY 17) [CPP] #197
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -17,5 +17,6 @@ | |
| *.class | ||
| *.pyc | ||
| *.html | ||
| .idea/ | ||
|
|
||
|
|
||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,65 @@ | ||
| // BY: _nishant0208_ | ||
|
|
||
| #include <bits/stdc++.h> | ||
| #include <algorithm> | ||
| using namespace std; | ||
| typedef long long ll; | ||
|
|
||
| #define MAX1 1000000007 | ||
|
|
||
| #define MAX2 1000000009 | ||
|
|
||
| #define MAX 100001 | ||
|
|
||
| ll MOD; | ||
| ll exponent(ll, ll); | ||
| ll modinverse(ll); | ||
|
|
||
| int main(){ | ||
| ll t; | ||
| cin >> t; | ||
| while(t--){ | ||
| ll n; | ||
| cin >> n; | ||
| n--; | ||
| ll x, y, temp1, temp2; | ||
| MOD = MAX1; | ||
| x = ((n % MOD) * ((n + 1) % MOD)) % MOD; | ||
| y = (2 * ((2 * n - 1) % MOD)) % MOD; | ||
| if(x % 2 == 0 && y % 2 == 0){ | ||
| x /= 2; | ||
| y /= 2; | ||
| } | ||
| if(x % 3 == 0 && y % 3 == 0){ | ||
| x /= 3; | ||
| y /= 3; | ||
| } | ||
| temp1 = ((x % MOD) * (modinverse(y))) % MOD; | ||
| MOD = MAX2; | ||
| x = ((n % MOD) * ((n + 1) % MOD)) % MOD; | ||
| y = (2 * ((2 * n - 1) % MOD)) % MOD; | ||
| if(x % 2 == 0 && y % 2 == 0){ | ||
| x /= 2; | ||
| y /= 2; | ||
| } | ||
| if(x % 3 == 0 && y % 3 == 0){ | ||
| x /= 3; | ||
| y /= 3; | ||
| } | ||
| temp2 = ((x % MOD) * (modinverse(y))) % MOD; | ||
| cout << temp1 << " " << temp2 << "\n"; | ||
| } | ||
| return 0; | ||
| } | ||
|
|
||
| ll exponent(ll a, ll b) { | ||
| if(b == 0) | ||
| return 1; | ||
| ll temp = (exponent(a, b / 2)) % MOD; | ||
| temp = (temp * temp) % MOD; | ||
| return (b % 2 == 0) ? temp : ((a % MOD) * temp) % MOD; | ||
| } | ||
|
|
||
| ll modinverse(ll val) { | ||
| return exponent(val, MOD - 2); | ||
| } | ||
|
There was a problem hiding this comment. After which line number? |
||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Rather simply delete the .idea files for now and in another PR you can do this 😉