| ENG RUS | Timus Online Judge |
Общий форумLuke Fang [WA #2] why my code got WA #2 HELP!! // Задача 1049. Отважные воздухоплаватели 18 июл 2010 00:30 I dont know why my code got WA #2. Someone help me. Thank you. I use sample test. The result is correct. When I upload to Judge. It always appear WA#2. #include<stdio.h> #include<stdlib.h> #include<string.h> #include<math.h> typedef struct{ int number; int sieve_number[10000]; int sq[10000]; }sieve; int main(){ int i,j,l, k,count=0,tmp,a; sieve p[11]; memset( p,'\0',sizeof(p) ); for(i = 0 ; i < 10 ; i++){ scanf("%d\n",&p[i].number); if(p[i].number < 1 || p[i].number > 10000) exit(0); } /* for(i=0;i<10;i++) printf("%d\n",p[i].number); */ for(k=0 ; k < 10 ; k++){ l=0; for (i=1; i<=p[k].number; i++) { for (j=2; j<i; j++){ if(i%j == 0){ count++; goto Next; } } p[k].sieve_number[l]=i; l++; Next:; } } /* printf("\n\n"); for(i=0;i<10;i++){ l=0; while (p[i].sieve_number[l] != 0){ printf("%d\n",p[i].sieve_number[l]); l++; } printf("\n"); } printf("=======================\n"); */ for( k = 0 ; k < 10 ;k++){ tmp = p[k].number; for( i=1 ; i <= tmp ; i++ , l++ ){ a = p[k].sieve_number[i]; while(1){ if ( a == 0 || tmp == 1 ) break; else if ( tmp % a == 0 ){ p[k].sq[i]++; tmp=tmp/a; } else break; } if(tmp == 0 || tmp == 1) break; } } for(i=0;i<10;i++){ /* printf("number %d\n",p[i].number); */ j = 1; while (j <= p[i].number){ if (p[i].sq[j] != 0){ /* printf("%d = %d\n",p[i].sieve_number[j],p[i].sq[j]); */ p[10].sieve_number[j]=p[i].sieve_number[j]; p[10].sq[j]+=p[i].sq[j]; } j++; } /* printf("\n"); */ } /* j=1; while (j < 10000){ if (p[i].sq[j] != 0){ printf("%d = %d\n",p[10].sieve_number[j],p[10].sq[j]); } j++; } */ a = 1; j=1; while (j < 10000){ if (p[10].sq[j] != 0){ a *= ( ( p[10].sq[j] )+1 ); } j++; } if ( a >= 0 && a <= 9 ) printf("%d",a); else exit(0); return 0; } /* http://www.manpagez.com/man/3/fmod/ */ Dim@N_SS47 Memory limit exceeded [2] // Задача 1001. Обратный корень 16 июл 2010 19:41 #include <stdlib.h> #include <stdio.h> #include <math.h> #define DOUBLES_NUM 64 #define int64 long long typedef struct list { long double nums[DOUBLES_NUM]; struct list *prev; } list; int main() { unsigned char ind = 0; unsigned int64 temp; list *temppl, *pl = malloc(sizeof(list)); pl->prev = NULL; while(scanf("%I64", &temp) != EOF) { pl->nums[ind] = sqrt((long double) temp); if(++ind >= DOUBLES_NUM - 1) { temppl = malloc(sizeof(list)); temppl->prev = pl; pl = temppl; ind = 0; } } while(1) { while(ind--) printf("%.4Lf\n", pl->nums[ind]); if(pl->prev == NULL) { free(pl); break; } temppl = pl->prev; free(pl); pl = temppl; ind = DOUBLES_NUM; } return 0; } Why? Esssential what you done? [1] // Задача 1001. Обратный корень 16 июл 2010 23:20 these is ver simple input will like this while(cin >> n) { } and array a[1024*128] Dim@N_SS47 Re: what you done? // Задача 1001. Обратный корень 17 июл 2010 18:18 I know that reading input could be done much simpler. What I don't understand is why it uses over 16MB of memory. Edited by author 18.07.2010 00:49 Esssential What will answer for 1000000000 ?, Could you write output of this test? [1] // Задача 1683. Холодильник 16 июл 2010 23:13 Edited by author 17.07.2010 00:34 Andrew Shmig aka SKYDOS [Vladimir SU] Re: What will answer for 1000000000 ?, Could you write output of this test? // Задача 1683. Холодильник 17 июл 2010 12:54 Possible answer in first test is: 6 3 1 1 Now try to think whats the best way to make minimal "cuts" :) And when n=1000000000 the answer is: 30 500000000 250000000 125000000 62500000 31250000 15625000 7812500 3906250 1953125 976562 488281 244141 122070 61035 30518 15259 7629 3815 1907 954 477 238 119 60 30 15 7 4 2 1 Edited by author 17.07.2010 12:55 Luke Fang [WA #1] why my code got WA #1 // Задача 1201. Какой сегодня день? 17 июл 2010 08:03 According to the discussion board. I reference one code on here and change some thing. But why still got the wrong answer. I use the sample test to test. The answer is right. But when I upload to judgement. Alway got the WA #1. Someone can tell me why. Thank you. Below is my code. #include<stdio.h> #include<stdlib.h> int is_leap_year(int y){ return ( ( y%4==0 ) && (y%100!=0||y%400==0) ); } int days_per_year(int y){ if(is_leap_year(y)) return 366; else return 365; } int days_per_month(int m,int y){ const int days[12]={31,28,31,30,31,30,31,31,30,31,30,31}; if(m!=2) return days[m-1]; else if(is_leap_year(y)) return 29; else return 28; } int get_day_of_week(int m,int d,int y){ int day=4; /* Key point */ int i; for(i=1600;i<y;i++) day+=days_per_year(i); for(i=1;i<m;i++) day+=days_per_month(i,y); day+=d; return day%7; } void print_calendar(int m,int d,int y) { const char* day_name[7]={"mon","tue","wed","thu","fri","sat","sun"}; int days=days_per_month(m,y); int day_begin=1-get_day_of_week(m,1,y); int more_print = (day_begin + days)%7; int i,j,flag; flag = 0; for(i=0;i<7;i++){ printf("%s",day_name[i]); for(j=day_begin+i ; j <= days + more_print ; j+=7 ) if( j<1 || j>days ) printf("...."); else if(j==d){ flag = 1; if(j<10) printf("..[%d]",j); else printf("..[%2d]",j); } else{ if(j<day_begin+7){ if(flag){ printf("..%d",j); flag = 0 ; } else{ printf("...%d",j); } } else if(j >= day_begin+7 && j<10){ if(flag){ printf("...%d",j); flag = 0 ; } else{ printf("....%d",j); } } else if(j>=10 && j<= days){ if(flag){ printf("..%2d",j); flag = 0 ; } else{ printf("...%2d",j); } } else{ printf("...."); } }/* if( j<1 || j>days ) */ printf("\n"); }/* for(i=0;i<7;i++) */ } int main() { int d,m,y; scanf("%d %d %d",&d,&m,&y); if( y < 1600 || y > 2400) exit(0); if( m < 1 || m > 12 ) exit(0); if( d < 1 || d > 31 ) exit(0); print_calendar(m,d,y); exit (0); } muhammad DP is better // Задача 1200. Рога и копыта 16 июл 2010 17:45 I think dp is much better.Math soln must have too many boundary conditions. I always got wa with math. can anybody send me math soln. email:radi_cse@yahoo.com Blum Help, please, I have AC. [4] // Задача 1354. Палиндром. Он же палиндром 22 авг 2008 17:16 I've got AC constructing suffix tree (mcc algo). Now, who also has O(N) solution simplier than mine, please tell me your idea. And is O(N*N) anough to get AC? Thanks. [SPbSU ITMO] WiNGeR Re: Help, please, I have AC. [1] // Задача 1354. Палиндром. Он же палиндром 22 авг 2008 17:50 This problem can be solved in O(n) by KMP algorithm. http://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm Blum Re: Help, please, I have AC. // Задача 1354. Палиндром. Он же палиндром 23 авг 2008 12:32 Oh, yes. How stupid I was. Thanks a lot. Now I have AC with kmp) Vladislav Ivanishin Re: Help, please, I have AC. [1] // Задача 1354. Палиндром. Он же палиндром 2 июл 2009 00:51 Blum писал(a) 22 августа 2008 17:16 I've got AC constructing suffix tree (mcc algo). Now, who also has O(N) solution simplier than mine, please tell me your idea. And is O(N*N) anough to get AC? Thanks. yes. It is a little strange, but O(n^2) really gets AC Andrew Shmig aka SKYDOS [Vladimir SU] Re: Help, please, I have AC. // Задача 1354. Палиндром. Он же палиндром 16 июл 2010 15:46 How to solve this problem using KMP? Somthing with prefix function or what? Help me pls, 'cause I solved this only with O(n^2). Matrosov Mike (NNSU) WA2 [2] // Задача 1006. Квадратные рамки 6 май 2007 16:52 Why I have WA on test 2. Give me some tests, please! miro.v.k Re: WA2 [1] // Задача 1006. Квадратные рамки 10 июл 2010 18:13 Me too. Look my code. //1006.cpp #include<iostream> #include<string.h> #include<vector> using namespace std; const int n=20, m=50; unsigned char a[n][m+1]; int br; struct frame { int x,y,l; }; vector<frame> v; void read() { int i; for(i=0;i<n;i++) cin>>a[i]; } void trace(int i,int j) { if(i<0 || i>=n || j<0 || j>=m || a[i][j]==192) return; br++; trace(i+1,j); } void solve() { frame f; int i,j; for(i=0;i<n;i++) for(j=0;j<m;j++) if(a[i][j]==218) { f.x=j; f.y=i; br=1; trace(i+1,j); f.l=br+1; v.push_back(f); } } void write() { int i; cout<<v.size()<<endl; for(i=0;i<v.size();i++) cout<<v[i].x<<' '<<v[i].y<<' '<<v[i].l<<endl; } int main() { read(); solve(); write(); return 0; } If anyone can help I will be very thankfull? Phan Hoài Nam - Đại học Ngoại ngữ Tin Học TP.HCM Re: WA2 // Задача 1006. Квадратные рамки 16 июл 2010 13:48 try some test cases: ..........ÚÄÄÄÄÄÄÄ¿............................... ..........³ÄÄÄÄÄÄijÄÄÄÄÄ¿...............ÚÄÄÄÄÄÄ¿.. ..........³.......³.....³.ÚÄÄÄÄÄÄÄ¿.....³......³.. .ÚÄÄÄÄÄÄÄÄÄÄÄÄ¿...³.....³.³....ÚÄÄÄÄÄÄÄÄÄÄÄ¿¿..³.. .³³.......³ÄÄijÄÄij¿....³.³....³..³.....³..³³.ÚÄ¿. .³³.....ÚÄ¿...³...³³....³.³....³..³.....³Úij³Ä³³³. .³³.....³.³...³...³³....³.³....³..³.....³³.³³.ÀÄÙ. .³³.....ÀÄÙ...³...³³....³.³....³..³.....³³.³³..³.. .³³.......ÀÄÄijÄÄÄÙ³....³.³....³..³.....ÀÄij³ÄÄÙ.. .³³.......³...³³...³....³.³....³..³......³.³³..³.. .³³.......³...³³...³....³.ÀÄÄÚÄÄÄÄÄÄ¿....³.³³..³.. .³ÀÄÄÄÄÄÄij...³³...³....³....³.³....³....Àij³ÄÄÙ.. .³........³...³ÀÄÄij....³....³.³....³......³³..... .³........ÀÄÄijÄÄÄÄÙ....³....³.³....³......³³..... .³........³...³.........³....³.³....³......³³..... .³........ÀÄÄijÄÄÄÄÄÄÄÄÄÙ....³.ÀÄÄÄijÄÄÄÄÄÄÙ³..... .ÀÄÄÄÄÄÄÄÄÄÄÄÄÙ..............³.ÀÄÄÄijÄÄÄÄÄÄÄÙ..... .............................ÀÄÄÄÄÄÄÙ.³........... ...................................ÀÄÄÙ........... .................................................. 15 35 15 4 15 8 5 2 3 9 10 1 15 10 4 10 10 0 9 8 5 3 41 5 7 40 1 8 46 4 3 26 2 9 31 3 14 31 3 13 29 10 8 1 3 14 ....ÚÄÄÄÄÚÄÄÄÄÄÄÄÄÄÄÄ¿................ÚÄÄÄÄÄÄÄ¿... ....³....³........³..³................³.......³... ....³....³........³..³................³.......³... ....³..ÚijÄÄÄ¿ÚÄÄijÄijÄÄÄÄÄÄÄ¿.ÚÄÄÄÄÄÄÄÄÄÚÄÄÄÄÄÄÄ¿ ....³ÚijijÄÄÄÚÄÄÄ¿³..³.......³.³...ÚÄÄÄÄij....³³.³ ....³³.³.³...³³..³³..³.......³.³...³..³..³....³³.³ ....³³.³.³...³³ÚijÄÄijÄÄÄÄ¿..³.³...³..³..³ÚÄ¿.³³.³ ....³³Ú³Ä³...³³³.³³..³....³..³.³...³..³..³³.³.³³.³ ...ÚÄÄijijÄÄÄÀÄÄÄÙ³..³....³..³.³...³..ÀÄijÀÄÙÄÙ³.³ ...³³³³ÀijÄÄÄÙ³³..³..³....³..³.³...³.....³.....³.³ ...³³³ÀÄij...³³³..³..³....³..³.³...ÀÄÄÄÄij.....³.³ ...³³³...³...³³³..³..³....³..³.³.........ÀÄÄÄÄÄÄÄÙ ...³³³...ÀÄÄÄÄÄÄÄÄÄÄÄÙ....³..³.³...............³.. ...³³ÀÄÄÄÄÄÄijٳ..³.......³..³.³...............³.. ...³ÀÄÄÄÄÄÄÄijijÄÄÙ.......³..³.³...............³.. ...³.........³³³..........³..³.³...............³.. ...³.........³³³..........³..ÚÄ¿...............³.. ...³.........³³ÀÄÄÄÄÄÄÄÄÄÄÙ..³.³...............³.. ...ÀÄÄÄÄÄÄÄÄÄÙÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÀÄÙ...............³.. ...............................ÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÙ.. 15 6 7 4 38 0 9 14 3 16 31 3 17 29 16 3 42 6 3 5 4 10 4 0 15 3 8 11 7 3 7 15 6 12 13 4 5 35 4 7 41 3 9 9 0 13 ..................ÚÄÄÄÄÄÄÄ¿....................... ...ÚÄÄÄÚÄÄÄÄÄÄÄÄÄijÄÄÄÄÄ¿.³..ÚÄÄÄÄÄ¿ÚÄÄÄÄÄ¿....... ...ÚÄÄij........³.³ÚÄÄÄ¿³.³..³.....³³.....³....... .ÚÄÄÄÄijÄÄÄÄÄÄÄ¿³.³³...³³.³..³..ÚÄijÄÄÄÄ¿.³....... .³.³...³.......³³.³³...³³.³..³..³..³³...³.³....... .³.³...³.......³³.³³...³³.³..³..³.ÚÄÄÄÄÄÄÄÄÄ¿..... .³.ÀÄÄij.......³³.³ÀÄÄÄÙ³.³..³..³.³³³...³.³.³..... .³.³...³...ÚÄÄÄÄÄij¿....³.³ÄÄÀÄÄÄijÙÀÄÄijÄÙ.³..... .³.³...³...³...³³.ÀÄÄÄÄÄÄÄÙ¿....³.³..³..³...³..... .³.³...³...³...³³..³...³³.³³....³.³..³..³...³..... .³.³...³...³...³³..³...³³.³³....³.³..³..³...³..... .³.³...³...³...³³..³...³³.³³....ÀijÄÄÄÄÄÙ...³..... .³.³...³...³...³³..³ÚÄÄÀÄÄÄÙ......³..³......³..... .³.³...³...³...³³..³³..³³.³.......³..³......³..... .³.ÀÄÄijÄÄijÄÄijÙ..³³..³³.³.......³..³......³..... .³.....³...ÀÄÄÄÄÄÄÄÙÀÄÄÙ³.³.ÚÄÄÄ¿.ÀÄÄÄÄÄÄÄÄÄÙ..... .³.....³.......³........³.³.³...³....³............ .ÀÄÄÄÄijÄÄÄÄÄÄÄÙ........³.³.³...³....³............ .......ÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÙ.ÀÄÄÄÄÄÄÄÄÄÄÙ............ ............................ÀÄÄÄÙ................. 15 3 1 14 3 2 5 20 12 4 28 15 5 26 7 12 1 3 15 7 1 18 23 8 5 19 2 5 36 1 7 32 3 9 29 1 7 11 7 9 18 0 9 34 5 11 ...........................ÚÄÄÄÄÄÄÄ¿.............. ........................ÚÄÄÄÄÄÄ¿...³.............. ...ÚÄÄÄÄ¿ÄÄÄÄÄÄÄÄÄÄ¿....³..³...³...³.............. ...³....³..........³....³..³...³...³.............. ...³....³..........³....³..³...³...³.............. ...³Ä¿..³..........³....³..³...³...³.............. ...³.³..³..........³....³..³...³...³.............. ...ÀÄÄÄÄÙ..........³....³..³...³...³.....ÚÄ¿...... ....ÚÄÄij¿.........³....ÀÄÄÄÄÄÄÙÄÄÄÙ.ÚÄÄijijÄÄ¿... ....³...³³ÚÄÄÄÄÄÄÄijÚÄÄ¿.............³...ÀÄÙ..³... ....³...³³³........³³..³ÄÄÄÄÄÄÄ¿.....³ÄÄÄÄÄÄÄij... ....³...³³³..ÚÄÄÄÄÄ¿³..³.......³.....³........³... ....³...³³³..³.....³ÀÄÄÙ.......³.....³........³... ....ÀÄÄÄÀÄÄÄijÄÄÄÄij...³.......ÚÄÄĿڳĿ......³... ..........³..³.....³...³.......³...³³³.³......³... ..........³..³.....³...³.......³...³³³.³......³... ..........³..³.....³...³.......³...³À³ÄÙ......³... ..........³..ÀÄÄÄÄÄÙ...³.......ÀÄÄÄÙ.ÀÄÄÄÄÄÄÄÄÙ... ..........ÀÄÄÄÄÄÄÄÄÙ...ÀÄÄÄÄÄÄÄÙ.....³........³... .....................................ÀÄÄÄÄÄÄÄÄÙ... 15 3 5 3 36 13 4 37 10 10 37 8 10 41 7 3 23 10 9 20 9 4 31 13 5 4 8 6 10 9 10 8 2 12 3 2 6 13 11 7 27 0 9 24 1 8 .........................ÚÚÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄ¿...... .......................ÚÄij¿ÚÚÄÄÄÄÄÄÄÄÄÄÄÄÄ¿...... ....................ÚÄijij³³³³³Ä³ÄÄ¿.......³...... ..........ÚÄÄÄÄÄ¿...³..³.³³³³³³Ä³ÄÄÄÄÄÄÄÄÄijĿ.... ..........³.....³...³..³.³³³³³³.³..³.......³.³.... ..........³.....³...³..ÀÄijÙÀ³ÄÄÙ..³ÚÄÄÄÄÄ¿³ÚÄ¿... ..........³...ÚijÄÄij¿....³..³³....³³.....³³³³³... ..........³...³.³ÄÄÄÄÄÄÄÄijĿ³ÄÄÄÄÄÄÄÄÄÄ¿.³³ÀÄÙ... ..........³...³.³...³³....³.³³³....³³...³.³³.³.... ..........ÀÄÄÄÄÄÙ...³³....³.³³³....³³...³.³³.³.... ..............³.³...³³....³.³³³....³³...³.³³.³.... ..............³.³...³³....³.³³³....³ÀÄÄijÄÙ³.³.... ..............³.³...³³....³.³³³....³....³..³.³.... ..............ÀijÄÄijÙ....³.³³³....³....³..³.³.... ................³.³.³.....³Ä³³³¿...³....³..³.³.... ................³.Àij.....³.³ÀÄÄÄÄÄÄÄÄÄÄÄÄÄÙ.³.... ................³...³.....³.³³³³...³....³..³.³.... ................³...ÀÄÄÄÄÄÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÙ.³.... ................³.........³.³ÀÄÄÄÄÄÄÄÄÄÄÙÄÄÄÄÙ.... ................ÀÄÄÄÄÄÄÄÄÄÄÄÙÄÄÙ.................. 16 18 13 3 26 14 6 14 6 8 20 2 16 30 3 16 25 0 6 44 5 3 28 1 5 23 1 5 36 5 7 20 7 11 16 7 13 10 3 7 29 7 12 26 0 18 29 1 15 ÚÄÄÄÄÄÄÄÄÄÄÄ¿.ÚÄÄÄÄÚÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄ¿ÄÄÄÄÄÄ¿..... ³...........³.³ÄÄÄijÄÄÄÄÄÄ¿...³......³......³..... ³...ÚÄÄÄÄÄÄÄÄÄÄ¿...³......³...³......³......³..... ³ÄÄij.......³.³³...³......³...³......³......³..... ³...³.......³.³³...³.....ÚÄÄ¿.³......³......³..... ³...³.......³.³³ÚÄijÄÄÄÄ¿³³.³.³ÄÄÄÄÄijÄÄÄÄ¿.³..... ³...³.......³.³³³..³....³³³.³.³......³....³.³..... ³ÄÄij.......³.³³³..³....³ÀÄÄÙ.³......³ÄÄÄÄÄÄÙ..... ³...³.......³.³³³..³....³.³...³......³....³....... ³...³.ÚÄÄÄÄÄÄ¿³³³..³....³.³...³......³....³....... ³...³.³.....³³³³³..³....³.³...³ÚÄ¿...³....³....... ³...³.³.....³³³³³..³....³.³...³³.³...³....³....... ÀÄÄijijÄÄÄÄÚij³³Ä¿Ú³¿...³.³...³ÀÄÙ...³....³....... ....ÀijÄÄÄÄÄijÄÙijijÄÄÄÄÄÄÙ...³......³....³....... ......³.³..³.³³..³À³Ù.........³......³....³....... ......³.ÀÄij.³³..³.³..........³......³....³....... ......ÀÄÄÄÄÄÄÙÀÄÄÄijÄÄÄÄÄÄÄÄÄÄÙ......³....³....... ...........³.....³.³..........ÀÄÄÄÄÄijÄÄÄÄÙ....... ...........ÀÄÄÄÄÄÙ.ÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÙ............ .................................................. 15 18 12 3 8 12 4 0 3 5 31 10 3 16 5 9 14 1 13 25 4 4 0 0 13 11 12 7 30 5 13 37 0 8 14 0 17 4 2 12 6 9 8 19 0 19 zinccopper How many frames are there on screen? [3] // Задача 1006. Квадратные рамки 28 ноя 2007 06:12 In the description, it first says "N square frames (1 ≤ N ≤ 15) were sequentially drawn on screen". Then it says "However, it should not contain more than 2000 frames". How many frames are there on screen, 15 or 2000? deitytoday Re: How many frames are there on screen? [2] // Задача 1006. Квадратные рамки 21 авг 2008 12:33 I want to ask that, too would somebody help? Daniel Mahu Re: How many frames are there on screen? [1] // Задача 1006. Квадратные рамки 4 апр 2009 22:38 The solution may output more frames than were initially drawn - if two frames overlap and it detects a third frame made from the overlapping parts. It should still be accepted if the total number of frames < 2000. That said, it shouldn't be a concern if you output at most one frame per input char (i.e., you don't output frames with no reason at all) because there are less input chars than 2000 (20x50 = 1000). Phan Hoài Nam - Đại học Ngoại ngữ Tin Học TP.HCM Re: How many frames are there on screen? // Задача 1006. Квадратные рамки 16 июл 2010 13:36 In reference to the problem statement, there are 1 - 15 square frames on the screen and there are 1 - 2000 frames (characters other than dots) on the screen Phan Hoài Nam - Đại học Ngoại ngữ Tin Học TP.HCM MAYBE WEAK TESTS ! // Задача 1006. Квадратные рамки 16 июл 2010 13:32 I have created some test cases with N = 15 and then solve it, for some test cases my program outputs K = 15 but FOR SOME TEST CASES MY PROGRAM OUTPUTS K = 16! ... Alipov Vyacheslav [Tomsk PU] Mistake in russian statement [1] // Задача 1418. Армейская история 15 июл 2010 20:50 В слове "подаваться" На выход должно подвааться единственное целое число -> На выход должно подаваться единственное целое число Sandro (USU) Fixed (-) // Задача 1418. Армейская история 15 июл 2010 22:43 Qafqaz_Ferhad Cebiyev And is it very easy to use long arithmetic. I was writing it.But then I saw that this is going to be very long.And I thought to myself this way isn't true. // Задача 1206. Сумма цифр суммы чисел 15 июл 2010 21:38 Qafqaz_Ferhad Cebiyev How to use long aritmetics in C++? I haven't use it before. // Задача 1206. Сумма цифр суммы чисел 15 июл 2010 21:26 How to use long aritmetics in C++? I haven't use it before. Qafqaz_Ferhad Cebiyev How to use long aritmetics in C++? I haven't use it before. 15 июл 2010 16:48 muhammad RB tree // Задача 1090. Теперь ты в армии 14 июл 2010 20:37 AC with RB tree but horrible time(.359 sec) please somebody tell me algorithm to AC in .015 sec. Thanks in advance Phan Hoài Nam - Đại học Ngoại ngữ Tin Học TP.HCM FINALLY ACCEPTED ! BECAUSE OF UNCLEAR PROBLEM STATEMENT // Задача 1038. Проверка орфографии 14 июл 2010 14:52 1. The new word starts after end of line 2. The new word starts after letters '0' - '9' 3. The new sentence does not start after end of line Mukhametianov Den [USU] Hint // Задача 1181. Разрезание окрашенного многоугольника 14 июл 2010 02:12 One stack is bad. But N stacks... =) Nazar What I must print in this case: [2] // Задача 1072. Маршрутизация 24 сен 2005 23:31 2 1 1.1.1.1 1.1.1.1 1 1.1.1.1 1.1.1.1 1 1 AdelantE Re: What I must print in this case: // Задача 1072. Маршрутизация 13 июл 2010 19:00 Yes 1 Moonstone Re: What I must print in this case: // Задача 1072. Маршрутизация 13 июл 2010 19:09 This test is incorrect... Виктор (marilyn_manson@bk.ru) My solution is very simple!!! [4] // Задача 1246. Собака на привязи 30 июн 2004 15:00 We take the lowermost point - O. The previous point - A, and following - B. Let q = cos (corner between AO and axis OX) r = cos (corner between BO and axis OX) If q < r then ccw else cw I got AC!!! KingPin Re: My solution is very simple!!! [3] // Задача 1246. Собака на привязи 30 май 2005 22:34 Simple but wrong! Simple test: 3 4 4 1 1 3 5 Your answer is ccw, but correct cw. Another proof that timus test are weak :( Yu Yuanming Re: My solution is very simple!!! [1] // Задача 1246. Собака на привязи 7 июн 2005 07:35 The method which find the lowermost point is right... But don't use cos & sin, think another way :) dmitri_quick Re: My solution is very simple!!! // Задача 1246. Собака на привязи 11 авг 2009 01:13 MY! solution is simple) only 6 actions for every Vertex. Don't use sin or cos Roman Rubanenko Re: My solution is very simple!!! // Задача 1246. Собака на привязи 13 июл 2010 17:48 .... 3 4 4 1 1 3 5=cw?Have you ever seen any clocks? ANDREI TRUBIN No subject // Задача 1423. Басня о строке 13 июл 2010 14:40 Edited by author 19.08.2010 14:23 Samsonov Ivan (Rybinsk SAAT) wa #4 [11] // Задача 1569. Сети в Исети 7 окт 2007 19:00 Please give some test Todor Tsonkov Re: wa #4 [10] // Задача 1569. Сети в Исети 7 окт 2007 22:00 Why BFS doesn't work ? Can you give some tests ? Victor Barinov (TNU) this test helped me to get AC // Задача 1569. Сети в Исети 7 окт 2007 22:27 6 9 5 6 3 4 2 4 1 5 3 6 1 2 1 6 4 5 3 3 shilp Re: wa #4 [8] // Задача 1569. Сети в Исети 7 окт 2007 22:42 i make a shortest path tree (i know i do it correctly) from the every vertex of the graph, but even that is giving me a WA on #17... can someone please give me a test case where that would fail? @Todor BFS won't work in a case like 6 6 1 2 2 5 1 3 3 5 3 6 3 4 if you make a BFS tree by searching the lower indexed vertices, starting from 1, then 5 would be committed under 2 where as it should be committed under 3, even if you are constructing a tree from 3 in the above case i am sure a case can be formed that the above anomaly is exploited. Loky_Yuri [USTU Frogs] Re: wa #4 [7] // Задача 1569. Сети в Исети 7 окт 2007 22:55 I have WA #17 too. But I don't understand why in your test BFS doesn't work? 6 6 1 2 2 5 1 3 3 5 3 6 3 4 My prog gives this answer: 1 2 1 3 3 4 3 5 3 6 It's correct, isn't it? shilp Re: wa #4 [6] // Задача 1569. Сети в Исети 7 окт 2007 23:31 its correct.. yes.. i am saying that a BFS would construct the shortest paths for sure, but it would do so in a greedy format that will most probably give a graph with a sub-optimal diameter, so perhaps will a shortest path tree.. i even tried constructing the BFS with highest degree first but none of it seems to work.. any idea? diver_ru (Fishburg SAAT) WA 17? Look here(+) [5] // Задача 1569. Сети в Исети 9 окт 2007 16:32 Look at the test, given by Victor (thanks him): 6 9 5 6 3 4 2 4 1 5 3 6 1 2 1 6 4 5 Answer will be 1 5 2 4 3 4 5 4 6 5 and maximum distance equal 3 (in edges), not 4! svr Re: WA 17? Look here(+) [3] // Задача 1569. Сети в Исети 16 окт 2007 00:04 How are you may start BFS programming without mathematical characterization of optimal solution. I found with difficulties in internet that it is tree of shortest pathes from absolute centre of graph. Thus you need in two programs 1) Finding absolute centre(Hacimi) 2) Dejkstra for shortest paths. P.S. Glad to confirm with help of 1569 My Hakimi algorithm realization. But, of course, we don't need Hakimi algo to solve this problem. When edges have equal wheightes absolute centre or in vertex or in middle of the edge. Edited by author 02.06.2008 16:18 Denis Koshman Re: WA 17? Look here(+) // Задача 1569. Сети в Исети 14 авг 2008 13:52 I have found algo here: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.5609 Thanks Victor for his test, I've found a bug (as usual, I used some outer loop variable inside inner loop. ARGHHHHH!) Edited by author 14.08.2008 14:01 Edited by author 14.08.2008 14:01 Tolstobrov Anatoliy[Ivanovo SPU] Re: WA 17? Look here(+) [1] // Задача 1569. Сети в Исети 25 сен 2008 20:12 What is the complexity of Hakimi algo? svr Re: WA 17? Look here(+) // Задача 1569. Сети в Исети 25 сен 2008 21:28 I repeat! You don't need Hakimi algo! Apply your shortests path algo also to the middles of the edges as sink of searching. Azad Re: WA 17? Look here(+) // Задача 1569. Сети в Исети 13 июл 2010 02:11 My program gave the following output: 1 5 3 6 1 2 1 6 4 5 Is that correct?
|