dthreatz's blog

By dthreatz, history, 4 years ago, In English,

One of the last SRMs of the year, don't miss it. It'll be in about 15 hours from now.

Check your time here

Read more »

 
 
 
 
  • Vote: I like it
  • +8
  • Vote: I do not like it

By dthreatz, 4 years ago, In English,

It seems they recently made some aesthetic changes to their website, primarily the profile pages. It looks really bad, everything is too big and it's all really buggy at the moment.

Their website was really well organized and the profile pages were awesome. Can't believe they ruined it all :(

Does anyone know if it's possible to return to the old front-end?

Read more »

 
 
 
 
  • Vote: I like it
  • +26
  • Vote: I do not like it

By dthreatz, history, 4 years ago, In English,

Topcoder SRM 668 will happen very soon (within 25 hours or so). See your local time here

Be there.

Read more »

 
 
 
 
  • Vote: I like it
  • +22
  • Vote: I do not like it

By dthreatz, 5 years ago, In English,

I'm getting a "Can't compile file: Compiled file is too large [40555520 bytes], but maximal allowed size is 33554432 bytes [CompileRequest {id='program.cpp', description='', file='program.cpp', resources='', type='cpp.g++11'}]." error when submitting my solution for Facebook Hacker Cup Round 1 problem A. However, the memory limit for this problem in the Gym section is 1024 MB. So, what's happening here?

Not doing anything crazy in my code either:

#include <iostream>
#define N 10000000
using namespace std;

int arr[N + 1] = {1};
void sieve()
{
    for(long i = 2; i <= N; i++){
        if(arr[i] > 0)
            continue;
        arr[i]++;
        for(long j = 2; i*j <= N; j++){
            arr[i*j]++;
        }
    }
}

int main()
{
    int t;
    cin >> t;
    sieve();
    long a, b, k;
    for(int tt = 1; tt <= t; tt++){
        long long ans = 0;
        cin >> a >> b >> k;
        for(long i = a; i <= b; i++){
            if(arr[i] == k)
                ans++;
        }
        cout << "Case #" << tt << ": " << ans << endl;
    }
    return 0;
}

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By dthreatz, 5 years ago, In English,

The final SRM for March will be held in less than 24 hours, so don't forget to participate.

Click here to check the exact time

Read more »

 
 
 
 
  • Vote: I like it
  • +30
  • Vote: I do not like it

By dthreatz, 5 years ago, In English,

I'm trying to improve my knowledge of Math by getting better at Discrete Math, Linear Algebra, and Calculus. I'm putting extra focus on Discrete Math since I believe that is most useful for programming contests.

Everyone knows that Russians excel at Mathematics, so my question is, how do you guys learn Math? I know that Russian schools have a pretty rigorous Math curriculum, but besides that, do you solve hundreds of Math exercises or what is your secret? :)

Edit: Of course, this question also applies to countries that were part of the Soviet Union.

Read more »

 
 
 
 
  • Vote: I like it
  • +16
  • Vote: I do not like it

By dthreatz, 5 years ago, In English,

I'm getting WA on Test Case 11. Since we cannot see the test cases or other people's code (since it's a Gym problem), does anyone have any idea on what's wrong with my code?

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <map>
#include <algorithm>
#include <cstring>
#include <set>
#include <fstream>
#include <cmath>
#include <iomanip>

using namespace std;

bool dp[10005][105];
int main()
{
    long n, k;
    cin >> n >> k;
    vector <int> v(n);
    for(long i = 0; i < n; i++) {
        cin >> v[i];
    }
    dp[1][v[0] % k] = 1;
    for(long i = 1; i < n; i++){
        for(long j = 0; j < k; j++){
            if(dp[i][j]){
                dp[i+1][abs((j+v[i])%k)] = 1;
                dp[i+1][abs((j-v[i])%k)] = 1;
            }
        }
    }
    puts(dp[n][0] ? "Divisible" : "Not divisible");
    return 0;
}

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it