Skip to content

edits #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
NabilSilva wants to merge 20 commits into
base: Yuan
Choose a base branch
from
Open

edits #1

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
20 commits
Select commit Hold shift + click to select a range
0fb2e5c
Add triplets solution and editorial
derekhh Jun 23, 2014
0107ff0
Deleting the typo.
Jun 23, 2014
544120c
Add two new solutions
derekhh Jun 23, 2014
74db177
Add test.txt in master
Jun 23, 2014
3981c59
Merge branch 'master' of https://github.com/derekhh/HackerRank
Jun 23, 2014
20a5038
add dog.txt
Jun 23, 2014
6a096d0
Remove txt files
derekhh Jun 23, 2014
9b783f7
Add Addepar Hackathon solutions
derekhh Jun 28, 2014
279118f
Add new solutinos
derekhh Jun 28, 2014
8c60c09
Commit merges
derekhh Jun 28, 2014
59cf9d7
Add solutions to Weekly Challenges - Week 6
derekhh Jul 7, 2014
b66429c
Add euler001.cpp
derekhh Jul 7, 2014
140dec5
Add new solutions
derekhh Jul 26, 2014
d115ed4
Add some solutions to 101 Hack July 14
derekhh Jul 27, 2014
26af096
Add solutions to Weekly Challenges 8
derekhh Aug 13, 2014
6cc303d
Ad Infinitum Aug
derekhh Aug 20, 2014
55dc665
Add Weekly Challenges 9 and 10 problems, I'm really too lazy lately.
derekhh Sep 15, 2014
916d517
Add Week 11 problems
derekhh Nov 1, 2014
d0bff8d
Add 101 Hack October solutions
derekhh Nov 11, 2014
3bd96c2
Check in Week 12 solutions
derekhh Jan 5, 2015
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
174 changes: 173 additions & 1 deletion HackerRank.vcxproj
View file
Open in desktop

Large diffs are not rendered by default.

162 changes: 162 additions & 0 deletions HackerRank.vcxproj.filters
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,6 +27,9 @@
<None Include="pairs.md">
<Filter>Source Files</Filter>
</None>
<None Include="triplets.md">
<Filter>Source Files</Filter>
</None>
</ItemGroup>
<ItemGroup>
<ClCompile Include="basic-cryptanalysis.cpp">
Expand Down Expand Up @@ -254,5 +257,164 @@
<ClCompile Include="bridges-and-harbors.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="even-odd-query.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="closest-number.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="kundu-and-tree.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="swappermutation.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="jagia-playing-with-numbers.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="triplets.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="find-point.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="game-of-thrones.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="icecream-parlor.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="computing-analytics.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="consistent-salaries.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="guessing-numbers.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="risk-management.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="special-numbers.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="upstairs.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="yaxis.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="acm-icpc-team.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="consecutive-subsequences.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="minimum-average-waiting-time.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="dynamic-summation.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="euler001.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="die-hard-3.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="chocolate-in-box.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="string-function-calculation.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="cavity-map.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="bus-station.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="xor-and-sum.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="counter-game.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="john-and-gcd-list.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="gneck.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="black-box-1.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="reverse-game.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="stepping-stones-game.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="jim_beam.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="akhil-and-gf.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="divisibility-of-power.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="emma-and-sum-of-products.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="matrix-tree.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="sansa-and-xor.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="lexicographic-steps.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="alternating-characters.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="cipher.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="towers.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="robot.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="sherlock-and-square.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="strange-numbers.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="grid-challenge.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="tree-pruning.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="jim-and-the-jokes.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="candles-2.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="priyanka-and-toys.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="chief-hopper.cpp">
<Filter>Source Files</Filter>
</ClCompile>
<ClCompile Include="favourite-sequence.cpp">
<Filter>Source Files</Filter>
</ClCompile>
</ItemGroup>
</Project>
39 changes: 39 additions & 0 deletions acm-icpc-team.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
//acm-icpc-team.cpp
//ACM ICPC Team
//Weekly Challenges - Week 6
//Author: derekhh

#include<cstdio>
#include<vector>
#include<bitset>
using namespace std;

char str[1010];
vector<bitset<1000>> v;

int main()
{
int n, m;
scanf("%d%d", &n, &m);
getchar();
for (int i = 0; i < n; i++)
{
scanf("%s", str);
bitset<1000> b(str);
v.push_back(b);
}

int best = 0, cnt = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
bitset<1000> t = v[i] | v[j];
if (t.count() > best) best = t.count(), cnt = 1;
else if (t.count() == best) cnt++;
}
}
printf("%d\n", best);
printf("%d\n", cnt);
return 0;
}
42 changes: 42 additions & 0 deletions akhil-and-gf.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,42 @@
//akhil-and-gf.cpp
//Akhil and GF
//Ad Infinitum - Math Programming Contest August'14
//Author: derekhh

#include<iostream>
using namespace std;

long long mod_mul(long long x, long long y, long long n)
{
if (!x) return 0;
return (((x & 1)*y) % n + (mod_mul(x >> 1, y, n) << 1) % n) % n;
}

long long ModExp(long long a, long long b, long long n)
{
long long c = 1, d = a;
while (b)
{
if (b & 1) c = mod_mul(c, d, n);
d = mod_mul(d, d, n);
b >>= 1;
}
return c;
}

int main()
{
int t;
cin >> t;
while (t--)
{
long long n, m;
cin >> n >> m;
long long tmp = ModExp(10, n, 9 * m);
tmp--;
if (tmp < 0) tmp += 9 * m;
tmp /= 9;
cout << tmp << endl;
}
return 0;
}
40 changes: 40 additions & 0 deletions alternating-characters.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
//alternating-characters.cpp
//Alternating Characters
//Weekly Challenges - Week 10
//Author: derekhh

#include<iostream>
#include<string>
using namespace std;

int main()
{
int t;
cin >> t;
while (t--)
{
string str;
cin >> str;
int len = (int)str.size();
int cnt = 0, ans = 0;
for (int i = 0; i < len; i++)
{
if (i == 0 || str[i] == str[i - 1])
cnt++;
else
{
if (cnt > 1)
{
ans += cnt - 1;
}
cnt = 1;
}
}
if (cnt > 1)
{
ans += cnt - 1;
}
cout << ans << endl;
}
return 0;
}
62 changes: 62 additions & 0 deletions black-box-1.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,62 @@
//black-box-1.cpp
//The Black Box
//Weekly Challenges - Week 8
//Author: derekhh

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> v;
vector<int> vv;

int main()
{
int n;
cin >> n;
int sz = 0;
while (n--)
{
int num;
cin >> num;
if (num > 0)
{
v.push_back(num);
sz++;
}
else
{
vector<int>::iterator pos = find(v.begin(), v.end(), -num);
v.erase(pos);
sz--;
}
vv.clear();
vv = v;
sort(vv.rbegin(), vv.rend());

int sig = 1;
while (sig <= vv[0])
sig <<= 1;
sig >>= 1;

for (int t = 0; sig >= 1; sig >>= 1)
{
int i = t;
while (i < sz && (vv[i] & sig) == 0) i++;
if (i >= sz) continue;
swap(vv[t], vv[i]);
for (int j = 0; j < sz; ++j)
{
if (j != t && (vv[j] & sig) != 0)
vv[j] = vv[j] ^ vv[t];
}
t++;
}
int result = 0;
for (int q = 0; q < sz; q++)
result ^= vv[q];
printf("%d\n", result);
}
return 0;
}
Loading