| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| spelling 'consiquently' ===> 'consequently' | Doctor Lai | 1940. Непростые годы | 4 янв 2013 00:21 | 2 |
|
| can anyone send me solution of this question? please ! (my mail is: erzhan_jktl@mail.ru) | Erzhan Shaniev | 1073. Квадратная страна | 3 янв 2013 08:38 | 2 |
Could you tell me case for Text 14.Thank You |
| WA 14!!!! | Toy | 1073. Квадратная страна | 3 янв 2013 08:11 | 1 |
Could you give me case for 14.Thank you. |
| The test case! | earthworm | 1003. Чётность | 3 янв 2013 06:35 | 1 |
|
| How debug?? | DuncanMcLaud | | 2 янв 2013 23:17 | 2 |
Hi! How can I get the data for the tests? For example - 1) coding task number N! 2) send for checking! 3) Wrong answer! Test number 2! 4) How to get input data for test 2? Thanks for the help! Nobody will give you the testdata. Edited by author 02.01.2013 23:17 |
| problem in test 6 | panic | 1796. Парк аттракционов | 1 янв 2013 22:02 | 5 |
i have a problem in test 6, can't find ,whats the matter?!?! help plz!! it's prob-ly test 0 0 0 0 0 0 1 No, you aren`t right. 0 0 0 0 0 0 - is invalid test case. Feature of test #6 is that ticket coast is greater then minimal nominal of bank notes set present. my English is not very good. I don't think that i understand your statement clearly. Can you explain it or give sample test for your statement. Tks. |
| Test2 Crash | pmartynov | 1125. Классики | 31 дек 2012 04:18 | 1 |
I've seen lots of guys crashed on test 2. Could anyone provide a hint for this test? |
| Help me PLEASE!!!!! I got WA 10 !!! | 107th | 1122. Игра | 31 дек 2012 02:00 | 6 |
I don't now why!! AAAAAAAA!!!! WWWW WBBW WBWW WWWW 000 011 010 is it impossible?? WWWW WBBW WBWW WWWW 000 011 010 Why impossible? Answer has to be one, since choosing 2,2 cell will turn all cells to white. But I still get WA10. Please help . . . You've forgotten, that cenrtral piece must leave. Are you saying that we should not turn the piece at the center of mask? There was no task condition about that. |
| where my mistake? | Mike_Ndd | 1567. SMS-спам | 31 дек 2012 01:52 | 1 |
var s: char; i, sim: integer; begin sim:=0; while not EOF do begin //for i:=1 to s do begin read (s); if ((s='a') or (s='d') or (s='g')or(s='g') or (s='m')or (s='p') or (s='t') or (s='w')) then sim:= sim+1 else if ((s='b') or (s='e') or (s='h') or (s='k') or(s='n') or (s='q') or (s='u') or (s='x')) then sim:= sim+2 else if ((s='c') or (s='f') or (s='i') or (s='o') or (s='r') or (s='v') or (s='y')) then sim:= sim+3 else if ((s='s') or (s='z')) then sim:=sim+4 else if (s=' ') then sim:=sim+1 else if (s='.') then sim:= sim+1 else if (s=',') then sim:= sim+2 else if (s='!') then sim:= sim+3 end end; write (sim); end. Edited by author 31.12.2012 01:58 |
| WA Test #24 | Fasterm | 1027. Снова D++ | 30 дек 2012 19:50 | 1 |
Can anybody tell what the problem ? Edited by author 30.12.2012 19:51 |
| Admin, May I suggest you something? :( | Mickkie | 1011. Кондукторы | 30 дек 2012 16:50 | 2 |
From : We know that there are more than P% conductors and less than Q% conductors. To clarify, you should write : By percentage, we know that there are more than P% conductors and less than Q% conductors of all Russian citizens in this city. Until I've read several comments in discussion, I found out what the problem wants. Sincerely. I added a little clarification to the sentence about percentage and a hint about sample test. Now the problem statement should be easier to understand. |
| Example | AGrigorii [Yaroslavl SU]🔥 | 1826. Минное поле | 30 дек 2012 16:38 | 2 |
Example AGrigorii [Yaroslavl SU]🔥 19 дек 2012 01:25 Can you explain me the first example.. why 17?? They can cross for 17 in such a way: 1,2--> <--1 5,10--> <--2 1,2--> |
| WA #22 why? | TARASHI {Kutaisi SU3} (Georgia) | 1785. Трудности локализации | 30 дек 2012 03:49 | 3 |
WA #22 why? TARASHI {Kutaisi SU3} (Georgia) 8 мар 2012 01:00 #include <iostream> using namespace std; void main() { int n; cin >> n; if( (n >= 1) && (n <= 4) ) cout << "few"; if( (n >= 5) && (n <=9 ) ) cout << "several"; if( (n >= 10) && (n <= 19) ) cout << "pack"; if( (n >= 20) && (n <= 49) ) cout << "lots"; if( (n >= 50) && (n <= 99) ) cout << "horde"; if( (n >= 100) && (n <= 249) ) cout << "throng"; if( (n >= 250) && (n <= 449) ) cout << "swarm"; if( (n >= 500) && (n <= 999) ) cout << "zounds"; if( (n >= 1000) ) cout << "legion"; } |
| which answer is correct? | Adler3D | 1922. Команда супергероев | 29 дек 2012 22:15 | 5 |
input: 3 1 1 2 answer: 4 1 1 1 2 2 3 1 2 3 2 answer: 5 1 1 1 2 2 3 1 2 3 2 3 1 2 3 answer: 3 1 1 1 2 3 1 2 3 answer: 1 3 1 2 3 why not answer: 3 1 1 1 2 3 1 2 3 ??? > why not: 1 1 Because 1 1 is effective but not reliable. It is not reliable because "2 1 2" is also effective. Therefore there exists a superhero such that adding it to "1 1" makes another effective team, and by the original text of this problem (note that the current problem text is WRONG but the admins don't seem to want to fix it), that makes "1 1" not reliable. > why not: 1 2 Same reason as "1 1": "1 2" is effective but not reliable because "2 1 2" is also effective. How is "2 1 2" effective? Effective according to the problem statement means that all heroes' wishes are satisfied. "2 1 2" doesn't meet this condition because "1" wants to work alone and is instead in a group with "2 2". |
| WA#14 Impossible ! | Mickkie | 1011. Кондукторы | 29 дек 2012 13:50 | 1 |
#include<stdio.h> double i,j,p,q,per; int main() { scanf("%lf %lf",&p,&q); for (i=1;;i++) for (j=0;j<=i;j++) { per=100*j/i; if (p<per && per<q) { printf("%d",(int) i); scanf(" "); return 0; } } } |
| If you have TL on test 3, read this | Doctor Lai | 1922. Команда супергероев | 28 дек 2012 07:27 | 1 |
The main loop is just O(n), not O(n^2) you need to sort the heroes first according to their wishes. the main loop is for (int i = 1; i <= ulen; i ++) { if (w[0].wish <= i) { used[0] = true; search(0, i, 1); used[0] = false; } } Edited by author 29.12.2012 01:28 Edited by author 29.12.2012 01:31 |
| 'Each value of the function is longint '..en..it's right i think | LLL | 1010. Дискретная функция | 27 дек 2012 20:08 | 1 |
if 'a' and 'b' are both longint,abs(a-b) can be __int64. |
| What is Wrong? | Bekmyrat | 1110. Степень | 27 дек 2012 08:05 | 2 |
# include <iostream> #include <cmath> #include <vector> using namespace std; int main() { vector < int > asd; int a,b,c,d,e=0;
cin>>a>>b>>c;
for(double i=1;i<=999;i++) { if(i<=b) { d=pow(i,a); if(d%b==c) asd.push_back(i);
else e++; } } if(e==b) cout<<"-1"; else { cout<<asd[0]; for(int i=1;i<asd.size();i++) cout<<' '<<asd[i]; }
getchar(); getchar();
return 0; } I think you should delete lines: getchar(); |
| How my O(n^4) solution got AC. | Raman Gupta | 1146. Maximum Sum | 26 дек 2012 21:31 | 3 |
I was little discouraged when my O(n^4) solution got AC.What remains the purpose of Dp ,if I could do it by complete search. Please mail me the O(n^3),O(n^2),O(n) solution for this task,any or all complexity written here. My mail id is royalbird.raman@gmail.com thanks for your support O(n) cannot be achieved in this problem, because of O(n^2) input. I think you use a kind of DP when you sum the numbers in every rectangle. (In fact, the most complete search has the complexity O(n^6)) =)) |
| Crash (stack overflow) | Komron | 1203. Научная конференция | 26 дек 2012 10:12 | 1 |
I wrote my code 3 times and the checker keeps on telling me that my solution crashes on some kind of stack overflow...Please help in fixing this issue, thanks. UPD: The problem is solved, so the question is canceled. Edited by author 26.12.2012 10:56 |