Derr JJ32w
Bump
Read more… (1 word)
Active In
Competitive Programming
Algorithms and Computer Programming
International Olympiad in Informatics
Machine Learning
Featured Contributions
NaN.
course
Competitive Programming: From Beginner to Expert
This course gets you from knowing basic programming to being a yellow-red rated coder in CodeChef / Codeforces / TopCoder / etc.
Expected time to completion: 40-60 sessions (about 2-3 months)
Read more…(134 words)
reply in this discussion
NaN.
course
Competitive Programming: From Beginner to Expert
This course gets you from knowing basic programming to being a yellow-red rated coder in CodeChef / Codeforces / TopCoder / etc.
Expected time to completion: 40-60 sessions (about 2-3 months)
Read more…(134 words)
reply in this discussion
Derr JJ34w
I notice that there are only around a 100 topics in this playlist. Is this really sufficient in helping me improve from a novice to a red rated coder?
Read more… (29 words)
reply in this discussion
Derr JJ37w
Why do I keep receiving an error?
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;string rotation(string s, long long n) {if ((s.length()) < n) {string temp = s;for (long long i = (s.length() - 1); i > 0; i--) {
Read more… (7 words)
NaN.
discussion
[ZCO12001] Matched Brackets (ZCO 2012: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
Derr JJ37w
Comments on my solution?
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int current = 0;
pair<int, int> maxCoords;
int currentMax = 0;
Read more… (157 words)
reply in this discussion
Derr JJ37w
Comments on this accepted C++ solution?
#include <bits/stdc++.h>
using namespace std;
int main() {
int n1, n2, n3; cin >> n1 >> n2 >> n3;
int pop = n1 + n2 + n3;
int ids[pop];
vector<int> reIds;
for (int i = 0; i < pop; i++) {
cin >> ids[i];
}
sort(ids, ids + pop);
Read more… (108 words)