HUST Online Judge WebBoard
Problem 114514 >> 无聊的加法(但验证了我的想法)
zhangwenbo @ 2024-07-18 22:20:16
[ Quote ] [ Edit ] [ Delete ] 1#
代码介绍:
输入两个正整数x,y,将它们转为vector< queue< stack< map<int,int> > > >类型,并相加,然后输出int类型的和
可输入数据范围(建议):
-1e8<=x,y<=1e8
zhangwenbo @ 2024-07-18 22:20:25
[ Quote ] [ Edit ] [ Delete ] 2#
#include<bits/stdc++.h>
using namespace std;
vector< queue< stack< map<int,int> > > > a;
vector< queue< stack< map<int,int> > > > c;
void CIN(int x,vector< queue< stack< map<int,int> > > > &k){
map<int,int> x2;
x2[1]=x;
stack< map<int,int> > sk;
sk.push(x2);
queue< stack< map<int,int> > > q;
q.push(sk);
vector< queue< stack< map<int,int> > > > c;
c.push_back(q);
k=c;
}
int get(vector< queue< stack< map<int,int> > > > k){
map<int,int> x2;
stack< map<int,int> > sk;
queue< stack< map<int,int> > > q;
vector< queue< stack< map<int,int> > > > c;
c=k;
q=c[0];
sk=q.front();
x2=sk.top();
int sum=x2[1];
return sum;
}
int main(){
int x,y;
cin>>x>>y;
CIN(x,a);
CIN(y,c);
int ans=get(a)+get(c);
cout<<ans;
return 0;
}