Zengtudor/alg2025
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
Zengtudor 2025-02-14 14:10:10 +08:00
parent ec5818ec98
commit aa21e80017
2 changed files with 3 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/2/P2455.cpp
View File

@ -4,7 +4,6 @@
#include <iomanip>
#include <ios>
#include <iostream>
#include <random>
#include <utility>
using ll = int64_t;
@ -33,9 +32,7 @@ bool isz(double a){
if(a > 1e-8 || a<-1e-8){
return false;
}
// if(a!=0){
// return false;
// }
return true;
}
@ -47,16 +44,6 @@ int main(){
std::cin>>m[i][j];
}
}
// std::random_device rd{};
// std::uniform_int_distribution<ll> uid(1,n);
// ll asp[maxn];
// for(ll i=1;i<=n;i++){
// asp[i]=uid(rd);
// }
// for(ll i=1;i<=n/2;i++){
// sp(m[i],m[asp[i]]);
// }
// pm();
for(ll i=1;i<=n;i++){
static ll nowused{1};

4
src/2/P3370.cpp
View File

@ -14,7 +14,7 @@ int n, ans = 1;
int prime = 233317;
const ull mod = 212370440130137957ll;
ull hashe(char s[]) {
ull mhash(char *s) {
int len = strlen(s);
ull ans = 0;
for (int i = 0; i < len; i++)
@ -27,7 +27,7 @@ int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
a[i] = hashe(s);
a[i] = mhash(s);
}
sort(a + 1, a + n + 1);
for (int i = 1; i < n; i++) {