fork download 
  1. // بسم الله الرحمن الرحيم
  2.  
  3. #include <bits/stdc++.h>
  4. #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
  5. #undef _GLIBCXX_DEBUG
  6. #pragma GCC optimize("Ofast,inline")
  7. #pragma GCC target("bmi,bmi2,lzcnt,popcnt")
  8. #pragma GCC target("movbe")
  9. #pragma GCC target("aes,pclmul,rdrnd")
  10. #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2")
  11. #define FastX ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  12. #define fll(i,a,b) for(long long i=a;i<b;i++)
  13. #define fllm(i,a,b) for(long long i=a;i>=b;i--)
  14. #define f(b,a) cout << fixed << setprecision(b) << a << endl;
  15. #define rall(x) x.rbegin(),x.rend()
  16. #define mod 998244353
  17. #define pi 3.14159265358979323846
  18. #define all(x) x.begin(),x.end()
  19. #define ull unsigned long long
  20. #define ld long double
  21. #define ll long long
  22. #define pb push_back
  23. #define sz(s) s.size()
  24. #define F first
  25. #define S second
  26. #define nl '\n'
  27.  
  28. using namespace std;
  29. vector<bool>sieve(1e7,1);
  30.  
  31. bool isprime(ull n)
  32. {
  33.     if(n==1) return false;
  34.     for(ll j=2;j*j<=n;j++)
  35.     {
  36.         if(n%j==0)
  37.         {
  38.             return false;
  39.         }
  40.     }
  41.     return true;
  42. }
  43.  
  44. void sev()
  45. {
  46.     for(ll i=2;i*i<1e7;i++)
  47.     {
  48.         if(sieve[i]==1)
  49.         {
  50.             for(ll j=i*i;j<1e7;j+=i)
  51.             {
  52.                 sieve[j]=0;
  53.             }
  54.         }
  55.     }
  56.     sieve[1]=0,sieve[0]=0;
  57. }
  58.  
  59. bool comp(pair<ll,ll>p1,pair<ll,ll>p2)
  60. {
  61.     if(p1.F>p2.F) return true;
  62.     else return false;
  63. }
  64.  
  65. ll fastpower(ll a,ll b)
  66. {
  67.      if(b==0) return 1;
  68.      ll ans=fastpower(a,b/2); ans*=ans;
  69.      if(b&1) return a*ans;
  70.      return ans;
  71. }
  72.  
  73. vector<ll>presum(vector<ll> &v)
  74. {
  75.     vector<ll>p(v.size());
  76.     fll(i,0,v.size())
  77.     {
  78.         if(i==0) p[i]=v[i];
  79.         else p[i]=v[i]+p[i-1];
  80.     }
  81.     return p;
  82. }
  83.  
  84. vector<ll>primefactor(ll n)
  85. {
  86.     ll cn=0,k=0; ll h=1; vector<ll>v;
  87.     while(n%2==0)
  88.     {
  89.         v.push_back(2); n/=2;
  90.     }
  91.     for(ll j=3;j<=sqrt(n);j+=2)
  92.     {
  93.         while(n%j==0)
  94.         {
  95.             v.push_back(j);
  96.             n/=j;
  97.         }
  98.     }
  99.     if(n>2) v.push_back(n);
  100.  
  101.     return v;
  102. }
  103.  
  104. ll nCr(ll n,ll r)
  105. {
  106.     ll sum=1;
  107.     fll(i,1,r+1) sum=sum*(n-r+i)/i;
  108.     return sum;
  109. }
  110.  
  111. vector<ll>divisors(ll n)
  112. {
  113.     vector<ll>c;
  114.     for(ll i=1;i<=sqrt(n);i++)
  115.     {
  116.         if(n%i==0)
  117.         {
  118.             c.push_back(i);
  119.             if(n/i!=i) c.push_back(n/i);
  120.         }
  121.     }
  122.     return c;
  123. }
  124.  
  125. ll lcm(ll a,ll b)
  126. {
  127.     ll k=(a*b)/__gcd(a,b);
  128.     return k;
  129. }
  130.  
  131. ll arteq(ll l,ll r,ll p)
  132. {
  133.     ll k=((r-l)/p)+1;
  134.     ll h=k*(l*2+(k-1)*p); h/=2;
  135.     return h;
  136. }
  137.  
  138. // cout << "YES" << nl;
  139. // cout << "NO" << nl;
  140. ll h=1;
  141. void solve()
  142. {
  143.     ll n,cn=0; cin >> n;
  144.     vector<ll>v=primefactor(n);
  145.     fll(i,0,sz(v)) cn+=v[i];
  146.     if(cn>41) cout << "Case #" << h << ":" << " " << -1 << nl,h++;
  147.     else
  148.     {
  149.         ll k=sz(v);
  150.         fll(i,0,100)
  151.         {
  152.             if(k>100||cn==41) break;
  153.             cn++,v.push_back(1),k++;
  154.         }
  155.         if(cn==41)
  156.         {
  157.             cout << "Case #" << h << ":" << " " << k << " ";
  158.             fll(i,0,sz(v)) cout << v[i] << " ";
  159.             cout << nl; h++;
  160.         }
  161.         else cout << "Case #" << h << ":" << " " << -1 << nl,h++;
  162.     }
  163. }
  164.  
  165. int main()
  166. {
  167.     FastX;
  168.     // freopen("input.txt","r",stdin);
  169.     // freopen("output.txt","w",stdout);
  170.     ll t=1;
  171.     cin >> t;
  172.     while(t--) solve();
  173.  
  174.   return 0;
  175. }
Runtime error #stdin #stdout 1.72s 2095896KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/R5Hnw8
language:
C++14 (gcc 8.3)
created:
223 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!