#include<cstdio>
using namespace std;
int a,b;
int main(){
freopen("hight.in","r",stdin);
freopen("hight.out","w",stdout);
scanf("%d%d",&a,&b);
printf("%d\n",a+b);
return 0;
}
#include<cstdio>
using namespace std;
int a,b,c;
int main(){
freopen("weight.in","r",stdin);
freopen("weight.out","w",stdout);
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",a+c>=b?1:2);
return 0;
}
T4:给出数列v1..vn,求区间[va,vb]的和,只有一次询问!(yhf用线段树做了。。orz)1<=n<=100,1<=vi<=100#include<cstdio>
using namespace std;
int a;
int main(){
freopen("age.in","r",stdin);
freopen("age.out","w",stdout);
scanf("%d",&a);
printf("%d%d\n",a%10,a/10);
return 0;
}
#include<cstdio>
using namespace std;
int n,a,b,w[105];
int main(){
freopen("valume.in","r",stdin);
freopen("valume.out","w",stdout);