Red Balloons

Yesterday, at 10:33 pm, by zephyredx

http://balloon.media.mit.edu/zephyredx/

Join mine too with another email address!

Yay. Red Balloons.

Yesterday, at 8:28 pm, by dysfunctionalequations

http://balloon.media.mit.edu/networkchallenge/.

My username is probably "networkchallenge" and I probably chose it so that people would think that they were not being referred. I realize this is a ridiculous idea.

Princeton Math Competition

Sat Nov 21, 2009 7:28 pm, by dysfunctionalequations

Quite disappointing. I suppose I should do better next time. And I should probably do Geometry instead of Number Theory also.

Duke Math Meet

Sun Nov 01, 2009 6:17 pm, by dysfunctionalequations

I went to this competition.

Code:
Power Round:
1. YAY
2. YAY
3. YAY
4. YAY
5. YAY
6. YAY
7. YAY
8. YAY
9. YAY

Team Round:
1. DARN
2. YAY
3. YAY
4. YAY
5. YAY
6. YAY
7. YAY
8. DARN
9. YAY
10. YAY

Individual Round:
1. YAY
2. YAY
3. YAY
4. YAY
5. YAY
6. YAY
7. DARN
8. DARN
9. DARN
10. YAY

Relay Round:
1. DARN
2. Semi-YAY


Yes.

Also Benjamin Gunby is very tricky.

Hmm

Thu Oct 29, 2009 3:39 pm, by dysfunctionalequations

Someone needs to tell me what's wrong with my heatwv program because I have absolutely no idea.

Code:
#include<iostream>
#include<fstream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
ifstream fin("heatwv.in");
ofstream fout("heatwv.out");

int main(){ //let's use DIJkSTRa
   
   int T, C, Ts, Te, currentnode;
   fin >> T;
   fin >> C;
   fin >> Ts;
   fin >> Te;
   Ts--; Te--;
   currentnode=Ts;
   vector<pair<int, int> > adjacencies[T]; // [start](cost,end)
   long distances[T];
   bool visited[T];
   for(int i=0;i<C;i++){
      int a, b, c;
      fin >> a;
      fin >> b;
      fin >> c;
      adjacencies[a-1].push_back(pair<int, int>(c,b-1));
      adjacencies[b-1].push_back(pair<int, int>(c,a-1));
   }
   for(int i=0;i<T;i++){
      distances[i]=2147483647;
      visited[T]=false;
   }
   distances[Ts]=0; visited[Ts]=true;
   while(currentnode!= Te){
      visited[currentnode]=true;
      for(unsigned int i=0;i<adjacencies[currentnode].size();i++){
         pair<int, int> asdf= adjacencies[currentnode][i];
         int end = asdf.second;
         int cost = asdf.first;
         if(distances[end]>cost+distances[currentnode]){
            distances[end]=cost+distances[currentnode];
         }
      }
      long min=2147483647 ;
      for(int i=0;i<T;i++){
         if(!visited[i] && distances[i] < min){
            currentnode=i;
            min = distances[i];
         }
      }
   }
   fout << distances[Te] << endl;
}


Yeah it works on the last 5 test cases. It fails on the others, and it wasn't saved for grading because of this. But my computer is able to run this program on the sample in less than one millisecond. I have no idea why this happens.

Qualifier

Tue Oct 27, 2009 4:18 pm, by dysfunctionalequations

Code:
                  -- case number --
            1  2  3  4  5  6  7  8  9 10 11
diet        *  *  *  *  *  *  *  *  s  s  s
echo        *  *  *  *  *  *  *  *  *  *
evenodd     *  *  *  *  *  *  *  *  *  *
papaya      *  *  *  *  *  *  *  *  *  *
rplow       *  *  *  *  *  *  *  *  *  *  *
stroll      *  *  *  *  *  *  *  *  *  *  *


Darn. Also look at this... (analysis on a program which is exactly the same as the one I submitted during the actual contest)

