- 새싹교실/2012/세싹 . . . . 146 matches
printf("Offset to fixup array : 0x%02x%02x\n", *((unsigned char*)MFT+5),*((unsigned char*)MFT+4));
, *((unsigned char*)MFT+47),*((unsigned char*)MFT+46),*((unsigned char*)MFT+45),*((unsigned char*)MFT+44));
, *((unsigned char*)MFT+21),*((unsigned char*)MFT+20));
i=((int)(*((unsigned char*)MFT+21))<<8)+*((unsigned char*)MFT+20);//Offset으로 포인터 이동
printf("First Attribute : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("First Attribute Size : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
((int)(*((unsigned char*)MFT+i+3))<<24)+
((int)(*((unsigned char*)MFT+i+2))<<16)+
((int)(*((unsigned char*)MFT+i+1))<<8)+
*((unsigned char*)MFT+i)
printf("Second Attribute : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("Second Attribute Size : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
((int)(*((unsigned char*)MFT+i+3))<<24)+
((int)(*((unsigned char*)MFT+i+2))<<16)+
((int)(*((unsigned char*)MFT+i+1))<<8)+
*((unsigned char*)MFT+i)
printf("Third Attribute : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("Third Attribute Size : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("Offset to fixup array : 0x%02x%02x\n", *((unsigned char*)MFT+5),*((unsigned char*)MFT+4));
, *((unsigned char*)MFT+47),*((unsigned char*)MFT+46),*((unsigned char*)MFT+45),*((unsigned char*)MFT+44));
- 김희성/MTFREADER . . . . 86 matches
long ReadAttribute(FILE* fp, unsigned char* offset, long flag);
__int64 ReadCluster(unsigned char* point,unsigned char* info);
unsigned __int64 point,i,j,k,temp;
unsigned __int64 HeaderSize;
unsigned __int64 offset;
for(j=1;j<=*((unsigned short*)((unsigned char*)$MFT+6));j++)
*((char*)$MFT+*((unsigned short*)((unsigned char*)$MFT+4)))
*((char*)$MFT+*((unsigned short*)((unsigned char*)$MFT+4))+1)
*((char*)$MFT+*((unsigned short*)((unsigned char*)$MFT+4))+2*j);
*((char*)$MFT+*((unsigned short*)((unsigned char*)$MFT+4))+2*j+1);
point=*((unsigned short*)((unsigned char*)$MFT+20));//Offset으로 포인터 이동
while(*((unsigned long*)((unsigned char*)$MFT+point))!=0xFFFFFFFF)
*((unsigned char*)MFT+point+9) = Attribute Name Size
if(*((unsigned char*)$MFT+point+8))
HeaderSize=64+*((unsigned char*)$MFT+point+9);
HeaderSize=24+*((unsigned char*)$MFT+point+9);
switch(*((unsigned long*)((unsigned char*)$MFT+point)))
MFT=PFILE_RECORD_HEADER(new U8[*((unsigned __int64*)((unsigned char*)$MFT+point+40))]);
i=*(short*)((unsigned char*)$MFT+point+32);
MFTLength=ReadCluster((unsigned char*)$MFT+point+i,(unsigned char*)MFT);
- 신기호/중대생rpg(ver1.0) . . . . 30 matches
unsigned int xp;
unsigned int next_xp;
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
unsigned long xp;
unsigned long next_xp;
void setInfo(char *_name,int _base_hp,int _hp,int _max_hp,unsigned int _xp,unsigned int _next_xp,int _base_att,int _base_def,int _townNum,int _level,int _money);
unsigned long getxp();
unsigned long getnext_xp();
void addxp(unsigned int _xp);
void entity::setInfo(char *_name,int _base_hp,int _hp,int _max_hp,unsigned int _xp,unsigned int _next_xp,int _base_att,int _base_def,int _townNum,int _level,int _money){
unsigned long entity::getxp(){
unsigned long entity::getnext_xp(){
void entity::addxp(unsigned int _xp){
unsigned int xp,nextxp;
- SmithNumbers/조현태 . . . . 26 matches
unsigned int Sum_jari(unsigned int);
unsigned int Creat_base_and_process(unsigned int number);
unsigned int Get_right(unsigned int, unsigned int*);
unsigned int minimum_number;
unsigned int Get_right(unsigned int number, unsigned int* log_number)
unsigned int sum=0;
unsigned int Sum_jari(unsigned int number)
unsigned int sum=0;
unsigned int Creat_base_and_process(unsigned int number)
unsigned int *log_number=(unsigned int*)malloc((MAX_NUMBER+2)*sizeof(unsigned int));
unsigned int gab;
unsigned int sum=0;
for (register unsigned int i=4; i<=MAX_NUMBER;i+=2)
for (register unsigned int i=3; i<=MAX_NUMBER; ++i)
for(register unsigned int j=i+gab; j<=MAX_NUMBER; j+=gab)
unsigned int left=Sum_jari(number),right=Get_right(number,log_number);
- PowerOfCryptography/조현태 . . . . 22 matches
unsigned __int64 such_target_number(unsigned __int64 mokpyo, unsigned __int64 gaesu)
unsigned __int64 min_answer=1, max_answer=mokpyo+1;
unsigned __int64 temp_target=(min_answer+max_answer)/2;
unsigned __int64 temp_result=1;
for (register unsigned __int64 i=0; i<gaesu; ++i)
unsigned __int64 intput_number=0;
unsigned __int64 gob_gaesu=0;
unsigned __int64 answer=such_target_number(intput_number,gob_gaesu);
const unsigned __int64 MAX_LONG=1000000000000000000;
unsigned __int64 number;
prv->plus_number_unsigned(number/MAX_LONG);
unsigned __int64 call_number(int where_number)
void plus_number_unsigned(unsigned __int64 plus_input_number)
plus_number_unsigned( plus_input_number);
unsigned __int64 get_number;
this->plus_number_unsigned(get_number);
int compare_number(unsigned __int64 target_number)
unsigned __int64 this_number=0;
unsigned __int64 taget_get_number=0;
- ReverseAndAdd/허아영 . . . . 17 matches
unsigned int numLength(unsigned int num)
unsigned int turn = 0;
bool isPalindrome(unsigned int *num, unsigned int length)
unsigned int i;
unsigned int ReverseAndAdd(unsigned int *num, unsigned int length)
unsigned int i, reverseNum = 0, Num = 0;
unsigned int *temp = new unsigned int [length];
unsigned int main()
unsigned int addNum, length, i, turn = 0, testCaseNum;
unsigned int num;
unsigned int * store_numbers;
store_numbers = new unsigned int[numLength(num)];
- FactorialFactors/조현태 . . . . 15 matches
unsigned int factorial_factors(unsigned int);
unsigned int factorial_factors(unsigned int answer)
unsigned int *log_answer = (unsigned int*)malloc((answer+2)*sizeof(unsigned int));
unsigned int sum = 1;
unsigned int gab;
unsigned int suchEnd = (unsigned int)sqrt((double)answer);
for (register unsigned int i=4; i<=answer;i+=2)
for (register unsigned int i=3; i<=suchEnd; ++i)
for(register unsigned int j = i * i; j <= answer; j+= gab)
for (register unsigned int i = suchEnd + 1; i <= answer; ++i)
- Memo . . . . 14 matches
unsigned char VerIHL; //Version and IP Header Length
unsigned char Tos;
unsigned short Total_len;
unsigned short ID;
unsigned short Flags_and_Frags; //Flags 3 bits and Fragment offset 13 bits
unsigned char TTL;
unsigned char Protocol;
unsigned short Checksum;
unsigned long SrcIP;
unsigned long DstIP;
//unsigned long Options_and_Padding;
unsigned short SrcPort;
unsigned short DstPort;
unsigned short iphdrlen;
- ReverseAndAdd/문보창 . . . . 11 matches
int makePalim(unsigned int * pal, unsigned int originN, int count);
void showPalim(const unsigned int * pal, const int * nadd, const int n);
unsigned int num; // test
unsigned int * palim = new unsigned int[n]; // palindrome
int makePalim(unsigned int * pal, unsigned int originN, int count)
unsigned int reverseN; // reverse한 수
unsigned int temp, t;
void showPalim(const unsigned int * pal, const int * nadd, const int n)
- Marbles/신재동 . . . . 9 matches
unsigned int testCase = 0;
unsigned int marbles[MAX_NUMBER] = {0,};
unsigned int c1[MAX_NUMBER] = {0,};
unsigned int n1[MAX_NUMBER] = {0,};
unsigned int c2[MAX_NUMBER] = {0,};
unsigned int n2[MAX_NUMBER] = {0,};
unsigned int m1[MAX_NUMBER] = {MAX_NUMBER,};
unsigned int m2[MAX_NUMBER] = {MAX_NUMBER,};
for(unsigned int i = 0; i < testCase; i++)
- PascalTriangle . . . . 9 matches
unsigned long int P(int row, int col) {
typedef unsigned long ulong;
unsigned long PascalTriangle1(int n, int m)
unsigned long *row[2]; // 2개의 배열의 포인터
row[0]=new unsigned long[40]; // 최대 40열까지 저장할 수 있도록 메모리 할당
row[1]=new unsigned long[40];
unsigned long temp=row[current][m-1];
unsigned long PascalTriangle2(int n, int m)
unsigned long x=1,y=1, p;
- CarmichaelNumbers/문보창 . . . . 8 matches
int findModulo(unsigned int a, unsigned int n);
int findModulo(unsigned int a, unsigned int n)
unsigned int modN = n;
unsigned int expo = 2;
unsigned int mod = (a * a) % n;
unsigned int modulo = 1;
- 피보나치/조현태 . . . . 8 matches
void prin(unsigned int num, unsigned int prv_answer )
void fibonacci2( unsigned int prv_answer,unsigned int sub_answer, unsigned int number, int call)
unsigned int num=1;
unsigned int temp=sub_answer;
unsigned int number;
- HowManyZerosAndDigits/허아영 . . . . 7 matches
unsigned int factorial(const unsigned int &num)
unsigned int n = 1, factorialN = 1;
unsigned int main()
unsigned int N, B;
unsigned int factorialN = 0;
unsigned int zeroCount = 0, numCount = 0;
- Steps/김상섭 . . . . 7 matches
unsigned int max[93000];
unsigned int count;
unsigned int found(unsigned int i)
unsigned int temp = 0;
unsigned int i, length1, length2, testnum, temp = 1;
vector<unsigned int> totallength;
- ReverseAndAdd/곽세환 . . . . 6 matches
int형을 unsigned로 바꾼후 통과
unsigned reverse(unsigned p)
unsigned t = 0;
unsigned int p; // 입력받은 숫자
unsigned int re; // 뒤집은 숫자
- 새싹교실/2011/데미안반 . . . . 6 matches
srand((unsigned)time(NULL));
printf("%u\n",(unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
- ComputerNetworkClass/Report2006/PacketAnalyzer . . . . 5 matches
unsigned int optval;
char, unsigned char, signed char 1 byte
short, unsigned short 2 bytes
int, unsigned int 4 bytes
long, unsigned long 4 bytes
Unsigned short interger 변환 (2바이트 체계)
Unsigned long interger 변환 (4바이트 체계)
- EffectiveC++ . . . . 5 matches
static unsigned int numberOfTargets()
static unsigned int numTargets; // 객체 카운터
unsigned int EnemyTarget::numTargets;
static unsigned int numTanks; // object counter for tanks
unsigned int EnenyTank::numTanks;
- IsBiggerSmarter?/문보창 . . . . 5 matches
int lcs_length(unsigned char t[][MAX_ELEPHANT]);
void print_lcs(int i, int j, unsigned char t[][MAX_ELEPHANT]);
unsigned char table[MAX_ELEPHANT][MAX_ELEPHANT];
int lcs_length(unsigned char t[][MAX_ELEPHANT])
void print_lcs(int i, int j, unsigned char t[][MAX_ELEPHANT])
- OurMajorLangIsCAndCPlusPlus/stdlib.h . . . . 5 matches
|| typedef size_t || sizeof 키워드의 unsigned 정수형 결과 ||
|| unsigned long int strtoul(const char *str, char **endptr, int base); || 문자열을 정수(unsigned long)로 변환 ||
|| void srand(unsigned int seed); || rand()에 의해 사용되는 난수 생성기에 인자 공급 ||
unsigned long ul;
- UnixSocketProgrammingAndWindowsImplementation . . . . 5 matches
unsigned short integer 변환 (2바이트 크기)
unsigned long integer 변환 (4바이트 크기)
unsigned long s_addr;
ssize_t send(int fildes, const void * buf, size_t nbytes, unsigned int flags);
ssize_t recv(int fildes, void *buf, size_t nbytes, unsigned int flags);
- whiteblue/파일읽어오기 . . . . 5 matches
unsigned int nSchoolNumber; // User's school number
UserInfo( string szN, unsigned int nSN )
unsigned int getSchoolNumber() { return nSchoolNumber; }
unsigned int nTNN;
unsigned int nTempNum = 0;
- 나를만든책장관리시스템/DBSchema . . . . 5 matches
|| bID || unsigned int || ID, PK ||
|| cID || unsigned int || ID, PK ||
|| cBook || unsigned int || FK references bm_tblBook(bID) on delete no action on update cascade ||
|| rID || unsigned int || ID, PK ||
|| rBook || unsigned int || FK refereneces bm_tblBook(bID) on delete no action on update cascade ||
- 헝가리안표기법 . . . . 5 matches
|| u || unsigned || unsigned type(4byte) || unsigned uPercent ||
|| w || WORD || unsigned word(2byte) || WORD wCnt ||
|| dw || DWORD || unsigned double word(4byte) || DWORD dwLength ||
- CToAssembly . . . . 4 matches
unsigned position;
volatile unsigned result;
unsigned position;
volatile unsigned result;
- CeeThreadProgramming . . . . 4 matches
unsigned Counter;
unsigned __stdcall ThreadedFunction( void* pArguments )
unsigned threadID = 1;
unsigned threadID2 = 2;
- DebuggingSeminar_2005/AutoExp.dat . . . . 4 matches
; u Unsigned decimal integer 0x0065,u 101
; o Unsigned octal integer 0xF065,o 0170145
std::basic_string<unsigned short,std::char_traits<unsigned short>,std::allocator<unsigned short> >=$BUILTIN(WSTDSTRING)
; You need to list the error code in unsigned decimal, followed by the message.
- DevelopmentinWindows . . . . 4 matches
||BYTE||unsigned char||
||DWORD||unsigned long||
||UINT||unsigned int||
||WORD||unsigned short||
- MineFinder . . . . 4 matches
18225.064 8.2 61776.601 27.6 9126043 CMinerBitmapAnalyzer::CompareBitmapPixel(class CDC *,class CDC *,int,int,unsigned long) (minerbitmapanalyzer.obj)
17577.168 7.9 17577.168 7.9 9126043 CDC::SetPixel(int,int,unsigned long) (mfc42d.dll)
294.378 0.1 295.578 0.1 2619 CWnd::DefWindowProcA(unsigned int,unsigned int,long) (mfc42d.dll)
- RandomWalk/영동 . . . . 4 matches
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
- ScheduledWalk/석천 . . . . 4 matches
typedef unsigned int UINT;
typedef unsigned int UINT;
typedef unsigned int UINT;
typedef unsigned int UINT;
- AcceleratedC++/Chapter3 . . . . 3 matches
// 컴파일시 에러가 나서 같은 의미인 unsigned int형을 써서 vec_sz을 표현했습니다.
typedef unsigned int vec_sz;
* size_type은 unsigned int 이다.
- CompleteTreeLabeling/조현태 . . . . 3 matches
unsigned _int64 answer_number;
unsigned _int64 result_number=1;
unsigned _int64 new_result=0;
- CppStudy_2002_2/STL과제/성적처리 . . . . 3 matches
for(unsigned int i = 0 ; i < _Scores.size() ; ++i)
for(unsigned int i = 0 ; i < _StudentList.size() ; ++i)
for(unsigned int i = 0 ; i < _StudentList.size() ; ++i)
- EightQueenProblem/이준욱 . . . . 3 matches
unsigned char rmap[8], map[8] = {0,0,0,0,0,0,0,0};
int mask(unsigned char * tmap , register int x, register int y)
unsigned char tmap[8];
- MoreEffectiveC++/Miscellany . . . . 3 matches
extern "C" void twiddleBit(unsigned char bits);
void twiddleBits(unsigned char bits);
void twiddleBits(unsigned char bits);
- OpenGL스터디 . . . . 3 matches
|| GLubyte, GLboolean || 부호없는 8비트 정수 || unsigned char || ub ||
|| GLushort || 부호없는 16비트 정수 || unsigned short || us ||
|| GLuint, GLenum, GLbitfield || 부호없는 32비트 정수 || unsigned long || ui ||
- RandomWalk/임민수 . . . . 3 matches
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
- RandomWalk/임인택 . . . . 3 matches
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
moveRoachRecursively((unsigned)(rand())%NUMOFDIRECTIONS);
- 금고/김상섭 . . . . 3 matches
unsigned int table[501][501];
unsigned int temp_table[2][501];
unsigned int full[10];
- 0PlayerProject/프레임버퍼사용법 . . . . 2 matches
unsigned short *data;
data = (unsigned short*)mmap(0, 320 * 240 * 2, PROT_READ | PROT_WRITE, MAP_SHARED, fb0, 0);
- EightQueenProblem/허아영 . . . . 2 matches
unsigned int queenNum = 0;
unsigned int tryX = 0, tryY = 0;
- MFC/HBitmapToBMP . . . . 2 matches
unsigned int size, palsize;
HDC hdc, unsigned int *size)
- NumberBaseballGame/영록 . . . . 2 matches
unsigned int number1,number2,number3;
unsigned int a,b,c;
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 2 matches
|| void * memccpy(void * dest, const void * scr, int c, unsigned int count) || Copies characters from a buffer. ||
|| int memicmp(const void * buf1, const void * buf2, unsigned int count) || Compares characters in two buffers (case-insensitive). ||
- STL/VectorCapacityAndReserve . . . . 2 matches
unsigned long id;
U(unsigned long x):id(x){}
- ThePriestMathematician/김상섭 . . . . 2 matches
unsigned int hanoi[10001] = {0,1,};
unsigned min, temp;
- UglyNumbers/곽세환 . . . . 2 matches
list<unsigned int> numbers;
unsigned int temp;
- VMWare/OSImplementationTest . . . . 2 matches
unsigned
char* vidmem = (unsigned char*)0xB8000;
- html5/web-storage . . . . 2 matches
readonly attribute unsigned long length;
getter DOMString key(in unsigned long index);
- 경시대회준비반/BigInteger . . . . 2 matches
typedef unsigned int SizeT;
typedef unsigned int DATATYPE;
int UnsignedCompareTo(BigInteger const&)const;
int BigInteger::UnsignedCompareTo(BigInteger const& with)const
int cmp = UnsignedCompareTo(with);
if(N1.UnsignedCompareTo(N2)<0)
int cmp = N1.UnsignedCompareTo(N2);
if(N1.UnsignedCompareTo(N2)<0)
int cmp = U.UnsignedCompareTo(V);
if(UnsignedCompareTo(ONE)==0) return ONE;
- 데블스캠프2006/월요일/함수/문제풀이/김준석 . . . . 2 matches
srand((unsigned)time(0));
srand((unsigned)time(NULL));
- 데블스캠프2006/월요일/함수/문제풀이/윤영준 . . . . 2 matches
srand((unsigned)time(NULL));
srand(unsigned(time(NULL)));
- 데블스캠프2006/월요일/함수/문제풀이/이장길 . . . . 2 matches
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
- 데블스캠프2006/화요일/tar/나휘동 . . . . 2 matches
for ( unsigned int i= 0 ; i < file.size ; i++ )
for( unsigned int i= 0 ; i < file.size ; i++ )
- 새싹교실/2012/개차반 . . . . 2 matches
* unsigned - MSB를 통해서 2배의 수를 더 많이 나타낼 수 있다는 개념 설명
* unsigned ~ : 양수 부분만 표현함으로써 더 큰 범위의 수를 나타낼 수 있지만 음수를 표현할 수 없다
- 정수민 . . . . 2 matches
srand((unsigned)time(NULL));
srand((unsigned)time(NULL));
- 조금더빠른형변환사용 . . . . 2 matches
static unsigned int get_clock()
unsigned int t;
- 3N 1/김상섭 . . . . 1 match
unsigned long num;
- 3N+1/김상섭 . . . . 1 match
unsigned long num;
- 3n+1Problem/김태진 . . . . 1 match
unsigned int a=0;
- ACE/CallbackExample . . . . 1 match
unsigned long msg_severity = log_record.type();
- AcceleratedC++/Chapter10 . . . . 1 match
배열은 클래스 타입이 아니기 때문에 배열의 크기를 나타내는 size_type과 같은 요소는 없습니다. 대신에 C Standard Definition 이하 '''<cstddef>''' 에 '''size_t'''로 지정된 unsigned 타입으로 배열의 크기를 사용해야합니다.
- Basic알고리즘/팰린드롬/조현태 . . . . 1 match
for (register unsigned int i = 0; i < strSize / 2; ++i)
- CPPStudy_2005_1/STL성적처리_3 . . . . 1 match
unsigned int total;
- CPPStudy_2005_1/STL성적처리_3_class . . . . 1 match
unsigned int total;
- CarmichaelNumbers/조현태 . . . . 1 match
unsigned int a=1;
- Chapter I - Sample Code . . . . 1 match
typedef unsigned char INT8U
- Counting/김상섭 . . . . 1 match
unsigned int n[1001] = {1,2,5,};
- DirectDraw/Example . . . . 1 match
// FUNCTION: WndProc(HWND, unsigned, WORD, LONG)
- EightQueenProblem/정수민 . . . . 1 match
srand((unsigned)time(NULL));
- FromDuskTillDawn/조현태 . . . . 1 match
for (register unsigned int i = 0; i < g_myTowns.size(); ++i)
- KnightTour/재니 . . . . 1 match
unsigned int m_Move;
- LightMoreLight/문보창 . . . . 1 match
unsigned int n;
- MedusaCppStudy . . . . 1 match
srand((unsigned)time(NULL));
- MedusaCppStudy/석우 . . . . 1 match
srand((unsigned)time(NULL));
- MedusaCppStudy/재동 . . . . 1 match
srand((unsigned)time(NULL));
- NumberBaseballGame/동기 . . . . 1 match
srand((unsigned)time(NULL));
- NumberBaseballGame/영동 . . . . 1 match
srand((unsigned)time(NULL));
- NumericalExpressionOnComputer . . . . 1 match
=== unsigned number ===
- OurMajorLangIsCAndCPlusPlus/XML/조현태 . . . . 1 match
typedef unsigned int bool;
- RandomWalk/김아영 . . . . 1 match
srand((unsigned)time(NULL));
- RandomWalk/대근 . . . . 1 match
srand ( (unsigned int) time (NULL) );
- RandomWalk/동기 . . . . 1 match
srand((unsigned)time(NULL));
- RandomWalk/종찬 . . . . 1 match
srand((unsigned)time(NULL));
- WindowsConsoleControl . . . . 1 match
#define randomize() srand((unsigned)time(NULL))
- Yggdrasil/가속된씨플플/2장 . . . . 1 match
std::string::size_type//unsigned형의 멤버변수로, 담을 수 있는 최대 문자 갯수를 저장한다. 글자수에 알맞는 type으로 알아서 정의하는 듯.
- randomwalk/홍선 . . . . 1 match
srand((unsigned)time(NULL)); // 시간을 이용해 랜덤을 설정
- ricoder . . . . 1 match
unsigned int Arsize;
- whiteblue/LinkedListAddressMemo . . . . 1 match
unsigned int count=0;
- zennith/dummyfile . . . . 1 match
unsigned long request, extractMask;
- zennith/source . . . . 1 match
unsigned long int fac = 1;
- 간단한C언어문제 . . . . 1 match
옳지않다. ss[]의 "문자"란 단어는 isdigit로 확인 할 수 없다. (확장코드이므로.) 이것을 isdigit로 확인 하려면 unsigned char형으로 선언 하면 된다. 기본 char형은 signed형이다. - [이영호]
- 김재현 . . . . 1 match
unsigned char j,k,n, used[MAX];
- 데블스캠프2006/월요일/함수/문제풀이/김대순 . . . . 1 match
srand((unsigned)time(NULL));
- 데블스캠프2006/월요일/함수/문제풀이/윤성준 . . . . 1 match
srand((unsigned)time(NULL));
- 데블스캠프2006/월요일/함수/문제풀이/정승희 . . . . 1 match
srand((unsigned)time(0));
- 데블스캠프2006/월요일/함수/문제풀이/주소영 . . . . 1 match
srand((unsigned)time(NULL));
- 데블스캠프2009/월요일/연습문제/svn코드레이스/박준호 . . . . 1 match
srand((unsigned)time(NULL));
- 데블스캠프2009/월요일/연습문제/svn코드레이스/서민관 . . . . 1 match
srand((unsigned)time(NULL));
- 데블스캠프2010/다섯째날/ObjectCraft/미션2/강소현 . . . . 1 match
srand((unsigned)time(NULL));
- 데블스캠프2010/일반리스트 . . . . 1 match
unsigned int i=0;
- 미로찾기/최경현김상섭 . . . . 1 match
srand((unsigned)(time(NULL)));
- 새싹교실/2012/AClass/2회차 . . . . 1 match
Void srand(unsigned int SEED);
- 새싹교실/2012/AClass/4회차 . . . . 1 match
예) typedef unsigned char uchar;
- 새싹교실/2012/아우토반/앞반/4.12 . . . . 1 match
srand((unsigned)time(NULL));
- 새싹교실/2012/주먹밥 . . . . 1 match
unsigned int y;
- 숫자를한글로바꾸기/김태훈zyint . . . . 1 match
unsigned int i=0;
- 시간맞추기/남도연 . . . . 1 match
└time(0), time(NULL)뭐 둘다 그말이 그말이지만.. 1970년 1월 1일부터 지나간 초를 알려줍니다. 물런 숫자가 무지무지무지무지 크므로 리턴값은 unsigned long 형 과 유사하며, 단순히 1초가 지날때마다 1씩 증가합니다. 그래서 이럴때 써먹습니다. - [조현태]
- 알고리즘5주숙제/김상섭 . . . . 1 match
unsigned int max = 1000000;
- 정렬/문원명 . . . . 1 match
unsigned long i=0,m=0,n,k=0;
Found 112 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
