Huawei Honorcup Marathon 2
By huawei, 5 years ago, In English

Dear Friends!

If you dream of realizing your ideas in new technologies and products used by a third part of the world's population — join Honorcup Marathon. It will be an unrated round for individual participation, as well as for teams of up to three people.

Take part in the round →

You will develop a quite challenging task without exact solution. Your solution with show up your programming skills, research and data analysis abilities.

At stake: we have Huawei devices for the top 3 winners, as well as 10,000 USD for top 1.

And, of course, TOP 80 participants will get a hoodie with Huawei Codecraft logo! During registration don’t forget to mention your size and home address for delivery. Well performed participants will be invited to get highly paid 3 months contracts in Moscow, St. Petersburg, Nizhny Novgorod, Novosibirsk, Minsk or in China (including transportation & accommodation expenses covered).

We accept solutions before October 14th, 20.59.59, (Moscow time).

We will ask winners to provide the source code and description of the solution; the details can be discussed in a phone call. In case of reasonable doubt about the violation of the rules, we reserve the right to transfer the prize to the next participant. Thank you for understanding!

Don’t miss your chance. Good luck to all!

Announcement of Huawei Honorcup Marathon 2
  • Vote: I like it
  • +285
  • Vote: I do not like it

Comments Comments (144)
| Write comment?
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Intriguing — so it's going to be much less specific-algorithm oriented and more open-ended? This would be an interesting competition

→ Reply
»
5 years ago, # |
  Vote: I like it +65 Vote: I do not like it

Huawei niubi!

→ Reply
»
5 years ago, # |
  Vote: I like it -60 Vote: I do not like it

Huawei niubi！

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +34 Vote: I do not like it

    think carefully why you can't surpass the one upstair.

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
      ← Rev. 2   Vote: I like it +62 Vote: I do not like it

      Repeating is not welcomed in Codeforces. Here is not a place for instant messaging, and you can upvote if you agree with others, instead of repeating.

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        OK,Thank you for your reminder.

        → Reply
        • »
          »
          »
          »
          »
          5 years ago, # ^ |
            Vote: I like it +1 Vote: I do not like it

          Forget it. This community is just toxic.

          → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it -64 Vote: I do not like it

      Repeating is not welcomed in Codeforces. Here is not a place for instant messaging, and you can upvote if you agree with others, instead of repeating.

      → Reply
»
5 years ago, # |
  Vote: I like it +19 Vote: I do not like it

Why can't I register as a team member? When I choose team, it shows nothing.

→ Reply
»
5 years ago, # |
  Vote: I like it +11 Vote: I do not like it

as well as for teams of up to three people.

TOP 80 participants will get a hoodie with Huawei Codecraft logo!

How does this work with teams? Are all members of top 80 teams given hoodies, or are 80 hoodies in total given out in order of team performance? Does the same apply to the devices for top 3?

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +30 Vote: I do not like it

    This was asked previous round. TL;DR No. A entity (team or user) gets only one device / hoodie.

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    And, of course, TOP 80 participants will get a hoodie with Huawei Codecraft logo!

    I interpret this as 80 hoodies are given in order of team performance.

    → Reply
»
5 years ago, # |
  Vote: I like it -8 Vote: I do not like it

In case of reasonable doubt about the violation of the rules, we reserve the right to transfer the prize to the next participant

What are you so concerned about that you had to specifically warn us?

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How many problems will be?

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What language we can use (C++,java,python)?

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -44 Vote: I do not like it

Huawei niubi!

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This seems like a kaggle data mining/machine learning contest, as the blog says " your programming skills, research and data analysis abilities."

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    I think it is. Huawei Honorcup Marathon 1 is about using machine learning to improve blood pressure measurement.

    Unfortunately I don't know anything about machine learning.

    → Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

wow! its gonna be interesting!

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -42 Vote: I do not like it

Let's go huawei！

→ Reply
»
5 years ago, # |
← Rev. 5   Vote: I like it -43 Vote: I do not like it

QaQ, it's my fault for getting a wrong length of this contest.

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +15 Vote: I do not like it

    Seems that you want to win this round in 0.001.

    UPD: You can see that he said "That's a bad starting time for Chinese" in Rev.2, which means he thinks the penalty is important in a 14-day round.

    → Reply
»
5 years ago, # |
  Vote: I like it -19 Vote: I do not like it

Are contestants age-restricted? Money prize is huge enough.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -44 Vote: I do not like it

First,We'd better not use "Chenglish" here. What's more,we'd better not talk about politics。

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it -11 Vote: I do not like it

    BTW,your spelling 'Fiest' is wrong. stO xukuan

    → Reply
