c++编程算所有的玫瑰花数，求高手代码改正。给我的答案要是代码的 现在谁手头上有关于鲜花图形的c++程序？高分
\u6211\u60f3\u77e5\u9053\u90a3\u4e2a\u94fa\u6ee1\u73ab\u7470\u82b1\u7684\u7a0b\u5e8f\u662f\u600e\u4e48\u505a\u7684\uff0c\u53ef\u662f\u6211\u4e0d\u4f1a\u7f16\u7a0b\uff0c\u4f1a\u5f88\u96be\u5b66\u4e48\u4e0b\u4e2aC++\u7136\u540e\u7528\u76f8\u540c\u7684\u7f16\u7a0b\u8bed\u8a00\u5efa\u51e0\u4e2a\u6587\u4ef6\u5939\uff0c\u8f93\u5165\u8bbe\u7f6e\u597d\u7684\u7f16\u7a0b\u8bed\u8a00\uff0c\u70b9\u51fb\u5373\u53ef
//\u6211\u6709\u4e2a\u5fc3\u5f62\u7684\uff0c\u4e0d\u77e5\u9053\u6ee1\u8db3\u8981\u6c42\u4e0d\uff1f
void xin()
{
char a[20][21]={' '};
int g;
for(g=5;g<=7;g++)
a[1][g]='o';
for(g=14;g<=16;g++)
a[1][g]='o';
for(g=4;g<=8;g++)
a[2][g]='o';
for(g=13;g<=17;g++)
a[2][g]='o';
for(g=2;g<=9;g++)
a[3][g]='o';
for(g=12;g<=19;g++)
a[3][g]='o';
for(g=1;g<=20;g++)
a[4][g]='o';
for(int l=5;l<11;l++)
{
for(g=1;g<=20;g++)
a[l][g]='o';
}
for(int h=11;h<20;h++)
{
for(g=h-9;g<=30-h;g++)
a[h][g]='o';
}
for(int i=0;i<20;i++)
{
for(int j=0;j<21;j++)
cout<<a[i][j];
cout<<endl;
}
}
下面为我写的代码，用i, j, k, l 分别表示千位、百位、十位、个位上的数字：
#include <iostream>
#include <cstdlib>
using namespace std;
inline int pow4(int i)
{
return i*i*i*i;
}
int main()
{
for (int i=1; i<10; i++)
for (int j=0; j<10; j++)
for (int k=0; k<10; k++)
for (int l=0; l<10; l++)
if (pow4(i)+pow4(j)+pow4(k)+pow4(l)== i*1000+j*100+k*10+l) {
cout<<i<<j<<k<<l<<"\t";
}
return 0;
}
运行结果为1634 8208 9474
y^4 在数学里 ^是乘方的含义，在C++里有其他的含义。这里的运算并不是乘方
if(x = y^4 + n^4 + i^4 + j^4) cout<<x;
else x = x + 1;
=>
if(x == y^4 + n^4 + i^4 + j^4) cout<<x;
x = x + 1;
#include <stdio.h>
void main()
{
int x = 1000;
int a[4];
do
{
int y = x;
for (int i=0;i<4; i++)
{
a[i] = y%10;
y /= 10;
}
if (x == a[0]*a[0]*a[0]*a[0] + a[1]*a[1]*a[1]*a[1] + a[2]*a[2]*a[2]*a[2] + a[3]*a[3]*a[3]*a[3])
{
printf("%d\n",x);
}
x ++;
} while (x < 10000);
}
^在C++中表示异或运算符，请不要与某些其它语言混淆
绛旓細cout<<鈥鎵鏈夌帿鐟拌姳鏁锛氣漡etRoseNum(lower锛寀pper)锛泒voidgetRoseNum(intlower锛宨ntupper){if((lower<1000)||(upper>9999)){cout<<鈥滀笂涓嬬晫閿欒锛佲<<endl锛況eturn锛泒for(inti=lower锛沬<=upper锛沬++){if(isRoseNum(i))銆傛敞鎰忎簨椤癸細C璇█鏄櫘閫傛ф渶寮虹殑涓绉嶈绠楁満绋嬪簭缂栬緫璇█锛瀹冧笉浠呭彲浠...
绛旓細1銆佸彲浠ュ啓鎴愯皟鐢ㄥ嚱鏁#includevoid rose(int n){int a,b,c,d;a=n/1000;b=n/100%10;c=n/10%10;d=n%10;if(a*a*a*a+b*b*b*b+c*c*c*c+d*d*d*d==n)printf("%d",n);}main(){int i;for(i=1000;i銆
绛旓細濡傛灉涓涓洓浣嶆暟绛変簬瀹冪殑姣忎竴浣嶆暟瀛楃殑4娆℃柟涔嬪拰锛屽垯绉拌繖涓洓浣嶆暟涓鐜懓鑺辨暟锛渚嬪锛8208 include "stdio.h"void main(){ int a,b,c,d,num,count=0;long sum=0;for(a=1;a<9;a++)for(b=0;b<9;b++)for(c=0;c<9;c++)for(d=0;d<9;d++){ num=a*1000+b*100+c*10+d;if(...
绛旓細C++ 涓湁 ^ 杩欎釜杩愮畻绗﹀悧锛熶笅闈负鎴戝啓鐨勪唬鐮侊紝鐢╥, j, k, l 鍒嗗埆琛ㄧず鍗冧綅銆佺櫨浣嶃佸崄浣嶃佷釜浣嶄笂鐨勬暟瀛楋細include <iostream> include <cstdlib> using namespace std;inline int pow4(int i){ return i*i*i*i;} int main(){ for (int i=1; i<10; i++)for (int j=0; j<10; ...
绛旓細int main(){ long i,j;long a[SIZE];long temp;long count=0;long sum=0;cout<<"鐜懓鑺辨暟锛"<<endl;for(i=(long)(pow(10,4-1));i<(long)pow(10,4);i++){ temp=i;while(temp!=0){ a[count++]=temp%10;temp/=10;} for(j=0;j<count;j++){ sum+=(long)(pow(a[j]...
绛旓細杩欓噷锛寊鐨勮绠楁槸鍏抽敭锛屽畠褰卞搷鑺辩摚鐨勮捣浼忓拰绔嬩綋鎰燂紝z = (-h - c * 4.9) + cos((1 - b)^7) * 50 + c * 2; 鏄姳鐡ｄ綅缃璁＄畻鐨涓涓緥瀛愩傛帴鐫锛宑alc鍑芥暟鐢ㄤ簬璁＄畻鑺鐨勫悇涓儴鍒嗭紝濡傝姳鏌勩佸彾銆佽姳钀煎拰鑺辩摚銆傝繖閲岀渷鐣ヤ簡鍏蜂綋鐨勯昏緫锛屼絾浣犲彲浠ラ氳繃璋冪敤杩欎釜鍑芥暟锛屼紶閫掑悎閫傜殑鍙傛暟鏉ョ敓鎴愪笉鍚岀殑褰㈢姸...
绛旓細浠ｇ爜鏂囨湰锛歩nclude "stdio.h"int main(int argc,char *argv[]){ int n,t;for(n=1000;n<10000;n++)if(n==(t=n/1000)*t*t*t+(t=n/100%10)*t*t*t+(t=n/10%10)*t*t*t+(t=n%10)*t*t*t)printf("%d\n",n);return 0;} ...
绛旓細} printf("\n"); }} 杩欎釜C璇█绋嬪簭閫氳繃宸у鐨勭煩闃靛彉鎹㈠拰鍏夌収璁＄畻锛鏋勫缓鍑轰竴涓粏鑵鐨勭帿鐟拌姳鍥炬锛屽皢鏁板涔嬬編涓缂栫▼鑹烘湳瀹岀編铻嶅悎銆傛瘡涓儚绱犵殑鐢熸垚閮戒緷璧栦簬澶嶆潅鐨勫悜閲忓拰鐭╅樀杩愮畻锛屽睍绀轰簡绋嬪簭鍛樺鍑犱綍鍜屽厜鐓х殑鐞嗚В銆傚湪瀹為檯缂栫▼涓紝浣犲彲浠ユ牴鎹渶瑕佽皟鏁村弬鏁板拰鍑芥暟缁嗚妭锛屼互鍒涘缓鍑烘洿澶氬彉鍖栫殑鐜懓鑺辨晥鏋溿
绛旓細C璇█娌℃湁鎻愪緵閭ｄ釜鍑芥暟鎴栬呭彨瀛楃鍚у惂銆傚綋鐒朵綘鍙互鐢ㄤ唬鐮佽嚜宸辩敾锛屼篃鍙互鍘绘壘鎵剧湅鏈変汉鏈変汉瀹舵彁渚涘ソ鐨勮兘鐢诲嚭鐜懓鑺鐨勬簮浠ｇ爜銆傛垜鎯虫病鏈夈傜敾閭ｄ釜杩樻槸寰堣垂鍔茬殑銆傚綋鐒跺鏋滅敤寮鍙戝伐鍏锋潵寮鍙戝甫UI鐨勭▼搴忥紝閭ｅ氨鍙互鐢ㄧ浉搴旂殑鍑芥暟鐩存帴杞藉叆鍥剧墖鐨勮祫婧愩備笉杩嘋璇█鐨勬垜娌¤杩囷紝涓鑸紑鍙慤I绋嬪簭鐢ㄧ殑閮芥槸闈㈠悜瀵硅薄鐨勮瑷...
绛旓細1銆佷綘閭ｄ釜鎶婂嚑涓暟鍊煎拰鐢荤瑪绫诲瀷鏀逛竴涓嬪氨鑳芥弧瓒宠姹 2銆佺粰浣犱竴涓畬鍠勭殑demo鍙傝冧笅 /// 绋嬪簭鍚嶇О锛氫竴鏈甸肩湡鐨勭帿鐟拌姳// 缂栬瘧鐜锛歏C6.0锛孍asyX 2011鎯婅洶鐗// 浣 鑰咃細瀛欑惃// 缂栧啓鍦扮偣锛歑UST// 缂栧啓鏃堕棿锛2013骞11鏈11鏃// 缂栧啓鐩殑锛氳禒缁欐湭鏉ュ彲鑳界湅鍒扮殑浣 #include <graphics.h>#include ...
