只补的数论部分和签到题
F-Infinite String Comparision
题意:
两个字符串无限次重复,询问字典序大小
思路
将两个字符串中最长的那个循环两次,一定可找出字典序大小
代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=1e5+5;
int main(){
char a[N],b[N];
while(scanf("%s%s",a,b)!=EOF){
int flag=0;
int xa=strlen(a),xb=strlen(b);
int x=max(xa,xb);
int i=0,j=0,cnt=0;
while(cnt<2*x){
if(i==xa)i=0;
if(j==xb)j=0;
if(a[i]>b[j]){
flag=1;
break;
}
else if(a[i]<b[j]){
flag=-1;
break;
}
i++,j++;
cnt++;
}
if(flag==1)printf(">\n");
else if(flag==0)printf("=\n");
else if(flag==-1)printf("<\n");
}
return 0;
}
J-Easy Integration
题意:
计算
思路
贝塔函数
(我是真不知道有这么个玩意儿)
代码
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e6+10;
const int mod = 998244353;
int f[N],inf[N];
int qmi(int a ,int k){int res = 1;while(k){if(k & 1) res = (ll)res * a % mod;a = (ll)a * a % mod; k >>= 1;}return res;}
void init(){
f[0] = inf[0] = 1;
for(int i =1 ; i <= N - 1; i ++){
f[i] = (ll)f[i - 1] * i % mod;
inf[i] = qmi(f[i], mod - 2);
}
}
int main()
{
init();
int n;
while(cin >>n){
int x = f[n], y = inf[n * 2 + 1];
cout << (ll)x * x % mod * y % mod << endl;
}
return 0;
}
D-Quadratic Form
题意:
给定A为n × n的正定二次型矩阵,X=(x1,x2,x3,…,xn)T,b为n × 1的列向量,求满足 XTAX≤1,(XTb)2的最大值
思路:
只需要套板子高斯消元求逆矩阵就可以了
代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
const int N = 205;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll qmi(ll a, ll b){ll res = 1;while(b){if(b & 1) res = res * a % mod;a = a * a % mod;b >>= 1;}return res;}
int n;
ll g[N][N],b[N],f[N][N];
void gauss(){
int c, r;
for(c = 0,r = 0; c < n; c++){
int t = r;
for(int i = r; i < n; i++)
if(g[i][c] > 0){
t = i;
break;
}
if(g[t][c] == 0)return ;
for(int i = 0; i < n; i++){
swap(g[t][i], g[r][i]);
swap(f[t][i], f[r][i]);
}
ll k = qmi(g[r][r], mod - 2);
for(int i = 0;i < n; i++){
g[r][i] = k * g[r][i] % mod;
f[r][i] = k * f[r][i] % mod;
}
for(int i = 0; i < n; i++){
if(i == r)continue;
if(g[i][c]){
k = g[i][c];
for(int j = 0; j < n; j ++){
g[i][j] = (g[i][j] - g[r][j] * k % mod + mod) % mod;
f[i][j] = (f[i][j] - f[r][j] * k % mod + mod) % mod;
}
}
}
r++;
}
}
int main(){
while(cin>>n){
memset(f, 0, sizeof f);
for(int i = 0 ; i < n; i++)f[i][i] = 1;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++){
scanf("%lld",&g[i][j]);
g[i][j] = (g[i][j] % mod + mod) % mod;
}
for(int i = 0; i < n; i++){
scanf("%lld",&b[i]);
b[i] = (b[i] % mod + mod) % mod;
}
gauss();
ll ans = 0;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
ans = (ans + b[j] * f[j][i] % mod * b[i] % mod) % mod;
cout << ans << endl;
}
system("pause");
return 0;
}