Общий форум| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | | I can;t submit through the website (4:47PM GMT 14/06/2001) !!!!!!! | Dinh Quang Hiep (mg9h@yahoo.com) | | 14 июн 2001 22:48 | 1 | | | #include <algorithm> ??? | Stefan Pochmann | | 14 июн 2001 20:18 | 2 | Hi everyone! How do I include the <algorithm>-header of C++? Yes I've already asked that some days ago. No, I didn't get a single answer. Yes, I'll keep asking this every few days from now on until I get an answer. I know there are some C++ Coders out there and someone must know! Stefan Pochmann | | to Dinh Hong Minh (IOI Team Next Year ;) ) | Dinh Quang Hiep (mg9h@yahoo.com) | | 14 июн 2001 19:41 | 3 | | | s[0] - compilation error | Docent | | 14 июн 2001 16:41 | 1 | if you tried to acess to the zero-element of the string you would get Compilation error! I spent for this more than hour! | | SaratovSU #3 or Mirzayanov Michael, can you tell me how to solve the problem 1107, please? | apple | | 14 июн 2001 12:48 | 5 | | | Hey brother QH ! Read this ! | Tran Nam Trung (trungduck@yahoo.com) | | 12 июн 2001 20:21 | 3 | 1. Pls translate 2 P for me ! 2. What about our P : 'Travelling tours' ? Have u asked MB again ? 71222119-trungduck@yahoo.com > 1. Pls translate 2 P for me ! > 2. What about our P : 'Travelling tours' ? Have u asked MB > again ? > 71222119-trungduck@yahoo.com | | Hey,if input is '(*(*1))', what's correct output? | Vua moi chay xuong nha xem phim duoc 1 ty, len chung no da lam x | 1027. Снова D++ | 12 июн 2001 20:17 | 2 | or '(*12012)' or '(7438(*))' (*(*(1)) => NO (*12012) => NO (7438(*)) => NO Have fun ! QH@ | | Freepascal & IOI'01 | Jivko Ganev | | 12 июн 2001 18:45 | 1 | This is for all the people that use freepascal and especially for those going to IOI. I want to know what do you think about freepascal's IDE, and the decision to use it for IOI. I think it is too buggy. I am going to IOI and I think that the fact that C++ has nice IDE(rhide) and the freepascal IDE is so buggy is handicaping the people that use pascal. I emailed IOI organizers and they said that it is possible there to be both Borland Pascal 7.0 and Freepascal, so that we can use BP for IDE. If you have any opinion about freepascal's ide please reply to this post, also if you are going to IOI and want Borland Pascal to be available please email the organizers. The availability of Borland Pascal doesn't matter the organizers because we are going to submit source that will be compiled during the testing. | | Sending a problem... | Vladimir Milenov Vasilev | | 12 июн 2001 02:55 | 1 | I want to send a message, but i don now how to make the tests, the time limit and the .exe file. Will someonne help me? Greetings from Bulgaria! | | Sending a problem... | Vladimir Milenov Vasilev | | 12 июн 2001 02:53 | 1 | | | s='(*123484)' is YES or NO in D++ | Vua moi chay xuong nha xem phim duoc 1 ty, len chung no da lam x | 1027. Снова D++ | 11 июн 2001 18:55 | 1 | | | Who can help me?What do the "Ep" and "Dp" mean in Problem 1088? | Cain | | 11 июн 2001 12:11 | 3 | const maxn = 100; var a,b : array[0..maxn]of longint; ans,i,j,D,E,F,DP,EP,H : longint; begin readln(D,E,F,DP,EP,H); for i:=1 to D do begin DP:=DP div 2; a[i]:=DP; end; for i:=1 to E do begin EP:=EP div 2; b[i]:=EP; end; i:=1;j:=1; while (i<=D)and(j<=E) do begin if a[i]>b[j] then inc(i) else if b[j]>a[i] then inc(j) else begin ans:=i+j-2;break; end; end; if ans<=H then writeln('YES') else writeln('NO'); end. | | Please everyone: BE CONTACTABLE | Stefan Pochmann | | 10 июн 2001 01:36 | 2 | Hi everybody. I tried to ask some C++ coders of you some C++ stuff. But almost nobody here tells his/her homepage or email address. YOU CAN DO THIS IN YOUR ACCOUNT INFO. Please, would some of you become reachable? Stefan Pochmann Ok, I tried changing my homepage address and it doesn't work. Maybe that's the reason almost nobody announces his/her address. So I ask the admins (hi there) to fix this problem. After clicking on the "Update"-button, I get a blank page and when I view my info again, nothing has changed. The blank page isn't really blank, it's just not completed because of the following: Microsoft JScript runtime error '800a138f': 'length' is not an object (/authedit.asp, line 7) Btw, the admins do read the Webboard, don't they? Stefan Pochmann | | Who solved 1050 ? Please help me. | HNT | | 9 июн 2001 19:22 | 3 | What is a blank line ? ??? Here is my solution (read from input.txt and write to output.txt). Please give me some sample input, output. Thank. {$R+} Program Preparing_an_article; Const fi = 'input.txt'; fo = 'output.txt'; characters = ['A'..'Z','a'..'z']; Label rep; Var f1,f2 : text; quotes : word; wrote : boolean; par : array[0..20250] of char; l,i,t : word; s : string; Begin assign(f1,fi); reset(f1); assign(f2,fo); rewrite(f2); wrote := true; par[0]:=' '; repeat if wrote then begin l := 0; quotes := 0; end; repeat inc(l); read(f1,par[l]); if par[l]='"' then inc(quotes); until (par[l]='\')or((par[l]=#10)and(par[l-1]=#13)); if par[l]='\' then begin s := ''; while (not eof(f1)) do begin inc(l); read(f1,par[l]); if par[l] in characters then s := s + par[l] else break; end; if (s='')and(par[l]='"') then begin wrote := false; continue;end; if s = 'endinput' then while not eof(f1) do begin inc(l);read(f1,par [l]);end; end; if ((par[l]=#10)and(par[l-1]=#13) ) or(s = 'par') or (s = 'endinput') then begin t := 1; for i := 1 to l do begin if (par[i-1]<>'\')and(par[i] = '"') and((t '"')or ((par[i]='"')and(par[i-1]='\')) then write(f2,par[i]); end; wrote := true; end else wrote := false; until s='endinput'; close(f1); close(f2); End. I haven't solved this one yet, but in real latex, a "blank line" can contain whitespace (space, tab) and still be a paragraph-separator. It doesn't have to be an "empty line". Hope that helps... Btw, is the sample io totally bullshit or what? Stefan Thank you . I've just got AC. Thanx. > I haven't solved this one yet, but in real latex, a > "blank line" can contain whitespace (space, tab) and > still be a paragraph-separator. It doesn't have to be > an "empty line". > > Hope that helps... > Btw, is the sample io totally bullshit or what? > > Stefan > | | Can u explain me this problem , DQH ( DSAP Group ) ? | Vua moi chay xuong nha xem phim duoc 1 ty, len chung no da lam x | 1088. Илья Муромец | 9 июн 2001 18:47 | 6 | it's a full binary tree, with the deep = F Ilya is on the deep of D The magic stone is in the deep of E every leaves is numbered from the left, the fist number is 1. do u understand what i've said :">???? QH@ > it's a full binary tree, with the deep = F > Ilya is on the deep of D > The magic stone is in the deep of E > every leaves is numbered from the left, the fist number is > 1. > do u understand what i've said :">???? > > QH@ > u must count the length from Ilya to the magic stone, and if this length <= H, u write YES, otherwise, u write NO !!!! Thanks Vua moi chay xuong nha xem phim duoc 1 ty, len chung no da lam x 13 мар 2001 21:55 > > it's a full binary tree, with the deep = F > > Ilya is on the deep of D > > The magic stone is in the deep of E > > every leaves is numbered from the left, the fist number > is > > 1. > > do u understand what i've said :">???? > > > > QH@ > > | | HELP! | Roger | 1037. Управление памятью | 9 июн 2001 18:41 | 3 | HELP! Roger 7 июн 2001 12:11 1 + 1 + 1 + 2 . 2 2 . 3 3 . 30000 601 . 1 601 . 2 602 . 3 602 + 602 + 1202 . 2 Why the request 601.1 is fail and 601.2 is successful,what's the difference? Thank you! Re: HELP! Andrey Popyk (popyk@ief.tup.km.ua) 7 июн 2001 18:39 10 min = 600 sec 601 . 1 last access to [1] was at 1sec ( 1 + ) 601-1=600 answer - 601 . 2 last acces to [2] was at 2sec ( 2 . 2 ) 601-2=599 < 600 answer + Good luck! | | Hey | tomato | | 9 июн 2001 09:30 | 6 | Hey tomato 8 июн 2001 22:35 Judge UVA.ES was very bad. I don't know why i was wrong in problem C and D. anybody know the reason ? > Judge UVA.ES was very bad. I don't know why i was wrong in > problem C and D. anybody know the reason ? Boy, change your nationality. FFF > > Judge UVA.ES was very bad. I don't know why i was wrong > in > > problem C and D. anybody know the reason ? > Boy, change your nationality. FFF > > > Judge UVA.ES was very bad. I don't know why i was wrong > > in > > > problem C and D. anybody know the reason ? maybe your mail server cut off some spaces when you try to write it, so you got WA ! Good luck ! QH@ somebody here did this contest. And i want to ask. About your opinion, i'll consider soon. They're too easy (maybe the C problem is not simple) but I couldn't solve. Fffff UVA.ES! Many problems which I did OK in USA team but they weren't accepted there. > maybe your mail server cut off some spaces when you try to > write it, so you got WA ! > > Good luck ! > > QH@ | | C++ includes fail | Stefan Pochmann | | 9 июн 2001 05:49 | 2 | Hi everyone. On 30 Apr 2001, Marat Bakirov posted a list of include files for C and C++. But it doesn't work. I used the following at top of my program: #include <iostream> #include <complex> #include <cstdio> using namespace std; Could please somebody explain how to correctly include those headers? Thanks in advance, Stefan Pochmann Ok, I tried a lot and failed every time. It is possible to include some headers when the extension ".h" is explicitly given: #include <iostream.h> This should work without the extension, too (assuming a standard C++ compiler), but it's ok. The bigger problem is that I just can't include <algorithm>. I think there's a problem with the compiler installation, so I ask the admins to fix it or tell me how to work around this. Or does anybody else have a hint for me? Stroustrap, g++ and uva.es all think that #include <algorithm> is ok, so I'm very disappointed and won't try any further until somebody tells me how to do it at timus. Stefan Pochmann | | ranklist | Georgy Kadrev | | 8 июн 2001 23:27 | 2 | How could I understand where I'm in the competioner ranklist. I try with summary ranklist but there were only the authors of the tasks ? ? ? Just write your name in box under Author Ranklist! | | Why my program is "Memory Limit exceed",I think i just use no more than 200K? | Cain | | 8 июн 2001 19:57 | 1 | const maxN = 30000; interval = 600; var block : array[0..maxn]of longint; i,time,no : longint; v : integer; s,_s : string; begin while not eof do begin readln(s); if pos('+',s)>0 then begin delete(s,pos('+',s),1); while s[length(s)]=' ' do delete(s,length(s),1); val(s,time,v); for i:=1 to maxn do if (block[i]=0)or(time-block[i]>=600) then break; block[i]:=time; writeln(i); end else begin i:=pos('.',s); _s:=copy(s,1,i-1); delete(s,1,i); while s[length(s)]=' ' do delete(s,length(s),1); while _s[length(_s)]=' ' do delete(_s,length(_s),1); val(_s,time,v); val(s,no,v); if (time-block[no]>=600)or(block[no]=0) then writeln ('-') else begin block[no]:=time; writeln('+'); end; end; end; end. |
|
|