#include <iostream>
#include <graphics.h>
#include <stdio.h>
#include <conio.h>
#include <Windows.h>
#include <stdlib.h>
#include <time.h>
int o[9] = { 0,1,2,3,4,5,6,7,8 };
class Puzzle
{
public:
Puzzle(int o[9])
{
for (int i = 0; i++; i <= 8)
{
order[i] = o[i];
}
getimage(pic1, "..\\滑块拼图\\res\\1.jpg");
getimage(pic2, "..\\滑块拼图\\res\\2.jpg");
getimage(pic3, "..\\滑块拼图\\res\\3.jpg");
getimage(pic4, "..\\滑块拼图\\res\\4.jpg");
getimage(pic5, "..\\滑块拼图\\res\\5.jpg");
getimage(pic6, "..\\滑块拼图\\res\\6.jpg");
getimage(pic7, "..\\滑块拼图\\res\\7.jpg");
getimage(pic8, "..\\滑块拼图\\res\\8.jpg");
getimage(pic9, "..\\滑块拼图\\res\\9.jpg");
}
void print(int o[9])
{
for (int i = 0; i++; i <= 8)
{
order[i] = o[i];
}
{
if (o[0] == 0){putimage(0,0,pic1);}
else if (o[0] == 1) { putimage(0, 0, pic2); }
else if (o[0] == 2) { putimage(0, 0, pic3); }
else if (o[0] == 3) { putimage(0, 0, pic4); }
else if (o[0] == 4) { putimage(0, 0, pic5); }
else if (o[0] == 5) { putimage(0, 0, pic6); }
else if (o[0] == 6) { putimage(0, 0, pic7); }
else if (o[0] == 7) { putimage(0, 0, pic8); }
}
{
if (o[1] == 0) { putimage(210, 0, pic1); }
else if (o[1] == 1) { putimage(210, 0, pic2); }
else if (o[1] == 2) { putimage(210, 0, pic3); }
else if (o[1] == 3) { putimage(210, 0, pic4); }
else if (o[1] == 4) { putimage(210, 0, pic5); }
else if (o[1] == 5) { putimage(210, 0, pic6); }
else if (o[1] == 6) { putimage(210, 0, pic7); }
else if (o[1] == 7) { putimage(210, 0, pic8); }
}
{
if (o[2] == 0) { putimage(420, 0, pic1); }
else if (o[2] == 1) { putimage(420, 0, pic2); }
else if (o[2] == 2) { putimage(420, 0, pic3); }
else if (o[2] == 3) { putimage(420, 0, pic4); }
else if (o[2] == 4) { putimage(420, 0, pic5); }
else if (o[2] == 5) { putimage(420, 0, pic6); }
else if (o[2] == 6) { putimage(420, 0, pic7); }
else if (o[2] == 7) { putimage(420, 0, pic8); }
}
{
if (o[3] == 0) { putimage(0, 210, pic1); }
else if (o[3] == 1) { putimage(0, 210, pic2); }
else if (o[3] == 2) { putimage(0, 210, pic3); }
else if (o[3] == 3) { putimage(0, 210, pic4); }
else if (o[3] == 4) { putimage(0, 210, pic5); }
else if (o[3] == 5) { putimage(0, 210, pic6); }
else if (o[3] == 6) { putimage(0, 210, pic7); }
else if (o[3] == 7) { putimage(0, 210, pic8); }
}
{
if (o[4] == 0) { putimage(210, 210, pic1); }
else if (o[4] == 1) { putimage(210, 210, pic2); }
else if (o[4] == 2) { putimage(210, 210, pic3); }
else if (o[4] == 3) { putimage(210, 210, pic4); }
else if (o[4] == 4) { putimage(210, 210, pic5); }
else if (o[4] == 5) { putimage(210, 210, pic6); }
else if (o[4] == 6) { putimage(210, 210, pic7); }
else if (o[4] == 7) { putimage(210, 210, pic8); }
}
{
if (o[5] == 0) { putimage(420, 210, pic1); }
else if (o[5] == 1) { putimage(420, 210, pic2); }
else if (o[5] == 2) { putimage(420, 210, pic3); }
else if (o[5] == 3) { putimage(420, 210, pic4); }
else if (o[5] == 4) { putimage(420, 210, pic5); }
else if (o[5] == 5) { putimage(420, 210, pic6); }
else if (o[5] == 6) { putimage(420, 210, pic7); }
else if (o[5] == 7) { putimage(420, 210, pic8); }
}
{
if (o[6] == 0) { putimage(0, 420, pic1); }
else if (o[6] == 1) { putimage(0, 420, pic2); }
else if (o[6] == 2) { putimage(0, 420, pic3); }
else if (o[6] == 3) { putimage(0, 420, pic4); }
else if (o[6] == 4) { putimage(0, 420, pic5); }
else if (o[6] == 5) { putimage(0, 420, pic6); }
else if (o[6] == 6) { putimage(0, 420, pic7); }
else if (o[6] == 7) { putimage(0, 420, pic8); }
}
{
if (o[7] == 0) { putimage(210, 420, pic1); }
else if (o[7] == 1) { putimage(210, 420, pic2); }
else if (o[7] == 2) { putimage(210, 420, pic3); }
else if (o[7] == 3) { putimage(210, 420, pic4); }
else if (o[7] == 4) { putimage(210, 420, pic5); }
else if (o[7] == 5) { putimage(210, 420, pic6); }
else if (o[7] == 6) { putimage(210, 420, pic7); }
else if (o[7] == 7) { putimage(210, 420, pic8); }
}
{
if (o[8] == 0) { putimage(420, 420, pic1); }
else if (o[8] == 1) { putimage(420, 420, pic2); }
else if (o[8] == 2) { putimage(420, 420, pic3); }
else if (o[8] == 3) { putimage(420, 420, pic4); }
else if (o[8] == 4) { putimage(420, 420, pic5); }
else if (o[8] == 5) { putimage(420, 420, pic6); }
else if (o[8] == 6) { putimage(420, 420, pic7); }
else if (o[8] == 7) { putimage(420, 420, pic8); }
}
}
int check()
{
if (order[0] == 0 && order[1] == 1 && order[2] == 2 && order[3] == 3 && order[4] == 4 && order[5] == 5 && order[6] == 6 && order[7] == 7 && order[8] == 8)
{
return 1;
}
else return 0;
}
//if succeed, return 1.
private:
int order[9];
PIMAGE pic1 = newimage(210, 210), pic2 = newimage(210, 210), pic3 = newimage(210, 210), pic4 = newimage(210, 210), pic5 = newimage(210, 210), pic6 = newimage(210, 210), pic7 = newimage(210, 210), pic8 = newimage(210, 210),pic9=newimage(210,210);
};
int main()
{
setinitmode(0);
initgraph(630, 630);//由于类中使用了PIMAGE，此须在其前部
{ int a, b, mid;
a = (rand() % (9));
b = (rand() % (9));
mid = o[a];
o[a] = o[b];
o[b] = mid;
a = (rand() % (9));
b = (rand() % (9));
mid = o[a];
o[a] = o[b];
o[b] = mid;
a = (rand() % (9));
b = (rand() % (9));
mid = o[a];
o[a] = o[b];
o[b] = mid;
a = (rand() % (9));
b = (rand() % (9));
mid = o[a];
o[a] = o[b];
o[b] = mid;
}
//打乱数组
char dir=0 ;
Puzzle puzzle(o);
for (; is_run(); delay_fps(60))
{
cleardevice();
if (o[0] == 8)
{
int mid;
if (dir == 37)
{
mid = o[1];
o[1] = o[0];
o[0] = mid;
}
else if (dir == 38)
{
mid = o[3];
o[3] = o[0];
o[0] = mid;
}
}
else if (o[1] == 8)
{
int mid;
if (dir == 37)
{
mid = o[1];
o[1] = o[2];
o[2] = mid;
}
else if (dir == 38)
{
mid = o[1];
o[1] = o[4];
o[4] = mid;
}
else if (dir == 40)
{
;
}
else if (dir == 39)
{
mid = o[1];
o[1] = o[0];
o[0] = mid;
}
}
else if (o[2] == 8)
{
int mid;
if (dir == 37)
{
;
}
else if (dir == 38)
{
mid = o[2
#资源达人分享计划# C/C++大作业 小游戏 滑块拼图+贪吃蛇.rar
版权申诉
5星 · 超过95%的资源 144 浏览量
2021-08-15
01:40:06
上传
评论
收藏 1.32MB RAR 举报 
C++小游戏 滑块拼图+贪吃蛇.rar （48个子文件） 
2020.7.12 滑块拼图 
滑块拼图.cpp 12KB 滑块拼图.vcxproj 7KB res 
8.jpg 14KB 2.jpg 16KB 1.jpg 13KB 6.jpg 19KB 3.jpg 18KB 5.jpg 14KB win.jpg 64KB 4.jpg 14KB 9.jpg 1KB 7.jpg 16KB 滑块拼图.vcxproj.user 168B 滑块拼图.vcxproj.filters 957B 滑块拼图.sln 1KB Debug 滑块拼图.pdb 796KB vc142.pdb 460KB 滑块拼图.log 8KB
滑块拼图.exe 397KB 滑块拼图.obj 64KB vc142.idb 427KB 滑块拼图.ilk 1.27MB 滑块拼图.tlog CL.write.1.tlog 420B CL.read.1.tlog 40KB CL.command.1.tlog 712B link.write.1.tlog 428B link.command.1.tlog 1KB link.read.1.tlog 5KB 滑块拼图.lastbuildstate 220B 贪吃蛇 贪吃蛇.vcxproj.filters 954B 贪吃蛇.vcxproj 7KB 贪吃蛇.cpp 5KB 贪吃蛇.vcxproj.user 168B Debug 贪吃蛇.tlog CL.write.1.tlog 408B 贪吃蛇.lastbuildstate 217B CL.read.1.tlog 40KB CL.command.1.tlog 704B link.write.1.tlog 412B link.command.1.tlog 1KB link.read.1.tlog 5KB 贪吃蛇.log 8KB 贪吃蛇.exe 396KB 贪吃蛇.ilk 1.27MB vc142.pdb 460KB 贪吃蛇.obj 57KB 贪吃蛇.pdb 796KB vc142.idb 355KB 贪吃蛇.sln 1KB资源评论
2301_789425732023-07-08内容与描述一致，超赞的资源，值得借鉴的内容很多，支持！
