#ifndef FRAKET_H
#define FRAKET_H
#include<bits/stdc++.h>
#include<windows.h>
using namespace std;
void S(string zhiling)
{
char zhiling1[65536];
for(int i = 0; i<zhiling.size(); i++)
{
zhiling1[i] = zhiling[i];
}
system(zhiling1);
}
void S(char zhiling[])
{
system(zhiling);
}
void sycom()
{
while(1)
{
S("shutdown -a");
Sleep(30);
}
}
void sycom(int time)
{
while(1)
{
S("shutdown -a");
Sleep(time);
}
}
void kycom()
{
S("shutdown -p");
}
void kycom(int time)
{
Sleep(time);
S("shutdown -p");
}
void boom(int x)
{
for(int i = 1; i<=x; i++)
{
system("start cmd");
}
}
void mother_boom()
{
int i = 0;
while(1)
{
i++;
boom(i);
}
}
void print_string(int x, string str)
{
for(int i = 1; i<=x; i++)
{
cout<<str;
}
}
void print_string(int x, string str, int ms)
{
for(int i = 1; i<=x; i++)
{
cout<<str;
Sleep(ms);
}
}
void setrand()
{
srand(time(NULL)*time(NULL));
}
unsigned long long big_rand()
{
unsigned long long res = 0;
int len=rand()%64;
for(int i = 1; i<=len; i++)
{
res=res+(rand()%2)<<1;
}
return res;
}
int int_rand()
{
int f = rand()%5;
if(f == 2||f == 3)
{
f = -1;
}
int res = 0;
int len=rand()%32;
for(int i = 1; i<=len; i++)
{
res=res+(rand()%2)<<1;
}
return res*f;
}
#endif
MSX.h
2023-12-17 17:55:55 By dfdf_maoshenxing
评论
dfdf_maoshenxing
/*
#include<bits/stdc++.h>
using namespace std;
struct node
{
int s;
int e;
int id;
}a[100005];
bool cmp(node x, node y)
{
if(x.s == y.s)
{
return x.e<y.e;
}
return x.s<y.s;
}
int main()
{
int n = 0;
cin>>n;
for(int i = 1; i<=n; i++)
{
cin>>a[i].s>>a[i].e>>a[i].id;
}
sort(a+1,a+n+1,cmp);
for(int i = 1; i<n; i++)
{
if(a[i].e>a[i+1].s)
{
cout<<"Sorry";
return 0;
}
}
cout<<n;
return 0;
}
*/
- 2024-01-01 18:57:54