t = int(input())
other = ['9', '7']
pr = {'7': 1, '9': 4}
for _ in range(t):
n = int(input())
l = min((n//2, 998244353))
output = ['1'] * l
n -= 2*l
for i in range(l):
for new in other:
if n >= pr[new]:
output[i] = new
n -= pr[new]
break
print(int(''.join(output)))#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
using ll = long long;
const int N = 1e5;
const int mod = 1000000007;
template<typename... T>
void read(T&... args) {
((cin >> args), ...);
}
template<typename... T>
void write(T&&... args) {
((cout << args << " "), ...);
}
int32_t main(){
time_t start, end;
time(&start);
ios_base::sync_with_stdio(false); cin.tie(0); cout << setprecision(12) << fixed;
ll t; read(t);
while(t--){
ll n; read(n);
string k = "";
if(n&1) k.push_back('7');
for(ll i=0;i<n;i+=2){
if(n&1 && i==0) {
i++;
continue;
}
k.push_back('1');
}
write(k);
cout<<endl;
}
time(&end);
// double time_taken = double(end - start);
// cout << "Time taken by program is : " << fixed << time_taken << setprecision(5);
// cout << " sec " << endl;
return 0;
}Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |