https://blog.youkuaiyun.com/anningztezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/anningzte/article/details/71480779https://blog.youkuaiyun.com/anningzte/article/details/71480779anningzteTue, 09 May 2017 17:18:13 +0800https://blog.youkuaiyun.com/anningzte/article/details/52129381https://blog.youkuaiyun.com/anningzte/article/details/52129381anningzteFri, 05 Aug 2016 15:10:37 +0800https://blog.youkuaiyun.com/anningzte/article/details/52129212https://blog.youkuaiyun.com/anningzte/article/details/52129212anningzteFri, 05 Aug 2016 14:56:37 +0800https://blog.youkuaiyun.com/anningzte/article/details/52128797https://blog.youkuaiyun.com/anningzte/article/details/52128797anningzteFri, 05 Aug 2016 14:33:57 +0800https://blog.youkuaiyun.com/anningzte/article/details/52126456https://blog.youkuaiyun.com/anningzte/article/details/52126456anningzteFri, 05 Aug 2016 10:24:13 +0800https://blog.youkuaiyun.com/anningzte/article/details/52125665https://blog.youkuaiyun.com/anningzte/article/details/52125665anningzteFri, 05 Aug 2016 08:57:37 +0800https://blog.youkuaiyun.com/anningzte/article/details/45622241https://blog.youkuaiyun.com/anningzte/article/details/45622241anningzteSun, 10 May 2015 17:02:40 +0800 先打开文件A，这时会出现第一个excel文件的窗口；]]>https://blog.youkuaiyun.com/anningzte/article/details/44313775https://blog.youkuaiyun.com/anningzte/article/details/44313775anningzteMon, 16 Mar 2015 21:32:35 +0800https://blog.youkuaiyun.com/anningzte/article/details/6291866https://blog.youkuaiyun.com/anningzte/article/details/6291866anningzteThu, 31 Mar 2011 15:46:00 +0800#define __MSDOS__

#if 1
/*
 * Program for testing winnability of opening positions in Free Cell.
 * Can also generate random positions, optionally filtered for winnability.
 * Does not actually support interactive playi]]>https://blog.youkuaiyun.com/anningzte/article/details/6278206https://blog.youkuaiyun.com/anningzte/article/details/6278206anningzteFri, 25 Mar 2011 16:29:00 +0800    printf("/t/t/t/t选局/n/t/t/t  从 1 到 1000000： ");
    cin>>g_gamenumber;
    Shuffle(g_gamenumber);
    string sR = ToString();
    printf("%s/n", sR.c_str());
{
        char fileOut[128];
        sprintf(fileOut,]]>https://blog.youkuaiyun.com/anningzte/article/details/6234260https://blog.youkuaiyun.com/anningzte/article/details/6234260anningzteWed, 09 Mar 2011 15:10:00 +0800#include "stdafx.h"
#include "Test.h"
#include "TestDlg.h"
#include
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/*===========================]]>https://blog.youkuaiyun.com/anningzte/article/details/6179244https://blog.youkuaiyun.com/anningzte/article/details/6179244anningzteFri, 11 Feb 2011 16:08:00 +0800https://blog.youkuaiyun.com/anningzte/article/details/6168149https://blog.youkuaiyun.com/anningzte/article/details/6168149anningzteFri, 28 Jan 2011 17:05:00 +0800// testDlg.h  URLDownloadToFile
// download by http://www.codefans.net/soft/5667.shtml
#if !defined    AFX_TESTDLG_H__
#define         AFX_TESTDLG_H__
#pragma once
#pragma warning (disable : 4786)
#include
]]>https://blog.youkuaiyun.com/anningzte/article/details/6118465https://blog.youkuaiyun.com/anningzte/article/details/6118465anningzteWed, 05 Jan 2011 17:21:00 +0800// cala24.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"

#if 10

// 1。根据算法1计算24点的代码
#pragma warning( disable : 4786 )
#include
#include
#incl]]>https://blog.youkuaiyun.com/anningzte/article/details/6096758https://blog.youkuaiyun.com/anningzte/article/details/6096758anningzteFri, 24 Dec 2010 17:26:00 +0800https://blog.youkuaiyun.com/anningzte/article/details/6068129https://blog.youkuaiyun.com/anningzte/article/details/6068129anningzteFri, 10 Dec 2010 16:45:00 +0800https://blog.youkuaiyun.com/anningzte/article/details/6063561https://blog.youkuaiyun.com/anningzte/article/details/6063561anningzteWed, 08 Dec 2010 17:25:00 +0800struct sdLink
{
    BYTE    a;  // a 点
    BYTE    b;  // b 点
    BYTE    x;  // a点的候选数x
    BYTE    y;  // b点的候选数y
    bool operator == (const sdLink & oth) const
    {
        return (a==oth.a && b==oth.b && ]]>https://blog.youkuaiyun.com/anningzte/article/details/6051727https://blog.youkuaiyun.com/anningzte/article/details/6051727anningzteFri, 03 Dec 2010 08:25:00 +0800
#include "stdafx.h"
#include "string.h"
#include "math.h"
#include "string"
#include "time.h"
#include "math.h"
#include
using namespace std;
// Calendar.cpp : Defines the entry point for the ]]>https://blog.youkuaiyun.com/anningzte/article/details/6015373https://blog.youkuaiyun.com/anningzte/article/details/6015373anningzteWed, 17 Nov 2010 17:29:00 +0800// [11/17/2010 anning]
// WXYZ-Wing
bool Sudoku::WXYZ_Wing(int n)
{
    struct sdWXYZ
    {
        _Point  p;
        int     candi;
    };
    // W -
    // X -
    // Y -
    // Z- X, Y,]]>https://blog.youkuaiyun.com/anningzte/article/details/6010711https://blog.youkuaiyun.com/anningzte/article/details/6010711anningzteMon, 15 Nov 2010 17:27:00 +0800//         A   C/D D/C   B
// W-Wing  ab---b===b----ab 删除ab两个数格共同看到的a候选数 属于Forcing Chain的
// 特例，也是应用强弱强的属性。
// 思路：
// 将所有的数对找出,过滤出不在同一个规则(row/col/box)中的数对(位置A,B,数字X,Y);
// 将所有的 X强链（单候选数）找出，定位关键字为候选数的值
// 如果A，B能够共同看到带X或者Y]]>