»
5 years ago, # |
  Vote: I like it -29 Vote: I do not like it

can someone just explain me what does i+=(i&(-i)); does

→ Reply
»
5 years ago, # |
  Vote: I like it -8 Vote: I do not like it

I'm very expected for it,and I hope it's not too difficuty.

→ Reply
»
5 years ago, # |
  Vote: I like it -77 Vote: I do not like it

HUAWEI NIUBI

→ Reply
»
5 years ago, # |
← Rev. 4   Vote: I like it -28 Vote: I do not like it

[DELETED]

→ Reply
»
5 years ago, # |
  Vote: I like it -44 Vote: I do not like it

Can we use c++ ???

→ Reply
»
5 years ago, # |
  Vote: I like it -39 Vote: I do not like it

Why you down vote me?

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -8 Vote: I do not like it

Is it true that marathons like this one require only the predicted output to be submitted, and my program's execution time doesn't matter?

→ Reply
»
5 years ago, # |
  Vote: I like it -16 Vote: I do not like it

If i partisipate in team in the Honor cup, will our team get a T-Shirt?

→ Reply
»
5 years ago, # |
  Vote: I like it -30 Vote: I do not like it

Huawei niubi!

→ Reply
»
5 years ago, # |
  Vote: I like it -17 Vote: I do not like it

T-shirt! T-shirt! T-shirt!

→ Reply
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

can anyone share the link of the data please? download limit reached for their link.

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there a faster way to download the data? Downloading speed has dropped down to 100kBps and it's going to take hours to download it.

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    NVM, I guess this was my problem.

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      did you download the data? How big it is? Can you share it in google drive (or something else) if possible?

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        It seems that I'll have to upload it first which will take too much time. Just register to Yandex and press "add and download".

        → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Added two more links.

    → Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

In case of reasonable doubt about the violation of the rules, we reserve the right to transfer the prize to the next participant.

Where can I read those rules?

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes, we need rules if there are any

    Also, it is not clear to me whether final testing is the only thing that matters or other subtasks are counted towards standings as well

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I think the required details are listed in the terms when you registered on the round. Also, the information in the announcement is important.

    → Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

2.1 GB DATA!!!

By my Internet speed, the contest will be over before the download is done :)

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How should I submit my results? I submitted the sample answer file "data_train_64_answers.txt" to C1 but got a WA with "The program is too long [size=115801 bytes]". Can anyone help?

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    Why C1, not A1?

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    "The program is too long [size=115801 bytes]" is about your submission size. In this problem it's ok to get this message instead of your real submission. So, it's not checker's comment or so.

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Did you expect such high scores in couple hours of the contest (in a 14 days contest)? I am wondering if its worth participating now or not.

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Yes, it was expected, because, archive with dataset contains answers for the training part of set. Scores will be recounted after contest finishing. So, it may be interesting to participate and do your best :)

        → Reply
        • »
          »
          »
          »
          »
          5 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          I was referring to non-training parts scores, its almost 30k for the A2 for lot of people. Was this expected as well?

          → Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

The post mentions a possible "violation of the rules". Where can we find these rules?

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    I think the required details are listed in the terms when you registered on the round. Also, the information in the announcement is important.

    → Reply
»
5 years ago, # |
  Vote: I like it +39 Vote: I do not like it

I read the rules in registration but it's still not clear to me :

The presented solutions are original, and the participants of the match do not violate any intellectual rights, such as the rights to the results of intellectual activity, copyright and the right to a trademark. The solutions presented were not published on any media, such as newspapers, magazines and websites, including in open source communities.

Does this means it's not allowed to implement, or even take inspiration of research papers on the topic, even if its only a subpart of our solution ? It's not like automatic jigsaw puzzle solving has never been investigated before, and it feels strange to say you have 2 weeks but can't use the internet to see what has been done already...

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can you try to ask this personally(I mean asking it under the section "Ask a question" on the problem set page)?As clarity on this is required as soon as possible

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it +25 Vote: I do not like it

      I got this answer :

      I redirected your question to Huawei, but I'm pretty sure they do not want to forbid usage of science articles. I think you can use published ideas if this does not violate anyone else's rights. It seems you can't use any copy-paste which can violate anyone rights.

      → Reply
»
5 years ago, # |
  Vote: I like it +108 Vote: I do not like it

→ Reply
»
5 years ago, # |
  Vote: I like it +27 Vote: I do not like it

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Well,I do think these cats are so poor that they fall into pieces just because a contest XD

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    my-awesome-meme.jpg

    → Reply
»
5 years ago, # |
  Vote: I like it +113 Vote: I do not like it

