| #include <bits/stdc++.h> |
| using namespace std; |
| typedef unsigned long long ull; |
| typedef long double doubleL; |
| typedef long long ll; |
| #define _SILENCE_CXX20_CISO646_REMOED_WARNING |
| #define memmin(a) memset(a,0,sizeof(a)) |
| #define memmax(a) memset(a,0x3f,sizeof(a)); |
| #define fspr(n) fixed << setprecision(n) |
| #define spr(n) setprecision(n) |
| #define sci setiosflags(ios::scientific) |
| #define siosf setiosflags |
| #define fspr(n) fixed << setprecision(n) |
| #define spr(n) setprecision(n) |
| #define sci setiosflags(ios::scientific) |
| #define siosf setiosflags |
| #define endl '\n' |
| #define ifor(i, l, r) for (ll i = l; i <= r; ++i) |
| #define rfor(i, r, l) for (ll i = r; i >= l; --i) |
| #define npos string::npos |
| #define pi 3.1415926535897932384626433832795 |
| #define fir first |
| #define sec second |
| #define pb push_back |
| #define pf push_front |
| #define type decltype |
| #define last(a) a.size()-1 |
| #define _last(a) prev(a.end(),1) |
| #define all(v) v.begin(),v.end() |
| template <class T, class Container = vector<T>, |
| class Compare = less<typename Container::value_type> > |
| using priqueue = priority_queue<T, Container, Compare>; |
| |
| const int IINF = 0x3f3f3f3f; |
| const long LINF = 0x3f3f3f3f3f3f3f3f; |
| const double EPS = 1.0e-9; |
| const long MOD = 1e9 + 7; |
| const int N = 2e5 + 100; |
| namespace cus { |
| |
| template<typename container> |
| void print(container& a2) { |
| for ( auto i = a2.begin(); i != a2.end(); i++ ) { |
| cout << *i << " \n"[i==prev(a2.end(),1)]; |
| } |
| } |
| |
| template<typename T1> |
| auto print(T1 a, ll l, ll r) -> void { |
| for ( long i = l; i <= r; ++i ) { |
| cout << a[i] << " /n"[i == r]; |
| } |
| } |
| |
| template<typename T> |
| void read(T& w) { |
| w = 0; |
| T f = 1; |
| char ch = getchar(); |
| while ( ch < '0' || ch > '9' ) { |
| if ( ch == '-' ) |
| f = -1; |
| ch = getchar(); |
| } |
| while ( ch <= '9' && ch >= '0' ) { |
| w = w * 10 + ch - '0'; |
| ch = getchar(); |
| } |
| } |
| template<typename T> |
| void print128(T x) { |
| if ( x < 0 ) { |
| putchar('-'); |
| x = -x; |
| } |
| if ( x > 9 )print128(x / 10); |
| putchar(x % 10 + '0'); |
| } |
| } |
| |
| |
| void solve() |
| { |
| |
| } |
| int main(int args, char** argv) |
| { |
| |
| |
| |
| int tt; |
| cin >> tt; |
| while ( tt-- ) |
| { |
| solve(); |
| } |
| return 0; |
| } |
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· AI技术革命,工作效率10个最佳AI工具