id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
14,200 |
void main()
{
int a,b,c,i;
int n,m;
double sum;
scanf("%d",&n);
while (n>0)
{
scanf("%d",&m);
sum=0;
a=1;b=2;
for (i=1;i<=m;i++)
{
sum+=(double)(b)/a;
c=b+a;
a=b;
b=c;
}
printf("%.3f\n",sum);
n--;
}
}
|
29
|
14,201 |
void deal(int n)
{
double a, b;
a = 2.0;
b = 1.0;
double sum;
sum = 0.0;
int i;
for(i = 0; i < n; i ++)
{
sum += a / b;
double t;
t = a;
a = a + b;
b = t;
}
printf("%.3lf\n", sum);
}
int main()
{
int m;
scanf("%d", &m);
int i;
for(i = 0; i < m; i ++)
{
int n;
scanf("%d", &n);
deal(n);
}
return 0;
}
|
29
|
14,202 |
void main()
{
float F_num(int n);
int m,i=0,j=1;
int c[1000];
float sum=0.0;
scanf("%d",&m);
while (i<m)
{
scanf("%d",&c[i]);
i++;
}
i=0;
while(i<m)
{
while (j<c[i]+1)
{
sum+=(F_num(j+1)/F_num(j));
//printf("%lf\n",F_num(j+1)/F_num(j));
j++;
}
printf("%.3f\n",sum);
sum=0.0;
j=1;
i++;
}
}
float F_num(int n)
{
int a=1,b=0,c,i=0;
while (i<n+1)
{
c=a+b;
a=b;
b=c;
i++;
}
return (c*1.0);
}
|
29
|
14,203 |
//**********************************
//**** ?????? *****
//**** 1200016612 *****
//** ?????(8-4) ????**
//**********************************
int main() //?????
{
int m=0,n=0,i=0,j=0,t=0,p=0; //????m?n???????i?j
double d=0,sum=0,x1=2,y1=1,x2=3,y2=2; //??d????????????sum?????????x1,y1,x2,y2??????????
cin>>m;
for(i=0;i<m;i++){ //????????
cin>>n;
if(n==1){sum=2;} //?????????????
else {
sum=3.5; //??????
for(j=3;j<=n;j++){ //???????????????sum
t=x2;p=y2;
x2=x2+x1;
y2=y2+y1;
x1=t;y1=p;
d=x2/y2;
sum=sum+d;
}
x1=2;y1=1;x2=3;y2=2; } //?x1,x2,y1,y2??????????
printf("%.3f\n",sum); //?????
}
return 0;
}
|
29
|
14,204 |
int main(int argc, char* argv[])
{
int m,i,j,e;
int a[100];
float s,q,w;
scanf("%d",&m);
for (i=0;i<m;i++)
{
scanf("%d",&a[i]);
q=2,w=1,s=0;
for (j=1;j<=a[i];j++)
{
s+=q/w;
e=q;
q=q+w;
w=e;
}
printf("%.3f\n",s);
}
return 0;
}
|
29
|
14,205 |
int main()
{
int n,i,j,sz[1000];
double result[1000]={0};
struct p{
int a,b;
double c;
}p[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&sz[i]);
p[0].a=2;
p[0].b=1;
p[0].c=(double)p[0].a/p[0].b;
p[1].a=3;
p[1].b=2;
p[1].c=(double)p[1].a/p[1].b;
for(i=0;i<n;i++)
{
if(sz[i]==1)
printf("%.3lf\n",p[0].c);
else if(sz[i]==2)
printf("%.3lf\n",p[0].c+p[1].c);
else
{
for(j=2;j<sz[i];j++)
{
p[j].a=p[j-1].a+p[j-2].a;
p[j].b=p[j-1].b+p[j-2].b;
p[j].c=(double)p[j].a/p[j].b;
result[i]+=p[j].c;
}
printf("%.3lf\n",p[0].c+p[1].c+result[i]);
}
}
return 0;
}
|
29
|
14,206 |
int main(){
int b[1000],c[1000],n,m,i,j,k;
double a[1000],num[1000];
scanf("%d",&m);
b[0]=2;
b[1]=3;
c[0]=1;
c[1]=2;
a[0]=1.0*b[0]/c[0];
a[1]=1.0*b[1]/c[1];
for(j=0;j<m;j++){
i=2;
num[j]=0;
scanf("%d",&n);
while(i>=2&&i<n){
b[i]=b[i-1]+b[i-2];
c[i]=c[i-1]+c[i-2];
a[i]=1.0*b[i]/c[i];
i++;
}
for(k=0;k<n;k++){
num[j]=num[j]+a[k];
}
printf("%.3lf\n",num[j]);
}
return 0;
}
|
29
|
14,207 |
int main()
{
int m,n,a,b,q;
double s=0;
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d",&n);
s=0;
for(int h=0;h<n;h++){
if(h==0){ a=2;
b=1;}
else{
q=a;
a=a+b;
b=q;}
s=s+a*1.0/b;
}
printf("%.3lf\n",s);
}
return 0;
}
|
29
|
14,208 |
int main()
{
int m,n,i,j;
double a[100],b[100],c[100],sum;
a[0]=1;
a[1]=2;
b[1]=1;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n);
sum=0;
for(j=0;j<n;j++)
{
a[j+2]=a[j]+a[j+1];
b[j+2]=a[j+1];
sum+=a[j+1]/b[j+1];
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,209 |
int main()
{
int m,i,n[1000];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&(n[i]));
}
int sz[1000];
double xsz[1000];
sz[0]=1;
sz[1]=2;
xsz[0]=(sz[1])/(sz[0]);
int k;
double sum[1000];
for(i=0;i<m;i++)
{
sum[i]=xsz[0];
for(k=1;k<(n[i]);k++)
{
sz[k+1]=sz[k]+sz[k-1];
xsz[k]=(sz[k+1])*1.0/(sz[k]);
sum[i]+=xsz[k];
}
printf("%.3lf\n",sum[i]);
}
return 0;
}
|
29
|
14,210 |
int main()
{
int m,n;
double shang[100],sum=0;
int fenzi[100],fenmu[100];
int i,j;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
fenzi[0]=2;
fenmu[0]=1;
scanf("%d",&n);
for(j=0;j<n;j++)
{
if(j==0)
{
fenzi[0]=2;
fenmu[0]=1;
sum=2;
}
else
{
fenzi[j]=fenzi[j-1]+fenmu[j-1];
fenmu[j]=fenzi[j-1];
shang[j]=1.0*fenzi[j]/fenmu[j];
sum=sum+shang[j];
}
}
printf("%.3lf\n",sum);
sum=0;
}
return 0;
}
|
29
|
14,211 |
int main()
{
int m,n;
double x;
scanf("%d",&m);
for(int i=1;i<=m;i++){
scanf("%d",&n);
int sz[n+1];
for(int j=0;j<n+1;j++){
sz[j]=sz[j-1]+sz[j-2];
sz[0]=1;
sz[1]=2;
}
x=0;
for(int j=1;j<n+1;j++){
x+=1.0*sz[j]/sz[j-1];
}
printf("%.3lf\n",x);
}
return 0;
}
|
29
|
14,212 |
void main()
{
double sum[199]={0},a[199];
int n,i,m,j;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&m);
sum[j]=2;
for(i=1;i<m;i++)
{
a[0]=2;
a[i]=1+1/a[i-1];
sum[j]+=a[i];
}
}
for(j=0;j<n;j++)
{
printf("%.3lf\n",sum[j]);
}
}
|
29
|
14,213 |
int main(void){
int m;
scanf("%d", &m);
while(m--){
int n, i;
double res = 0;
double temp1 = 1.0, temp2 = 2.0;
scanf("%d", &n);
for(i = 0; i < n; ++i){
res = res + temp2/temp1;
temp2 += temp1;
temp1 = temp2 - temp1;
}
printf("%.3lf\n", res);
}
}
|
29
|
14,214 |
int main()
{
int m,n,i;
cin>>m;
for(i=1;i<=m;i++)
{
cin>>n;
double a=1,b=1,c=2,d=0,e=0,f;
for(f=1;f<=n;f++)
{
d=d+c/b;//??
e=b;//????b???e
b=c;//????c???b
c=c+e;//???c?????b+c
}
printf("%.3f\n",d);
}
return 0;
}
|
29
|
14,215 |
int main(){
int m;
scanf("%d",&m);
int i;
for(i=0;i<m;i++)
{
int n;
scanf("%d",&n);
int a=2,b=1,k,e;
double sum=0;
for(k=1;k<=n;k++)
{
sum+=(double)a/b;
e=a;
a=a+b;
b=e;
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,216 |
int main()
{
double a[1000],b[1000];
double c[1000];
double sum=0;
int n,m,i,j;
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%d",&n);
a[0]=2,b[0]=1;
sum=2.0;
for(i=1;i<n;i++)
{
a[i]=a[i-1]+b[i-1];
b[i]=a[i-1];
c[i]=a[i]/b[i];
sum+=c[i];
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,217 |
int main()
{
double x;
int i,j,m,n,j1,j2;
scanf("%d",&m);
double a[100];
for(i=0;i<m;i++)
{
x=0;
scanf("%d",&n);
a[0]=1,a[1]=2;
for(j=2;j<=n;j++)
{
a[j]=a[j-2]+a[j-1];
}
for(j=0;j<n;j++)
{
x=x+a[j+1]/a[j];
}
printf("%.3lf\n",x);
}
return 0;
}
|
29
|
14,218 |
int main(){
int i,j,m;
int d[100];
double a,b,e,s=0;
scanf("%d",&m);
for(i=0;i<m;i++){
a=2.0;b=1.0;
scanf("%d",&d[i]);
for(j=0;j<d[i];j++){
s+=a/b;
e=b;
b=a;
a=a+e;
}
printf("%.3lf\n",s);
s=0;
}
return 0;
}
|
29
|
14,219 |
int main(){
int n;
scanf("%d",&n);int m;float a[100];int b[100][100];int c[100][100];
for(int d=0;d<n;d++)
{a[d]=3.5000000;}
for(int i=0;i<n;i++){
scanf("%d",&m);
for(int j=0;j<m;j++)
{
if(j==0){b[i][j]=2;}
if(j==1){b[i][j]=3;}
if(j>=2){b[i][j]=b[i][j-1]+b[i][j-2];}
if(m!=1&&j>1){a[i]+=1.0000*b[i][j]/b[i][j-1];}
if(m==1){a[i]=2.0000000;}
}
}
for(int o=0;o<n;o++)
{
printf("%.3f\n",a[o]);
}
return 0;
}
|
29
|
14,220 |
int main(){
int m,i;
scanf("%d",&m);
double sz[m];
for(i=0;i<m;i++){
int n;
scanf("%d",&n);
int j;
double sum=0.0;
int a=2,b=1,e;
for(j=0;j<n;j++){
double t;
t=1.0*a/b;
sum+=t;
e=b;
b=a;
a=e+b;
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,221 |
int main(){
int m,i,j;
double a=2.000,b=1.000;
int c[100];
double s[100];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&c[i]);
}
for(i=0;i<m;i++){
s[i]=0;
}
for(i=0;i<m;i++){
for(j=0;j<c[i];j++){
s[i]+=1.0*a/b;
a=a+b;
b=a-b;
}
printf("%.3lf\n",s[i]);
a=2.000;
b=1.000;
}
return 0;
}
|
29
|
14,222 |
int main()
{
int n,i,j,o;
float a=1,b=1,c=0,d=1,p,s=0,e;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&o);
s=0;
a=1;
b=1;
c=0;
d=1;
for(i=0;i<o;i++)
{
p=(a+b)/(c+d);
s=s+p;
e=a;
a=b;
b=e+a;
e=c;
c=d;
d=e+c;
}
printf("%.3f\n",s);
}
return 0;
}
|
29
|
14,223 |
int main()
{
int m,n[100],i,str;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n[i]);
}
for(i=0;i<m;i++)
{
double sum=0;
int p=1,q=2,t=0;
while(t<n[i])
{
sum+=(double)q/p;
str=q;
q=p+q;
p=str;
t++;
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,224 |
int main(){
int m,i,n,k;
scanf("%d",&m);
double res,x,y;
x=1.0*2/1;
y=x+1.0*3/2;
int sz1[1000],sz2[1000];
sz1[0]=2;
sz1[1]=3;
sz2[0]=1;
sz2[1]=2;
for(i=0;i<m;i++){
scanf("%d",&n);
if(n==1){
printf("%.3lf\n",x);
}else if(n==2){printf("%.3lf\n",y);
}else{
res=3.500;
for(k=2;k<n;k++){
sz1[k]=sz1[k-1]+sz1[k-2];
sz2[k]=sz2[k-1]+sz2[k-2];
res+=(1.0*sz1[k])/sz2[k];
}
printf("%.3lf\n",res);
}
}
return 0;
}
|
29
|
14,225 |
int main()
{
int m=0,i,n,t;
int x[100];
double c[1000];
double sum=0;
scanf("%d",&m);
for(i=0;i<m;i++)
{
int a=1,b=2;
sum=0;
scanf("%d",&x[i]);
for(n=0;n<x[i];n++)
{
c[n]=b/(a*1.0);
t=a;
a=b;
b=t+b;
sum=sum+c[n];
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,226 |
double sum(int n){
int a=1,b=2;
double c;
double h=0;
int i=1;
int e;
while(i<=n){
c=(1.0*b)/(1.0*a);
h+=c;
e=a;
a=b;
b+=e;
i++;
}
return h;
}
int main()
{
int m,n;
double hs;
scanf("%d",&m);
for(int mm=0;mm<m;mm++){
scanf("%d",&n);
hs=sum(n);
printf("%.3lf",hs);
if(mm!=m-1){
printf("\n");
}
}
return 0;
}
|
29
|
14,227 |
int fei(int n) {
if(n == 1) return 1;
if(n == 2) return 2;
if(n > 2) {
int a = fei(n - 1) + fei(n - 2);
return a;
}
}
int main() {
int m;
cin >> m;
for(int k = 0; k < m; k++) {
int n;
cin >> n;
int a = 1; /* to calculate the numerator */
int b = 1; /* to calculate the denominator */
double t; /* to calculate the item of the formula */
double sum = 0;
for(int i = 1; i <= n; i++) {
a = fei(i + 1);
b = fei(i);
t = (double)(a) / (double)(b);
sum += t;
}
printf("%.3lf\n", sum);
}
return 0;
}
|
29
|
14,228 |
double f(int n){
double a=1,b=2,c;
int i=1;
double d=2.000;
if(n==1)
return d;
while(i<n){
c=a+b;
a=b;b=c;
d+=c/a;
i++;
}
return d;
}
int main(){
int m,i,sz[100];
double s;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&(sz[i]));
}
for(i=0;i<m;i++){
printf("%.3lf\n",f(sz[i]));
}
return 0;
}
|
29
|
14,229 |
int main()
{
int m, n;
cin >> m;
int i;
for ( i = 1; i <= m; i++ )
{
cin >> n;
double a[1000][2];
int j;
a[0][1] = 1;
a[1][1] = 2;
for ( j = 2; j < n; j++ )
a[j][1] = a[j-1][1] + a[j-2][1];
a[0][0] = 2;
for ( j = 1; j < n; j++ )
a[j][0] = a[j-1][0] + a[j-1][1];
double sum = 0, mul = 1;
for ( j = 0; j < n; j++ )
mul = mul * a[j][1];
for ( j = 0; j < n; j++ )
{
a[j][0] = a[j][0] * ( mul / a[j][1] );
sum = sum + a[j][0];
}
cout << fixed << setprecision(3) << sum / mul << endl;
}
return 0;
}
|
29
|
14,230 |
int main()
{
double s[100],a,b,d,e;
int m,c[100],i;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&c[i]);
}
for(i=0;i<m;i++){
a=2.000;b=1.000;
e=2.000;
if(c[i]==1){
s[i]=e;
}
if(c[i]!=1){
for(int j=1;j<c[i];j++){
d=a;
a=a+b;
b=d;
e=e+a/b;
}
s[i]=e;
}
}
for(int k=0;k<m;k++){
printf("%.3lf\n",s[k]);
}
return 0;
}
|
29
|
14,231 |
void sum(int n) {
int front=1;
int temp;
int top=2, bottom=1;
double sum=0;
int i;
for (i=0; i<n; i++) {
sum+=(double)top/front;
temp=top;
top+=front;
front=temp;
}
printf("%.3lf\n",sum);
}
int main()
{
int m, n;
scanf("%d",&m);
int i;
for (i=0; i<m; i++) {
scanf("%d",&n);
sum(n);
}
return 0;
}
|
29
|
14,232 |
double f(double x);
double g(double y);
int main()
{
int i;
double s,j,n,a[1000];
scanf("%lf",&n);
for(i=0;i<=n-1;i++)
{
scanf("%lf",&a[i]);
}
for(i=0;i<=n-1;i++)
{
s=0;
for(j=1;j<=a[i];j++)
{
s+=g(j)/f(j);
}
printf("%.3lf\n",s);
}
return 0;
}
double f(double x)
{
if(x==1)
return 1;
if(x==2)
return 2;
if(x>2)
return f(x-1)+f(x-2);
}
double g(double y)
{
if(y==1)
return 2;
if(y==2)
return 3;
if(y>2)
return g(y-1)+g(y-2);
}
|
29
|
14,233 |
int main()
{
int m,i,j;
int n[100]={0};
scanf("%d",&m);
double a1=2;
double a2=3;
double b1=1;
double b2=2;
double a3,b3;
double slot;
double sum;
for(i=0;i<m;i++)
{
scanf("%d",&n[i]);
if(n[i]==1) printf("%.3lf\n",(a1/b1));
if(n[i]==2) printf("%.3lf\n",(a1/b1)+(a2/b2));
if(n[i]>2)
{
sum=(a1/b1)+(a2/b2);
for(j=0;j<n[i]-2;j++)
{
a3=a1+a2;
b3=b1+b2;
sum+=(a3/b3);
slot=a2;
a2=a1;
a1=slot;
slot=b2;
b2=b1;
b1=slot;
slot=a3;
a3=a2;
a2=slot;
slot=b3;
b3=b2;
b2=slot;
}
printf("%.3lf\n",sum);
a1=2;
a2=3;
b1=1;
b2=2;
sum=(a1/b1)+(a2/b2);
}
}
return 0;
}
|
29
|
14,234 |
void main()
{
int m, n, i, j, p, q, t;
float sum;
scanf("%d", &m);
for(i=0; i<m; i++)
{
scanf("%d", &n);
sum=0;
p=2;
q=1;
for(j=0; j<n; j++)
{
sum+=(float)p/(float)q;
t=p;
p=p+q;
q=t;
}
printf("%.3f\n", sum);
}
}
|
29
|
14,235 |
main()
{
int m;
scanf("%d",&m);
int i;
for(i = 1;i<= m;i ++)
{
int n;
scanf("%d",&n);
float a=2,b=1,c,s=0;
int j;
for(j = 1; j <=n;j++)
{
s+=a/b;
c = a;
a += b;
b = c;
}
printf("%.3f\n",s);
}
}
|
29
|
14,236 |
// ????.cpp : ??????????????
//
int main()//(int argc, _TCHAR* argv[])
{
int m,M;
scanf("%d",&M);
double a[5000],b[5000];
int i,j;
a[1]=2;a[2]=3;
b[1]=1;b[2]=2;
for(i=3;i<=4999;i++)
{
a[i]=a[i-1]+a[i-2];
b[i]=b[i-1]+b[i-2];
}
for(m=1;m<=M;m++)
{
int n,N;
scanf("%d",&N);
double s=0;
for(n=1;n<=N;n++)
{
s=s+a[n]/b[n];
}
printf("%.3f\n",s);
}
return 0;
}
|
29
|
14,237 |
int main()
{
int m,i;
int n,j;
float x,s;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n);
for(s=0,j=0,x=2.0f;j<n;j++)
{
s=s+x;
x=1+1/x;
}
printf("%.3f\n",s);
}
}
|
29
|
14,238 |
int f(int n)
{
int a;
if(n==1)
{a=1;}
if(n==2)
{a=2;}
if(n>2)
{a=f(n-1)+f(n-2);}
return a;
}
int main()
{
int m,i;
scanf("%d",&m);
for(i=0;i<m;i++)
{
int l,j;
scanf("%d",&l);
float sum=0;
for(j=2;j<=l+1;j++)
{
sum+=(float)f(j)/(float)f(j-1);
}
printf("%.3f\n",sum);
}
return 0;
}
|
29
|
14,239 |
int main()
{
int n,i,j,k,zi[1000],mu[1000];
double sum,div[1000];
zi[0]=2;
zi[1]=3;
mu[0]=1;
mu[1]=2;
div[0]=2.0;
div[1]=1.5;
for(i=2;i<1000;i++)
{
zi[i]=0;
mu[i]=0;
}
for(i=2;i<1000;i++)
{
zi[i]=zi[i-1]+zi[i-2];
mu[i]=mu[i-1]+mu[i-2];
div[i]=(1.0*zi[i])/(1.0*mu[i]);
}
cin>>n;
for(j=0;j<n;j++)
{
cin>>k;
for(i=0;i<k;i++)
{
sum+=div[i];
}
printf("%.3lf",sum);
cout<<endl;
sum=0;
}
return 0;
}
|
29
|
14,240 |
//***************************************
// ???????? *
// ?????? *
// ?????2012.10 *
// ???????? *
//***************************************
int main() //?????
{
int m,n,i=1,j=1; //?????????m?????n?????i,j
double x,s,a=1,b=2; //?????????x,a,b?????s?
cin>>m;
for(j=1;j<=m;j++) //????
{
cin>>n; //??n
for(a=1,b=2,i=1,s=0;i<=n;i++) //???????
{
if(i%2==1)
{
x=b/a;
s=s+x;
a=a+b;
}
else
{
x=a/b;
s=s+x;
b=b+a;
}
}
printf("%.3f\n",s); //????
}
return 0;
}
|
29
|
14,241 |
main()
{
int m,n,i,j;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&n);
int a[100],b[100];
double d[100];
a[0]=2;b[0]=1;d[0]=(double)a[0]/b[0];
for(j=1;j<n;j++)
{
a[j]=a[j-1]+b[j-1];
b[j]=a[j-1];
d[j]=(double)a[j]/b[j];
}
double c=0.0000000;
for(j=0;j<n;j++)
{
c=c+d[j];
}
printf("%.3lf\n",c);
}
}
|
29
|
14,242 |
void jisuanb(double b[],int n,double a[])
{
int i;
for(i=1;i<=n;i++)
{
a[i+2]=a[i]+a[i+1];
b[i]=a[i+1]/a[i];
}
}
int main()
{
double sum=0,b[100],a[100];
int m,i,n[100];
a[1]=1;
a[2]=2;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n[i]);
}
for(i=0;i<m;i++)
{
sum=0;
jisuanb(b,n[i],a);
int j;
for(j=0;j<n[i];j++)
{
// printf("xunhuan\n");
sum+=b[j+1];
}
printf("%.3f\n",sum);
}
return 0;
}
|
29
|
14,243 |
int main()
{
int i,j,k,n[1000],m,fz[1000],fm[1000];
double sum[1000],fs;
scanf("%d",&m);
for(j=0;j<m;j++){
scanf("%d",&n[j]);
}
for(j=0;j<m;j++){
fz[0]=2;
fm[0]=1;
fz[1]=3;
fm[1]=2;
fs=3.500;
if(n[j]==1){
sum[j]=2.000;
}else if(n[j]==2){
sum[j]=3.500;
}else if(n[j]>2){
for(i=2;i<n[j];i++){
fz[i]=fz[i-1]+fz[i-2];
fm[i]=fm[i-1]+fm[i-2];
fs+=(fz[i]*1.000/fm[i]*1.000);
}
sum[j]=fs;
}
}
for(j=0;j<m;j++){
printf("%.3lf\n",sum[j]);
}
return 0;
}
|
29
|
14,244 |
int main()
{
float f(int j);
int i,n,m,k;
float s=0;
scanf("%d\n",&m);
for(k=0;k<m;k++)
{s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
s=s+f(i+3)/f(i+2);
printf("%.3lf\n",s);
}
return 0;
}
float f(int j)
{ int c;
if (j==1||j==2)
c=1;
else c=f(j-1)+f(j-2);
return(c);
}
|
29
|
14,245 |
int main()
{
int m,n,i,j;
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%d",&n);
int a[n],b[n];
double c[n],s=0;
for(i=0;i<n;i++)
{
if(i==0)
{
a[i]=2;
b[i]=1;
c[i]=2;
}else{
a[i]=a[i-1]+b[i-1];
b[i]=a[i-1];
c[i]=1.0*a[i]/b[i];
}
s+=c[i];
}
printf("%.3lf\n",s);
}
}
|
29
|
14,246 |
int main()
{
double sz[1000];
int n,a;
double b,c,q,d;
scanf("%d",&n);
for(int i=1;i<=n;i++){
q=0;
scanf("%d",&a);
d=1;
b=2;
for(int j=0;j<a;j++){
c=d+b;
sz[j]=b/d;
d=b;
b=c;
c=0;
}
for(int w=0;w<a;w++){
q=q+sz[w];
}
printf("%.3lf\n",q);
}
}
|
29
|
14,247 |
int main(){
int fenzi[100];
int fenmu[100];
fenzi[0]=2;
fenzi[1]=3;
fenmu[0]=1;
fenmu[1]=2;
double s=0;
double s1=2*1.0/1;
double s2=s1+(3*1.0/2);
int i,m,j,n;
double sz[100];
scanf("%d",&m);
for(i=0;i<m;i++){
s=s2;
scanf("%d",&n);
if(n==1){
sz[i]=s1;
}
else if(n==2){
sz[i]=s2;
}
else{
for(j=2;j<n;j++){
fenzi[j]=fenzi[j-1]+fenzi[j-2];
fenmu[j]=fenmu[j-1]+fenmu[j-2];
s+=fenzi[j]*1.0/fenmu[j];
sz[i]=s;
}
}
}
for(i=0;i<m-1;i++){
printf("%.3lf\n",sz[i]);
}
printf("%.3lf",sz[i]);
return 0;
}
|
29
|
14,248 |
int main()
{
int i,a[1000];
a[0]=1;a[1]=1;
for(i=2;i<900;i++)a[i]=a[i-1]+a[i-2];
int n,t,j;
float sum;
scanf("%d\n",&n);
for(j=0;j<n;j++)
{
sum=0;
scanf("%d",&t);
for(i=0;i<t;i++)sum=sum+(float)(a[i+2])/(float)(a[i+1]);
printf("%.3f\n",sum);
}
}
|
29
|
14,249 |
int main(){
double a[1000],b[1000],c[1000];
int i;
a[0]=2;
a[1]=3;
for(i=2;i<1000;i++){
a[i]=a[i-1]+a[i-2];
}
b[0]=1;
b[1]=2;
for(i=2;i<1000;i++){
b[i]=b[i-1]+b[i-2];
}
for(i=0;i<1000;i++){
c[i]=a[i]/b[i];
}
int m,n,j;
double sum=0;
scanf("%d",&m);
for(i=1;i<=m;i++){
scanf("%d",&n);
for(j=0;j<n;j++){
sum+=c[j];
}
printf("%.3lf\n",sum);
sum=0;
}
return 0;
}
|
29
|
14,250 |
int main()
{
int m,n,i=1,x=2,y=2,j=0;
double z=0,a[100]={2,3},b[100]={1,2};
while(x<100)
{
a[x]=a[x-2]+a[x-1];
x++;
}
while(y<100)
{
b[y]=b[y-2]+b[y-1];
y++;
}
scanf("%d",&m);
while(i<=m)
{
scanf("%d",&n);
z = 0; j =0;
while(j<n)
{
z=z+a[j]/b[j];
j++;
}
printf("%.3lf\n",z);
i++;
}
return 0;
}
|
29
|
14,251 |
main()
{
int m,i,n,j;
scanf("%d",&m);
int a[10000],b[10000];
a[0]=2;
a[1]=3;
b[0]=1;
b[1]=2;
for(i=2;i<10000;i++)
{ a[i]=a[i-1]+a[i-2];
b[i]=b[i-1]+b[i-2];
}
for(i=0;i<m;i++)
{ float sum=0;
scanf("%d",&n);
for(j=0;j<n;j++)
sum=sum+(float)a[j]/b[j];
printf("%.3f\n",sum);}
getchar();
getchar();
getchar();
}
|
29
|
14,252 |
int main(){
int m,i,j,max;
scanf("%d",&m);
int*sz_1=(int*)malloc(sizeof(int)*m);
for(i=0;i<m;i++){
scanf("%d",&(sz_1[i]));}
max=0;
for(i=0;i<m;i++){
if(sz_1[i]>max){
max=sz_1[i];
}
}
int*sz_2=(int*)malloc(sizeof(int)*(max+1));
sz_2[0]=1;
sz_2[1]=2;
for(i=2;i<=max;i++){
sz_2[i]=sz_2[i-1]+sz_2[i-2];
}
double*sz_3=(double*)malloc(sizeof(double)*m);
for(i=0;i<m;i++) sz_3[i]=0;
for(i=0;i<m;i++){
for(j=0;j<sz_1[i];j++){
sz_3[i]+=1.0*sz_2[j+1]/sz_2[j];
}
}
for(i=0;i<m;i++) printf("%.3lf\n",sz_3[i]);
free(sz_1);
free(sz_2);
free(sz_3);
return 0;
}
|
29
|
14,253 |
int main()
{
int n;
int fm[100];
int fz[100];
double sun=0;
int i,j;
double fs[100];
fm[0]=1;
fm[1]=2;
fz[0]=2;
fz[1]=3;
int m;
scanf("%d",&m);
for(j=0;j<=m-1;j++)
{
sun=0;
scanf("%d",&n);
for(i=2;i<=n-1;i++)
{
fm[i]=fm[i-1]+fm[i-2];
fz[i]=fz[i-1]+fz[i-2];
}
for(i=0;i<=n-1;i++)
{
fs[i]=fz[i]*1.0/fm[i];
sun+=fs[i];
}
printf("%.3lf",sun);
printf("\n");
}
return 0;
}
|
29
|
14,254 |
int main(){
int n,m;
scanf("%d",&n);
for(int a=0;a<n;a++){
scanf("%d",&m);
double s=0;
int sz[1000];
sz[0]=1;
sz[1]=2;
for(int i=2;i<1000;i++){
sz[i]=sz[i-1]+sz[i-2];
}
double qh[1000];
for(int g=1;g<1000;g++){
qh[g]=1.0*sz[g]/sz[g-1];
}
for(int r=1;r<=m;r++){
s+=qh[r];
}
printf("%.3lf\n",s);
}
return 0;
}
|
29
|
14,255 |
int main(){
int m,n[1000],i,j,k,c;
double sum[1000],x[1000];
int a=2,b=1;
for(i=0;i<1000;i++){
x[i]=a*1.0/b;
c=b;
b=a;
a=a+c;
}
scanf("%d",&m);
for(j=0;j<m;j++){
scanf("%d",&n[j]);
sum[j]=0;
for(k=0;k<n[j];k++){
sum[j]+=x[k];
}
}
for(j=0;j<m;j++){
printf("%.3lf\n",sum[j]);
}
return 0;
}
|
29
|
14,256 |
//**********************************
//**** ?????? *****
//**** 1200012718 *****
//** ??????? **
//**********************************
int main ()
{
int m;
cin>>m; //????m
double a=1,b=1,c,n,sum=0; //abc???????????sum??
for (int i=1;i<=m;i++)
{
cin>>n; //??n??
a=1,b=1,sum=0; //???????ab?????sum
for (int j=1;j<=n;j++)
{
c=a+b; //c=a+b ??????
sum=sum+c/b;
a=b;
b=c; //???c/b???a?b???????
}
printf("%.3f\n",sum); //???????sum
}
return 0;
}
|
29
|
14,257 |
double cal(int n)
{int i,a=1,b=2,temp;
double sum=0;
for(i=0;i<n;i++)
{sum=sum+(double)b/(double)a;
temp=a+b;
a=b;
b=temp;}
return sum;}
int main()
{int m,i,n[1000];
scanf("%d",&m);
for(i=0;i<m;i++)
{scanf("%d",&n[i]);
printf("%.3f\n",cal(n[i]));}}
|
29
|
14,258 |
//****************************
//*????
int main()
{
int m,n;
double sum=0,a,b;
int i,k,p;
cin>>m;
for(i=1;i<=m;i++)
{
cin>>n; //??for????n?
sum=0;a=2;b=1;
for(k=1;k<=n;k++)
{
sum=sum+a/b;
p=a;
a=a+b;
b=p; //?????n??
}
printf("%.3f\n",sum);
}
return 0;
}
|
29
|
14,259 |
int main(){
double a[MAX],j,sum=0,c,b,d;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lf",&a[i]);
}
for(i=0;i<n;i++){
for(j=1;j<=a[i];j++){
if(j==1){
c=2;
b=1;
}
sum+=c/b;
d=b;
b=c;
c=c+d;
}
printf("%.3lf\n",sum);
sum=0;
}
return 0;
}
|
29
|
14,260 |
int main()
{
int n,m,i,j,a[100];
double c;
c=0;
scanf("%d",&m);
a[1]=1;
a[2]=2;
for(i=3;i<100;i++)
{
a[i]=a[i-1]+a[i-2];
}
for(i=0;i<m;i++)
{
scanf("%d",&n);
for(j=1;j<=n;j++)
{
c=c+(double)a[j+1]/a[j];
}
printf("%.3lf\n",c);
c=0;
}
return 0;
}
|
29
|
14,261 |
double f(int n){
double x[100],y=0.0;
int i;
x[0]=1;
for(i=1;i<=n;i++)
{
x[i]=1.0/x[i-1]+1;
y+=x[i];
}
return y;
}
int main(){
int m,i;
int n[100];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n[i]);
}
for(i=0;i<m;i++)
{
printf("%.3lf\n",f(n[i]));
}
return 0;
}
|
29
|
14,262 |
int f1(int n)
{
if(n==1||n==2)
return 1;
else return f1(n-1)+f1(n-2);
}
int f2(int n)
{
if(n==1||n==2)
return 1;
else return f2(n-1)+f2(n-2);
}
void main()
{
int n,i,k,j;
scanf("%d",&k);
for(j=0;j<k;j++)
{
float sum=0;
scanf("%d",&n);
for(i=2;i<n+2;i++)
{
sum+=(float)f2(i+1)/f1(i);
}
printf("%.3f\n",sum);
}
}
|
29
|
14,263 |
int main()
{
int m;
int a[MAX];
double p[MAX],q[MAX];
double s[MAX];
int i,j,n;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&a[i]);
}
for(i=0;i<m;i++){
n=a[i];
p[0]=2;
q[0]=1;
s[0]=2;
for (j=1;j<n;j++){
p[j]=p[j-1]+q[j-1];
q[j]=p[j-1];
s[j]=s[j-1]+p[j]/q[j];
}
printf("%.3lf\n",s[n-1]);
}
return 0;
}
|
29
|
14,264 |
int main()
{
int m=0,k=0,j=0;//??????m??????k?j
cin>>m;//??m
for(k=0;k<m;k++)//????m???
{
int n=0;//?????n??
cin>>n;//??n
float sum=0;//?????
float a=1,b=2;//????????????
for(j=0;j<n;j++)//??
{
sum+=b/a;//?????a/b
b=a+b;a=b-a;//ab??????ab
}
cout<<fixed<<setprecision(3)<<sum<<'\n';//??sum
}
return 0;
}
|
29
|
14,265 |
int main()
{
int i,m,n,j;
float sl[1000],add[1000];
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%d",&n);
sl[0]=1;
sl[1]=2;
add[j]=0;
for(i=0;i<n;i++)
{
add[j]=sl[i+1]/sl[i]+add[j];
sl[i+2]=sl[i]+sl[i+1];
}
}
for(j=0;j<m;j++)
{
printf("%.3f\n",add[j]);
}
return 0;
}
|
29
|
14,266 |
int main(){
int m,n;
scanf("%d",&m);
for (int z=0;z<m;z++){
scanf("%d",&n);
double sum=0;
int x=1,y=2;
int tmp;
for(int i=0;i<n;i++){
sum=sum+(double)y/x;
tmp=y;
y=x+y;
x=tmp;
}
if(z!=0){
printf("\n");
}
printf("%.3lf",sum);
}
return 0;
}
|
29
|
14,267 |
void main()
{
int m,n,i,j,a[1000],b[1000];
float sum=0;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n);
a[0]=2;
b[0]=1;
sum=(float)a[0]/b[0];
for(j=0;j<n-1;j++)
{
a[j+1]=a[j]+b[j];
b[j+1]=a[j];
sum+=(float)a[j+1]/b[j+1];
}
printf("%.3f\n",sum);
}
}
|
29
|
14,268 |
int main()
{
float shuzu[NUM],shulie[NUM],qiuhe[NUM],s=0;
shuzu[0]=1,shuzu[1]=2;
for(int j=0;j<NUM-2;j++)
{
shuzu[j+2]=shuzu[j]+shuzu[j+1];
}
for(int i=0;i<NUM-2;i++)
{
shulie[i]=shuzu[i+1]/shuzu[i];
}
int m;
scanf("%d",&m);
for(int k=0;k<m;k++)
{
scanf("%f",&(qiuhe[k]));
for(int l=0;l<qiuhe[k];l++)
{
s+=shulie[l];
}
printf("%.3f\n",s);
s=0;
}
return 0;
}
|
29
|
14,269 |
//#define main xmain
int main()
{
int i, j, n, m;
double n1, n2, t, sum;
scanf("%d", &m);
for (j=0; j<m; j++) {
sum = 0;
n1 = 1;
n2 = 2;
scanf("%d", &n);
for (i=0;i<n;i++) {
sum += n2/n1;
t = n1;
n1 = n2;
n2 = t + n2;
}
printf("%.3lf\n", sum);
}
return 0;
}
char mn[][200] = {
"3\n"
"5\n"
"10\n"
"20",
"7\n"
"13\n"
"12\n"
"11\n"
"4\n"
"5\n"
"6\n"
"7",
"21\n"
"1\n"
"2\n"
"3\n"
"4\n"
"5\n"
"6\n"
"7\n"
"8\n"
"9\n"
"10\n"
"11\n"
"12\n"
"13\n"
"14\n"
"15\n"
"16\n"
"17\n"
"18\n"
"19\n"
"20\n"
"11",
};
int xn = 0;
int max_files = sizeof(mn) / sizeof(mn[0]);
char * output_dir = "data";
void xbuild()
{
printf(mn[xn]);
xn++;
}
|
29
|
14,270 |
int fibonacci(int n)
{
int a;
if (n==1||n==2)
a=1;
else a=fibonacci(n-1)+fibonacci(n-2);
return a;
}
int main()
{
int m,i,j;
scanf("%d",&m);
for (i=1;i<=m;i++)
{
int n;
double fenzi,fenmu,result,sum=0.0;
scanf("%d",&n);
for (j=1;j<=n;j++)
{
fenzi=fibonacci(j+2);
fenmu=fibonacci(j+1);
result=fenzi/fenmu;
sum=sum+result;
}
printf("%.3f\n",sum);
}
return 0;
}
|
29
|
14,271 |
main()
{
int m;
scanf("%d",&m);
int n[m];
int i;
for(i=0;i<m;i++)
{
scanf("%d",&n[i]);
}
for(i=0;i<m;i++)
{
int xi;
xi=n[i];
if(xi==1)
printf("2.000\n");
if(xi==2)
printf("3.500\n");
if(xi>2)
{
float ai[xi];
float bi[xi];
float ci[xi];
int j;
ai[0]=2;
ai[1]=3;
bi[0]=1;
bi[1]=2;
float sumi;
sumi=3.5;
for(j=2;j<xi;j++)
{
ai[j]=ai[j-1]+ai[j-2];
bi[j]=bi[j-1]+bi[j-2];
ci[j]=ai[j]/bi[j];
sumi+=ci[j];
}
printf("%.3f\n",sumi);
}
}
}
|
29
|
14,272 |
int main(){
double m,sz[100],fm[100],a[100],result[100];
int k,i;
scanf("%lf",&m);
for(k=0;k<m;k++) scanf("%lf",&sz[k]);
for(k=0;k<m;k++){if(sz[k]==1) result[k]=2.000;
else {for(i=1;i<=sz[k]+1;i++){fm[1]=1;
fm[2]=2;
fm[i]=fm[i-1]+fm[i-2];}
for(i=1;i<=sz[k];i++) a[i]=fm[i+1]/fm[i];
result[k]=0;
for(i=1;i<=sz[k];i++) result[k]+=a[i];
} }
for(k=0;k<m;k++) printf("%.3lf\n",result[k]);
return 0;
}
|
29
|
14,273 |
int main()
{
int i,j,n,m;
double a=1,sum[100]={0};
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&n);
for(j=0;j<n;j++){
a=1/a+1;
sum[i]=sum[i]+a;
}
a=1;
}
for(i=0;i<m;i++){
printf("%.3lf\n",sum[i]);
}
return 0;
}
|
29
|
14,274 |
int main(int argc, char* argv[])
{
int m,sz[100],i,sl[500],j;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&sz[i]);
}
sl[0]=1;
sl[1]=2;
for(i=2;i<500;i++){
sl[i]=sl[i-1]+sl[i-2];
}
double fs[500],sum[500]={0};
for(i=0;i<500;i++){
fs[i]=(double)sl[i+1]/sl[i];
}
for(i=0;i<m;i++){
for(j=0;j<sz[i];j++){
sum[i]=fs[j]+sum[i];
}
printf("%.3lf\n",sum[i]);
}
return 0;
}
|
29
|
14,275 |
int main()
{
int m,n[100]={0};
double sum[100]={0},a=1,b=2,c=0;
scanf("%d",&m);
for (int i=0;i<m;i++){
scanf("%d",&n[i]);
a=1;
b=2;
for(int k=0;k<n[i];k++){
sum[i]+=b/a;
c=b;
b=a+b;
a=c;
}
printf("%.3lf\n",sum[i]);
}
return 0;
}
|
29
|
14,276 |
int main()
{
int n,m,i,j;
double a,b,e[3000],sum,num;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d",&n);
e[1]=1;
e[2]=2;
num=e[2]/e[1];
for(j=3;j<=n+1;j++)
{
e[j]=e[j-1]+e[j-2];
num+=e[j]/e[j-1];
}
printf("%.3lf\n",num);
}
return 0;
}
|
29
|
14,277 |
int main()
{
int m,i,j,n[N],a[M];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n[i]);
}
a[0]=1;
a[1]=2;
for(i=0;i<m;i++)
{
double sum=0.0;
for(j=1;j<=n[i];j++)
{
a[j+1]=a[j]+a[j-1];
sum+=1.0*a[j]/a[j-1];
}
printf("%.3lf\n",sum);
}
return 0;
}
|
29
|
14,278 |
int main(){
int i,j,n;
scanf("%d",&n);
int sz[10000];
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
int zr[10000][2];
zr[0][0]=2;
zr[0][1]=1;
zr[1][0]=3;
zr[1][1]=2;
for(i=2;i<10000;i++){
zr[i][0]=zr[i-1][0]+zr[i-2][0];
zr[i][1]=zr[i-1][1]+zr[i-2][1];
}
double fs[10000]={0};
for(i=0;i<10000;i++){
fs[i]=(double)zr[i][0]/zr[i][1];
}
double jg[10000]={0};
for(i=0;i<n;i++){
for(j=0;j<sz[i];j++){
jg[i]+=fs[j];
}
}
for(i=0;i<n;i++){
printf("%.3lf\n",jg[i]);
}
return 0;
}
|
29
|
14,279 |
int main(){
int m,n,i,u;
double add,each1[100],each2[100];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&n);
each1[0]=2;
each1[1]=3;
each2[0]=1;
each2[1]=2;
add=3.5;
for(u=2;u<n;u++){
each1[u]=each1[u-1]+each1[u-2];
each2[u]=each2[u-1]+each2[u-2];
add+=1.0*each1[u]/each2[u];
}
if(n==1){
printf("2.000\n");
}else{
printf("%.3lf\n",add);
}
}
return 0;
}
|
29
|
14,280 |
int main(){
int m,i,a,b,j,temp;
int sz[10000];
double sum=0;
double c;
scanf("%d",&m);
for(i=1;i<=m;i++){
scanf("%d",&sz[i]);
sum=0;
a=2;
b=1;
for(j=1;j<=sz[i];j++){
c=1.0*a/b;
temp=a+b;
sum=sum+c;
b=a;
a=temp;
}
printf("%.3lf\n",sum);}
return 0;
}
|
29
|
14,281 |
double SUM(int n)
{
double i=5.0,j=3.0,temp,sum=3.5;
int k;
for(k=3;k<=n;k++)
{
sum=sum+i/j;
temp=i;
i=i+j;
j= temp;
}
return sum;
}
int main()
{
int m,n,i;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d",&n);
if(n==1)
printf("2.000\n");
if(n==2)
printf("3.500\n");
if(n>=3)
printf("%.3f\n",SUM(n));
}
return 0;
}
|
29
|
14,282 |
double F(double x);
double f(double y);
int main()
{
int m,i;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
double a=0.0,n;
scanf("%lf",&n);
int k=1;
for(k=1;k<=n;k++)
{
a=a+(F(k)/f(k));
}
printf("%.3lf\n",a);
}
return 0;
}
double F(double x)
{
double sz[500];
if(x==1){return 2.0;}
if(x==2){return 3.0;}
int b;
for(b=3;b<=x;b++)
{
sz[1]=2.0;sz[2]=3.0;
sz[b]=sz[b-1]+sz[b-2];
}
return sz[(int)x];
}
double f(double y)
{
double zs[500];
if(y==1){return 1.0;}
if(y==2){return 2.0;}
int c;
for(c=3;c<=y;c++)
{
zs[1]=1.0;zs[2]=2.0;
zs[c]=zs[c-1]+zs[c-2];
}
return zs[(int)y];
}
|
29
|
14,283 |
int main(){
int m;
int n;
int i,k;
int a[1000000];
int b[1000000];
double x,y;
scanf("%d",&m);
for(i=0;i<m;i++)
{
a[0]=2;a[1]=3;
b[0]=1;b[1]=2;
scanf("%d",&n);
if(n==1)
{
x=a[0]*1.0/b[0];
printf("%.3lf\n",x);
}else if(n==2)
{
x=a[0]*1.0/b[0]+a[1]*1.0/b[1];
printf("%.3lf\n",x);
}else if(n>=3){
y=a[0]*1.0/b[0]+a[1]*1.0/b[1];
for(k=2;k<n;k++)
{
a[k]=a[k-1]+a[k-2];
b[k]=b[k-1]+b[k-2];
y=y+a[k]*1.0/b[k];
}
printf("%.3lf\n",y);
}
}
return 0;
}
|
29
|
14,284 |
int main()
{
long m,i,p;
double x,y,z,a[2000];
scanf("%d",&m);
x=2;
y=1;
a[0]=0;
for (i=1;i<=20;i++)
{
a[i]=a[i-1]+x/y;
z=x+y;
y=x;
x=z;
//printf("%lf %lf %lf\n",x,y,z);
}
for (i=1;i<=m;i++)
{
scanf("%d",&p);
printf("%.3lf\n",a[p]);
}
}
|
29
|
14,285 |
int main()
{
int m,n,i,j;
double sum[MAX],s[MAX],x[MAX];
s[0]=2;
x[0]=1;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&n);
sum[i]=0;
for(j=1;j<=n;j++){
s[j]=s[j-1]+x[j-1];
x[j]=s[j-1];
sum[i]=sum[i]+(s[j-1])/(x[j-1]);
}
}
for(i=0;i<m;i++){
printf("%.3lf\n",sum[i]);
}
return 0;
}
|
29
|
14,286 |
float sum (int n)
{
float j,s;
int i;
float a[1000],b[1000];
a[1]=2;a[2]=3;
b[1]=1;b[2]=2;
if (n==1)
{j=2;
return j;}
if (n==2)
{j=3.5;
return j;}
if (n!=1 && n!=2)
{
s=3.5;
for (i=3;i<=n;i++)
{
a[i]= a[i-1]+a[i-2];
b[i]= b[i-1]+b[i-2];
s=s+(a[i]/b[i]);
}
return s;
}
}
int main ()
{
int m,x;
scanf ("%d",&m);
for (x=0;x<m;x++)
{
int n;
scanf ("%d",&n);
printf ("%.3f\n",sum(n));
}
getchar ();
getchar ();
}
|
29
|
14,287 |
int fbnq(int);
int main(){
int m,i,j;
int n[100];
double a[100],sum[100]={0.00};
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&(n[i]));
}
for(j=0;j<m;j++){
for(i=1;i<=n[j];i++){
sum[j]+=(double)fbnq(i+1)/fbnq(i);
}
}
for(i=0;i<m;i++){
printf("%.3f\n",sum[i]);
}
return 0;
}
int fbnq(int b){
int f0,f1,f2;
f0=1;
f1=1;
if(b==1){
return f1;
}
for(int i=2;i<=b;i++){
f2=f0+f1;
f0=f1;
f1=f2;
}
return f2;
}
|
29
|
14,288 |
int main() {
int m,n;
scanf("%d",&m);
int i;
int*cs=(int*)malloc(sizeof(int)*m);
for(i=0;i<m;i++){
scanf("%d",&cs[i]);
}
for(i=0;i<m;i++){
int*sz=(int*)malloc(sizeof(int)*(cs[i]+1));
int a=1;
int b=2;
int j;
sz[0]=1;
sz[1]=2;
for(j=2;j<=cs[i];j++){
sz[j]=sz[j-2]+sz[j-1];
}
double*sl=(double*)malloc(sizeof(double)*(cs[i]));
for(j=0;j<cs[i];j++){
sl[j]=1.0*sz[j+1]/sz[j];
}
double sum=0;
for(j=0;j<cs[i];j++){
sum+=sl[j];
}
printf("%.3lf\n",sum);
free(sz);
free(sl);
}
return 0;
}
|
29
|
14,289 |
int main()
{
int m,i,j,k;
int a[100],b[100],c[100];
double s;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&a[i]);
}
for(i=0;i<m;i++){
k=a[i];
for(j=1;j<=k;j++){
b[1]=2;
b[2]=3;
if(j!=1 && j!=2){
b[j]=b[j-1]+b[j-2];
}
}
}
for(i=0;i<m;i++){
k=a[i];
for(j=1;j<=k;j++){
c[1]=1;
c[2]=2;
if(j!=1 && j!=2){
c[j]=c[j-1]+c[j-2];
}
}
}
for(i=0;i<m;i++){
k=a[i];
s=0;
for(j=1;j<=k;j++){
s=s+b[j]*1.0/c[j];
}
if(i!=m-1)
printf("%.3lf\n",s);
else
printf("%.3lf",s);
}
return 0;
}
|
29
|
14,290 |
int main(){
int m;
int i,j;
double e,x,y;
scanf("%d",&m);
int*sz
=(int*)malloc(sizeof(int)*m);
for(i=0;i<m;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<m;i++){
double sum=0;
x=1.0;
y=2.0;
for(j=0;j<sz[i];j++){
sum+=y/x;
e=y;
y=x+y;
x=e;
}
printf("%.3lf\n",sum);
}
free(sz);
return 0;
}
|
29
|
14,291 |
int main (){
int m,n,i,j;
double s;
scanf("%d",&m);
for(i=1;i<=m;i++){
scanf("%d",&n);
double*x=(double*)malloc(sizeof(double)*n);
double*y=(double*)malloc(sizeof(double)*n);
x[0]=2;
x[1]=3;
y[0]=1;
y[1]=2;
if(n==1){
s=2;
}
else if(n==2){
s=3.5;
}else{
s=3.5;
for(j=2;j<n;j++){
x[j]=x[j-1]+x[j-2];
y[j]=y[j-1]+y[j-2];
s+=x[j]/y[j];
}
}
printf("%.3lf\n",s);
}
return 0;
}
|
29
|
14,292 |
int main()
{
int m,n;
float a=1,b=2,c,s=0;
scanf("%d",&m);
float *result=(float *)malloc(sizeof(float)*m);
for(int i=0;i<m;i++)
{
scanf("%d",&n);
for(int k=0;k<n;k++)
{
s+=b/a;
c=a+b;
a=b;
b=c;
}
result[i]=s;
s=0;
a=1;
b=2;
}
for(int i=0;i<m;i++) printf("%.3f\n",result[i]);
return 0;
}
|
29
|
14,293 |
int main(){
int m,h,i,j;
double a[100],b[100],c[100],he=0;
scanf("%d",&m);
a[0]=2;
a[1]=1.5;
b[0]=2;
b[1]=3;
c[1]=2;
c[0]=1;
for(i=2;i<100;i++){
b[i]=b[i-1]+b[i-2];
c[i]=c[i-1]+c[i-2];
a[i]=b[i]/c[i];
}
for(i=0;i<m;i++){
scanf("%d",&h);
he=0;
for(j=0;j<h;j++)
he=he+a[j];
printf("%.3lf\n",he);
}
return 0;
}
|
29
|
14,294 |
int main(){
int m,n,fm,fn,i,j;double s=0;
scanf("%d",&m);
for(i=1;i<=m;i++){s=0;scanf("%d",&n);fm=1;fn=1;
for(j=1;j<=n;j++){fm=fm+fn;fn=fm-fn;s+=(1.0*fm)/fn;}
printf("%.3f\n",s);
}
return 0;
}
|
29
|
14,295 |
int main()
{
int m,i,n,k;
float s=0,j;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d",&n);
j=2;
s=0;
for(k=1;k<=n;k++)
{
s=s+j;
j=1+1/j;
}
printf("%.3f\n",s);
}
}
|
29
|
14,296 |
int main()//?????
{
int m,n;//???m,n
cin>>m;//??m
for(int i=1;i<=m;i++)//????m?n
{
cin>>n;
float a=1,b=2,s=0,t;//??????
for(int j=1;j<=n;j++)//??
{
s=s+b/a;
t=b;
b=a+b;
a=t;
}
printf("%.3f",s);//????
cout<<endl;
}
return 0;//?????
}
|
29
|
14,297 |
//
// main.cpp
// hw
//
// Created by ? ? on 12-12-16.
// Copyright (c) 2012? ? ?. All rights reserved.
//
int main(int argc, const char * argv[])
{
int x;
cin>>x;
for(int q=0;q<x;q++){
int n,a=2,b=1;
cin>>n;
double Sum=0;
for (int i=1; i<=n; i++) {
Sum+=(float)a/b;
int t=a;
a+=b;
b=t;
}
printf("%.3f\n",Sum);
}
return 0;
}
|
29
|
14,298 |
int main()
{
int m,i,j;
double a[100],b[100],x=1,y=2,z;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%lf",&a[i]);
}
for(i=0;i<m;i++)
{
b[i]=0;
}
for(i=0;i<m;i++)
{
for(j=0;j<a[i];j++)
{
b[i]=b[i]+y/x;
z=x;
x=y;
y=z+y;
}
x=1;
y=2;
}
for(i=0;i<m;i++)
{
printf("%.3lf\n",b[i]);
}
return 0;
}
|
29
|
14,299 |
int main(){
int m,shuzu[100],i,j;
double x,s,e,a,b;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&shuzu[i]);
}
for(i=0;i<m;i++){
s=0;
a=1;
b=2;
x=b/a;
for(j=0;j<shuzu[i];j++){
s=s+x;
e=a;
a=b;
b=e+b;
x=b/a;
}
printf("%.3lf\n",s);
}
return 0;
}
|
29
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.