Is it against the rules to partially solve the problem by hand?

→ Reply
»
5 years ago, # |
  Vote: I like it -15 Vote: I do not like it

Aw...I am too young to participate in honorcup :(. I am <14 years of age.

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

"Well performed participants will be invited to get highly paid 3 months contracts in Moscow, St. Petersburg, Nizhny Novgorod, Novosibirsk, Minsk or in China (including transportation & accommodation expenses covered)"

How many does "well performed" mean? Also, in case of participation as a team,will every participant of the team get an internship opportunity?

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

So, does the score of the solution just depend on the answer of A3, B3 and C3?

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes

    "...After the contest, for each participant we will use the last correctly formatted (0 points) submission on problems A3, B3 and C3 to evaluate the quality of the solution. These values will be used to determine the winners."

    → Reply
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

I think you should at least tell us the file count in the last subtasks to avoid screwing up.

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You have all the test data available, can't you count it by yourself?

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Well, what if I submit the wrong answer (which has less pictures), I would never know, because it's going to show OK. Just to be sure.

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I got your point. You can simply check number of lines in your output file to be sure.

        → Reply
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

When the system tests?

→ Reply
»
5 years ago, # |
  Vote: I like it +20 Vote: I do not like it

Should we now just go to bed intriguied by results missing?

→ Reply
»
5 years ago, # |
  Vote: I like it +68 Vote: I do not like it

Thank you Huawei, now I hate cats.

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    I also hate squares and diff square plates on the floor

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +68 Vote: I do not like it

    I can see edges between blocks in normal pictures without dividing and shuffling.

    → Reply
»
5 years ago, # |
  Vote: I like it +34 Vote: I do not like it

When system testing is gonna be?

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

My mate just said "we're tied for first place" and I didn't believe it. Surprisingly it was true, 0 points on all test tasks so far...

→ Reply
»
5 years ago, # |
  Vote: I like it +51 Vote: I do not like it

Congratulations to the winners!

  • 1 place: ccz181078 — 88917.633 points
  • 2 place: T1024 — 88851.308 points
  • 3 place: icecuber — 88412.545 points
→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +45 Vote: I do not like it

meme

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +2 Vote: I do not like it

Congrats to the winners :)

Does anybody have original ideas to share ? I assume most of us had a heuristic for edge-edge compatibility, then a strategy for assembly.

  • For edge compatibility I tried several things but didn't find much better than Mahalanobis Gradient Compatibility (used in many papers). You take the 3-color pixel differences on the last two row/columns of the border, compute mean and 3x3 covariance matrix, then sum the (Mahalanobis) distance to that distribution for all the pixel-to-pixel differences across the border.

  • For assembly I had a greedy considering all positions either taken or touching taken ones, putting down the best-score piece one at a time (I allow moving or replacing pieces). Then I try to move around connected components of "very good" edges and merge them (and cut the connected components with one mistaken good edge by looking at the bridges). Then cut to MxM size, then greedy again to fill.

In particular has anyone used linear programming for the assembly ? It looked powerful but I was too lazy to try.

When having many small optimizations/variations around I found it hard to tweak and set the parameters (I've never done any machine learning also, maybe that's why).

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I had several different greedy solutions, I ran them all, and then I selected the most optimal answer for each picture separately

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This paper contained some interesting ideas.

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
      ← Rev. 3   Vote: I like it +3 Vote: I do not like it

      Generally speaking, no. The genetic algorithm shows good results for tasks A and B, but for problem C it gives about 20.000-25.000 points. I believe that the main problem is that the best-buddies metric that underlies this paper does not work well enough for the third sample. I tried to introduce the psevdobudies metric, however this provided minor improvements. I suppose many participants went the same way and got into a dead end.

      → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Hello, I used four-algorithms combine solutions. I run every algorithm and choose the best result as answer.

    • First algo is greedy solution. I just brut-force the central fragment and construct result for it, then choose best. For every brute-force center I made prio queue with best fragments suggestions, then every time choose the best one and merge it into current-center result.

    • Second and third soultions are BFS-based algorithms with low difference. The main idea is that if place which you wanna to fill with fragment connected with more than one filled poses then you decrease probability of wrong fragment-setting. So let's brute force as in previous method central fragment and start BFS algo from center with greedy setting fragments in each poses. So with it in most of cases when you choose current "best" fragment you oriented to two already set fragment, which decrease error probability.

    • Fourth algo I used just only for 16x16 subtask cause previous algorithms works not bad only for A and B tasks. So I just brute-force the best 4x4 subfragments formed by BFS algorithm and then choosen the best of this and merge it into result. It leads to stability 41 point per image in front of ~28 point of BFS/Greedy algo.

    And after all I try to improve results by deleting fragments which distance was more than 10% and re-build image with placing only removed poses. If it led to more optimal solution I leave it as result and round it otherwise.

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Thanks for sharing your approach, which judging by the standings it worked quite well :)

    I share some ideas about my final approach here:

    • Edge compatibility: I used some simple approach calculating the sum of the absolute value of the difference between the normalized pixel values (in YCbCr color space for RGB images) between the border row/column of the pieces.

    • Assembly algorithm: Greedy considering unused blocks on the positions touching the already taken ones which will not make the grid exceed MxM dimensions. For each position I calculate the best score and the second best score, and then I pick the position with the highest difference between those scores and place the block with the highest score on that position.

    This simple approach was good enough to achieve the following scores: 29.5k on A3, 29.3k on B3 and 26.7k on C3.

    → Reply
