（未完成）[hduoj]“字节跳动-文远知行杯”广东工业大学第十四届程序设计竞赛(代码片段)

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back

const int N= 1e7+7;
const int inf= 3e3+7;


int main()
    printf("1.00
1.00
1.00
1.00
");

    system("pause");

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back

const int N= 1e6+7;
const int inf= 3e3+7;
const int mod=192600817;

int get(int a,int b)
    return a*4+b+1;


LL f[N],F[N];

int main()
    f[1]=f[2]=1;
    F[1]=1;
    F[2]=2;
    for(int i=3;i<=1e5;i++)
        f[i]=(f[i-1]+f[i-2])%mod;
        F[i]=f[i]*f[i]%mod;
        F[i]+=F[i-1];
        F[i]%=mod;
    
    int q;
    while(cin>>q)
    while(q--)
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        //if(get(a,b)==get(c,d))cout<<0<<endl;
        if(get(c,d)<get(a,b))cout<<(F[get(a,b)]-F[get(c,d)-1]+mod)%mod<<endl;
        else cout<<(F[get(c,d)]-F[get(a,b)-1]+mod)%mod<<endl;
    
    
    system("pause");

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back

const int N= 1e7+7;
const int inf= 3e3+7;

int cnt;

int ans[N],vis[N],mem[N],in[N];

int solve(int x)
    if(mem[x]!=-1)return mem[x];
    if(x==1)return 1;
    if(in[x])return 0;
    in[x]=1;
    int res=x,now=0;
    while(res)
        now+=(res%10)*(res%10);
        res/=10;
    
    mem[x]=solve(now);
    in[x]=0;
    return mem[x];


int main()
    memset(mem,-1,sizeof(mem));
    for(int i=1;i<=2e6;i++)if(mem[i]==-1)mem[i]=solve(i);
    rep(i,2e6)if(mem[i])ans[++cnt]=i;
    int q;
    cin>>q;
    while(q--)
        int k;
        cin>>k;
        cout<<ans[k]<<endl;
    

    system("pause");

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back

const int N= 1e7+7;
const int inf= 3e3+7;
const int mod=1000000007;

LL po(LL x)
    if(x==0)return 1;
    LL res=po(x/2);
    if(x&1)return res*res%mod*2%mod;
    return res*res%mod;


int main()
    LL x;
    while(cin>>x)
        cout<<(x-1)%mod * (po(x)%mod) %mod +1<<endl;
    

    system("pause");

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back

const int N=6;
const int inf= 3e3+7;
const int mod=123456789;
 
LL tmp[N][N];  
void multi(LL a[][N],LL b[][N],int n)  
  
    memset(tmp,0,sizeof tmp);  
    for(int i=0;i<n;i++)  
        for(int j=0;j<n;j++)  
        for(int k=0;k<n;k++)  
        tmp[i][j]=(tmp[i][j]+ (b[i][k]%mod*a[k][j]%mod) )%mod; 
    for(int i=0;i<n;i++)  
        for(int j=0;j<n;j++)  
        a[i][j]=tmp[i][j];  
  
LL init[N][N]=
    2,0,0,0,0,0,
    1,0,0,0,0,0,
    27,0,0,0,0,0,
    9,0,0,0,0,0,
    3,0,0,0,0,0,
    1,0,0,0,0,0
;

LL a[N][N]=
    1,2,1,0,0,0,
    1,0,0,0,0,0,
    0,0,1,3,3,1,
    0,0,0,1,2,1,
    0,0,0,0,1,1,
    0,0,0,0,0,1
;

LL b[N][N]=
    1,2,1,0,0,0,
    1,0,0,0,0,0,
    0,0,1,3,3,1,
    0,0,0,1,2,1,
    0,0,0,0,1,1,
    0,0,0,0,0,1
;

LL res[N][N];

void Pow(LL a[][N],LL n)  
  
    for(int i=0;i<N;i++)
    for(int j=0;j<N;j++) res[i][j]=init[i][j],a[i][j]=b[i][j];
    while(n)  
      
        if(n&1)  
            multi(res,a,N);
        multi(a,a,N);  
        n>>=1;  
      


int main()
    int q;
    cin>>q;
    while(q--)
        LL n;
        cin>>n;
        Pow(a,n-2);
        cout<<res[0][0]<<endl;
    
    system("pause");