Problem A. Auxiliary Project

Problem A. Auxiliary Project
Input file: auxiliary.in Time limit: 3 seconds
Output file: auxiliary.out Memory limit: 512 megabytes
Anna has just finished her course project. She has a lot of seven-segment LED displays as leftovers and
a small power source. Each display consumes power proportionally to the number of lit segments, e.g. ‘9’
consumes twice more power than ‘7’.
Anna wonders what is the maximum possible sum of digits she is able to achieve, if her power source is
able to light n segments, and she wants to light exactly n segments.
Input
The single line of the input contains one integer n — the number of segments that should be lit
(2 ≤ n ≤ 106
).
Output
Output a single integer — the maximum possible sum of digits that can be displayed simultaneously.
Examples
auxiliary.in auxiliary.out
4 4
7 11
6 14
In the first example, a single ‘4’ should be displayed (‘7’ has greater value, but has only three segments).
In the second example ‘4’ and ‘7’ should be displayed, in the third one — two ‘7’s.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    freopen("auxiliary.in","r",stdin);
    freopen("auxiliary.out","w",stdout);
    long long int t,t1,result,n;
    scanf("%lld",&n);
    t=n/3;
    t1=n%3;
    if(t1==1)
    {
        t=t-1;
        result=t*7+4;
    }
    else if(t1==2)
    {
        result=t*7+1;
    }
    else if(t1==0)
    {
        result=t*7;
    }
    printf("%lld\n",result);
    return 0;
}