第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-680 数的计算

#include <stdio.h>
#include <string.h>
int sum = 1;
void fun(int n)
{
	int i;
	for (i = 1; i <= n / 2; i++)
	{
		sum++;
		fun(i);
	}
}
int main()
{
	int n;
	scanf("%d", &n);
	fun(n);
	printf("%d", sum);
	return 0;
}

#include<iostream>
using namespace std;
int sum=0,n;
void dfs(int k){
    if(k==1)
    return;
    for(int i=1;i<=k/2;i++){
        sum++;
        dfs(i);
    }
}
int main(){
    cin>>n;
    dfs(n);
    cout<<sum+1<<endl;
    return 0;
}

import java.io.*;
import java.math.*;
import java.util.*;


public class Main {

    static final int INF = 0x3f3f3f3f;
    static final long LNF = 0x3f3f3f3f3f3f3f3fL;

    public static void main(String[] args) throws IOException {
        initReader();
     int n=nextInt();
     pw.println(count(n));
        pw.close();
    }
    static int count(int n){
        if(n==1)return 1;
        int s=1;
        for(int i=1;i<=n/2;i++){
            s+=count(i);
        }
        return s;
    }

    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static PrintWriter pw;

    public static void initReader() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

    }

    public static boolean hasNext() {
        try {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
        } catch (Exception e) {
            return false;
        }
        return true;
    }

    public static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    public static String nextLine() {
        try {
            return reader.readLine();
        } catch (Exception e) {
            return null;
        }
    }

    public static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public static char nextChar() throws IOException {
        return next().charAt(0);
    }
}

n=int(input())
lis=[1]*(n+1)
for i in range(2,n+1):
    for j in range(1,i//2+1):
        lis[i]+=lis[j]
print(lis[-1])