## Search found 62 matches

Wed Dec 21, 2005 7:09 pm
Forum: ACM ICPC Archive Board
Topic: 3300 "Can't be Judged"
Replies: 1
Views: 1556
you don`t need to submit again; if the problem becomes judgable, your solution will be judged from sure
Thu Dec 15, 2005 5:51 am
Forum: ACM ICPC Archive Board
Topic: faking mondrian(south america 2000/2001)
Replies: 0
Views: 1270

### faking mondrian(south america 2000/2001)

hello. i've been trying to solve this problem(2167,live archive).I would like to know if someone has tried it or knows if there's some problem with the judge 's inputs(cause this problem doesn't have any ac).Thx in advance.
Mon Dec 05, 2005 11:37 pm
Forum: Other words
Topic: Notice: Second Programming Contest of Newbies
Replies: 6
Views: 2382
22 o 23 dec would be ok. Remember a lot of people will be celebrating christmas
Wed Nov 30, 2005 5:16 am
Forum: Algorithms
Topic: a question about prim algorithm
Replies: 1
Views: 741

### a question about prim algorithm

My straightforward implementation of prim is O(EV) using adjacency matrix but i found an excercise in cormen which asks to make a "simple" implementation of prim algorithm using adjacency matrix in O(V^2) time.Coud someone explain how to achieve this?(by "simple" i suppose that it's not necesary to ...
Tue Oct 18, 2005 2:22 am
Forum: Volume 109 (10900-10999)
Topic: 10936 - Land surveyor's job
Replies: 10
Views: 6390
rage_true wrote
:2 trulo17
Why you add to angel pi?
>> angle+=pi;
this way i change the current direction to the opossite, this is necessary in my algorithm to measure the correct angle(due to the problems conditions)
Sun Oct 16, 2005 8:13 am
Forum: Volume 109 (10900-10999)
Topic: 10936 - Land surveyor's job
Replies: 10
Views: 6390

### 10936 - Land surveyor's job

#include<cstdio> #include<cmath> #include<cctype> #include<cstring> struct point { double angle,distance; }; int main() { int n,i,j,L; char s[15]; double pi=2*acos(0.0),degree,minute,second,angle,x1,y1,x2,y2,xt,yt,total; point A[1000]; for(;;) { scanf("%d",&n); if(n==0) break; for(i=0;i<n;++i) { sc...
Fri Oct 14, 2005 3:33 am
Forum: Other words
Replies: 1
Views: 1009

hello, this year mi teammates and me are willing to participate in the icpc regionals, but there is a trouble: there are 2 facultys within the university which want to send their teams to the contest. as far as i know this is possible but
Thu Sep 29, 2005 6:32 am
Forum: Algorithms
Topic: graph coloring
Replies: 1
Views: 896

### graph coloring

i've just solved problem 193(graph coloring) and now i'm trying to solve a regional problem "girls an boys"(2041 in live archive, althought i'm sending it to another judge). I just did input modifications using the same algo, but i'm getting tle. The difference is that in this problem we are asked o...
Thu Sep 15, 2005 6:54 am
Forum: Off topic (General chit-chat)
Topic: FIFA U-17 World Championship Peru 2005
Replies: 2
Views: 1712

### FIFA U-17 World Championship Peru 2005

For the first time, Peru is going to hold an event of this kind. As a football fanatic, i'm really excited about that . So i want to know your opinion.
Of course i'm voting for Peru!!

A-RRI-BA PE-RU!!!!!!

Btw, the question should say:
Fri Sep 02, 2005 10:33 pm
Forum: C++
Topic: s.length() against s[0] = '\0'
Replies: 2
Views: 1653

### s.length() against s[0] = '\0'

i thought these two statements are the same if( A[0] == '\0' || B[0] == '\0' ) if( A.length() == 0 || B.length() == 0 ) where A and B are c++ strings but they aren't, since i got Acc( problem 10100 ) with the second one, but a WA with the first one( that's the only thing i changed ) Could somebody g...
Fri Sep 02, 2005 9:03 am
Forum: Volume 3 (300-399)
Topic: 306 - Cipher
Replies: 74
Views: 18858
#include<cstdio> #include<cstring> int main() { int n,i,j,ciclo,t,k; int T[210][210]; int A[210]; char S[210],S2[210]; char c; for( i = 0; i < 210; ++i ) { T[0][i] = i; } for( ; ; ) { scanf( "%d", &n ); if( n == 0 ) { break; } for( i = 0; i < n; ++i ) { scanf( "%d", &A[i] ); } /*problematic part fo...
Mon Feb 14, 2005 5:20 pm
Forum: Volume 103 (10300-10399)
Topic: 10311 - Goldbach and Euler
Replies: 98
Views: 23381

### thanks!!!!!!!

well little joey, i just got acc after your post . I coudn`t managed to work with bits before your post, now it's all very clear. Thanks for replying, that's that kind of help someone always need, bye.
Sun Feb 13, 2005 4:23 am
Forum: Volume 103 (10300-10399)
Topic: 10311 - Goldbach and Euler
Replies: 98
Views: 23381
[/code] #include<cstdio> #include<iostream> # define max 100000001 # define L 10000 using namespace std; struct cosa { unsigned x : 1;//this is supossed to use one bit } A[max]; why does this get compile error? i'm not sure, but i think this should only use: 100M * bit = 12.5 M but in fact the judge...
Fri Feb 11, 2005 4:53 pm
Forum: Volume 108 (10800-10899)
Topic: 10810 - Ultra-QuickSort
Replies: 36
Views: 20901

### thx

thanks to christian and little joey for answering. Yes, input is not right, but the hint is totally correct. Got Ac now, thx again.
Fri Feb 11, 2005 9:18 am
Forum: Volume 108 (10800-10899)
Topic: 10810 - Ultra-QuickSort
Replies: 36
Views: 20901