Markfieraloha的博客

#include <bits/stdc++.h>using namespace std;int main(){ struct u{ long long key,away, back; }user[1005]; long long n,k,durmax=0,keys[1005],tem; cin >> n>>k; // for k users for(int i=1;i<=k;i++){ .

#include <bits/stdc++.h>using namespace std;int main(){ int n,a,j,x,is_empty[105],cou=0,l,m,flag=0; x=1; for(int i=1;i<=100;i++){ is_empty[i]=1; } cin>>n; // for every purchase demand for(int i=1;i&l.

#include<bits/stdc++.h>using namespace std;int main(){ double lev[10],after, before,tax[10],need[10], rate[10],remain; lev[1] = 3500; lev[2] = lev[1]+1500-45; lev[3] = lev[2]+3000-300; lev[4] = lev[3]+4500-900; lev[5] = .

#include<bits/stdc++.h>using namespace std;int main(){ long long n, m, a[1005], revise, step; cin >> n >> m; // init the queue for(int i=1; i<=n;i++){ a[i]=i; } // for every revision for(int i=1;i.

#include<bits/stdc++.h>using namespace std;int main(){ //flag: // 1: right // 0: left long long pos[1005],n,L,t; bool flag[1005]; cin >> n >> L >> t; //input initial pos and flags for calls for(in.

#include<bits/stdc++.h>using namespace std;int main(){ struct { int no; int x1, x2, y1, y2; } win[15]; struct{ int x, y; } point[15]; int n, m,pos_pre,isin=0,order[15],tem; cin >> n >&g.

#include<bits/stdc++.h>using namespace std;string houzhui(string s) { stack<char> st; string res = ""; char c; for(int i=0;i<s.size();i++){ c = s[i]; if(c>='0'&& c<='9'){ res+=c; .

#include<bits/stdc++.h>using namespace std;int main(){ string s; long long sum=0,cou=1,tem; cin >>s; for(int i=0;i<s.length()-1;i++){ if(s[i]!='-'){ sum+= cou * (s[i]-'0'); cou++; }.

#include<bits/stdc++.h>using namespace std;int main(){ int n,m; long long remain=0,shu, shumax=0,indmax,sumshu=0,tem; cin >> n>>m; for(int i=0;i<n;i++){ shu=0; cin >> tem; remain +=tem;.

#include<bits/stdc++.h>using namespace std;typedef struct Point{ int x; int y;}P;typedef struct Line{ int k0; int k1; int k2;}L;bool Is_classified(vector<P> A, vector<P> B, Line lines){ int coua=0,coub=0;.