1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20

TSearchRec sr;
if(FindFirst(Dir+"\\"+mask,iattr,sr)==0)
{
 do
 {
  AnsiString Processes=Dir+"\\"+sr.Name;
  //куча кода
  AnsiString newName=sr.Name;
  //еще код
  AnsiString TmpFile=Dir+"\\"+newName;
  if(RenameFile(Processes,TmpFile))
  {
   ...
  }
  {
   ...
   continue;
  }
 }while(FindNext(sr)==0);
}

1. 1
2. 2
3. 3

...
HWND handle=FindWindow(NULL,AnsiString("DPPCommModule").c_str());
...

1. 1

struct X{template<class T>X(T);X g(){X(this->*&X::g);}};

1. 1

(unsigned int*)(&pInput->pIrStatus->PunctScheme[0])

1. 1
2. 2
3. 3
4. 4
5. 5
6. 6

void CsrSmException (void)
{
  while(1){
    Sleep(0);
  };
}

1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7

int SUM(int A, int B)
{
	if (0 == A) return B;
	if (0 == B) return A;

	return (1 + (SUM(A, B - 1) + SUM(A - 1, B)) / 2);
}

1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40

#include <iostream>
#include <math.h>

using namespace std;

int main()
{
char end;
char *stroka[end];
int number[10] = {0,1,2,3,4,5,6,7,8,9};
int size = 0; 


cout << "Input element of array: \n";

while(end != '*')
{ 
cin >> end;
*stroka[size] = end;
size++; 
}

for(int i = 0; i < size-1; i++)
{
cout << stroka[i] << " "; 
}

for(int i = 0; i < size-1; i++)
{
for(int j = 0; j < 10; j++) 
{
if(*stroka[i] == number[j])
{
cout << *stroka[i] << " "; 
} 
} 
} 

system("PAUSE"); 
}

1. 1

#define JUST_ANOTHER_MAGIC_NUMBER 4398476903476060

1. 1
2. 2
3. 3

#pragma warning( disable : 4005 )
#define TRUE free(reinterpret_cast<VOID*>(-1))
#pragma warning( default : 4005 )

1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11

unsigned arrtoint(u_char *arr)
{
    unsigned r=0;
    unsigned s=0xFF;
    for(unsigned int i=0; i<4; i++)
    {
        r+=arr[i]*s;
        s*=0xFF;
    }
    return r;
}