»
5 years ago, # |
  Vote: I like it +27 Vote: I do not like it

We want Editorial!

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +14 Vote: I do not like it

    Especially on pictures like 3334.png

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      At least that one didn't have several identically fully black (or white) pieces like some others where you can't do anything. Abusing the colors in the output i get :

      Spoiler

      So this one is about matching noise, I didn't do anything specific and I get garbage because I use only the outer two columns/rows on each piece. But you might get a bit better than random if you match some statistics on the noise ? (there seems to be more or less densely (1,1,1) vs (0,0,0) areas for instance)

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it +10 Vote: I do not like it

        Did you have previous experience working with images?

        Looks like your visualization is pretty advanced

        → Reply
        • »
          »
          »
          »
          »
          5 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Uh nope not at all, I just found something to read/write png then it's just an array of numbers to me and I wrote a few helper functions to decorate the output to debug.

          → Reply
»
5 years ago, # |
  Vote: I like it +14 Vote: I do not like it

"During registration don’t forget to mention your size and home address for delivery."

registration where?

→ Reply
»
5 years ago, # |
  Vote: I like it +37 Vote: I do not like it

MikeMirzayanov, will it be possible to submit in the future? Seems a good practice to get at least 27k on C.

→ Reply
»
5 years ago, # |
  Vote: I like it +17 Vote: I do not like it

Did huawei contact anyone regarding hoodies or internship?

→ Reply
»
5 years ago, # |
  Vote: I like it +61 Vote: I do not like it

Where are hoodies?

→ Reply
»
5 years ago, # |
  Vote: I like it +27 Vote: I do not like it

Where are our hoodies, guys? Actually, it's pretty cold outside :D

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to get my hoodie?

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

Huawei finally reported some reassuring information via email:

"Since the 'Code' nomination allowed not only Eurasian participants to compete, we decided to separate the award ceremonies. Huawei R&D departament, as the maintainer of the championship, will inform you about the procedure later. All winners for sure will receive theirs prizes!"

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    where did you get that info? a source would be nice.

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      via email, fixed

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I didn’t receive any email, is this normal?

        → Reply
»
5 years ago, # |
← Rev. 6   Vote: I like it +15 Vote: I do not like it

Huawei have written me on e-mail

Spoiler
→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    I got the same. They write about top100 now, not top80 as announced above. What about teams (my teammate got the same)? A prize for both of us or just one? And they don't even want to know my hoodie size.

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I have this message too. Could it be fake?

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      Of course I can't tell for sure, but it looks legit to me. Maybe just an intern who forgot to ask about the size.

      It was sent from 185.176.76.210, which belongs to Huawei UK. The content language is set to Chinese.

      And most important they sent it to my codeforces email address, which I rarely use somewhere else (e.g. you could find another email address if you search for my github account).

      But I agree that the email isn't what I expected. Usually organizers send a link to some kind of webshop or online form to enter your address.

      → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    me too, but i am 91

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    This e-mail address ([email protected]) is the same as was shown on their official honorcup site few days ago. It was written on their site for those who are interested in huawei internships, so it's official i think.

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    i didn't receive that email, why?

    → Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Got the hoodie, yay)

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Huawei niubi！

→ Reply
»
5 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Damn it, I still haven't got my hoodie((

→ Reply
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

→ Reply
»
5 years ago, # |
  Vote: I like it +15 Vote: I do not like it

This is how looks my certificate after opening the parcel.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Did anyone in Brazil receive the hoodie? We're still waiting :/.

→ Reply
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Half a year passed but I still haven't got my hoodie. I think it's been lost in the express.

→ Reply
»
4 years ago, # |
← Rev. 3   Vote: I like it +8 Vote: I do not like it

I have not received sweatshirt after two years :( .

→ Reply