Code:
  > Run 1: Execution error: Your program (`heatwv') used more than the
    allotted runtime of 1 seconds (it ended or was stopped at 1.674
    seconds) when presented with test case 1. It used 2928 KB of
    memory.

      ------ Data for Run 1 ------
    7 11 5 4
    2 4 2
    1 4 3
    7 2 2
    3 4 3
    5 7 5
    7 3 3
    6 1 1
    6 3 4
    2 4 3
    5 6 3
    7 2 1
      ----------------------------

  > Run 2: Execution error: Your program (`heatwv') used more than the
    allotted runtime of 1 seconds (it ended or was stopped at 1.674
    seconds) when presented with test case 2. It used 2928 KB of
    memory.

      ------ Data for Run 2 ------
    10 20 9 4
    5 6 308
    8 10 696
    4 2 569
    8 6 471
    1 2 874
    5 3 130
    4 5 804
    8 9 89
    10 4 717
    10 9 41
    7 6 998
    1 6 639
    7 9 650
    7 8 339
    3 1 597
    9 1 622
    7 10 2
    5 1 4
    1 4 372
    1 10 163
      ----------------------------

  > Run 3: Execution error: Your program (`heatwv') used more than the
    allotted runtime of 1 seconds (it ended or was stopped at 1.674
    seconds) when presented with test case 3. It used 2928 KB of
    memory.

      ------ Data for Run 3 ------
    20 43 11 19
    8 14 569
    17 13 859
    11 14 571
    18 14 583
    14 5 569
    9 1 342
    14 6 397
    14 17 640
    12 1 331
    19 12 999
    16 1 203
    19 6 493
    9 14 645
    7 4 118
    15 6 218
    15 20 164
    13 16 737
    1 15 548
    1 17 478
    4 15 286
    4 17 964
    12 14 165
    15 7 759
    1 5 976
    19 11 491
    15 11 286
    14 1 889
    10 17 852
    15 16 6
    20 3 563
    ... [and more] ...
      ----------------------------

  > Run 4: Execution error: Your program (`heatwv') used more than the
    allotted runtime of 1 seconds (it ended or was stopped at 1.620
    seconds) when presented with test case 4. It used 2928 KB of
    memory.

      ------ Data for Run 4 ------
    50 122 14 3
    49 4 977
    17 16 209
    10 8 573
    14 45 989
    41 49 988
    11 13 548
    34 46 367
    29 35 30
    13 16 220
    50 11 280
    42 16 608
    46 48 423
    48 9 381
    27 13 514
    26 2 725
    38 1 10
    33 18 688
    19 47 750
    36 18 650
    49 47 393
    14 6 688
    13 29 387
    22 11 10
    45 37 974
    9 12 926
    35 49 776
    44 33 993
    34 1 592
    33 39 409
    34 37 858
    ... [and more] ...
      ----------------------------

  > Run 5: Execution error: Your program (`heatwv') used more than the
    allotted runtime of 1 seconds (it ended or was stopped at 1.674
    seconds) when presented with test case 5. It used 2928 KB of
    memory.

      ------ Data for Run 5 ------
    100 251 88 95
    90 39 170
    75 71 718
    38 37 51
    92 86 622
    29 46 790
    85 43 175
    14 65 614
    2 97 123
    72 28 919
    9 89 158
    63 89 159
    55 30 297
    76 4 267
    94 93 56
    96 85 293
    69 65 539
    58 49 281
    85 14 997
    98 15 693
    72 39 73
    90 47 513
    100 53 642
    96 28 897
    14 73 790
    26 14 289
    90 52 699
    91 84 283
    56 32 480
    71 24 151
    9 48 92
    ... [and more] ...
      ----------------------------

  > Run 6: OK [0.011 secs, 2928 KB]
  > Run 7: OK [0.000 secs, 2928 KB]
  > Run 8: OK [0.011 secs, 2928 KB]
  > Run 9: OK [0.022 secs, 3060 KB]
  > Run 10: OK [0.022 secs, 3060 KB]


And of course, it wasn't saved during the actual contest because of qualification tests.

Basically:
1: yay.
2: yay.
3: yay.
4: yay.
5: yay.
6: darn. FAIL
7: darn.
8: yay?
9: WHAT.

Interesting

Mon Oct 26, 2009 5:41 pm, by dysfunctionalequations

I recently gave invites to Google Wave to several people. When I had one invite left, I received this message:

Quote: (09:32:59 PM) Mitchell Lee: Perhaps
(09:33:06 PM) Mitchell Lee: I should invite you to Google Wave
(09:35:42 PM) David Yang: yo ushould.
(09:35:43 PM) David Yang: PLEASE.
(09:35:54 PM) Mitchell Lee: Okay
(09:35:57 PM) David Yang: please
(09:36:18 PM) Mitchell Lee: Done
(09:36:27 PM) David Yang: ok
(09:36:31 PM) David Yang: now tell me what google wave is

The sort of stuff that we do at my school

Sun Oct 25, 2009 8:58 am, by dysfunctionalequations

Quote: Find the percent composition (by mass) of the elements in \text{Cl}_2.

Croatian Open Competition in Informatics contest 1

Sat Oct 24, 2009 9:51 am, by dysfunctionalequations

[ Currently: no I'm not Croatian... ]

Hmm I seem to have participated in this contest, which is now over.

http://evaluator.hsin.hr

Quote: 3:00 Opened tasks
2:59 Printing tasks
2:57 NOTE is trivial
2:57 Darn I don't know what a "doimno" is
2:57 DOMINO is trivial
2:47 Read all the problems
2:30 Solved NOTE, DOMINO, MALI, maybe GENIJALAC will work
2:29 Finished coding up NOTE.
2:26 Finished coding up DOMINO.
2:00 Still not done
1:50 FINALLY finished coding GENIJALAC (my sister was yelling which distracted me)
1:50 long long ints probably work better for GENIJALAC
1:45 Estimated score right now: 30+50+100 = 180 which is quite unfortunate...
1:44 Coding brute force solutions now
1:33 Done coding MALI_bruteforce; submitted ; expecting at least 50% of points 30+50+50+100 = 230 which is less unfortunate but still quite unfortunate
1:29 for each blank decide vowel or consonant
0:50 almost done coding DOBRA ; ran into a ridiculous error due to lack of knowledge of C++
0:40 debugging DOBRA
0:08 DARN. only 8 minutes left and still not done yet...
0:02 Just need to fix DOBRA / code ALADIN brute-force... unfortunate
0:01 Submitting final versions... brute forced last problem + dobra fails + mali probably won't go so well

Darn, I managed to fail to notice that I was overcounting words like JALBULKLA (for the third test case). There were other problems with my DOBRA program also...
Also, I failed to test my MALI algorithm, which got 8 out of 10 of the test cases incorrect.
My ALADIN program happens to segfault on everything EXCEPT the first three cases... Quite unfortunate.


30/50/14/20/120/39. Total score: 273. Hmm.

I still haven't done the USACO qualifier yet...

USAMTS Round 1

Thu Oct 15, 2009 3:58 pm, by dysfunctionalequations

Because my "1489+3\neq 1502" was not a very detailed description of my performance on the first round of the twenty-first year of the USAMTS, it would be very good for me to actually write about the round.

Problem 1. I used a computer on this. However, I seem to have found the correct answer, with explanation. I expect a score of 5.
Problem 2. I finished this problem. I seem to have found the correct answer. Additionally, my proof seems to be correct. I expect a score of 5.
Problem 3. Although my proof seems to mostly be correct, it contains the statement "1489+3=1502" at the end. I hope for a score of 5.
Problem 4. I proved that the only possible areas of the triangle were 40 and 60. I proved that a value of 60 is attainable. I proved that a value of 40 is attainable. I expect a score of 5.
Problem 5. I seem to have written a correct solution to this problem. I expect a score of 5.

I hope for a score of 25. I expect a score not less than 24.

My solutions are attached so that you might read them.
solutions.pdf
  • Description 
  • Filename solutions.pdf
  • Filesize 92.43 KB
  • Downloaded 76 Time(s)

pdf Download

Page 1 of 13 [122 Entries]

Goto page: 1, 2, 3, ..., 11, 12, 13 Next

actually, quite trivial...

Tag Cloud

Shoutbox

Shouts

  • Hm it looks like geo is my second best olympiad subject, yet still far from algebra.

    By gauss1181, on Sun Oct 11, 2009 11:58 am

  • your polynomial on Mewmew's blog definitely has real, distinct roots

    By stevenmeow, on Mon Oct 05, 2009 6:12 pm

  • Darn. Maybe I should post more geometry here.

    Meaning, REAL geometry.

    This is unfortunate.

    By dysfunctionalequations, on Thu Oct 01, 2009 3:37 am

  • Darn I looked through 6 pages for geo, but NO THERE IS NO GEO HERE WHAT (besides that one IBMO, which I got bored and wrote a solution for hmm). Okay that 2005 IMO thing is like, a theorem with a name which totally should not be on the IMO.

    By serialk11r, on Wed Sep 30, 2009 7:34 pm

  • ‮ I can type backwards. I can write \LaTeX code backwards.

    By dysfunctionalequations, on Wed Sep 30, 2009 2:04 pm

44 Shouts

Goto page 1, 2, 3, ..., 7, 8, 9 Next

A Custom Block

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nulla est magna, sollicitudin blandit ornare nec, imperdiet ac mauris. Nam tempor cursus euismod. Donec tincidunt libero id orci facilisis pretium. Morbi viverra vulputate eros. Nunc elementum malesuada mauris, a porttitor enim blandit et. Sed ac erat justo. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Curabitur dapibus scelerisque pulvinar. In vulputate tempor suscipit. Donec turpis nunc, vehicula ut interdum ut, bibendum eu dui. Vivamus commodo convallis augue, in commodo ipsum commodo tristique. Fusce eget nibh neque. Mauris ipsum diam, mattis quis posuere vitae, semper id quam. Vestibulum leo libero, blandit sit amet commodo condimentum, ornare id ipsum. Maecenas pretium mi sit amet nisl malesuada aliquam. Etiam ultrices turpis id nibh feugiat mollis. Curabitur sit amet leo condimentum ante suscipit consequat. Proin aliquam, nulla at facilisis iaculis, augue ipsum hendrerit nulla, in condimentum libero turpis in neque. Maecenas nibh augue, malesuada a luctus quis, placerat eu neque.

About owner

  • Joined: 30 Jun 2008
  • Location: None
  • Occupation: Solving trivial problems
  • Interests: Solving trivial problems

Blog details

  • Blog started: 04 Nov 2008
  • Total entries: 132
  • Total visits: 52842

RSS Feed

RSS Feed