緇撶偣瀛樺偍鐨勬暟鎹潎涓洪潪璐熸暣鏁?/span>
Input
絎竴琛岃緭鍏ヤ竴涓暣鏁皌錛岃〃紺烘湁t涓簩鍙夋爲
絎簩琛岃搗錛屾瘡琛岃緭鍏ヤ竴涓暟緇勶紝鍏堣緭鍏ユ暟緇勯暱搴︼紝鍐嶈緭鍏ユ暟緇勫唴鏁版嵁錛屾瘡涓暟鎹箣闂寸敤絀烘牸闅斿紑錛岃緭鍏ョ殑鏁版嵁閮芥槸闈炶礋鏁存暟
榪炵畫杈撳叆t琛?/span>
Output
姣忚杈撳嚭涓涓ず渚嬬殑鍏堝簭閬嶅巻緇撴灉錛屾瘡涓粨鐐逛箣闂寸敤絀烘牸闅斿紑
Sample Input
3
3 1 2 3
5 1 2 3 0 4
13 1 2 3 4 0 5 6 7 8 0 0 9 10
Sample Output
1 2 3
1 2 4 3
1 2 4 7 8 3 5 9 10 6
鍒嗘瀽錛?/span>榪欓亾棰樼殑鍏抽敭鍦ㄤ簬錛氳瀹氭暟緇勪綅緗粠1寮濮嬬紪鍙鳳紝閭ｄ箞浣嶇疆涓篿鐨勭粨鐐癸紝瀹冪殑宸﹀瀛愬湪鏁扮粍鐨勪綅緗槸2i錛屽彸瀛╁瓙鍦ㄦ暟緇勭殑浣嶇疆鏄?i+1
鍒嗘瀽錛?/span>榪欓亾棰樼殑鍏抽敭鍦ㄤ簬錛氳瀹氭暟緇勪綅緗粠1寮濮嬬紪鍙鳳紝閭ｄ箞浣嶇疆涓篿鐨勭粨鐐癸紝瀹冪殑宸﹀瀛愬湪鏁扮粍鐨勪綅緗槸2i錛屽彸瀛╁瓙鍦ㄦ暟緇勭殑浣嶇疆鏄?i+1
榪欓亾棰樼殑闅劇偣鍦ㄦ妸鏍戝緩绔嬭搗鏉ワ紝鍏朵粬閮藉鏄撱?/span>
浠ｇ爜錛?/span>
浠ｇ爜錛?/span>
#include <iostream>
using namespace std;
class BiTreeNode
{
private:
BiTreeNode *leftChild; //宸﹀瓙鏍戞寚閽?/span>
BiTreeNode *rightChild; //鍙沖瓙鏍戞寚閽?/span>
public:
int data; //鏁版嵁鍩?br />
//鏋勯犲嚱鏁板拰鏋愭瀯鍑芥暟
BiTreeNode():leftChild(NULL), rightChild(NULL){}
BiTreeNode(int item, BiTreeNode *left = NULL,
BiTreeNode *right = NULL):
data(item), leftChild(left), rightChild(right){}
~BiTreeNode(){}
BiTreeNode * &Left(void) //娉ㄦ剰榪斿洖鍊肩被鍨嬩負鎸囬拡鐨勫紩鐢ㄧ被鍨?/span>
{return leftChild;}
BiTreeNode * &Right(void) //娉ㄦ剰榪斿洖鍊肩被鍨嬩負鎸囬拡鐨勫紩鐢ㄧ被鍨?/span>
{return rightChild;}
};
class BiTree
{
private:
BiTreeNode *root; //鏍圭粨鐐規寚閽?/span>
int i,len; //len鏄爲緇撶偣鐨勬暟閲?/span>
void Destroy(BiTreeNode * &t);
void PreOrder(BiTreeNode * &t);
void CreateBiTree(BiTreeNode * &T,const int arrTree[],int pos);
public:
//鏋勯犲嚱鏁板拰鏋愭瀯鍑芥暟
BiTree(void):root(NULL),i(0){}; //鏋勯犲嚱鏁?/span>
~BiTree(void){}; //鏋愭瀯鍑芥暟
//鏋勯犱簩鍙夋爲
void MakeTree(const int arrTree[],int num); //鏋勯犱簩鍙夋爲錛屽埄鐢ㄥ厛搴忛亶鍘嗙粨鏋滃緩鏍?/span>
void Destroy(void); //閿姣佷簩鍙夋爲
void PreOrder(); //鍓嶅簭閬嶅巻
};
//2銆佸畾涔夐攢姣佸嚱鏁?/span>
void BiTree ::Destroy(void) //閿姣佷簩鍙夋爲錛屽叕鏈夊嚱鏁?/span>
{
Destroy(root);
}
void BiTree ::Destroy(BiTreeNode * &t)
//閿姣佷簩鍙夋爲錛岀鏈夊嚱鏁頒緵鍏辨湁鍑芥暟璋冪敤
{
if(t != NULL && t->Left() != NULL)
Destroy(t->Left());
if(t != NULL && t->Right() != NULL)
Destroy(t->Right());
if(t != NULL)
{
delete t;
}
}
//3銆佸畾涔夊緩鏍戝嚱鏁?/span>
void BiTree::MakeTree(const int arrTree[],int num)
//鏋勯犱簩鍙夋爲錛屽埄鐢ㄥ厛搴忛亶鍘嗙粨鏋滃緩鏍戯紝鍏湁鍑芥暟
{
i=0;
len = num;
CreateBiTree(root,arrTree,1);//鏁扮粍浣嶇疆浠?寮濮?/span>
}
void BiTree::CreateBiTree(BiTreeNode * &T, const int arrTree[],int pos) //閫掑綊寤烘爲縐佹湁鍑芥暟
{
int ch;
ch=arrTree[pos];
if (ch == 0 || pos > len) T = NULL;
else
{
T=new BiTreeNode();
T->data = ch; // 鐢熸垚鏍圭粨鐐?/span>
i++;
if(i>len) return;
CreateBiTree(T->Left(), arrTree,2*pos); // 鏋勯犲乏瀛愭爲
CreateBiTree(T->Right(), arrTree,2*pos+1); // 鏋勯犲彸瀛愭爲
}
}
//4銆佸畾涔夊厛搴忛亶鍘嗗嚱鏁?/span>
void BiTree::PreOrder()
//鍓嶅簭閬嶅巻璁塊棶浜屽弶鏍戯紝鍏湁鍑芥暟
{
PreOrder(root);
}
void BiTree::PreOrder(BiTreeNode* &t)
//鍓嶅簭閬嶅巻璁塊棶浜屽弶鏍戯紝縐佹湁鍑芥暟t
{
if(t!=NULL)//鑻ヤ簩鍙夋爲緇撶偣涓嶄負絀猴紝鎵ц濡備笅鎿嶄綔錛?/span>
{
cout<<t->data<<" ";//1銆佽緭鍑哄綋鍓嶇粨鐐圭殑鏁版嵁錛岃〃紺鴻緇撶偣琚闂簡
PreOrder(t->Left());//2銆佸厛搴忛亶鍘嗚緇撶偣鐨勫乏瀛╁瓙
PreOrder(t->Right());//3銆佸厛搴忛亶鍘嗚緇撶偣鐨勫彸瀛╁瓙
}
}
int main()
{
int m,i,j,k;
int *arrTree;
BiTree myTree;
cin>>m;
for(i=0;i<m;i++)
{
arrTree = new int[800];
cin>>k;
for(j=1;j<=k;j++)
cin>>arrTree[j];
myTree.MakeTree(arrTree,k);
myTree.PreOrder();
cout<<endl;
delete []arrTree;
myTree.Destroy();
}
return 0;
}
using namespace std;
class BiTreeNode
{
private:
BiTreeNode *leftChild; //宸﹀瓙鏍戞寚閽?/span>
BiTreeNode *rightChild; //鍙沖瓙鏍戞寚閽?/span>
public:
int data; //鏁版嵁鍩?br />
//鏋勯犲嚱鏁板拰鏋愭瀯鍑芥暟
BiTreeNode():leftChild(NULL), rightChild(NULL){}
BiTreeNode(int item, BiTreeNode *left = NULL,
BiTreeNode *right = NULL):
data(item), leftChild(left), rightChild(right){}
~BiTreeNode(){}
BiTreeNode * &Left(void) //娉ㄦ剰榪斿洖鍊肩被鍨嬩負鎸囬拡鐨勫紩鐢ㄧ被鍨?/span>
{return leftChild;}
BiTreeNode * &Right(void) //娉ㄦ剰榪斿洖鍊肩被鍨嬩負鎸囬拡鐨勫紩鐢ㄧ被鍨?/span>
{return rightChild;}
};
class BiTree
{
private:
BiTreeNode *root; //鏍圭粨鐐規寚閽?/span>
int i,len; //len鏄爲緇撶偣鐨勬暟閲?/span>
void Destroy(BiTreeNode * &t);
void PreOrder(BiTreeNode * &t);
void CreateBiTree(BiTreeNode * &T,const int arrTree[],int pos);
public:
//鏋勯犲嚱鏁板拰鏋愭瀯鍑芥暟
BiTree(void):root(NULL),i(0){}; //鏋勯犲嚱鏁?/span>
~BiTree(void){}; //鏋愭瀯鍑芥暟
//鏋勯犱簩鍙夋爲
void MakeTree(const int arrTree[],int num); //鏋勯犱簩鍙夋爲錛屽埄鐢ㄥ厛搴忛亶鍘嗙粨鏋滃緩鏍?/span>
void Destroy(void); //閿姣佷簩鍙夋爲
void PreOrder(); //鍓嶅簭閬嶅巻
};
//2銆佸畾涔夐攢姣佸嚱鏁?/span>
void BiTree ::Destroy(void) //閿姣佷簩鍙夋爲錛屽叕鏈夊嚱鏁?/span>
{
Destroy(root);
}
void BiTree ::Destroy(BiTreeNode * &t)
//閿姣佷簩鍙夋爲錛岀鏈夊嚱鏁頒緵鍏辨湁鍑芥暟璋冪敤
{
if(t != NULL && t->Left() != NULL)
Destroy(t->Left());
if(t != NULL && t->Right() != NULL)
Destroy(t->Right());
if(t != NULL)
{
delete t;
}
}
//3銆佸畾涔夊緩鏍戝嚱鏁?/span>
void BiTree::MakeTree(const int arrTree[],int num)
//鏋勯犱簩鍙夋爲錛屽埄鐢ㄥ厛搴忛亶鍘嗙粨鏋滃緩鏍戯紝鍏湁鍑芥暟
{
i=0;
len = num;
CreateBiTree(root,arrTree,1);//鏁扮粍浣嶇疆浠?寮濮?/span>
}
void BiTree::CreateBiTree(BiTreeNode * &T, const int arrTree[],int pos) //閫掑綊寤烘爲縐佹湁鍑芥暟
{
int ch;
ch=arrTree[pos];
if (ch == 0 || pos > len) T = NULL;
else
{
T=new BiTreeNode();
T->data = ch; // 鐢熸垚鏍圭粨鐐?/span>
i++;
if(i>len) return;
CreateBiTree(T->Left(), arrTree,2*pos); // 鏋勯犲乏瀛愭爲
CreateBiTree(T->Right(), arrTree,2*pos+1); // 鏋勯犲彸瀛愭爲
}
}
//4銆佸畾涔夊厛搴忛亶鍘嗗嚱鏁?/span>
void BiTree::PreOrder()
//鍓嶅簭閬嶅巻璁塊棶浜屽弶鏍戯紝鍏湁鍑芥暟
{
PreOrder(root);
}
void BiTree::PreOrder(BiTreeNode* &t)
//鍓嶅簭閬嶅巻璁塊棶浜屽弶鏍戯紝縐佹湁鍑芥暟t
{
if(t!=NULL)//鑻ヤ簩鍙夋爲緇撶偣涓嶄負絀猴紝鎵ц濡備笅鎿嶄綔錛?/span>
{
cout<<t->data<<" ";//1銆佽緭鍑哄綋鍓嶇粨鐐圭殑鏁版嵁錛岃〃紺鴻緇撶偣琚闂簡
PreOrder(t->Left());//2銆佸厛搴忛亶鍘嗚緇撶偣鐨勫乏瀛╁瓙
PreOrder(t->Right());//3銆佸厛搴忛亶鍘嗚緇撶偣鐨勫彸瀛╁瓙
}
}
int main()
{
int m,i,j,k;
int *arrTree;
BiTree myTree;
cin>>m;
for(i=0;i<m;i++)
{
arrTree = new int[800];
cin>>k;
for(j=1;j<=k;j++)
cin>>arrTree[j];
myTree.MakeTree(arrTree,k);
myTree.PreOrder();
cout<<endl;
delete []arrTree;
myTree.Destroy();
}
return 0;
}
]]>
1024 1025 1026 1027 1028 1029 1030 1031 1032
鍒欐湁10涓?鍑虹幇鍦ㄨ繖浜涙暟涓?/span>
Input
杈撳叆涓嶄細瓚呰繃500琛屻傛瘡涓琛屾湁涓や釜鏁癮鍜宐錛宎鍜宐鐨勮寖鍥存槸0 < a, b < 100000000銆傝緭鍏ヤ袱涓?鏃剁▼搴忕粨鏉燂紝涓や釜0涓嶄綔涓鴻緭鍏ユ牱渚嬨?/span>
Output
瀵逛簬姣忎竴瀵硅緭鍏ョ殑a鍜宐錛岃緭鍑轟竴涓暟錛屼唬琛?鍑虹幇鐨勪釜鏁般?/span>
Sample Input
1 10
44 497
346 542
1199 1748
1496 1403
1004 503
1714 190
1317 854
1976 494
1001 1960
0 0
Sample Output
2
185
40
666
113
105
1133
512
1375
1256
#include<stdio.h>
#include<string.h>
int Find_OneNum(long a)
{
long i,b,count=0;
while(a)
{
b=a%10;
if(b == 1)
{
count++;
}
a=a/10;
}
return count;
}
int main()
{
long a,b,i,sum;
while((scanf("%ld%ld",&a,&b) == 2),a)
{
if(a>b)
{
int temp;
temp=a;
a=b;
b=temp;
}
sum=0;
for(i=a;i<=b;i++)
{
sum += Find_OneNum(i);
}
printf("%ld\n",sum);
}
return 0;
}
#include<string.h>
int Find_OneNum(long a)
{
long i,b,count=0;
while(a)
{
b=a%10;
if(b == 1)
{
count++;
}
a=a/10;
}
return count;
}
int main()
{
long a,b,i,sum;
while((scanf("%ld%ld",&a,&b) == 2),a)
{
if(a>b)
{
int temp;
temp=a;
a=b;
b=temp;
}
sum=0;
for(i=a;i<=b;i++)
{
sum += Find_OneNum(i);
}
printf("%ld\n",sum);
}
return 0;
}
]]>
The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes in the range of two supplied numbers a and b (5 <= a < b <= 1000,000,000); both a and b are considered to be within the range .
Input
Line 1: Two integers, a and b
Output
The list of palindromic primes in numerical order, one per line.
Sample Input
5 500
Sample Output
5
7
11
101
131
151
181
191
313
353
373
383
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int i;
int Is_Prime(int a)
{
double t = a;
for(i=2;i<=sqrt(t);i++)
{
if(a % i == 0)
return 0;
}
return 1;
}
int diglen(int c)
{
if(c/10 == 0)
return 1;
int count=0;
while(c)
{
c=c/10;
count++;
}
return count;
}
void IntoStr(int a,char* str) //灝嗘暟瀛楄漿鎹負瀛楃涓?/span>
{
int h= diglen(a)-1,i=0;
while(h+1)
{
int k,c,d=1;
for(k=0;k<h;k++)
{
d=d*10;
}
c=a/d;//鍙栨湰嬈℃暟瀛楃殑鏈楂樹綅
str[i++] = c+48;
a = a%d; //鍙栦綑鏁?/span>
h--;
}
str[i]='\0'; //鏈鍚庢湯灝懼姞瀛楃涓茬粨鏉熺
}
int Is_Pal(int b)
{
int len = diglen(b);
int ok = 1,j;
char* str = (char*)malloc(sizeof(char)*(len+1));
IntoStr(b,str); //灝嗘暟瀛楄漿鎹負瀛楃鏁扮粍錛屼篃鍙互鐢╥toa鍑芥暟鎴?sprintf鍑芥暟
for(i=0,j=len-1;i < len/2;i++,j--)
{
if(str[i] != str[j])
ok = 0;
}
free(str);
if(ok == 1)
return 1;
else
return 0;
}
int main()
{
int a,b,j;
scanf("%d%d",&a,&b);
for(j=a;j<=b;j++)
{
if(Is_Prime(j) && Is_Pal(j))
printf("%d\n",j);
}
return 0;
}
#include<math.h>
#include<stdlib.h>
int i;
int Is_Prime(int a)
{
double t = a;
for(i=2;i<=sqrt(t);i++)
{
if(a % i == 0)
return 0;
}
return 1;
}
int diglen(int c)
{
if(c/10 == 0)
return 1;
int count=0;
while(c)
{
c=c/10;
count++;
}
return count;
}
void IntoStr(int a,char* str) //灝嗘暟瀛楄漿鎹負瀛楃涓?/span>
{
int h= diglen(a)-1,i=0;
while(h+1)
{
int k,c,d=1;
for(k=0;k<h;k++)
{
d=d*10;
}
c=a/d;//鍙栨湰嬈℃暟瀛楃殑鏈楂樹綅
str[i++] = c+48;
a = a%d; //鍙栦綑鏁?/span>
h--;
}
str[i]='\0'; //鏈鍚庢湯灝懼姞瀛楃涓茬粨鏉熺
}
int Is_Pal(int b)
{
int len = diglen(b);
int ok = 1,j;
char* str = (char*)malloc(sizeof(char)*(len+1));
IntoStr(b,str); //灝嗘暟瀛楄漿鎹負瀛楃鏁扮粍錛屼篃鍙互鐢╥toa鍑芥暟鎴?sprintf鍑芥暟
for(i=0,j=len-1;i < len/2;i++,j--)
{
if(str[i] != str[j])
ok = 0;
}
free(str);
if(ok == 1)
return 1;
else
return 0;
}
int main()
{
int a,b,j;
scanf("%d%d",&a,&b);
for(j=a;j<=b;j++)
{
if(Is_Prime(j) && Is_Pal(j))
printf("%d\n",j);
}
return 0;
}
]]>
( ) [ ( ) ( [ ] ) ] { }
1 2 3 4 5 6 7 8 9 10 11 12
浠庝笂渚嬪彲浠ョ湅鍑虹1鍜岀2涓嫭鍙峰尮閰嶏紝絎?鍜岀10涓嫭鍙峰尮閰嶏紝4鍜?鍖歸厤錛?鍜?鍖歸厤錛?鍜?鍖歸厤錛?1鍜?2鍖歸厤銆備粠涓彲浠ョ湅鍒版嫭鍙峰祵濂楃殑鐨勬儏鍐墊槸姣旇緝澶嶆潅鐨勶紝浣跨敤鍫嗘爤鍙互寰堟柟渚跨殑澶勭悊榪欑鎷彿鍖歸厤媯楠岋紝鍙互閬靛驚浠ヤ笅瑙勫垯錛?/span>
1銆?褰撴帴鏀剁1涓乏鎷彿錛岃〃紺烘柊鐨勪竴緇勫尮閰嶆鏌ュ紑濮嬶紱闅忓悗濡傛灉榪炵畫鎺ユ敹鍒板乏鎷彿錛屽垯涓嶆柇榪涘爢鏍堛?/span>
2銆?褰撴帴鍙楃1涓彸鎷彿錛屽垯鍜屾渶鏂拌繘鏍堢殑宸︽嫭鍙瘋繘琛屽尮閰嶏紝琛ㄧず宓屽涓?緇勬嫭鍙峰凡緇忓尮閰嶆秷闄?/span>
3銆?鑻ュ埌鏈鍚庯紝鎷彿涓嶈兘瀹屽叏鍖歸厤錛屽垯璇存槑杈撳叆鐨勮〃杈懼紡鏈夐敊
Input
絎竴琛岃緭鍏ヤ竴涓猼錛岃〃紺轟笅闈㈠皢鏈塼緇勬祴璇曟暟鎹傛帴涓嬫潵鐨則琛岀殑姣忚杈撳叆涓涓〃杈懼紡錛岃〃杈懼紡鍙冭檻鑻辨枃鍗婅鐘舵佽緭鍏ワ紝鏃犻渶鑰冭檻涓枃鍏ㄨ杈撳叆
Output
瀵逛簬姣忎竴琛岀殑琛ㄨ揪寮忥紝媯鏌ユ嫭鍙鋒槸鍚﹀尮閰嶏紝鍖歸厤鍒欒緭鍏k錛屼笉鍖歸厤鍒欒緭鍑篹rror
Sample Input
2
(a+b)[4*5+(-6)]
[5*8]/{(a+b)-6
Sample Output
ok
error
浠ｇ爜錛?br />
浠ｇ爜錛?br />
#include<iostream>
#include<cstring>
#include<stack>
using namespace std;
int main()
{
int t,len;
stack<char> mystack;
cin>>t;
while(t--)
{
int ok=0;
char str[100];
cin>>str;
len=strlen(str);
for(int i=0;i<len;i++)
{
switch(str[i])
{
case '(':
case '[':
case '{':
mystack.push(str[i]);
break;
case ')':
if(mystack.top() == '(')
{
mystack.pop();
ok=1;
}
break;
case ']':
if(mystack.top() == '[')
{
mystack.pop();
ok=1;
}
break;
case '}':
if(mystack.top() == '{')
{
mystack.pop();
ok=1;
}
break;
default: break;
}
}
if(ok && mystack.empty())
cout<<"ok"<<endl;
else
cout<<"error"<<endl;
}
return 0;
}
#include<cstring>
#include<stack>
using namespace std;
int main()
{
int t,len;
stack<char> mystack;
cin>>t;
while(t--)
{
int ok=0;
char str[100];
cin>>str;
len=strlen(str);
for(int i=0;i<len;i++)
{
switch(str[i])
{
case '(':
case '[':
case '{':
mystack.push(str[i]);
break;
case ')':
if(mystack.top() == '(')
{
mystack.pop();
ok=1;
}
break;
case ']':
if(mystack.top() == '[')
{
mystack.pop();
ok=1;
}
break;
case '}':
if(mystack.top() == '{')
{
mystack.pop();
ok=1;
}
break;
default: break;
}
}
if(ok && mystack.empty())
cout<<"ok"<<endl;
else
cout<<"error"<<endl;
}
return 0;
}
]]>
瀵逛簬浠繪剰鍗佽繘鍒舵暟杞崲涓簁榪涘埗錛屽寘鎷暣鏁伴儴鍒嗗拰灝忔暟閮ㄥ垎杞崲銆傛暣鏁伴儴鍒嗛噰鐢ㄩ櫎k姹備綑娉曪紝灝忔暟閮ㄥ垎閲囩敤涔榢鍙栨暣娉曚緥濡倄=19.125錛屾眰2榪涘埗杞崲
鏁存暟閮ㄥ垎19錛?span style="white-space:pre"> 灝忔暟閮ㄥ垎0.125
19 / 2 = 9 … 1 0.125 * 2 = 0.25 … 0
9 / 2 = 4 … 1 0.25 * 2 = 0.5 … 0
4 / 2 = 2 … 0 0.5 * 2 = 1 … 1
2 / 2 = 1 … 0
1 / 2 = 0 … 1
鎵浠ユ暣鏁伴儴鍒嗚漿涓?10011錛屽皬鏁伴儴鍒嗚漿涓?.001錛屽悎璧鋒潵涓?0011.001 璇風敤鍫嗘爤瀹炵幇涓婅堪鏁板埗杞崲
Input
絎竴琛岃緭鍏ヤ竴涓猼錛岃〃紺轟笅闈㈠皢鏈塼緇勬祴璇曟暟鎹?/span>
鎺ヤ笅鏉ョ殑t琛岀殑姣忚鍖呭惈涓や釜鍙傛暟n錛?<n<10000錛屼笖鏈澶氭湁8浣嶅皬鏁幫級鍜宬錛?<k<=16錛夛紝n琛ㄧず瑕佽漿鎹㈢殑鏁板鹼紝n鍙互甯﹀皬鏁幫紙涔熷彲浠ヤ笉甯︼紒錛夛紝k琛ㄧず瑕佽漿鎹㈢殑鏁板埗錛宬蹇呴』鏄鏁存暟銆傚ぇ浜?0鐨勮繘鍒舵暟鎹敤A\B\C\D\E\F琛ㄧず
Output
瀵逛簬姣忎竴緇勬祴璇曟暟鎹紝姣忚杈撳嚭杞崲鍚庣殑緇撴灉錛屽皬鏁伴儴鍒嗗ぇ浜?浣嶇殑錛屽彧杈撳嚭鍓?浣嶅皬鏁?/span>
Sample Input
2
19.125 2
15.125 16
Sample Output
10011.001
F.2
浠ｇ爜
#include<iostream>
浠ｇ爜
#include<iostream>
#include<stack>
using namespace std;
int main()
{
stack<int> mystack;
int t,m,k;
double b,a;
cin>>t;
while(t--)
{
int c,x[100],d=0,i=0,count=0;
cin>>b>>k;
m=b;
a=b-m;
while(m)
{
c=m%k;
m=m/k;
mystack.push(c);
}
while(1)
{
d=a*k;
if(d>=k)
break;
a=a*k;
x[i++]=d;
count++;
}
while(!mystack.empty())
{
if(mystack.top()<10)
{
cout<<mystack.top();
mystack.pop();
}
else
{
switch(mystack.top())
{
case 10: cout<<"A"; mystack.pop(); break;
case 11: cout<<"B"; mystack.pop(); break;
case 12: cout<<"C"; mystack.pop(); break;
case 13: cout<<"D"; mystack.pop(); break;
case 14: cout<<"E"; mystack.pop(); break;
case 15: cout<<"F"; mystack.pop(); break;
}
}
}
cout<<".";
for(i=0;i<count;i++)
cout<<x[i];
cout<<endl;
}
return 0;
}
using namespace std;
int main()
{
stack<int> mystack;
int t,m,k;
double b,a;
cin>>t;
while(t--)
{
int c,x[100],d=0,i=0,count=0;
cin>>b>>k;
m=b;
a=b-m;
while(m)
{
c=m%k;
m=m/k;
mystack.push(c);
}
while(1)
{
d=a*k;
if(d>=k)
break;
a=a*k;
x[i++]=d;
count++;
}
while(!mystack.empty())
{
if(mystack.top()<10)
{
cout<<mystack.top();
mystack.pop();
}
else
{
switch(mystack.top())
{
case 10: cout<<"A"; mystack.pop(); break;
case 11: cout<<"B"; mystack.pop(); break;
case 12: cout<<"C"; mystack.pop(); break;
case 13: cout<<"D"; mystack.pop(); break;
case 14: cout<<"E"; mystack.pop(); break;
case 15: cout<<"F"; mystack.pop(); break;
}
}
}
cout<<".";
for(i=0;i<count;i++)
cout<<x[i];
cout<<endl;
}
return 0;
}
]]>
浠ｇ爜濡備笅錛?br />
#include<stdio.h>
#define N 10
int Maxcom(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else if(b>a)
b=b-a;
}
return a;
}
int main()
{
int a[N][N];
int i,j,max;
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
if(i==1 && j==1)
a[i][j]=1;
else if( i>0 && j>0)
{
max = Maxcom(i,j);
if(max == 1)
a[i][j]=1;
else
a[i][j]=0;
}
else
a[i][j]=0;
}
}
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
printf("%d ",a[i][j]);
printf("\n");
}
printf("\n");
return 0;
}
#define N 10
int Maxcom(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else if(b>a)
b=b-a;
}
return a;
}
int main()
{
int a[N][N];
int i,j,max;
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
if(i==1 && j==1)
a[i][j]=1;
else if( i>0 && j>0)
{
max = Maxcom(i,j);
if(max == 1)
a[i][j]=1;
else
a[i][j]=0;
}
else
a[i][j]=0;
}
}
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
printf("%d ",a[i][j]);
printf("\n");
}
printf("\n");
return 0;
}
]]>
#include<stdio.h>
#include<string.h>
#define N 1000
int main()
{
char a[N];
int i,j,k=0,count[100]={0},max;
printf("Input the a string: "); //杈撳叆瀛楃涓?/span>
gets(a);
for(i=0;a[i]!=0;i++)
{
while(a[i++] == ' ')
{
count[k]++;
if(a[i+1]!=' ')
k++;
}
}
for(j=0;j<k;j++)
{
max=count[0];
if(count[j]<count[j+1])
max=count[j+1];
}
printf("%d\n",max);
return 0;
}
#include<string.h>
#define N 1000
int main()
{
char a[N];
int i,j,k=0,count[100]={0},max;
printf("Input the a string: "); //杈撳叆瀛楃涓?/span>
gets(a);
for(i=0;a[i]!=0;i++)
{
while(a[i++] == ' ')
{
count[k]++;
if(a[i+1]!=' ')
k++;
}
}
for(j=0;j<k;j++)
{
max=count[0];
if(count[j]<count[j+1])
max=count[j+1];
}
printf("%d\n",max);
return 0;
}
]]>
#include<stdio.h>
#include<string.h>
#define N 1000
int main()
{
char a[N];
int i,j;
printf("Input the a string: "); //杈撳叆瀛楃涓?/span>
gets(a);
for(i=0;a[i]!=0;i++)
{
while(a[i] == ' ' && a[i+1] == ' ')
{
for(j=i;a[j]!=0;j++)
a[j]=a[j+1];
}
}
printf("%s",a);
return 0;
}
]]>
浠ｇ爜嫻嬭瘯閫氳繃錛?br />
#include<stdio.h>
#define N 1000
int main()
{
char a[N];
int b[N]={0};
int i,c[N]={0};
printf("Input the string: ");
gets(a);
for(i=0;a[i]!='\0';i++)
{
b[a[i]]++;
}
for(i=0;a[i]!=0;i++)
{
if(c[a[i]] == 0)
{
printf("%c : %d\n",a[i],b[a[i]]);
c[a[i]]=1;
}
}
printf("\n");
return 0;
}
#define N 1000
int main()
{
char a[N];
int b[N]={0};
int i,c[N]={0};
printf("Input the string: ");
gets(a);
for(i=0;a[i]!='\0';i++)
{
b[a[i]]++;
}
for(i=0;a[i]!=0;i++)
{
if(c[a[i]] == 0)
{
printf("%c : %d\n",a[i],b[a[i]]);
c[a[i]]=1;
}
}
printf("\n");
return 0;
}
]]>
紼嬪簭濡備笅錛?br />
typedef struct{ float x; float y; } point; //瀹氫箟鐐圭殑鏁版嵁綾誨瀷
float distance(point,point); //涓ょ偣涔嬮棿璺濈鍑芥暟
float distance(point a,point b)
{
float dx= a.x - b.x, dy= a.y - b.y;
return sqrt(dx*dx + dy*dy);
}
//浠ヤ笂涓哄ご鏂囦歡 Point.h 鐨勫唴瀹?/span>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include "Point.h"
float randFloat()
{ return 1.0*rand()/RAND_MAX; } //浜х敓闅忔満鏁扮殑鍑芥暟
int main()
{
float d,N;
int i,j,cnt=0;
scanf("%f%f",&d,&N); //d涓鴻姹備袱鐐逛箣闂磋窛紱誨皬浜庣殑闀垮害錛孨涓烘祴璇曠殑鐐?nbsp;
point *a = (point *)malloc(sizeof(point)*N); //鍔ㄦ佺敓鎴愭暟鎹被鍨嬩負point鐨勬暟緇刟
for(j=i+1;j<N;j++)
if(distance(a[i],a[j])<d) //濡傛灉涓ょ偣涔嬮棿鐨勮窛紱誨皬浜巇錛岄偅涔坈nt鍔?
cnt++;
printf("%d edges shorter than %f\n",cnt,d); //杈撳嚭鏈夊灝戞潯杈圭殑闀垮害灝忎簬d
return 0;
}
float distance(point,point); //涓ょ偣涔嬮棿璺濈鍑芥暟
float distance(point a,point b)
{
float dx= a.x - b.x, dy= a.y - b.y;
return sqrt(dx*dx + dy*dy);
}
//浠ヤ笂涓哄ご鏂囦歡 Point.h 鐨勫唴瀹?/span>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include "Point.h"
float randFloat()
{ return 1.0*rand()/RAND_MAX; } //浜х敓闅忔満鏁扮殑鍑芥暟
int main()
{
float d,N;
int i,j,cnt=0;
scanf("%f%f",&d,&N); //d涓鴻姹備袱鐐逛箣闂磋窛紱誨皬浜庣殑闀垮害錛孨涓烘祴璇曠殑鐐?nbsp;
point *a = (point *)malloc(sizeof(point)*N); //鍔ㄦ佺敓鎴愭暟鎹被鍨嬩負point鐨勬暟緇刟
for(i=0;i<N;i++)
{
a[i].x = randFloat(); a[i].y = randFloat();
}
for(i=0;i<N;i++)for(j=i+1;j<N;j++)
if(distance(a[i],a[j])<d) //濡傛灉涓ょ偣涔嬮棿鐨勮窛紱誨皬浜巇錛岄偅涔坈nt鍔?
cnt++;
printf("%d edges shorter than %f\n",cnt,d); //杈撳嚭鏈夊灝戞潯杈圭殑闀垮害灝忎簬d
return 0;
}
]]>
//妯℃嫙鎶涚‖甯佺殑瀹為獙
#include<stdio.h>
#include<stdlib.h>
int heads() //榪斿洖0鎴栭潪0鍊?/span>
{
return rand() <RAND_MAX/2;
}
int main()
{
int i,j,cnt;
int N,M;
scanf("%d%d",&N,&M); //鎶涗竴鏋氱‖甯丯=32嬈★紝濡傛鍋歁=1000嬈¤繖鏍風殑瀹為獙
int *f=(int *)malloc((N+1)*sizeof(int));
for(j=1;j<=N;j++) //鍒濆鍖栨暟緇勫叏閮ㄤ負0鍊?/span>
f[j]=0;
for(i=1;i<M;i++,f[cnt]++) //寮濮嬫姏紜竵錛宖[cnt]璁板綍絎琧nt嬈℃姏紜竵鍑虹幇姝ｉ潰鐨勬鏁?/span>
for(cnt=1,j=1;j<=N;j++) //寮濮嬬涓杞叡32嬈＄殑鎶涚‖甯佸疄楠?/span>
if(heads()) cnt++; //濡傛灉鍑虹幇姝ｉ潰錛屽嵆heads()榪斿洖鍊間負1錛屽垯瀵瑰簲鐫f[cnt]++,鍚屾椂cnt++,姝ゅ鍒╃敤鏁扮粍绱㈠紩緇熻姝ｉ潰鍑虹幇嬈℃暟錛岃礋闈㈡暟緇勫煎緇堜負0
for(j=1;j<=N;j++)
{
printf("%2d ",j);
for(i=0;i<f[j];i+=10) printf("*"); //姝ｉ潰姣忓嚭鐜板崄嬈℃墦鍗頒竴涓槦鍙?/span>
printf("\n");
}
return 0;
}
#include<stdio.h>
#include<stdlib.h>
int heads() //榪斿洖0鎴栭潪0鍊?/span>
{
return rand() <RAND_MAX/2;
}
int main()
{
int i,j,cnt;
int N,M;
scanf("%d%d",&N,&M); //鎶涗竴鏋氱‖甯丯=32嬈★紝濡傛鍋歁=1000嬈¤繖鏍風殑瀹為獙
int *f=(int *)malloc((N+1)*sizeof(int));
for(j=1;j<=N;j++) //鍒濆鍖栨暟緇勫叏閮ㄤ負0鍊?/span>
f[j]=0;
for(i=1;i<M;i++,f[cnt]++) //寮濮嬫姏紜竵錛宖[cnt]璁板綍絎琧nt嬈℃姏紜竵鍑虹幇姝ｉ潰鐨勬鏁?/span>
for(cnt=1,j=1;j<=N;j++) //寮濮嬬涓杞叡32嬈＄殑鎶涚‖甯佸疄楠?/span>
if(heads()) cnt++; //濡傛灉鍑虹幇姝ｉ潰錛屽嵆heads()榪斿洖鍊間負1錛屽垯瀵瑰簲鐫f[cnt]++,鍚屾椂cnt++,姝ゅ鍒╃敤鏁扮粍绱㈠紩緇熻姝ｉ潰鍑虹幇嬈℃暟錛岃礋闈㈡暟緇勫煎緇堜負0
for(j=1;j<=N;j++)
{
printf("%2d ",j);
for(i=0;i<f[j];i+=10) printf("*"); //姝ｉ潰姣忓嚭鐜板崄嬈℃墦鍗頒竴涓槦鍙?/span>
printf("\n");
}
return 0;
}
]]>
#include<stdio.h>
#include<stdlib.h>
struct Stu
{
int score;
struct Stu *next;
};
typedef struct Stu Node;
int main()
{
int i;
Node *head,*p,*q;
head=(Node*)malloc(sizeof(Node)); //鍒涘緩澶寸粨鐐?/span>
if(head == NULL)
{
printf("Memory is not enough!");
return 0;
}
head->next=NULL;
for(i=0;i<10;i++)
{
p=(Node*)malloc(sizeof(Node)); //鍒涘緩涓涓柊緇撶偣p
if(p == NULL)
{
printf("no enough memory!");
return 0;
}
printf("Input the %dth student's score: ",i+1);
scanf("%d",&p->score); //杈撳叆鎴愮嘩
q=head;
while(q->next != NULL) //閬嶅巻閾捐〃
{
if(q->next->score < p->score) //濡傛灉鍙戠幇閾捐〃涓殑鏌愪釜鎴愮嘩姣斿綋鍓嶈緭鍏ユ垚緇╁皬錛屽氨璺沖嚭寰幆錛屽湪鍏跺墠闈㈡彃鍏ュ綋鍓嶈緭鍏ユ垚緇?/span>
break;
q=q->next; //緇х畫閬嶅巻鐩村埌閬嶅巻鐨勬垚緇╂瘮褰撳墠杈撳叆鐨勬垚緇╁皬
}
p->next=q->next; //榪欐槸褰撳墠鎴愮嘩鎻掑叆鍒伴摼琛ㄤ腑姣斿叾灝忕殑鎴愮嘩鍓嶉潰鐨勪唬鐮?/span>
q->next=p;
}
p=head->next;
while(p !=NULL)
{
printf("%d ",p->score);
p=p->next;
}
return 0;
}
#include<stdlib.h>
struct Stu
{
int score;
struct Stu *next;
};
typedef struct Stu Node;
int main()
{
int i;
Node *head,*p,*q;
head=(Node*)malloc(sizeof(Node)); //鍒涘緩澶寸粨鐐?/span>
if(head == NULL)
{
printf("Memory is not enough!");
return 0;
}
head->next=NULL;
for(i=0;i<10;i++)
{
p=(Node*)malloc(sizeof(Node)); //鍒涘緩涓涓柊緇撶偣p
if(p == NULL)
{
printf("no enough memory!");
return 0;
}
printf("Input the %dth student's score: ",i+1);
scanf("%d",&p->score); //杈撳叆鎴愮嘩
q=head;
while(q->next != NULL) //閬嶅巻閾捐〃
{
if(q->next->score < p->score) //濡傛灉鍙戠幇閾捐〃涓殑鏌愪釜鎴愮嘩姣斿綋鍓嶈緭鍏ユ垚緇╁皬錛屽氨璺沖嚭寰幆錛屽湪鍏跺墠闈㈡彃鍏ュ綋鍓嶈緭鍏ユ垚緇?/span>
break;
q=q->next; //緇х畫閬嶅巻鐩村埌閬嶅巻鐨勬垚緇╂瘮褰撳墠杈撳叆鐨勬垚緇╁皬
}
p->next=q->next; //榪欐槸褰撳墠鎴愮嘩鎻掑叆鍒伴摼琛ㄤ腑姣斿叾灝忕殑鎴愮嘩鍓嶉潰鐨勪唬鐮?/span>
q->next=p;
}
p=head->next;
while(p !=NULL)
{
printf("%d ",p->score);
p=p->next;
}
p=head;
while(p->next !=NULL)
{
q=p->next;
p->next=q->next;
free(q);
}
free(head);
while(p->next !=NULL)
{
q=p->next;
p->next=q->next;
free(q);
}
free(head);
return 0;
}
]]>
鎬濇兂錛歭en2涓哄瓙涓茬殑闀垮害錛岃緗彉閲?i =0, 鍒╃敤strncmp鍑芥暟灝唖tr+i 寮濮嬬殑len2涓瓧絎︿笌瀛愪覆substr榪涜姣旇緝錛屽鏋滅浉絳夛紝鍒檆ount鍔?錛屾鏃?i 鍔?len2錛屽鏋滀笉絳夛紝鍒?i 鍔?錛岀戶緇鎵俱?br />
浠ｇ爜嫻嬭瘯閫氳繃錛?br />
#include<stdio.h>
#include<string.h>
int totsubstrnum(char *str, char *substr);
int main()
{
char str[80],substr[80];
printf("Input string: ");
gets(str);
printf("Input substring: ");
gets(substr);
printf("count = %d\n",totsubstrnum(str,substr));
return 0;
}
int totsubstrnum(char *str, char *substr)
{
int i=0,count=0,len1,len2;
len1=strlen(str);
len2=strlen(substr);
while(i <= len1-len2)
{
if(strncmp(str+i,substr,len2) == 0)
{
count++;
i +=len2;
}
else
i++;
}
return (count);
}
#include<string.h>
int totsubstrnum(char *str, char *substr);
int main()
{
char str[80],substr[80];
printf("Input string: ");
gets(str);
printf("Input substring: ");
gets(substr);
printf("count = %d\n",totsubstrnum(str,substr));
return 0;
}
int totsubstrnum(char *str, char *substr)
{
int i=0,count=0,len1,len2;
len1=strlen(str);
len2=strlen(substr);
while(i <= len1-len2)
{
if(strncmp(str+i,substr,len2) == 0)
{
count++;
i +=len2;
}
else
i++;
}
return (count);
}
]]>
浠ｇ爜嫻嬭瘯閫氳繃錛?br />
#include<stdio.h>
#include<string.h>
void strlshif(char *s, int n);
void main()
{
char str[]="0123456789";
strlshif(str,3);
printf("%s\n",str);
}
void strlshif(char *s, int n)
{
int i,len;
char ch;
len=strlen(s);
for(i=0;i<n;i++)
{
ch=s[0];
strncpy(s,s+1,len-1);
s[len-1]=ch;
}
}
閭ｄ箞鑻ユ槸涓嶇敤strncpy鍑芥暟鍔熻兘錛屽浣曚嬌鎸囧畾鐨勫瓧絎︿覆宸︾Щn浣嶏紵
浠ｇ爜嫻嬭瘯閫氳繃錛屽涓嬶細
#include<string.h>
void strlshif(char *s, int n);
void main()
{
char str[]="0123456789";
strlshif(str,3);
printf("%s\n",str);
}
void strlshif(char *s, int n)
{
int i,len;
char ch;
len=strlen(s);
for(i=0;i<n;i++)
{
ch=s[0];
strncpy(s,s+1,len-1);
s[len-1]=ch;
}
}
閭ｄ箞鑻ユ槸涓嶇敤strncpy鍑芥暟鍔熻兘錛屽浣曚嬌鎸囧畾鐨勫瓧絎︿覆宸︾Щn浣嶏紵
浠ｇ爜嫻嬭瘯閫氳繃錛屽涓嬶細
#include<stdio.h>
#include<string.h>
int main()
{
char str[]="0123456789";
char sstr[80]={0}; //浣跨敤涓鏁扮粍鍌ㄥ瓨縐誨姩鍚庣殑瀛楃涓?/span>
char *p;
int c,j;
static int i,n;
p=&str[0];
printf("input the number: \n");
scanf("%d",&n); //杈撳叆瑕佸乏縐葷殑鍓峮涓瓧絎︼紝鍗沖皢榪檔涓瓧絎︾Щ鍔ㄥ埌鏈鍚庨潰
c=n;
while( c-- && p++ ); //鎵懼埌娌℃湁縐誨姩榪囩殑鍓╀笅鐨勫叏閮ㄥ瓧絎︼紝鎶婂畠浠偍瀛樺湪鏁扮粍sstr 涓?/span>
for(i=0;i<strlen(str)-n;i++)
{
sstr[i]= *p;
p++;
}
p=&str[0]; //鎸囬拡鎸囧悜絎竴涓瓧絎?/span>
for(j=i;j<strlen(str);j++) //灝嗚縐誨姩鐨勫瓧絎︿竴涓竴涓湴“鎺?#8221;鍒版暟緇剆str鍚庨潰
{
sstr[j]= *p;
p++;
}
sstr[j]='\0'; //鏈鍚庡瓧絎︿覆緇撳熬鐢?\0'
printf("%s",sstr);
return 0;
}
#include<string.h>
int main()
{
char str[]="0123456789";
char sstr[80]={0}; //浣跨敤涓鏁扮粍鍌ㄥ瓨縐誨姩鍚庣殑瀛楃涓?/span>
char *p;
int c,j;
static int i,n;
p=&str[0];
printf("input the number: \n");
scanf("%d",&n); //杈撳叆瑕佸乏縐葷殑鍓峮涓瓧絎︼紝鍗沖皢榪檔涓瓧絎︾Щ鍔ㄥ埌鏈鍚庨潰
c=n;
while( c-- && p++ ); //鎵懼埌娌℃湁縐誨姩榪囩殑鍓╀笅鐨勫叏閮ㄥ瓧絎︼紝鎶婂畠浠偍瀛樺湪鏁扮粍sstr 涓?/span>
for(i=0;i<strlen(str)-n;i++)
{
sstr[i]= *p;
p++;
}
p=&str[0]; //鎸囬拡鎸囧悜絎竴涓瓧絎?/span>
for(j=i;j<strlen(str);j++) //灝嗚縐誨姩鐨勫瓧絎︿竴涓竴涓湴“鎺?#8221;鍒版暟緇剆str鍚庨潰
{
sstr[j]= *p;
p++;
}
sstr[j]='\0'; //鏈鍚庡瓧絎︿覆緇撳熬鐢?\0'
printf("%s",sstr);
return 0;
}
]]>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
void substr(char *s, int startloc,int len)
{
if((startloc < 0) || (startloc >= strlen(s)) || (len<0))
{
printf("input error!");
exit(0);
}
int i,c=0;
char sstr[80];
while(*s !='\0')
{
if(c!=startloc)
{
++c;
s++;
}
else
{
for(i=0;i<len;i++)
{
sstr[i]= *s;
s++;
}
sstr[i]='\0';
break;
}
}
printf("%s",sstr);
}
int main()
{
char str[80];
int s,l;
printf("Input string: ");
gets(str);
printf("Start Location: ");
scanf("%d",&s);
printf("Substring length: ");
scanf("%d",&l);
substr(str,s,l);
return 0;
}
]]>
浠ｇ爜嫻嬭瘯閫氳繃錛?br />
#include<stdio.h>
void mystrcat( char *str,char *destr)
{
while(*str !='\0')
str++;
while(*destr !='\0')
{
*str = *destr;
str++;
destr++;
}
*str = '\0';
}
int main()
{
char str[30],destr[30];
printf("input string and substring: ");
scanf("%s%s",str,destr);
mystrcat(str,destr);
printf("%s",str);
return 0;
}
void mystrcat( char *str,char *destr)
{
while(*str !='\0')
str++;
while(*destr !='\0')
{
*str = *destr;
str++;
destr++;
}
*str = '\0';
}
int main()
{
char str[30],destr[30];
printf("input string and substring: ");
scanf("%s%s",str,destr);
mystrcat(str,destr);
printf("%s",str);
return 0;
}
]]>
#########
#######
#####
###
#
浠ｇ爜嫻嬭瘯閫氳繃錛?br />
#include<stdio.h>
int main()
{
int n,s,i,j,k,c=0;
scanf("%d",&n);
s=2*n-1;
for(i=0;i<n;i++)
{
if(c!=0) //濡傛灉涓嶆槸絎竴琛岋紝鍗硈瑕佸噺2錛屼綔涓鴻緭鍑?鐨勪釜鏁?/span>
s=s-2;
for(k=0;k<c;k++)
{
printf(" ");
}
for(j=0;j<s;j++)
{
printf("#");
}
for(k=0;k<c;k++)
{
printf(" ");
}
c++;
printf("\n");
}
return 0;
}
int main()
{
int n,s,i,j,k,c=0;
scanf("%d",&n);
s=2*n-1;
for(i=0;i<n;i++)
{
if(c!=0) //濡傛灉涓嶆槸絎竴琛岋紝鍗硈瑕佸噺2錛屼綔涓鴻緭鍑?鐨勪釜鏁?/span>
s=s-2;
for(k=0;k<c;k++)
{
printf(" ");
}
for(j=0;j<s;j++)
{
printf("#");
}
for(k=0;k<c;k++)
{
printf(" ");
}
c++;
printf("\n");
}
return 0;
}
]]>