Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

¹ØÓÚAndroid C´úÂë ±äÁ¿²ð·Ö×éºÏµÄÎÊÌâ

Hi,

  ÔÚAndroidÉÏÓÐЩÔËËãÓÐÎÊÌâ(C´úÂë)

  4×Ö½Úx2×é³É8×Ö½Ú ÕâÀïÓÐÁ½ÖÖ×ö·¨£º

1. ½«8×Ö½Ú±äÁ¿µ±×öÒ»¸öint[2]È»ºó¸÷×Ô¸³Öµ

2. ½«¸ß4×Ö½Ú<<32 È»ºóÔÙ | µÍ4×Ö½Ú

 

ÕâÀ·½·¨2ûÓÐÎÊÌâ¡£¶ø·½·¨Ò»½á¹ûÓÐÎó
ÇëÎʿɷñÓÐʲô·½·¨½â¾öÕâ¸öÎÊÌ⣿

Thanks 

C/C++ code:

//·½·¨1

unsigned int HIGH_INT(unsigned long long d)

{

unsigned long long dcopy = d;

return ((unsigned int*)&dcopy)[1];

}



unsigned long long MAKE_DBLINT(unsigned int high, unsigned int low)

{

unsigned long long build = low;

((unsigned int*)&build)[1] = high;

return build;

}



void printInt(unsigned long long l) {

unsigned int high = HIGH_INT(l),low = (unsigned int)l;

LOGV("high=%X low=%X",high,low);

}

//·½·¨2

unsigned int HIGH_INT2(unsigned long long d)

{

unsigned long long dcopy = d;

return (unsigned int)(dcopy>>32);

}



unsigned long long MAKE_DBLINT2(unsigned int high, unsigned int low)

{

unsigned long long build = low;

unsigned long long build2 = high;

build2 = build2 << 32;

build = build | build2;

return build;

}



void printInt2(unsign


Ïà¹ØÎÊ´ð£º

C/C++/MFCȺ - C/C++ / ·Ç¼¼ÊõÇø

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

Çó½Ìc/c++ÓïÑÔÏà¹ØÎÊÌâ - C/C++ / CÓïÑÔ

ÓÐÒ»10*10¾ØÕ󣬳ýÈ¥µÚÒ»¸öµã£¨0£¬0£©ºÍ×îºóÒ»µã£¨9£¬9£©£¬»¹Óа˸öµãΪ1£¬ÆäËû¶¼Îª0£¬ÒªÇóÓöþάÊý×é±íʾ¡£°Ë¸öµãÊÇËæ»úÉú³ÉµÄ£¬±àдÏà¹Ø³ÌÐò±íʾ¾ØÕóËùÓпÉÄÜÇé¿ö¡£
ÕæÐÄÇó½Ì¸÷λ¸ßÊÖ£¬°¥£¡±¾ÈËÌ«²ËÁË£¡ºÇºÇ£¡
......

cÓïÑÔʵÏÖlinux timeÏà¹Øº¯Êý - C/C++ / CÓïÑÔ

ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