## Search found 18 matches

Wed Jun 18, 2003 2:51 pm
Forum: Other words
Topic: Problem Difficulity Level
Replies: 4
Views: 1319
thanks.....guys!

but, is there no site like that in www?
i ever found one... but i forgot the links..

when i search again in google or yahoo... i can't find it....

Tue Jun 17, 2003 11:30 am
Forum: Volume 1 (100-199)
Topic: 122 - Trees on the level
Replies: 103
Views: 9700
c'mon man....

i've stucked with this one...
pliss....

-thanks-
Tue Jun 17, 2003 11:27 am
Forum: Other words
Topic: Problem Difficulity Level
Replies: 4
Views: 1319

### Problem Difficulity Level

where can i find it???

-thanks-
Tue Jun 17, 2003 11:22 am
Forum: Volume 1 (100-199)
Topic: 128 - Software CRC
Replies: 62
Views: 7219
i also got WA, anything wrong?? here is it : #include <stdio.h> #include <string.h> #define LONG unsigned long #define CRC_V 34943 LONG CRC(char *word) { LONG i,cr=0, get; for(i=strlen(word)%2==1?-1:0;word[i];i+=2) { get = cr * 0x10000; if(i!=-1) get += (LONG) word[i] * 0x100; get += word[i+1]; cr =...
Fri Jun 13, 2003 9:53 am
Forum: Volume 7 (700-799)
Topic: 743 - The MTM Machine
Replies: 12
Views: 7493

### 743 - The MTM Machine

anyone can give me more sample input??
and the output of course

i'm still confused with the 3rd rule

-thanks-
Wed May 28, 2003 2:44 pm
Forum: Volume 5 (500-599)
Topic: 594 - One Little, Two Little, Three Little Endians
Replies: 46
Views: 13183
^_^

i use char pointer....
and reverse it....

u'll solve it just in several lines of code

peace....
Tue May 27, 2003 10:25 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 178926
Hope this'll help u #include <stdio.h> #define MAXNUM 100000 int g_stack[MAXNUM] = {0,}; int main(int argc, char* argv[]) { while( 1 ) /* <--- Forever loops!! I can't find "return" for this function or "break" for this loops */ { long int nFrom, nTo; while( 2 == scanf( "%ld %ld", &nFrom, &nTo ) ) { ...
Mon May 26, 2003 2:46 pm
Forum: Volume 2 (200-299)
Replies: 12
Views: 6535
i've increase the array, but still get WA here is my code : #include <stdio.h> char buffer[100][110]; char number[100][110]; void accross(int h, int w) { int i,j,flag; printf("Across\n"); for(i=0;i<h;i++) for(j=0;j<w;j++) { if(number[i][j]!='0') { flag=0; if(j==0) flag=1; else if(buffer[i][j-1]=='*'...
Mon May 26, 2003 1:38 pm
Forum: Volume 6 (600-699)
Topic: 642 - Word Amalgamation
Replies: 9
Views: 5817
mine got WA #include <stdio.h> #include <string.h> int N=0; char DIC[101][7]; int compare(char *a, char *b) { int i; for(i=0;a[i];i++) { if(a[i]>b[i]) return 1; if(b[i]>a[i]) return -1; } if(b[i]==0) return 0; else return -1; } void sort(void) { char temp[7]; int i,j,tv; for (i=0;i<N-1;i++) { for(j=...
Mon May 26, 2003 1:28 pm
Forum: Volume 3 (300-399)
Topic: 344 - Roman Digititis
Replies: 15
Views: 4341
i get WA too... this is mine... pliz help me... #include <stdio.h> #include <stdlib.h> int I,V,X,L,C; void proccess(int n) { int i,x; for(i=1;i<=n;i++) { x = i/10; if(x>=9) { C++; x-=10; } if(x>=4) { L++; x-=5; } x = abs(x); X+=x; x = i%10; if(x>=9) { X++; x-=10; } if(x>=4) { V++; x-=5; } x = abs(x)...
Mon May 26, 2003 1:26 pm
Forum: Volume 6 (600-699)
Topic: 641 - Do the Untwist
Replies: 9
Views: 5540

### 641 - Do the Untwist

this is my WA code: #include <stdio.h> #include <string.h> char text[30]="_abcdefghijklmnopqrstuvwxyz."; int getCode(char ch) { int i; for(i=0;text[i]!=ch;i++); return i; } char getText(int code) { return text[code]; } void untwist(int k, char *a) { int i,n,pcode; int plaincode[100], chipcode[100]; ...
Mon May 26, 2003 1:19 pm
Forum: Volume 6 (600-699)
Topic: 612 - DNA Sorting
Replies: 122
Views: 15462
anyone can catch my mistakes??? this is my code : #include <stdio.h> #include <string.h> char buffer[50][101]; int inv[50]; value(char a) { if(a=='A') return 0; if(a=='C') return 1; if(a=='G') return 2; if(a=='T') return 3; return -1; } inversion(char *a) { int i,j,count=0; for(i=0;i<strlen(a)-1;i++...
Mon May 26, 2003 1:03 pm
Forum: Volume 104 (10400-10499)
Topic: 10465 - Homer Simpson
Replies: 75
Views: 22358
my code giv the same result.... but' i still get WA here is it: #include <stdio.h> main() { long i,j,m,n,t,max,waste,time; while( scanf("%ld %ld %ld",&m,&n,&t)!=EOF ) { max=0; time=0; waste=0; for(i=0;m*i<=t;i++) for(j=0;m*i+n*j<=t;j++) { if(m*i+n*j==t && i+j>max) { max=i+j; } else if(i+j>waste) { w...
Mon May 26, 2003 10:38 am
Forum: Volume 5 (500-599)
Topic: 587 - There's treasure everywhere!
Replies: 37
Views: 2525
i also got WA here is my code : #include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> main() { int i,j,n,count=1; float dx,xx,yy,d; char *x,step[999],dir[999],buff[999],buf[999]; dx=sqrt(2)/2; while(1) { gets(buf); if(strcmp(buf,"END")==0) return 0; x = buf; xx = 0, yy=0; whil...
Mon May 26, 2003 9:31 am
Forum: Volume 2 (200-299)