huanghai/python
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

'commit'

Browse Source
This commit is contained in:
HuangHai
2025-08-30 18:35:01 +08:00
commit 1f397eca87
6258 changed files with 1487241 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
C++课程/待整理知识/啊哈算法/火柴棍等式.cpp Normal file
View File

@@ -0,0 +1,41 @@
#include<bits/stdc++.h>
using namespace std;
int Fun(int n)
{
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>г<EFBFBD>0-9ûһ<C3BB><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD>Ļ<EFBFBD><C4BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int arr[10] = { 6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int ret = 0;
//<2F>ж<EFBFBD>n<EFBFBD>Dz<EFBFBD><C7B2><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD><CEBB>
while (n / 10 != 0){
//<2F><><EFBFBD><EFBFBD>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD>Ļ<EFBFBD><C4BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
ret += arr[n % 10];
//<2F><><EFBFBD><EFBFBD>n<EFBFBD>ĸ<EFBFBD>λ<EFBFBD><CEBB>
n /= 10;
}
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϴ<EFBFBD>ʱn<CAB1><6E>Ҫ<EFBFBD>Ļ<EFBFBD><C4BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>(n<><6E>һλ<D2BB><CEBB>)
ret += arr[n];
return ret;
}
int main()
{
int a, b, c, m, num = 0;
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĸ<EFBFBD><EFBFBD><EFBFBD>\n");
scanf("%d", &m);
//ö<><C3B6>a<EFBFBD><61>b
for (a = 0; a <= 1111; a++){
for (b = 0; b <= 1111; b++){
c = a + b;
//<2F>ж<EFBFBD><D0B6>Ƿ<EFBFBD><C7B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (Fun(a) + Fun(b) + Fun(c) == m - 4){
printf("%d + %d = %d\n", a, b, c);
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>п<EFBFBD><D0BF>ܵĸ<DCB5><C4B8><EFBFBD>
num++;
}
}
}
printf("һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƴ<EFBFBD><EFBFBD>%d<><64><EFBFBD><EFBFBD>ͬ<EFBFBD><CDAC>ʽ\n", num);
system("pause");
return 0;
}