malteklaes/cpp-code-code_search_net-style huggingface dataset:
#include <bits/stdc++.h>   using namespace std;   int main() {     int n;     cin >> n;     int a[n];     for (int i = 0; i < n; i++) cin >> a[i];     int ans = 0;     for (int i = 0; i < n - 1; i++) {       int t = 0;       while (i + int(pow(2, t)) < n) t++;       t = t - 1;       a[i + int(pow(2, t))] += a[i];       ans += a[i];       a[i] = 0;       cout << ans << endl;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n, k;     cin >> n >> k;     string mat[n + 5];     int dp[n + 5][n + 5];     for (int i = 0; i < (n); i++) cin >> mat[i];     memset(dp, 0, sizeof(dp));     if (mat[0][0] ==  a ) dp[0][0] = 1;     for (int i = 1; i < (n); i++) {       dp[i][0] = dp[i - 1][0];       if (mat[i][0] ==  a ) dp[i][0]++;       dp[0][i] = dp[0][i - 1];       if (mat[0][i] ==  a ) dp[0][i]++;     }     for (int i = 1; i < (n); i++) {       for (int j = 1; j < (n); j++) {         dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);         if (mat[i][j] ==  a ) dp[i][j]++;       }     }     int maxi = -1;     for (int i = 0; i < (n); i++) {       for (int j = 0; j < (n); j++) {         if (i + j + 1 - dp[i][j] - k <= 0) maxi = max(maxi, i + j);       }     }     set<pair<int, int>> pts;     if (maxi == -1)       pts.insert(make_pair(0, 0));     else {       for (int i = 0; i < (n); i++) {         for (int j = 0; j < (n); j++) {           if (i + j == maxi && (i + j + 1 - dp[i][j] - k) == 0) {             pts.insert(make_pair(i, j));           }         }       }     }     string ans, cont;     for (int i = 0; i < (maxi + 1); i++) ans.push_back( a );     if (maxi == -1) ans.push_back(mat[0][0]), maxi++;     for (int i = maxi; i < (2 * n - 2); i++) {       char mini =  z  + 1;       for (auto x : pts) {         int r = x.first, c = x.second;         if (r < n - 1) mini = min(mini, mat[r + 1][c]);         if (c < n - 1) mini = min(mini, mat[r][c + 1]);       }       ans.push_back(mini);       set<pair<int, int>> temp;       for (auto x : pts) {         int r = x.first, c = x.second;         if (r < n - 1) {           if (mat[r + 1][c] == mini) temp.insert(make_pair(r + 1, c));         }         if (c < n - 1) {           if (mat[r][c + 1] == mini) temp.insert(make_pair(r, c + 1));         }       }       pts = temp;     }     cout << ans;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n;     cin >> n;     map<int, vector<int> > ps;     set<int> xs;     for (int i = 0; i < n; i++) {       int x, y;       cin >> x >> y;       ps[y].push_back(x);       xs.insert(x);     }     map<int, int> rk;     const int INF = 1 << 30;     for (int x : xs) {       int i = rk.size();       rk[x] = i + 1;     }     rk[INF] = xs.size() + 1;     int bit[200100] = {};     long long ans = 0;     xs.clear();     for (auto it = ps.rbegin(); it != ps.rend(); it++) {       int y = it->first;       sort(it->second.begin(), it->second.end());       for (int i = 0; i < it->second.size(); i++) {         int l = it->second[i],             r = (i + 1 == it->second.size() ? INF : it->second[i + 1]);         long long sum1 = 0, sum2 = 0;         if (xs.find(l) == xs.end()) {           xs.insert(l);           for (int j = rk[l]; j <= rk.size() + 1; j += j & -j) bit[j]++;         }         for (int j = rk[l]; j > 0; j -= j & -j) sum1 += bit[j];         for (int j = rk[r] - 1; j > 0; j -= j & -j) sum2 += bit[j];         ans += sum1 * (sum2 - sum1 + 1);       }     }     cout << ans << endl;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int t;     cin >> t;     while (t--) {       int n;       cin >> n;       string s;       bool x = false, y = false;       cin >> s;       if (n == 1) {         s[0] % 2 ? cout <<  1 n  : cout <<  2 n ;         continue;       }       for (int i = 0; i < n; i++) {         if ((i + 1) % 2 == 1)           x |= ((s[i] -   0 ) % 2 == 1);         else if ((i + 1) % 2 == 0)           y |= ((s[i] -   0 ) % 2 == 0);       }       if (n % 2 == 1) {         x ? cout << 1 : cout << 2;       } else {         y ? cout << 2 : cout << 1;       }       cout <<   n ;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const long long mod = 1e9 + 7;   const long long INF = 4e18;   const int inf = 2e9;   int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }   int lcm(int a, int b) { return a * b / gcd(a, b); }   int a[3005], pos[3005];   int main(void) {     int n, i, j, naik = 0;     scanf( %d , &n);     for (i = 1; i <= n; ++i) {       scanf( %d , a + i);       pos[a[i]] = i;     }     int ans = 0;     for (i = 1; i <= n; ++i) {       while (pos[i] > i) {         swap(a[pos[i]], a[pos[i] - 1]);         swap(pos[a[pos[i]]], pos[a[pos[i] - 1]]);         ans++;       }     }     ans = ((ans >> 1) << 2) + (ans & 1);     printf( %.9f n , (double)ans);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main(int argc, char const *argv[]) {     int n;     char s[105][105];     while (~scanf( %d , &n)) {       for (int i = 1; i <= n; ++i) scanf( %s , s[i] + 1);       vector<pair<int, int> > r;       bool rc = true;       for (int i = 1; i <= n; ++i) {         int j;         for (j = 1; j <= n; ++j)           if (s[i][j] ==  . ) {             r.push_back(pair<int, int>(i, j));             break;           }         if (j > n) {           rc = false;           break;         }       }       vector<pair<int, int> > c;       bool cc = true;       for (int j = 1; j <= n; ++j) {         int i;         for (i = 1; i <= n; ++i)           if (s[i][j] ==  . ) {             c.push_back(pair<int, int>(i, j));             break;           }         if (i > n) {           cc = false;           break;         }       }       if (rc) {         for (int i = 0; i < n; ++i) printf( %d %d n , r[i].first, r[i].second);       } else if (cc) {         for (int i = 0; i < n; ++i) printf( %d %d n , c[i].first, c[i].second);       } else {         puts( -1 );       }     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int MaxN = 1e5 + 10;   vector<string> tot[MaxN];   int cnt;   char s[MaxN];   bool check[MaxN], flag;   set<string> ans;   int main() {     scanf( %s , s);     int len = strlen(s);     check[len] = 1;     for (int i = len - 2; i >= 5; i--) {       if (check[i + 2]) {         string t;         t += s[i];         t += s[i + 1];         if (tot[i + 2].size() == 0) {           check[i] = 1;           tot[i].push_back(t);           ans.insert(t);         } else {           flag = 1;           for (int j = 0; j < tot[i + 2].size(); j++) {             if (tot[i + 2][j] != t) {               flag = 0;               break;             }           }           if (!flag) {             tot[i].push_back(t);             ans.insert(t), check[i] = 1;           }         }       }       if (check[i + 3]) {         string t;         t += s[i];         t += s[i + 1];         t += s[i + 2];         if (tot[i + 3].size() == 0) {           check[i] = 1;           tot[i].push_back(t);           ans.insert(t);         } else {           flag = 1;           for (int j = 0; j < tot[i + 3].size(); j++) {             if (tot[i + 3][j] != t) {               flag = 0;               break;             }           }           if (!flag) {             tot[i].push_back(t);             ans.insert(t), check[i] = 1;           }         }       }     }     printf( %d n , ans.size());     for (set<string>::iterator ite = ans.begin(); ite != ans.end(); ite++) {       cout << *ite << endl;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int t;     cin >> t;     while (t--) {       int r, g, b, w;       cin >> r >> g >> b >> w;       int evens = (r % 2 == 0) + (g % 2 == 0) + (b % 2 == 0) + (w % 2 == 0);       int odds = (r % 2 == 1) + (g % 2 == 1) + (b % 2 == 1) + (w % 2 == 1);       if (evens == 4 || evens == 3 || odds == 4 || (odds == 3 && r && g && b))         cout <<  Yes n ;       else         cout <<  No n ;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     string name;     cin >> name;     string right =   , left =   ;     int i = 0;     for (; true; i++) {       if (name[i] ==  | ) {         break;       }       left += name[i];     }     i++;     for (; i < name.length(); i++) {       right += name[i];     }     int ll = left.length();     int rl = right.length();     string toAdd;     cin >> toAdd;     if (abs(rl - ll) == 0) {       if (toAdd.length() % 2 == 0) {         for (int i = 0; i < toAdd.length(); i += 2) {           right += toAdd[i];           left += toAdd[i + 1];         }         cout << left <<  |  << right;       } else {         cout <<  Impossible ;       }     } else if (abs(rl - ll) == toAdd.length()) {       if (rl > ll) {         for (int i = 0; i < (rl - ll); i++) {           left += toAdd[i];         }         cout << left <<  |  << right;       } else {         for (int i = 0; i < (ll - rl); i++) {           right += toAdd[i];         }         cout << left <<  |  << right;       }     } else if (abs(ll - rl) < toAdd.length()) {       if ((rl + ll + toAdd.length()) % 2 == 0) {         if (rl > ll) {           for (int i = 0; i < (rl - ll); i++) {             left += toAdd[i];           }           for (int i = abs(ll - rl); i < toAdd.length(); i += 2) {             right += toAdd[i];             left += toAdd[i + 1];           }           cout << left <<  |  << right;         } else {           for (int i = 0; i < (ll - rl); i++) {             right += toAdd[i];           }           for (int i = abs(ll - rl); i < toAdd.length(); i += 2) {             right += toAdd[i];             left += toAdd[i + 1];           }           cout << left <<  |  << right;         }       } else {         cout <<  Impossible ;       }     } else {       cout <<  Impossible ;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int MAXN = 1e5 + 7;   pair<double, double> a[MAXN];   double F[MAXN], S[MAXN];   int n, p;   bool cmp(pair<double, double> x, pair<double, double> y) {     return x.first * y.second > x.second * y.first;   }   int vt = -1;   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cin >> n >> p;     for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;     if (n == 1) {       if (p >= a[1].first) {         cout << -1;         return 0;       }       double res = a[1].second / (a[1].first - p);       cout << res;       return 0;     }     sort(a + 1, a + n + 1, cmp);     for (int i = 1; i <= n; i++) S[i] = S[i - 1] + a[i].second;     for (int i = 1; i <= n; i++) F[i] = F[i - 1] + a[i].first;     for (int i = 2; i <= n; i++) {       double value = a[i].second / a[i].first;       double res = value * F[i - 1] - S[i - 1];       if (res > p * value) {         vt = i;         break;       }     }     if (vt == -1) {       double res = S[n] / (F[n] - p);       if (F[n] <= p)         cout << -1;       else         cout << res;       return 0;     }     double kq = S[vt - 1] / (F[vt - 1] - p);     cout << fixed;     cout << setprecision(10) << kq;     return 0;   }
#include <bits/stdc++.h>   #include <string>   #include <cstdint>   #include <iterator>   #include <algorithm>   #include <fstream>   #include <vector>   #include <set>      using namespace std;      using ll = long long;   using ld = long double;      #define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);   #define Int int_fast64_t   #define pb push_back   #define mp make_pair   #define all(x) (x).begin(),(x).end()   #define fi first   #define se second      #define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))   #define mine(a)    (*min_element((a).begin(), (a).end()))   #define maxe(a)    (*max_element((a).begin(), (a).end()))      typedef vector<Int> vi;   typedef pair<Int, Int> pii;   typedef pair<Int, bool> pib;   typedef pair<string, Int> psi;   typedef pair<string, string> pss;   typedef vector<pii> vpii;   typedef vector<psi> vpsi;   typedef vector<pss> vpss;         using namespace std;   // Vector   template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}   template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i <<    ; return os;}   template <typename T>   pair<T, bool> getNthElement(set<T>& searchSet,int index)   {       pair<T, bool> result;          // Check if index is valid or not       if (searchSet.size() > index) {           result.first                   = *(std::next(                   searchSet.begin(),                   index));           result.second = true;       }          else           result.second = false;          // Return the pair       return result;   }         const Int N=7+1e10;      Int gcd(Int a, Int b)   {       // Everything divides 0       if (a == 0)           return b;       if (b == 0)           return a;          // base case       if (a == b)           return a;          // a is greater       if (a > b)           return gcd(a-b, b);       return gcd(a, b-a);   }      int main() {       FAST_IO;          Int t; cin >> t;       while(t--){           Int n; cin >> n;           vi arr(n);           cin >> arr;           Int ans=0;           Int Min=mine(arr);           auto it=find(all(arr), Min);           Int a=it-arr.begin();           if(arr[0]==Min){               cout << n-1 << endl;           }           else{               cout << n << endl;               cout <<  1   << a+1 <<     << Min <<     << Min+1 <<   n ;           }           for(Int i=1;i<n;++i){               cout <<  1   << i+1 <<     << Min <<     << Min+i <<   n ;           }       }          return 0;   }
#include <bits/stdc++.h>   const long long P = 1000000000039LL;   inline long long mul(long long a, long long b) {     long long ans = 0;     for (; b; b >>= 1) {       if (b & 1) {         ans = (ans + a) % P;       }       a = (a << 1) % P;     }     return ans;   }   int k = 0, t = 0;   long long fac[10], ifac[10];   void init() {     fac[0] = 1;     ifac[0] = 1;     fac[1] = 1;     ifac[1] = 1;     for (int i = 2; i < 10; i++) {       ifac[i] = (P - mul(P / i, ifac[P % i])) % P;     }     for (int i = 2; i < 10; i++) {       ifac[i] = mul(ifac[i - 1], ifac[i]);       fac[i] = mul(fac[i - 1], i);     }   }   int cnt[16];   long long f[10], g[10];   long long c[10];   void calc(int len) {     std::fill(f, f + len + 1, 0);     for (int i = 0; i < 16; i++) {       if (cnt[i] < 0) {         return;       }     }     f[0] = 1;     for (int i = 0; i < 16; i++) {       std::fill(g, g + len + 1, 0);       for (int j = 0; j <= cnt[i]; j++) {         for (int u = 0; u <= len - j; u++) {           g[u + j] = (g[u + j] + mul(ifac[j], f[u])) % P;         }       }       std::copy(g, g + len + 1, f);     }   }   void preDP() {     std::fill(cnt, cnt + 16, t);     c[0] = 0;     cnt[1]--;     calc(9);     for (int i = 1; i < 10; i++) {       c[i] = c[i - 1] + 15 * mul(f[i - 1], fac[i - 1]);     }   }   long long solve(long long x) {     long long l = 0, ans = 0;     int d[10];     std::fill(cnt, cnt + 16, t);     for (; x; d[l++] = x % 16, x /= 16)       ;     if (l > 0) {       ans += c[l - 1];     }     for (int i = l - 1; i >= 0; i--) {       for (int u = ((i == l - 1) ? 1 : 0); u < d[i]; u++) {         cnt[u]--;         calc(i);         ans += mul(f[i], fac[i]);         cnt[u]++;       }       cnt[d[i]]--;     }     for (int i = 0; i < 16; i++) {       if (cnt[i] < 0) {         return ans;       }     }     return ans + 1;   }   int main() {     scanf( %d%d , &k, &t);     init();     preDP();     long long l = 0, r = 0xFFFFFFFFFLL;     for (long long mid = 0; l + 1 < r;          solve(mid = (l + r) >> 1) >= k ? r = mid : l = mid)       ;     printf( %I64x n , r);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     ios_base::sync_with_stdio(false);     int n;     double r;     cin >> n >> r;     double X[n];     for (int i = 0; i < n; i++) {       cin >> X[i];     }     double Y[n];     Y[0] = r;     for (int i = 1; i < n; i++) {       Y[i] = r;       for (int j = 0; j < i; j++) {         if (abs(X[i] - X[j]) <= 2 * r)           Y[i] = max(Y[i], Y[j] + sqrt(4 * r * r + 2 * X[i] * X[j] - X[i] * X[i] -                                        X[j] * X[j]));       }     }     for (int i = 0; i < n; i++) {       cout << fixed << setprecision(9) << Y[i] <<    ;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     vector<int> grundies;     grundies.push_back(0);     for (int i = 1; i <= 60; i++) {       long long accum = 0;       long long add = 0;       while (accum < i) {         accum += add;         add++;       }       if (accum > i) {         add--;         accum -= add;       }       add--;       grundies.push_back(add);     }     long long numPiles;     cin >> numPiles;     long long finalState = 0;     for (long long i = 0; i < numPiles; i++) {       long long pile;       cin >> pile;       finalState = finalState ^ grundies[pile];     }     if (!finalState) cout <<  YES  << endl;     if (finalState) cout <<  NO  << endl;     return 0;   }
#include <bits/stdc++.h>   #pragma comment(linker,  /stack:225450978 )   #pragma GCC optimize( Ofast )   #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native )   using namespace std;   const long long Mod = 1000000007LL, INF = 1e9, LINF = 1e18;   const long double Pi = 3.141592653589793116, EPS = 1e-9,                     Gold = ((1 + sqrt(5)) / 2);   long long keymod[] = {1000000007LL, 1000000009LL, 1000000021LL, 1000000033LL};   long long keyCount = sizeof(keymod) / sizeof(long long);   template <class T>   int getbit(T s, int i) {     return (s >> i) & 1;   }   template <class T>   T onbit(T s, int i) {     return s | (T(1) << i);   }   template <class T>   T offbit(T s, int i) {     return s & (~(T(1) << i));   }   template <class T>   int cntbit(T s) {     return __builtin_popcountll(s);   }   auto TimeStart = chrono::steady_clock::now();   auto TimeEnd = chrono::steady_clock::now();   void ControlIO(int argc, char* argv[]);   void TimerStart();   void TimerStop();   void Exit();   long long n, k, d1, d2;   void Input() { cin >> n >> k >> d1 >> d2; }   void Solve() {     long long A = LINF, B = 0, C = 0;     for (long long i = 0; i < 2; i++) {       for (long long j = 0; j < 2; j++) {         if (i)           B = A - d1;         else           B = A + d1;         if (j)           C = B - d2;         else           C = B + d2;         if ((k - A - B - C + min(A, min(B, C)) * 3) % 3 != 0 ||             k - A - B - C + min(A, min(B, C)) * 3 < 0)           continue;         if ((A + B + C + n - k) % 3 == 0 &&             (A + B + C + n - k) / 3 >= max(A, max(B, C))) {           cout <<  yes n ;           return;         }       }     }     cout <<  no n ;   }   int main(int argc, char* argv[]) {     ControlIO(argc, argv);     ios_base::sync_with_stdio(0);     cin.tie(NULL);     int T;     cin >> T;     TimerStart();     while (T--) {       Input();       Solve();     }     TimerStop();     return 0;   }   void ControlIO(int argc, char* argv[]) {}   void TimerStart() {}   void TimerStop() {}   void Exit() {     TimerStop();     exit(0);   }
#include <bits/stdc++.h>   using namespace std;   string to_string(string s) { return     + s +    ; }   string to_string(const char *s) { return to_string((string)s); }   string to_string(bool b) { return (b ?  true  :  false ); }   template <typename A, typename B>   string to_string(pair<A, B> p) {     return  (  + to_string(p.first) +  ,   + to_string(p.second) +  ) ;   }   template <typename A, typename B, typename C>   string to_string(tuple<A, B, C> t) {     return  (  + to_string(get<0>(t)) +  ,   + to_string(get<1>(t)) +  ,   +            to_string(get<2>(t)) +  ) ;   }   template <typename A>   string to_string(A v) {     bool first = true;     string res =  { ;     for (const auto &x : v) {       if (!first) {         res +=  ,  ;       }       first = false;       res += to_string(x);     }     res +=  } ;     return res;   }   void _debug() { cerr <<   n ; }   template <typename Head, typename... Tail>   void _debug(Head H, Tail... T) {     cerr <<     << to_string(H);     _debug(T...);   }   using ll = long long;   using ld = long double;   using ii = pair<int, int>;   using vi = vector<int>;   using vii = vector<ii>;   using vc = vector<char>;   using vb = vector<bool>;   int main() {     cin.tie(nullptr);     ios::sync_with_stdio(false);     cout << fixed << setprecision(9);     int n, k;     cin >> n >> k;     int lo = 1, hi = n;     while (lo < hi) {       int mid = lo + (hi - lo) / 2;       int total = 0;       int cur = mid;       while (cur) {         total += cur;         cur /= k;       }       if (total >= n) {         hi = mid;       } else {         lo = mid + 1;       }     }     cout << hi;   }
#include <bits/stdc++.h>   using namespace std;   template <typename T, typename S>   ostream &operator<<(ostream &os, const pair<T, S> &p) {     return os <<  (  << p.first <<  ,   << p.second <<  ) ;   }   template <typename C, typename T = decay<decltype(*begin(declval<C>()))>,             typename enable_if<!is_same<C, string>::value>::type * = nullptr>   ostream &operator<<(ostream &os, const C &c) {     bool f = true;     os <<  [ ;     for (const auto &x : c) {       if (!f) os <<  ,  ;       f = false;       os << x;     }     return os <<  ] ;   }   template <typename T>   void debug(string s, T x) {     cerr <<   033[1;35m  << s <<   033[0;32m =  033[33m  << x <<   033[0m n ;   }   template <typename T, typename... Args>   void debug(string s, T x, Args... args) {     for (int i = 0, b = 0; i < (int)s.size(); i++)       if (s[i] ==  (  || s[i] ==  { )         b++;       else if (s[i] ==  )  || s[i] ==  } )         b--;       else if (s[i] ==  ,  && b == 0) {         cerr <<   033[1;35m  << s.substr(0, i) <<   033[0;32m =  033[33m  << x              <<   033[31m |  ;         debug(s.substr(s.find_first_not_of(   , i + 1)), args...);         break;       }   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     int n, d;     cin >> n >> d;     vector<array<int, 3>> x(n);     for (int i = 0; i < n; i++) {       int s, a;       cin >> s >> a;       x[i] = {max(s, a), s, a};     }     int ret = 0;     sort(x.begin(), x.end());     for (auto [_, s, a] : x)       if (s >= d) {         ret++;         d = max(d, a);       }     cout << ret <<   n ;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   using lli = long long;   using lld = long double;   using ulli = unsigned long long int;   using pll = pair<lli, lli>;   using ttt = pair<lli, pll>;   using vttt = vector<ttt>;   using vll = vector<pll>;   using vl = vector<lli>;   using vi = vector<int>;   using vvi = vector<vector<int>>;   using cd = complex<lld>;   void sanjeev(int kkkk) {     int t;     cin >> t;     while (t > 0) {       t--;       long long int a, b, x, y;       cin >> a >> b >> x >> y;       long long int n;       cin >> n;       long long int sa = min(n, a - x);       long long int sb = min(n, b - y);       if (a - sa < b - sb) {         a -= sa;         n -= sa;         sb = min(n, b - y);         b -= sb;         cout << a * b <<   n ;       } else {         b -= sb;         n -= sb;         sa = min(n, a - x);         a -= sa;         cout << a * b <<   n ;       }     }   }   int main() {     if (!0) ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     cout << fixed << setprecision(10);     int t = 1;     for (int i = 0; i < t; i++) {       sanjeev(i + 1);     }     if (0) system( pause );   }