a、b是0-9的数字,c是1 3 5 7 9单数
公式是(a*8+b*4+c*2)/11的余数是1
求满足这个公式的所有三个数abc这个顺序的排列组合
for a in range(0,10):
for b in range(0,10):
for c in [1,3,5,7,9]:
if (a*8+b*4+c*2)%11 == 1:
print(a,b,c)
c++的代码,我用cin是为了停住程序。
#include<iostream>
#include<stdlib.h>
using namespace std;
int main()
{
int a,b,c;
for(a = 0; a<10;a++)
{
for(b = 0; b<10;b++)
{
for(c = 1; c<10;c+=2)
{
if((a*8+b*4+c*2)%11==1)
{
cout << a <<" "<< b <<" "<< c << endl;
}
}
}
}
cin.get();
}
因为a和b都是按顺序便利下来,所以无需进行额外排序
for a in range(10):
for b in range(10):
for c in range(1,10,2):
if (a*8+b*4+c*2)%11==1:
print(f'{a}{b}{c}', end=' ')
C++:
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
for (a = 0; a <= 9; a++)
{
for (b = 0; b <= 9; b++)
{
for (c = 1; c <= 9; c += 2)
{
if ((a * 8 + b * 4 + c * 2) % 11 == 1)
cout << a << b << c << endl;
}
}
}
return 0;
}
python
for a in range(1,10):
for b in range(1,10):
for c in range(1,10,2):
if (a * 8 + b * 4 + c * 2) % 11 == 1 :
print('%d%d%d' %(a,b,c))