


﹥ 癫⒊倒⒋啲生萿﹎還會不會_洅í繼х續﹎﹖
这样有错吗?
#include <stdio.h>
#define Func(A,B,n) (i>2)? 1:(A*Func(n-1)+B*Func(n-2))%7
int A,B;
int main(void)
{
int n,f,i;
printf("input:");
while(3==scanf("%d%d%d",&A,&B,&n)&&A!=0&&B!=0&&n!=0)
for(i=1;i<=n;i++)
{
f=Func(A,B,n);
printf("Output:%d\n",f);
printf("input:");
}
return 0;
}
错可能不会,但绝对会超时.
这样有错吗?
#include <stdio.h>
#define Func(A,B,n) (i>2)? 1:(A*Func(n-1)+B*Func(n-2))%7
int A,B;
int main(void)
{
int n,f,i;
printf("input:");
while(3==scanf("%d%d%d",&A,&B,&n)&&A!=0&&B!=0&&n!=0)
for(i=1;i<=n;i++)
{
f=Func(A,B,n);
printf("Output:%d\n",f);
printf("input:");
}
return 0;
}
那这样有没有错嘛
#include <stdio.h>
int a, b;
int main(void)
{
long n;
long sum( long n);
while(scanf("%d%d%ld", &a, &b, &n) == 3&&(a != 0||b != 0||n != 0))
{
printf("%ld\n", sum(n));
}
return 0;
}
long sum( long n)
{
if(n == 1||n == 2)
return 1;
else
return (a*sum(n - 1) + b*sum(n - 2))%7;
}
别的方法还没有想到啊!