Do it now!

/*
 ============================================================================
 Name        : Lotto.c
 Author      : chobocho
 Version     :
 Copyleft
 Description : Lotto
 ============================================================================
 */

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void lotto(int num, int max_number);

void lotto(int num, int max_number)
{
    int number[100] = {0, };
    int i = 0;
    int prev = 0;
    int next = 0;
    int temp = 0;

    if (num > max_number || max_number < 0 || max_number >= 100)
    {
        return;
     }

    for (i = 0; i < max_number; i++)
    {
        number[i] = i+1;
     }

    srand((time(NULL)));

    for (i = 0; i < 1000; i++)
    {
        prev = rand() % max_number;
        next = rand() % max_number;

        temp = number[prev];
        number[prev] = number[next];
        number[next] = temp;
    }

    for (i = 0; i < num; i++)
    {
         printf ("%d ", number[i]);
     }
     puts("\n");

}

int main(int argc, char **argv) {
    lotto(6, 46);
    return 0;
}

#include <stdio.h>
#include <io.h>

int main(void) {
  _finddatai64_t file;
  intptr_t files;

  files = _findfirsti64("*.*", &file);
  do {
      printf("%s\n", file.name);
  } while(_findnexti64(files, &file) == 0);
  _findclose(files);

  return 0;
}

#include <iostream>
#include <list>
using namespace std;

class CData {
public:
    CData (int x = 0) { data = x; }
    void set (int x) { data = x; }
    int  get (void)  { return data ; }
    // 방법 1: 비교를 위한 함수를 만든다.
    int operator()( CData &lhv, CData &rhv) const { return (lhv.get() > rhv.get()); }
    // 방법 2: < 연산자를 오버로딩 한다.
    int operator<( CData &rhv) const { return (this->data < rhv.get()); }
 
private:
    int data;       
};

void process(void);
void prinfList( list<CData> myList );

int main (int argc, char **argv)
{

    process();
   
    getchar();
    return 0;   
}

void process (void)
{
     list<CData> myData;

         
     myData.push_front(10);
     myData.push_front(17);
     myData.push_front(11);
     myData.push_front(1);
     myData.push_front(20);

     prinfList( myData );
 
     // STL의 list는 제너릭한 sort를 사용할 수 없다.
     // 멤버함수를 호출하면 < 연산자를 비교 함수로 쓴다.
     myData.sort();         // method 2
     prinfList( myData );
    // 직접 비교 함수를 넣을 수도 있다.
     myData.sort(CData()); // metod 1
     prinfList( myData );
}

void prinfList( list<CData> myList )
{
     list<CData> :: iterator iter;
    
     for (iter = myList.begin(); iter != myList.end(); iter++)
         cout << iter->get() << " ";
     cout << endl;
}

// 흐미... 심심해서 해본게 생각보다 시간을 많이 까먹었다.
// TDD는 정말 중요하다.

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

void process(void);

int main(void)
{
    process();  
    return 0;
}

void process(void)
{
     string alpha = "0123456789";
     int synap = 0;
     int soft = 0;
     int wants = 0;
     int you = 0;
     int result = 0;
     int count = 0;
    
     //'SYNAP + SOFT = WANTS + YOU'
     // 0123456789
     // AFNOPSTUWY
     
     do
     {
           
        if (alpha[5] == '0' || alpha[8] == '0' || alpha[9] == '0')
            continue;
       
        synap = (alpha[5]-'0')*10000 + (alpha[9]-'0')*1000 + (alpha[2]-'0')*100 + (alpha[0]-'0')*10 + (alpha[4]-'0');            
        soft = (alpha[5]-'0')*1000 + (alpha[3]-'0')*100 + (alpha[1]-'0')*10 + (alpha[6]-'0');
        wants = (alpha[8]-'0')*10000 + (alpha[0]-'0')*1000 + (alpha[2]-'0')*100 + (alpha[6]-'0')*10 + (alpha[5]-'0');            
        you = (alpha[9]-'0')*100 + (alpha[3]-'0')*10 + (alpha[7]-'0');
       
        if (synap + soft == wants + you)           
        {
            cout << synap << " + " << soft << " = " << wants << " + " << you << endl;     
            result += wants + you;
            cout << result << endl;
        }
       
     } while (next_permutation(alpha.begin(), alpha.end())  );
    
}