1089-1096
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n,a,b;
cin>>n;
while(n--){
cin>>a>>b;
cout<<a+b<<endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n,a,b;
cin>>n;
while(n--){
cin>>a>>b;
cout<<a+b<<endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int a,b;
while(1){
cin>>a>>b;
if(a==0&&a==b)
break;
cout<<a+b<<endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int a,N;
while(1){
cin>>N;
if(N==0){
break;}
int sum=0;
while(N--){
cin>>a;
sum+=a;
}
cout<<sum<<endl;
}
return 0;
}
#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N,M,a;
cin>>N;
while(N--){
cin>>M;
int sum=0;
while(M--){
cin>>a;
sum+=a;
}
cout<<sum<<endl;
}
return 0;
}
#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N,a;
while(cin>>N){
int sum=0;
while(N--){
cin>>a;
sum+=a;
}
cout<<sum<<endl;
}
return 0;
}
#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b){
cout<<a+b<<endl<<endl;
}
return 0;
}
#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N,M,a;
cin>>N;
while(N--){
cin>>M;
int sum=0;
while(M--){
cin>>a;
sum+=a;
}
cout<<sum<<endl;
if(N!=0){
cout<<endl;//错在这
}
}
return 0;
}
1000,1001
#include <iostream>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b){
cout<<a+b<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main(){
int n;
while(cin>>n){
int sum=0;
while(n!=0){
sum+=n;
--n;
}
cout<<sum<<endl<<endl;//要多输出一行空格,看题要仔细!!!
}
return 0;
}
2055
#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int y,T;
char x;
cin>>T;
while(T--){
cin>>x>>y;
int sum=0;
if(x>='a'&&x<='z'){
sum=x;
cout<<(-(sum-96))+y<<endl;
}
if(x>='A'&&x<='Z'){
sum=x;
cout<<(sum-64)+y<<endl;
}
}
return 0;
}