For this Question: We define a weird series as follows:
7, 77, 777, 7777, 77777, 777777,. .
Given a positive integer N find where is first occurrence of a number divisible by N in the given series.
If the series contains no multiple of N, print -1 instead.Input contains a single integer N.

Constraints:
1 <= N <= 1000000Print the position of the first position of a multiple of N in the series. (For example, if the first occurrence is the third element of the series, print 3)Sample Input 1
101

Sample Output 1
4

Explanation: 7, 77, 777 are not multiple of 101 whereas 7777 is a multiple of 101.

Sample Input 2
2

Sample Output 2
-1

Sample Input 3
7

Sample Output 3
1, I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc  __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
    return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long  
#define f80 __float128
#define pii pair<int,int>
/////////////

signed main()
{
	fastio;
	#ifdef ANIKET_GOYAL
		freopen("inputf.in","r",stdin);
		freopen("outputf.in","w",stdout);
	#endif
	int i, j;
	long long law;
	long long seven_multi = 0;
	long long temp_pow = 7;
 
	cin >> law;
 
	for (i = 1, temp_pow = 7; i <= law; i++) {
		seven_multi += temp_pow;
		if ((seven_multi %= law) == 0) {
			cout << i << endl;
			return 0;
		}
		temp_pow *= 10;
		temp_pow %= law;
	}
 
	cout << -1 << endl;
	return 0;
	#ifdef ANIKET_GOYAL
		// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
	#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?