Big fibonacci

#include <iostream>
#include <vector>
using namespace std;
int a,b,n,cur;
int mod = 1E9+7;
int main() {
    cin >> a >> b >> n;
    if (n == 2) cur = b;
    if (n==1) cur = a;
    for (int i=0; i<n-2; i++) {
        cur = (a+b) % mod;
        a = b;
        b = cur;
    }

    cout << cur;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED