E D R , A S I H C RSS

Full text search for "p-1"

p-1


Search BackLinks only
Display context of search results
Case-sensitive searching
  • CompleteTreeLabeling/조현태 . . . . 11 matches
          return (temp-1)/(degree-1);
          temp_block->next[i]=create_block(i+get_number_nodes(input_degree, input_deep)+input_degree*(input_number-get_number_nodes(input_degree, input_deep-1)),input_deep+1,input_all_deep,input_degree, line, temp_block);
          return (temp-1)/(degree-1);
          temp_block->next[i]=create_block(i+get_number_nodes(degree, input_deep)+degree*(input_number-get_number_nodes(degree, input_deep-1)),input_deep+1, temp_block);
          int remain=get_number_nodes(degree,deep)-get_number_nodes(degree,line[block_number]->deep-1);
          int number_of_one=get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1);
          change(&line[temp_block->default_number+i]->number,&line[such_point+get_number_nodes(degree,line[block_number]->deep-1)]->number);
          change(&line[temp_block->default_number+i]->number,&line[such_point+get_number_nodes(degree,line[block_number]->deep-1)]->number);
          int block_number=1;//get_now_nodes(degree,deep-1);// 임시
          int sub_nodes=get_number_nodes(degree,line[block_number]->deep-1), now_nodes=get_number_nodes(degree,line[block_number]->deep);
          sub_line=(int*)malloc(sizeof(int)*(get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1)));
  • BeeMaja/하기웅 . . . . 4 matches
          col=step-1;
          col=step-1;
          row=step-1;
          row=step-1;
  • Bridge/권영기 . . . . 4 matches
          if(man[0] + man[1] + man[p] + man[1] > man[p] + man[0] + man[p-1] + man[0]){
          ans += man[p] + man[0] + man[p-1] + man[0];
          ans2.push(make_pair(man[0], man[p-1]));
          ans2.push(make_pair(man[p-1], man[p]));
  • JollyJumpers/임인택 . . . . 4 matches
          if( (tmp<size) && !isExist[tmp-1]) {
          isExist[tmp-1] = true;
          if( tmp<array.length && !flags[tmp-1]) {
          flags[tmp-1] = true;
  • 새싹교실/2012/AClass/3회차 . . . . 4 matches
          q=a[j][p-1];
          w=b[p-1][j+1];
          q=a[j][p-1];
          w=b[p-1][j];
  • DermubaTriangle/김상섭 . . . . 2 matches
          num1_y = height*(temp-1.0/3.0);
          num2_y = height*(temp-1.0/3.0);
  • HelpOnInstallation . . . . 2 matches
          * 윈도우즈 사용자의 경우는 아파치 웹서버를 제외한 PHP + rcs + 기타 몇몇 프로그램이 함께 패키징 된 apmoni-setup-1.1.x.exe를 제공합니다.
          * 윈도우즈 사용자의 경우 micro apache 웹서버가 포함된, mapmoni-setup-1.1.x.exe 를 받으실 수도 있습니다. (단, 여기서 .x. 는 3 이상)
  • IndexedTree/권영기 . . . . 2 matches
          temp = sp-1;
          temp = sp-1;
  • JollyJumpers/강희경 . . . . 2 matches
          if(gap >= aList[0] || gap == 0 || binaryMap[gap-1]){
          binaryMap[gap-1] = true;
  • DermubaTriangle/하기웅 . . . . 1 match
          col+=sqrt(3.0)*(eExp-sExp-1)/2;
  • LispLanguage . . . . 1 match
          * emacs 강좌 - lisp 이해하기 1: http://ageofblue.blogspot.kr/2012/01/emacs-lisp-1.html
  • OurMajorLangIsCAndCPlusPlus/XML/김상섭허준수 . . . . 1 match
          return sta->array[--sta->top-1];
  • RoboCode . . . . 1 match
          * Upload:robocode-setup-1.0.7.jar
  • 데블스캠프2011/다섯째날/Cryptography . . . . 1 match
         φ(n) <- (p-1)*(q-1)
  • 몸짱프로젝트/Maze . . . . 1 match
          if ( path[top-1].direction > 7){
  • 피보나치/김홍선 . . . . 1 match
          pibo(p-1);
  • 희경/엘레베이터 . . . . 1 match
          while(temp-1 != floor)
Found 17 matching pages out of 7540 total pages (5000 pages are searched)

You can also click here to search title.

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
Processing time 0.2874 sec