mirror of
https://gitcode.com/Zengtudor/alg2025.git
synced 2025-08-21 18:52:07 +00:00
update
This commit is contained in:
parent
bdcbb82f46
commit
3477697f90
46
src/8/1/P2467.cpp
Normal file
46
src/8/1/P2467.cpp
Normal file
@ -0,0 +1,46 @@
|
|||||||
|
/*
|
||||||
|
1324 1423
|
||||||
|
13254 14253 15324 15423
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <algorithm>
|
||||||
|
#include <cstdint>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <iostream>
|
||||||
|
#include <numeric>
|
||||||
|
#include <vector>
|
||||||
|
using ll = int64_t;
|
||||||
|
|
||||||
|
int main(){
|
||||||
|
return 0;
|
||||||
|
for(ll i=3;i<=6;i++){
|
||||||
|
printf("[%lld]\n",i);
|
||||||
|
static std::vector<ll> v;
|
||||||
|
v.clear();
|
||||||
|
v.resize(i);
|
||||||
|
for(ll i=0;i<v.size();i++)v[i]=i+1;
|
||||||
|
ll sum=0;
|
||||||
|
while (std::next_permutation(v.begin(),v.end())) {
|
||||||
|
if(v[0]!=1)continue;
|
||||||
|
ll now=-1;
|
||||||
|
if(v[0]<v[1])now=1;
|
||||||
|
else now=0;
|
||||||
|
for(ll i=2;i<v.size();i++){
|
||||||
|
if((now==1&&v[i-1]<v[i]) || (now==0&&v[i-1]>v[i])){
|
||||||
|
goto next;
|
||||||
|
}else{
|
||||||
|
if(v[i-1]<v[i])now=1;
|
||||||
|
else now=0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for (ll i=0; i<v.size(); i++) {
|
||||||
|
std::cout<<v[i]<<" ";
|
||||||
|
}
|
||||||
|
std::cout<<'\n';
|
||||||
|
sum++;
|
||||||
|
next:;
|
||||||
|
}
|
||||||
|
printf("sum: %lld\n",sum);
|
||||||
|
}
|
||||||
|
}
|
38
src/8/2/T644759.cpp
Normal file
38
src/8/2/T644759.cpp
Normal file
@ -0,0 +1,38 @@
|
|||||||
|
#include <cstdint>
|
||||||
|
#include <iostream>
|
||||||
|
#include <istream>
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
using ll = int64_t;
|
||||||
|
static inline constexpr std::string cvtfd(ll n,ll b){
|
||||||
|
std::string s;
|
||||||
|
do{
|
||||||
|
ll c=n%b;
|
||||||
|
s=char(c+'0')+s;
|
||||||
|
n/=b;
|
||||||
|
}while(n);
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
ll k,q;
|
||||||
|
std::vector<char> d;
|
||||||
|
int main(){
|
||||||
|
std::iostream::sync_with_stdio(false);
|
||||||
|
std::cin>>k;
|
||||||
|
d.resize(k);
|
||||||
|
for(char&c:d){
|
||||||
|
ll tmp;
|
||||||
|
std::cin>>tmp;
|
||||||
|
c=tmp+'0';
|
||||||
|
}
|
||||||
|
std::cin>>q;
|
||||||
|
while(q--){
|
||||||
|
ll n;
|
||||||
|
std::cin>>n;
|
||||||
|
std::string s = cvtfd(n,d.size());
|
||||||
|
for(char c:s){
|
||||||
|
std::cout<<d[c-'0'];
|
||||||
|
}
|
||||||
|
std::cout<<'\n';
|
||||||
|
}
|
||||||
|
}
|
4
src/8/2/lucky1.ans
Normal file
4
src/8/2/lucky1.ans
Normal file
@ -0,0 +1,4 @@
|
|||||||
|
1
|
||||||
|
2
|
||||||
|
11
|
||||||
|
12
|
7
src/8/2/lucky1.in
Normal file
7
src/8/2/lucky1.in
Normal file
@ -0,0 +1,7 @@
|
|||||||
|
2
|
||||||
|
1 2
|
||||||
|
4
|
||||||
|
1
|
||||||
|
2
|
||||||
|
3
|
||||||
|
4
|
100000
src/8/2/lucky2.ans
Normal file
100000
src/8/2/lucky2.ans
Normal file
File diff suppressed because it is too large
Load Diff
100003
src/8/2/lucky2.in
Normal file
100003
src/8/2/lucky2.in
Normal file
File diff suppressed because it is too large
Load Diff
100000
src/8/2/lucky3.ans
Normal file
100000
src/8/2/lucky3.ans
Normal file
File diff suppressed because it is too large
Load Diff
100003
src/8/2/lucky3.in
Normal file
100003
src/8/2/lucky3.in
Normal file
File diff suppressed because it is too large
Load Diff
100000
src/8/2/lucky4.ans
Normal file
100000
src/8/2/lucky4.ans
Normal file
File diff suppressed because it is too large
Load Diff
100003
src/8/2/lucky4.in
Normal file
100003
src/8/2/lucky4.in
Normal file
File diff suppressed because it is too large
Load Diff
100000
src/8/2/lucky5.ans
Normal file
100000
src/8/2/lucky5.ans
Normal file
File diff suppressed because it is too large
Load Diff
100003
src/8/2/lucky5.in
Normal file
100003
src/8/2/lucky5.in
Normal file
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue
Block a user