FOJ 2206 函数求解

/* ***********************************************
Author        :Zhou Zhentao
Email         :774388357@qq.com
Created Time  :2015/11/20 17:06:34
File Name     :acm.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

int F(int x){
    if(x<20150001) return x+2014;
    return 20152014;
}

int main(){
    int n, T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        printf("%d\n",F(n));
    }
    return 0;
}