C语言编程题，考试急用，请高手帮忙啊！！！！ 急！！！高难度c语言编程题，高手请进帮忙！！！
\u8bf7\u9ad8\u624b\u5e2e\u5fd9\u89e3\u51b3\u4e00\u9053C\u8bed\u8a00\u7684\u7f16\u7a0b\u9898\uff01~~\u6025\u554a\uff01~~\u4ee3\u7801\u53ca\u5176\u4e0d\u89c4\u8303\uff0c\u9996\u5148\u7ed9\u4f60\u4fee\u6539\u89c4\u8303\uff0c\u7136\u540e\u7ed9\u4f60\u7f16\u4e0a\u884c\u53f7\uff0c\u7ed9\u4f60\u8bf4
1 int findStr(char *str,char *substr)
2 {
3 int n;
4 char *p , *r;
5 n=0;
6 while ( *str )
7 {
8 p=str;
9 r=substr;
10 while(*r)
11 if(*r==*p) { r++; p++; }
12 else break;
13 if(*r=='\0')
14 n++;
15 str++;
16 }
17 return n;
18}
====================================================================
\u9996\u5148\u6b64\u9898\u4e0d\u7528\u6307\u9488\u4f5c\uff0c\u5f88\u9ebb\u70e6\uff0c\u800c\u4e14\u51fd\u6570\u539f\u5f62\u90fd\u8981\u4fee\u6539\uff0c\u8981\u6dfb\u52a0\u4e24\u4e2a\u5b57\u7b26\u4e32\u957f\u5ea6\u53c2\u6570\uff0c\u624d\u53ef\u4ee5\u4e0d\u518d\u4f7f\u7528\u6307\u9488\u3002\u8fd8\u662f\u7ed9\u4f60\u8bb2\u89e3\u8fd9\u4e2a\u7a0b\u5e8f\u7684\u6d41\u7a0b\u5427\u3002
6 while ( *str )
\u8fd9\u4e2a\u5faa\u73af\u662f\u4ece\u6e90\u4e32\u7b2c\u4e00\u4e2a\u5b57\u8282\u5f00\u59cb\uff0c\u4e00\u76f4\u78b0\u5230'\0'\u7ed3\u675f\uff0c\u56e0\u4e3a'\0'\u7684ASCII\u7801\u4e3a0,\u4e5f\u5c31\u662fNULL\u3002\u4e0b\u9762\u4ee3\u7801\u5df2\u77e5\u9053Line 16\u90fd\u662f\u8fd9\u4e2a\u5faa\u73af\u4f53\u3002
8 p=str;
9 r=substr;
\u53d6\u5f97\u4e24\u4e2a\u5b57\u4e32\u5f53\u524d\u6307\u9488\uff0c\u4e3a\u4f5c\u6bd4\u8f83\u51c6\u5907\uff0c
10 while(*r)
11 if(*r==*p) { r++; p++; }
12 else break;
\u8fd9\u4e2a\u5faa\u73af\u7684\u6761\u4ef6\u548cLine 6\u5dee\u4e0d\u591a\u3002\u5176\u4e2d\u8fd9\u4e2a\u5faa\u73af\u662f\u8fd9\u6837\u7684\uff0c\u5c06\u8fde\u4e2a\u5b57\u4e32\u7684\u7b2c\u4e00\u4e2a\u5b57\u8282\u5f00\u59cb\u6bd4\u8f83\uff0c\u5982\u679c\u76f8\u7b49\u5219\u6bd4\u8f83\u4e0b\u4e00\u4e2a\uff0c\u4e00\u76f4\u5230r\u7ed3\u675f\u8fd8\u662f\u76f8\u7b49\u7684\uff0c\u8fd9\u4e2a\u5b57\u4e32\u5c31\u5728str\u4e2d\u51fa\u73b0\u8fc7\uff0c\u5426\u5219\u5230Line 12\u6267\u884c\uff0c\u8df3\u51fa\u5faa\u73af\u3002
11 if(*r==*p) { r++; p++; } \u5982\u679c\u8fd9\u4e24\u4e2a\u5b57\u8282\u76f8\u7b49\uff0c\u5219\u6bd4\u8f83\u4e0b\u4e00\u4e2a\u5b57\u3002
12 else break;\u4e0d\u76f8\u7b49\uff0c\u8df3\u51fa\u5faa\u73af\u3002
\u4ee5\u4e0b\u8fd9\u4e24\u53e5\u662f\u5224\u65ad\u521a\u624d\u5faa\u73af\u7ed3\u675f\u7684\u539f\u56e0
13 if(*r=='\0') \u5982\u679cr\u6307\u9488\u6307\u5411\u7684\u5b57\u8282\u662f'\0'\uff0c\u90a3\u4e48\u8868\u793a\u6574\u4e2a\u5b57\u7b26\u4e32\u90fd\u5339\u914d\u4e86\uff0c\u56e0\u6b64\u5c31\u8ba9\u8ba1\u6570\u5668n\u81ea\u52a01\uff0c\u7136\u540e\u4ece\u6e90\u4e32\u4e0b\u4e00\u4e2a\u5b57\u8282\u5f00\u59cb\u518d\u6b21\u5339\u914d\u3002
14 n++;
15 str++;
\u77e5\u9053str\u6307\u5411\u5b57\u7b26\u4e32\u7ed3\u675f\uff0c\u7a0b\u5e8f\u7ed3\u675f\u4e86\u3002
====================================================================
\u8fd8\u6709\u697c\u4e3b\u8fde\u6307\u9488\u90fd\u770b\u4e0d\u61c2\uff0c\u90a3\u5c31\u5371\u9669\u4e86\u3002
\u5f88\u7b80\u5355
#include
void main()
{
int ix,iy;
printf("please input the data of x:");
scanf("%d",&ix);
if(x0)
printf("the y is :%d",ix);
if(x==0)
{
iy=ix-1;
printf("the y is:%d"&iy);
}
if(x<0&&x<10)
printf("the y is: 1");
printf("input any key to quit!");
gech();
}
\u8fd9\u662fif\u7684
#include
void main()
{
int ix,iy,entrance;
printf("input the x:");
scanf("%d",ix);
if(x0)
entrance=1;
if(x==0)
{
entrance=2;
}
if(x<0&&x<10)
entrance=3;
switch(entrance)
case 1: printf("the y is :%d",ix);break;
case 2: printf("the y is :%d,ix-1");break;
case 3: printf("the y is : 1");break;
printf("input any key to quit!");
getch();
}
\u5c31\u662f\u8fd9\u4e2a\u4e86\u3002
#include<stdio.h>
long fun(long int x)
{
long ret=0;
while(x){
if(x%10%2){
ret= ret*10+ x%10;
}
x=x/10;
}
return ret;
}
void main()
{
long a,b;
printf("Please input a long int num:");
scanf("%ld",&a);
b=fun(a);
printf("b=%ld\n",b);
}
2.
#include<math.h>
void fun(char *s,char *t,char *p)
{
int i=0,j=0,k=0;
for(i=0;i<50;i++){
p[i]=0;
}
i=0;
while(t[i]){
j=0;
while(s[j]){
if(t[i]!=s[j]){
j++;
}else break;
}
k=0;
while(p[k]){
if(t[i]!=p[k]){
k++;
}else break;
}
if(s[j]==0 && p[k]==0){
p[k]=t[i];
}
i++;
}
}
void main()
{
char s1[50],s2[50],s3[50];
gets(s1);gets(s2);
fun(s1,s2,s3);
puts(s3);
}
3.
int fun(int m)
{
int sum=0,a=0,i;
if(m==1) return 1;
for(i=1;;i++){
a=a+i;
sum =sum+a;
if(sum>m)
return i-1;
}
}
void main()
{int x;
scanf("%d",&x);
printf("n=%d\n",fun(x));
}
4.
#define N 10
void fun(int *x,int n)
{
int i,min_n,min;
min=x[0];
min_n=0;
for(i=1;i<n;i++){
if(x[i]<min){
min=x[i];
min_n=i;
}
}
i=x[0];
x[0]=x[min_n];
x[min_n]=i;
min=x[1];
min_n=1;
for(i=2;i<n;i++){
if(x[i]<min){
min=x[i];
min_n=i;
}
}
i=x[1];
x[1]=x[min_n];
x[min_n]=i;
}
main()
{int a[N],i;
for(i=0;i<N;i++)
scanf("%d",a+i);
fun(a,N);
for(i=0;i<N;i++)
printf("%d ",a[i]);
printf("\n");
}
5.
#include <math.h>
long fun(int high,int n)
{
int sum=0,count=0,k,i;
for(high--;high>=2;high--){
k=0;
for(i=2;i<=sqrt(high+1);i++){
if(high%i==0){
k=1;
break;
}
}
if(k==0){
count++;
sum += high;
}
if(count==n) break;
}
return sum;
}
void main()
{int k,n;
scanf("%d%d",&k,&n);
printf("sum=%ld\n",fun(k,n));
}
6.
int fun(int *a,int n)
{
int i,j;
for(i=j=0,j;i<n;i++){
if(!(a[i]%2)){
a[j]=a[i];
j++;
}
}
a[j]=-1;
return j;
}
void main()
{int x[15],i,n;
for(i=0;i<15;i++)
scanf("%d",x+i);
n=fun(x,15);
for(i=0;x[i]!=-1;i++)
printf("%d ",x[i]);
printf("n=%d\n",n);
}
绛旓細1. 鐢熸垚鍓10涓鏁板苟姹傚叾骞冲潎鍊 include <conio.h> include <stdio.h> int main( void ){ int i,k,sum=0;int a[10]={0};float ave=0.0;printf("璇疯緭鍏: \n");for(i=0;i<10;){ fflush(stdin);scanf("%d",&k);if(k%2==1) a[i++]=k;} printf("鍓10涓鏁颁负: \n...
绛旓細{ int a,b,c;printf("杈撳叆涓変釜鏁帮細");scanf("%d%d%d",&a,&b,&c);if(a>b&&a>c)printf("鏈澶у间负锛%d",a);else if(b>a&&b>c)printf("鏈澶у间负锛%d",b);else printf("鏈澶у间负锛%d",c);锝
绛旓細绗竴棰:include <stdio.h>#include #include <stdlib.h>int main(void){ int num[10] = {0}; bool sort[11] = {false}; srand(time(NULL)); printf("澶勭悊鍓:"); for(size_t i = 0; i != 10; ++i) { num[i] = rand() % 10 + 1; printf("%-...
绛旓細#include <iostream>using namespace std;//绗竴闂void func_question_one(void){int a[5] = {0};int inx;//杈撳叆5涓暣鏁癴or (inx=0; inx!=5; ++inx)cin>>a[inx];//鍋囪娉曟渶澶ф暟鍜屾渶灏忔暟閮芥槸a[0]int min = a[0], max=a[0];int min_pos = 0, max_pos = 0;for (inx...
绛旓細long ret=0;while(x){ if(x%10%2){ ret= ret*10+ x%10;} x=x/10;} return ret;} void main(){ long a,b;printf("Please input a long int num:");scanf("%ld",&a);b=fun(a);printf("b=%ld\n",b);} 2.include<math.h> void fun(char *s,char *t,char *p){ in...
绛旓細else printf(鈥&&&&鈥);A)### B)&&&& C)###&&&& D)鏈夎娉曢敊璇紝鏃犺緭鍑虹粨鏋 銆恔=-3,鍒ゆ柇k<=0鎴愮珛,鎵浠ユ墽琛宲rintf(鈥###鈥);璇彞銆戜笁銆绋嬪簭璁捐棰 2銆佹眰1+2+3+3+鈥︹+100鐨勫笺傦紙瑕佹眰锛氬垎鍒埄鐢╳hile寰幆銆乨o鈥hile寰幆銆乫or寰幆涓夌鏂规硶鍒嗗埆瀹炵幇缂栫▼锛/// while寰幆 ...
绛旓細1.#include<stdio.h> void main(){ int max(int x,int y,int z); //澹版槑姹傛渶澶у肩殑鍑芥暟 int a,b,c,d; //瀹氫箟鍙橀噺 scanf("%d,%d,%d",&a,&b,&c); //杈撳叆涓変釜鏁存暟 d=max(a,b,c); //姹備笁涓暣鏁扮殑鏈澶у printf("max=%d\n",d); //杈撳嚭鏈澶у } int max(int x,...
绛旓細int a[10];int i;int max = 0;int min = 100;int maxi=0;int mini =0;for(i=0;i<10;i++){ scanf("%d",&a[i]);if(a[i]<min){ min = a[i];mini = i;} if(a[i]>max){ max = a[i];maxi = i;} } int sum =0;for(i=0;i<10;i++){ if(i != mini &&...
绛旓細main(){ int i;for(i=1000;i<10000;i++){ if(search(i)) printf("%d ",i);} } int search(int i){ int j,k;j=i/100;k=i%100;if(i==(k+j)*(k+j)) return 1;else return 0;} //4 鏈変竴涓惈鏈10涓厓绱犵殑鏁村瀷鏁扮粍锛岀紪绋灏嗗叾鍏冪礌鎸夐嗗簭瀛樻斁 include<stdio.h> main()...
绛旓細return n>1;} int main(){ int a[10],i,j,n=10,t;for(i=0; i<n; i++)scanf("%d",&a[i]);for(i=0; i<n; i++)if(isprime(a[i])){ for(j=i; j<n-1; j++)a[j]=a[j+1];n--;} for(i=0; i<n-1; i++)for(j=0; j<n-1-i; j++)if(a[j]>a[j...
