malteklaes/cpp-code-code_search_net-style huggingface dataset:
#include <bits/stdc++.h>   using namespace std;   const int mara = (int)(1e6) + 5;   vector<long long> a(mara), prime(mara), v(mara), luck;   map<long long, bool> flag;   long long bigmod(long long a, long long b, long long m) {     long long res = 1;     while (b) {       if (b & 1) {         res = (res * a) % m;         b--;       } else {         b /= 2;         a = (a * a) % m;       }     }     return res;   }   void soln() {     long long a, b, sum = 0;     cin >> a >> b;     for (long long i = 1; i <= 10; i++) {       long long as = i * b;       as %= 10;       sum += as;     }     long long vajok = 10 * b;     long long div = a / vajok;     long long rem = a % vajok;     long long res = sum * div;     for (long long i = b; i <= rem; i += b) {       long long temp = i;       temp %= 10;       res += temp;     }     cout << res << endl;   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     ;     long long t;     cin >> t;     while (t--) {       soln();     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     ios_base::sync_with_stdio(false);     int n, k;     cin >> n >> k;     vector<pair<long long, int> > c(n);     vector<int> ans(n);     for (int i = 0; i < n; ++i) {       cin >> c[i].first;       c[i].second = i;     }     set<pair<long long, int> > av;     for (int i = 0; i < k; ++i) av.insert(c[i]);     int now = k;     long long cost = 0;     for (int i = 0; i < n; ++i) {       if (now < n) av.insert(c[now]);       ans[av.rbegin()->second] = ++now;       cost += av.rbegin()->first * (now - av.rbegin()->second - 1);       av.erase(*av.rbegin());     }     cout << cost <<   n ;     for (int i : ans) cout << i <<    ;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int maxn = 2005, maxv = 4e6 + 5;   long long a, b, c, X1, X2, Y1, Y2;   pair<long double, long double> va[6], vb[6];   void exgcd(long long a, long long b, long long &x, long long &y) {     if (!b) {       x = 1, y = 0;       return;     }     exgcd(b, a % b, y, x);     y -= a / b * x;   }   long double sqr(long double x) { return x * x; }   int main() {     scanf( %lld %lld %lld , &a, &b, &c);     scanf( %lld %lld %lld %lld , &X1, &Y1, &X2, &Y2);     long double ans = abs(X1 - X2) + abs(Y1 - Y2);     if (a != 0 && b != 0) {       va[0] = make_pair(X1, (long double)(-c - a * X1) / b);       va[1] = make_pair((long double)(-c - b * Y1) / a, Y1);       vb[0] = make_pair(X2, (long double)(-c - a * X2) / b);       vb[1] = make_pair((long double)(-c - b * Y2) / a, Y2);       for (int i = 0; i <= 1; i++)         for (int j = 0; j <= 1; j++) {           long double ans1 = fabs(X1 - va[i].first) + fabs(Y1 - va[i].second) +                              fabs(X2 - vb[j].first) + fabs(Y2 - vb[j].second);           ans1 += sqrt(sqr(va[i].first - vb[j].first) +                        sqr(va[i].second - vb[j].second));           ans = min(ans, ans1);         }     }     printf( %.9f n , (double)ans);   }
#include <bits/stdc++.h>   using namespace std;   vector<int> edges[100006];   int given[100006] = {0};   int dfs(int i, int c) {     if (given[i] != 0) {       if ((given[i] == 1 && c == 2) || (given[i] == 2 && c == 1)) return 0;     }     if (edges[i].size() != 0) given[i] = c;     int fl = 1;     for (int j = 0; j < edges[i].size(); j++) {       int v = edges[i][j];       if (given[v] != 0) {         if (given[v] == c) return 0;       } else {         int t;         if (c == 1)           t = 2;         else           t = 1;         fl = dfs(v, t) & fl;       }     }     return fl;   }   int main() {     int u, v, n, m;     scanf( %d , &n), scanf( %d , &m);     for (int i = (0); i < (m); ++i) {       scanf( %d , &u), scanf( %d , &v);       edges[u].push_back(v);       edges[v].push_back(u);     }     for (int i = (0); i < (100004); ++i) given[i] = 0;     int flag = 1;     for (int i = 1; i <= n && flag; i++) {       if (given[i] == 0) flag = dfs(i, 1) & flag;     }     if (flag == 0)       puts( -1 );     else {       int a = 0, s = 0, tempp = 22;       for (int i = 1; i <= n; i++)         if (given[i] == 1)           a++;         else if (given[i] == 2)           s++;       printf( %d n , a);       for (int i = 1; i <= n; i++)         if (given[i] == 1) printf( %d  , i);       printf(  n );       printf( %d n , s);       for (int i = 0; i <= n; i++)         if (given[i] == 2) printf( %d  , i);       printf(  n );     }   }
#include <bits/stdc++.h>   using namespace std;   struct Widget {     string type, name;     vector<Widget *> childs;     long long h, w, s, b;     Widget(string _name =   , string _type =   , long long _h = -1,            long long _w = -1) {       h = _h, w = _w;       type = _type;       name = _name;       s = 0;       b = 0;     }     void pack(Widget *W) { childs.push_back(W); }     long long getW() {       if (type ==  normal )         return w;       else if (type ==  VBox ) {         if (childs.size() == 0) return 0;         if (w != -1) return w;         w = 0;         for (int i = 0; i < childs.size(); ++i) w = max(w, childs[i]->getW());         return w = w + 2 * b;       } else {         if (childs.size() == 0) return 0;         if (w != -1) return w;         w = 0;         for (int i = 0; i < childs.size(); ++i) w += childs[i]->getW();         return w = w + 2 * b + s * max(0LL, (long long)childs.size() - 1);       }     }     long long getH() {       if (type ==  normal )         return h;       else if (type ==  HBox ) {         if (childs.size() == 0) return 0;         if (h != -1) return h;         h = 0;         for (int i = 0; i < childs.size(); ++i) h = max(h, childs[i]->getH());         return h = h + 2 * b;       } else {         if (childs.size() == 0) return 0;         if (h != -1) return h;         h = 0;         for (int i = 0; i < childs.size(); ++i) h += childs[i]->getH();         return h = h + 2 * b + s * max(0LL, (long long)childs.size() - 1);       }     }   };   map<string, Widget> M;   int main() {     int N;     cin >> N;     for (int i = 0; i < N; ++i) {       string com;       cin >> com;       if (com ==  Widget ) {         string name;         cin >> name;         int p1 = name.find( ( );         int p2 = name.find( , );         int p3 = name.find( ) );         string rname = name.substr(0, p1);         string val1 = name.substr(p1 + 1, p2 - p1 - 1);         string val2 = name.substr(p2 + 1, p3 - p2 - 1);         int h, w;         sscanf((val1 +     + val2).c_str(),  %d %d , &w, &h);         M[rname] = Widget(name,  normal , h, w);       } else if (com ==  VBox  || com ==  HBox ) {         string name;         cin >> name;         M[name] = Widget(name, com);       } else {         string name, method, val;         int p1 = com.find( . );         int p2 = com.find( ( );         int p3 = com.find( ) );         name = com.substr(0, p1);         method = com.substr(p1 + 1, p2 - p1 - 1);         val = com.substr(p2 + 1, p3 - p2 - 1);         if (method ==  pack ) {           M[name].pack(&M[val]);         } else {           int n;           sscanf(val.c_str(),  %d , &n);           if (method ==  set_spacing )             M[name].s = n;           else             M[name].b = n;         }       }     }     for (map<string, Widget>::iterator it = M.begin(); it != M.end(); ++it)       cout << (it->first) <<     << (it->second.getW()) <<                << (it->second.getH()) << endl;   }
#include <bits/stdc++.h>   using namespace std;   int n, m, a[1000], l[1000], r[1000], mn, mx, ans, mx2, mn2, ansi = -1, ans2;   string s;   int main() {     ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);     cin >> n >> m;     for (int i = 0; i < n; i++) {       cin >> a[i];       if (i == 0) mn = a[i], mx = a[i];       mn = min(mn, a[i]), mx = max(a[i], mx), ans = mx - mn;     }     for (int j = 0; j < m; j++) cin >> l[j] >> r[j];     for (int i = 1; i <= n; i++) {       for (int j = 0; j < m; j++) {         if (i >= l[j] && i <= r[j]) {           for (int k = l[j] - 1; k < r[j]; k++) {             a[k]--;           }         }       }       for (int j = 0; j < n; j++) {         if (j == 0) mn2 = a[j], mx2 = a[j];         mn2 = min(mn2, a[j]), mx2 = max(a[j], mx2);       }       if (ans < mx2 - mn2) ans = mx2 - mn2, ansi = i;       for (int j = 0; j < m; j++) {         if (i >= l[j] && i <= r[j]) {           for (int k = l[j] - 1; k < r[j]; k++) {             a[k]++;           }         }       }     }     cout << ans << endl;     for (int i = 0; i < m; i++) {       if (ansi >= l[i] && ansi <= r[i]) {         ans2++;       }     }     cout << ans2 << endl;     for (int i = 0; i < m; i++) {       if (ansi >= l[i] && ansi <= r[i]) {         cout << i + 1 <<    ;       }     }   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n;     int ans = 0;     cin >> n;     string arr[11] = { ABSINTH ,  BEER ,     BRANDY ,  CHAMPAGNE ,  GIN ,  RUM ,                        SAKE ,     TEQUILA ,  VODKA ,   WHISKEY ,    WINE };     for (int i = 0; i < n; i++) {       string a;       cin >> a;       if (isdigit(a[0]) != 0) {         if (stoi(a) < 18) {           ans++;         }       } else {         for (int j = 0; j < 11; j++) {           if (a == arr[j]) {             ans++;           }         }       }     }     cout << ans;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int inf = 1e9;   const int MOD = 1e9 + 7;   const int N = 1e5 + 10;   int n, p[N], h[N];   vector<int> g[N];   vector<pair<int, int> > ans;   void build(int x, int y) {     int m1 = g[x].size();     if (x == y) {       for (auto i = 0; i < m1 - 1; i++)         ans.push_back(pair<int, int>(g[x][i], g[x][i + 1]));       return;     }     for (auto i = 0; i < g[y].size(); i++)       ans.push_back(pair<int, int>(g[x][i % m1], g[y][i]));   }   void solve() {     int m = 0;     for (auto i = 1; i <= n; i++)       if (!h[i]) {         m++;         int cur = i;         while (!h[cur]) {           h[cur] = 1;           g[m].push_back(cur);           cur = p[cur];         }       }     int root = 1;     for (auto i = 1; i <= m; i++)       if (g[i].size() < g[root].size()) root = i;     if (g[root].size() > 2) {       printf( NO );       return;     }     for (auto i = 1; i <= m; i++)       if (g[i].size() % g[root].size()) {         printf( NO );         return;       }     for (auto i = 1; i <= m; i++) build(root, i);     if (ans.size() != n - 1) {       printf( NO n );       return;     }     printf( YES n );     for (auto i : ans) printf( %d %d n , i.first, i.second);   }   int main() {     scanf( %d , &n);     for (auto i = 1; i <= n; i++) scanf( %d , p + i);     solve();   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n;     cin >> n;     vector<int> a(n);     for (int i = 0; i < n; i++) cin >> a[i];     int pen = 0;     for (int i = 0; i < n; i++) {       if (pen) {         if (a[i])           a[i]--;         else {           cout <<  NO ;           return 0;         }         pen = 0;       }       if (a[i] % 2) pen = 1;       if (i == n - 1) {         if (pen)           cout <<  NO ;         else           cout <<  YES ;       }     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   void __print(int x) { cerr << x; }   void __print(long x) { cerr << x; }   void __print(long long x) { cerr << x; }   void __print(unsigned x) { cerr << x; }   void __print(unsigned long x) { cerr << x; }   void __print(unsigned long long x) { cerr << x; }   void __print(float x) { cerr << x; }   void __print(double x) { cerr << x; }   void __print(long double x) { cerr << x; }   void __print(char x) { cerr <<      << x <<     ; }   void __print(const char* x) { cerr <<     << x <<    ; }   void __print(const string& x) { cerr <<     << x <<    ; }   void __print(bool x) { cerr << (x ?  true  :  false ); }   template <typename T, typename V>   void __print(const pair<T, V>& x) {     cerr <<  { ;     __print(x.first);     cerr <<  , ;     __print(x.second);     cerr <<  } ;   }   template <typename T>   void __print(const T& x) {     int f = 0;     cerr <<  { ;     for (auto& i : x) cerr << (f++ ?  ,  :   ), __print(i);     cerr <<  } ;   }   void _print() { cerr <<  ] n ; }   template <typename T, typename... V>   void _print(T t, V... v) {     __print(t);     if (sizeof...(v)) cerr <<  ,  ;     _print(v...);   }   template <class A>   void read(vector<A>& v);   template <class A, size_t S>   void read(array<A, S>& a);   template <class T>   void read(T& x) {     cin >> x;   }   void read(double& d) {     string t;     read(t);     d = stod(t);   }   void read(long double& d) {     string t;     read(t);     d = stold(t);   }   template <class H, class... T>   void read(H& h, T&... t) {     read(h);     read(t...);   }   template <class A>   void read(vector<A>& x) {     for (auto& a : x) read(a);   }   template <class A, size_t S>   void read(array<A, S>& x) {     for (auto& a : x) read(a);   }   const int MAXN = 2e5 + 5;   long long mod = 998244353;   vector<pair<long long, long long> > gr[200005];   void solve() {     long long n, k;     cin >> n >> k;     vector<long long> a(n);     read(a);     long long sum = 0;     for (long long i = int(n); i >= int(n - k + 1); i--) {       sum += i;     }     cout << sum <<    ;     long long i = 0, j = n - 1;     while (a[i] < n - k + 1) {       i++;     }     while (a[j] < n - k + 1) j--;     long long cnt = 0;     long long ans = 1;     for (long long r = int(i); r < int(j + 1); r++) {       if (a[r] < (n - k + 1)) {         cnt++;       } else {         if (cnt != 0) ans = (ans * cnt) % mod;         cnt = 1;       }     }     if (cnt != 0) ans = (ans * cnt) % mod;     cout << ans % mod <<   n ;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long test;     test = 1;     while (test--) {       solve();     }   }
#include <bits/stdc++.h>   using namespace std;   long long calc(int n, int k) {     int c = n / k;     long long ans = c;     ans += (long long)(n - k) * c / 2;     return ans;   }   int main() {     int n;     cin >> n;     vector<long long> a;     for (int i = 1; i * i <= n; i++)       if (n % i == 0) {         a.push_back(calc(n, i));         if (i * i != n) a.push_back(calc(n, n / i));       }     sort(a.begin(), a.end());     a.erase(unique(a.begin(), a.end()), a.end());     for (long long first : a) printf( %I64d  , first);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   vector<pair<long long int, long long int> > dis(100005), edge;   long long int cnt[100005];   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     long long int t = 0, n, e, x, y, z, i, j, k, g, q, ans = 0, sum = 0, c = 0, h;     cin >> n >> t;     for (i = 1; i <= n; i++) {       cin >> x;       dis[i].first = x;       dis[i].second = i;     }     sort(dis.begin() + 1, dis.begin() + n + 1);     if (dis[1].first != 0) {       cout <<  -1 n ;       return 0;     }     if (n == 1) {       cout <<  0 n ;       return 0;     }     if (dis[1].first == dis[2].first) {       cout <<  -1 n ;       return 0;     }     vector<long long int> v1, v2;     v1.push_back(dis[1].second);     i = 2;     long long int next = 1;     while (i <= n) {       for (j = i; j <= n; j++) {         if (dis[j].first != next) break;         v2.push_back(dis[j].second);       }       i = j;       long long int s1 = v1.size();       long long int s2 = v2.size();       for (j = 0, k = 0; j < s2 && k < s1;) {         if (cnt[v1[k]] == t) {           k++;           continue;         }         edge.push_back(make_pair(v1[k], v2[j]));         cnt[v1[k]]++;         cnt[v2[j]]++;         if (cnt[v1[k]] == t) k++;         j++;       }       if (j != s2) {         cout <<  -1 n ;         return 0;       }       v1.clear();       next++;       for (j = 0; j < s2; j++) {         v1.push_back(v2[j]);       }       v2.clear();     }     ans = edge.size();     cout << ans <<   n ;     for (i = 0; i < edge.size(); i++) {       cout << edge[i].first <<     << edge[i].second <<   n ;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main(void) {     int n, max = 0;     string a[100];     cin >> n;     for (int i = 0; i < n; i++) cin >> a[i];     for (int i = 0; i < n; i++) {       int count = 0;       for (int j = 0; j < n; j++) {         if (i != j) {           if (a[i].compare(a[j]) == 0) count++;         }       }       if (count > max) max = count;     }     cout << max + 1;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int n, m, as = 0;   template <class T>   void read(T &x) {     char ch;     bool ok;     for (ok = 0, ch = getchar(); !isdigit(ch); ch = getchar())       if (ch ==  - ) ok = 1;     for (x = 0; isdigit(ch); x = x * 10 + ch -  0 , ch = getchar())       ;     if (ok) x = -x;   }   int fp(int x, int y) {     int asi = 1;     while (y) {       if (y & 1) asi = 1ll * asi * x % 1000000007;       x = 1ll * x * x % 1000000007;       y >>= 1;     }     return asi;   }   int get_miu(int x) {     int asi = 1;     for (int i = (2), en = (x); i <= en; ++i) {       if (i * i > x) break;       if (x % i == 0) {         asi = 1000000007 - asi;         x /= i;         if (x % i == 0) return 0;       }     }     if (x != 1) asi = 1000000007 - asi;     return asi;   }   int main() {     read(n);     read(m);     if (m % n) {       puts( 0 );       return 0;     };     m /= n;     for (int i = (1), en = (m); i <= en; ++i) {       if (i * i > m) break;       if (m % i == 0) {         as = (as + 1ll * fp(2, m / i - 1) * get_miu(i) % 1000000007) % 1000000007;         if (i * i != m)           as = (as + 1ll * fp(2, i - 1) * get_miu(m / i) % 1000000007) %                1000000007;       }     }     printf( %d n , as);     return 0;   }
/******************************    *                            *    *    author :  rion_cse      *    *    created:  11.07.2021    *    *                            *    ******************************/       /*******************************************************    *                                                     *    *  ***-->    BISMILLAHIR RAHMANIR RAHIM    <--***     *    *  ***--> ISLAMIC UNIVERSITY OF BANGLADESH <--***     *    *  ***--> COMPUTER SCIENCE AND ENGINEERING <--***     *    *                                                     *    *******************************************************/       #include<bits/stdc++.h>   const int MOD=1e9+7;       #define  pf                 printf   #define  sc                 scanf       #define  s1(n)              scanf( %d ,&n)   #define  s2(n1,n2)          scanf( %d %d ,&n1,&n2)   #define  s3(n1,n2,n3)       scanf( %d %d %d ,&n1,&n2,&n3)   #define  s4(n1,n2,n3,n4)    scanf( %d %d %d %d ,&n1,&n2,&n3,&n4)       #define  ss1(n)             scanf( %lld ,&n)   #define  ss2(n1,n2)         scanf( %lld %lld ,&n1,&n2)   #define  ss3(n1,n2,n3)      scanf( %lld %lld %lld ,&n1,&n2,&n3)   #define  ss4(n1,n2,n3,n4)   scanf( %lld %lld %lld %lld ,&n1,&n2,&n3,&n4)       #define  p1(x)              printf( %I64d ,x)   #define  p2(x,y)            printf( %I64d %I64d ,x,y)   #define  p3(x,y,z)          printf( %I64d %I64d %I64d ,x,y,z)       #define  fi(i,a,b)          for(long long i=a;i<=b;i++)   #define  fm(i , a)          for(long long i=1;i<=a;i++)   #define  fd(i,a,b)          for(long long i=b;i>=a;i--)       #define  clr(x)             memset(x,0,sizeof(x))   #define  cln(x)             memset(x,-1,sizeof(x))       #define  fw                 freopen( output.txt , w ,stdout);       typedef long long int ll;   ///ll ar[1009],arr[1009];   using namespace std;       /*ll LCM(ll a,ll b)   {       return (a/(__gcd(a,b)))*b;   }*/       int main()   {        ll t;        cin>>t;        while(t--)        {         ll n,i,j;         cin>>n;         ll ar[n+5],br[n+5],s=0,s1=0;         vector< ll > v,vc;         for(i=1;i<=n;i++)         {          cin>>ar[i];          s+=ar[i];         }            for(i=1;i<=n;i++)         {           cin>>br[i];            s1+=br[i];         }                  if(s!=s1) cout<< -1 <<endl;         else {                for(i=1;i<=n;i++)                {                 if(ar[i]>br[i]){                   for(j=1;j<=(ar[i]-br[i]);j++)                   v.push_back(i);                 }                    else if(ar[i]<br[i]){                    for(j=1;j<=(br[i]-ar[i]);j++)                   vc.push_back(i);                 }                }                cout<<v.size()<<endl;                for(i=0;i<v.size();i++)                 cout<<v[i]<<   <<vc[i]<<endl;              }      }       return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int OO = (int)1e9 + 7;   const int mod = (int)1e9 + 7;   const int MAX = (int)1e5 + 5;   int main(void) {     ios_base::sync_with_stdio(false);     int n;     while (cin >> n) {       vector<pair<int, int> > h;       for (int i = 0; i < n; i++) {         int cur;         cin >> cur;         h.push_back(make_pair(cur, i));       }       sort(h.begin(), h.end());       set<pair<int, int> > s;       for (int i = 0; i < n; i++) {         int l = min(i, h[i].second), r = max(i, h[i].second);         auto it = s.lower_bound(make_pair(l, -1));         if (it == s.end()) {           s.insert(make_pair(r, l));         } else {           int cl = it->second, cr = it->first;           if (r > cl) {             s.erase(it);             s.insert(make_pair(max(cr, r), min(cl, l)));           } else {             s.insert(make_pair(r, l));           }         }       }       int seg = s.size(), tot = 0;       for (auto it = s.begin(); it != s.end(); it++) {         tot += it->first - it->second + 1;       }       cout << seg + (n - tot) <<   n ;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int maxn = 2e5 + 5;   const long long inf = 3e18;   long long t, a[maxn], b[maxn], x[maxn];   long long l[maxn], r[maxn];   int n;   int main() {     scanf( %d%lld , &n, &t);     for (int i = 1; i <= n; i++) scanf( %lld , a + i);     for (int i = 1; i <= n; i++) scanf( %lld , x + i);     for (int i = 1; i <= n; i++) {       if (i < n && x[i] > x[i + 1]) {         puts( No );         return 0;       }       l[i] = a[i] + t;       r[i] = inf;       if (x[i] < i) {         puts( No );         return 0;       }     }     int now = 1;     for (int i = 1; i < n; i++) {       for (now = max(now, i); now < x[i]; now++) {         l[now] = max(l[now], a[now + 1] + t);       }       if (now != n) r[now] = min(r[now], a[now + 1] + t - 1);     }     for (int i = 1; i <= n; i++) {       if (l[i] > r[i]) {         puts( No );         return 0;       }       b[i] = min(r[i], max(b[i - 1] + 1, l[i]));       if (b[i] <= b[i - 1] || b[i - 1] + 1 > r[i]) {         puts( No );         return 0;       }     }     puts( Yes );     for (int i = 1; i <= n; i++) printf( %lld  , b[i]);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main(int argc, char *argv[]) {     long long n, k, a[55];     cin >> n >> k;     for (int i = 1; i <= n; i++) cin >> a[i];     sort(a + 1, a + 1 + n);     if (k > n)       cout << -1 << endl;     else {       cout << a[n + 1 - k] <<     << a[n + 1 - k] << endl;     }     return EXIT_SUCCESS;   }