FFT Prime number Playing table program

#include <bits/stdc++.h>using namespace Std;typedef long Long ll;void foo (ll x) {int flag=0;for (ll i=2;i*i<=x;++ i) if (x%i==0) {int j=0;for (; x%i==0;x/=i) ++j;if (flag++) cout<< "*"; cout<<i;if (j!=1) cout<< "^" < <j;} if (x!=1) {if (flag) cout<< "*"; cout<<x;} Cout<<endl;} BOOL Bar (ll X) {for (ll i=2;i*i<=x;++i) if (x%i==0) return 0;return 1;} ll Pow (ll u,ll v,ll p) {ll a=1;for (; v;v>>=1) {if (v&1) a=a*u%p;u=u*u%p;} return A;} ll Root (ll d,ll q) {ll k=0,a[16];for (ll I=2,j=d;; ++i) {if (j%i==0) {a[k++]=i;while (j%i==0) j/=i;} if (j<i*i) {if (j!=1) A[k++]=j;break;}} for (ll i=2;; ++i) {ll j=0;for (; J!=k&&pow (i,d/a[j],q)!=1;++j); if (j==k) return i;}} int m;ll X,v[10000];int Main () {for (Int. j=17;j<30;++j) for (ll I=1; (x=i* (1&LT;&LT;J) +1) <1e8;++i) if (i%2&& Bar (x)) V[m++]=x;sort (V,v+m), for (int i=0;i!=m;++i) {COUT&LT;&LT;SETW (8) &LT;&LT;V[I]&LT;&LT;SETW (4) <<root (v[ I]-1,v[i]); int j=0;for (--V[I];V[I]%2==0;++J) V[I]/=2;COUT&LT;&LT;SETW (4) << "2^" <<j<<"*" &LT;&LT;SETW (5) <<v[i]<<endl;}} 

　　

FFT Prime number Playing table program