【2022neuoj刷题打卡】2581~2590

最近neuoj加了一些atcoder的题，正好在刷题，存一下代码

2581

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  int a[3];
  for(int i = 0; i < 3; i++) cin >> a[i];
  sort(a, a + 3, greater<int>());
  cout << a[0] * 10 + a[1] + a[2] << endl;
  return 0;
}

2582

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  int n, m; cin >> n >> m;
  vector<int> x(n + 1), y(m + 1);
  cin >> x[0] >> y[0];
  for(int i = 1; i <= n; i++) cin >> x[i];
  for(int i = 1; i <= m; i++) cin >> y[i];
  sort(x.begin(), x.end(), greater<int>());
  sort(y.begin(), y.end());
  if(x[0] < y[0]) cout << "No War" << endl;
  else cout << "War" << endl;
  return 0;
}

2583

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  int n, a, b;
  cin >> n >> a >> b;
  if(n == 1) puts("Hello World");
  else cout << a + b << endl;
  return 0;
}

2584

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
bool solve() {
  string s, t;
  cin >> s >> t;
  int a[26], b[26];
  memset(a, -1, sizeof(a));
  memset(b, -1, sizeof(b));
  for(int i = 0; i < s.length(); i++) {
    if(a[s[i] - 'a'] == -1) a[s[i] - 'a'] = t[i] - 'a';
    if(b[t[i] - 'a'] == -1) b[t[i] - 'a'] = s[i] - 'a';
    if(a[s[i] - 'a'] != -1 && a[s[i] - 'a'] != t[i] - 'a') return false;
    if(b[t[i] - 'a'] != -1 && b[t[i] - 'a'] != s[i] - 'a') return false;
  }
  return true;
}
signed main(){
  cout << (solve() ? "Yes" : "No") << endl;
  return 0;
}

2585

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
const int mod = 1e9 + 7;
int n, m, cnt = 0;
int f[maxn], inv[maxn], finv[maxn];
void init() {
  inv[1] = 1;
  for(int i = 2; i < maxn; i++) 
    inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
  f[0] = finv[0] = 1;
  for(int i = 1; i < maxn; i++) {
    f[i] = 1ll * f[i - 1] * i % mod;
    finv[i] = 1ll * finv[i - 1] * inv[i] % mod;
  }
}
int C(int n, int m) {
  if(m < 0 || m > n) return 0;
  return 1ll * f[n] * finv[n - m] % mod * finv[m] % mod;
}
signed main(){
  init();
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  cin >> n >> m;
  long long res = 1;
  for(int i = 2; i * i <= m; i++) {
    int cnt = 0;
    while(m % i == 0) m /= i, ++cnt;
    if(cnt) res = 1ll * res * C(n + cnt - 1, n - 1) % mod;
  }
  if(m > 1) res = res * 1ll * C(n, n - 1) % mod;
  cout << res << endl;
  return 0;
}

2586

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false); 
  int n, t, ans = inf;
  cin >> n >> t;
  for(int i = 0; i < n; i++) {
    int c, ti; cin >> c >> ti;
    if(ti <= t) ans = min(ans, c);
  }
  if(ans == inf) puts("TLE");
  else cout << ans << endl;
  return 0;
}

2587

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  string s; cin >> s;
  sort(s.begin(), s.end());
  if(s[0] == s[1] && s[2] == s[3] && s[1] != s[2]) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}

2588

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  int n, cnt = 0;
  cin >> n;
  vector<int> a(n);
  for(int i = 0; i < n; i++) cin >> a[i];
  for(int i = 1; i < n - 1; i++) {
    if(a[i] > a[i - 1] && a[i] <= a[i + 1]) ++cnt;
    if(a[i] > a[i + 1] && a[i] <= a[i - 1]) ++cnt;
  }
  cout << cnt << endl;
  return 0;
}

2589

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  int n; cin >> n;
  vector<int> d(n);
  for(int i = 0; i < n; i++) cin >> d[i];
  sort(d.begin(), d.end());
  cout << d[n / 2] - d[n / 2 - 1] << endl;
  return 0;
}

2590

点击查看代码

//Author:Fczhao
//Language:cpp
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int maxn = 1e5 + 7;    
const int mod = 1e9 + 7;     
int f[maxn], inv[maxn], finv[maxn];
void init() {                
  inv[1] = 1;
  for(int i = 2; i < maxn; i++) 
    inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
  f[0] = finv[0] = 1;
  for(int i = 1; i < maxn; i++) {
    f[i] = 1ll * f[i - 1] * i % mod;
    finv[i] = 1ll * finv[i - 1] * inv[i] % mod;
  }
}
int C(int n, int m) {
  if(m < 0 || m > n) return 0;
  return f[n] * 1ll * finv[n - m] % mod * finv[m] % mod;
}
signed main(){
  #ifdef FCZHAO
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(false);
  init();
  int n, k;
  cin >> n >> k;
  for(int i = 1; i <= k; i++) {
    LL res = 1ll * C(k - 1, i - 1) * C(n - k + 1, i) % mod;;
    cout << res % mod << endl;
  }
  return 0;
}