哆啦AC梦的博客

#include#include#include#includeusing namespace std;int a[100050],ans,t,cas,n,l,r,w;int main(){ // freopen("in.in","r",stdin); scanf("%d",&t); int cas=0; while(t--) {

#includeusing namespace std;typedef long long LL;const int maxn=1e5+50;int n;LL a[maxn];LL sum[maxn];int l[maxn],r[maxn];int main(){ int cas=0; while(scanf("%d",&n)!=EOF) {

#include#include#include#includeusing namespace std;const int maxn=1e6+50;int lake,n;int a[maxn];int ans[maxn];int have[maxn];set s;int main(){ int t; scanf("%d",&t); while(t--

#include#include#includeusing namespace std;int main(){ int n; ios::sync_with_stdio(false); while((cin>>n)&&n) { long long next=0,ans=0,x; for(int i=0;i<n;i++)

#include#include#include#include#define debuusing namespace std;const int maxn=1e5+50;int cas=0,n;int v[maxn];int gt[maxn];int cost[maxn];void solve(){ memset(v,0,sizeof(v)); int i

#include#include#includeusing namespace std;const int maxn=1e5+50;int n,d,tail,cnt;char st[maxn];int main(){ while(scanf("%d%d",&n,&d)==2&&n) { char ans[maxn]; tail=0;

#include#include#include#include#includeusing namespace std;const int INF=1e7;const int maxn=1e6+50;int x[maxn];int v[maxn];queue q;int cas=0,n,m,k;void prepare(){ x[1]=1; x[2]=2;

#include#include#include#includeusing namespace std;int maxx,top,pos[1000010],a[1000010],t,n;int main(){ scanf("%d",&t); while(t--) { scanf("%d",&n); memset(a,0,size

#include#include#include#include#include#includeusing namespace std;vector ans;deque q;int n;int check(){ for(int i=1;i<q.size();i++) if(q[i]<q[i-1]) return 0; return 1;}i

#include#include#includeusing namespace std;int t,l,zero,one,temp1,temp2,qnum;string st1,st2;int main(){ ios::sync_with_stdio(false); cin>>t; int cas=0; while(t--) {

#include#include#include#includeusing namespace std;string st;int a[1000],num;void rev(int pos){ cout<<num+1-pos<<" "; for(int i=0; i<=pos/2; i++) { int temp=a[i];

#include#include#include#includeusing namespace std;const int maxn=100000+50;struct point{ int v,pos,ans;};int n;point a[maxn];int cmp(point a,point b){ return a.v<b.v;}int main(

#include#define debuusing namespace std;const int maxn=1e6;struct point{ double v[3];} a[maxn];int n,cas=0;int rk[maxn];double ans[maxn];vector g[maxn];void solve(int s,int k){ dou

#include#include#includeusing namespace std;long long ans,sum[16000000];int cas,a[5000],b[5000],c[5000],d[5000],n;int main(){ scanf("%d",&cas); while(cas--) { scanf("%d",&n)

#include#include#include#includeusing namespace std;const int maxn=1200;int n,w,h;int row,col;int d[maxn];int arr[maxn][2];int x[maxn],y[maxn];int idx[10000+50],idy[10000+50];int mat[maxn]

#include#define debuusing namespace std;const int maxn=2*1e5+50;const int INF=1e9+50;struct point{ int w,g; point(int a=0,int b=0):w(a),g(b) {} bool operator < (const point& rhs) con

#include#define debuusing namespace std;const int maxn=5*1e3+50;struct point{ int l,r,id;};int n,v[maxn];point a[maxn],b[maxn];int ansx[maxn],ansy[maxn];int cmp(point a,point b){ i

#include#includeusing namespace std;const int maxn=1000000+50;int p[maxn],s[maxn],water[maxn];int t,n;int main(){ ios::sync_with_stdio(false); cin>>t; while(t--) { cin>>n;

#includeusing namespace std;char ans[]={"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"};int main(){ int cas=0,n; while(scanf("%d",&n)!=EOF) { cas++; if(cas!=1)

#include#include#include#includeusing namespace std;const int maxn=2000;struct point{ int x,y; double rad;};point g[maxn];int x[maxn],y[maxn],r[maxn],n;int check(point a,point b){

#include#include#includeusing namespace std;const int maxn=1000+50;int n;string st[maxn];string st1,st2;void solve(){ string ans="",st3=""; sort(st,st+n); st1=st[n/2-1];st2=st[n/2

#include#include#include#include#define debuusing namespace std;const int maxn=1e7+50;typedef long long LL;int v[maxn];LL sum,maxx;LL n,m,a[maxn],l,r,mid;int check(LL limit){ int i=0,n