A:
思路:x=x+a,y=y-b;
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int a,b,x,y;
int main(){
while(cin>>a>>b>>x>>y){
printf("%d %d\n",a+x,b-y);
}
}
B:
思路一:字符串数组处理,不担心数据范围超出long long:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int n;
char a[100][20];
int check(char *a){
int ans=0;
int s=strlen(a);
for(int i=0;i<s;i++)
ans+=(a[i]-'0');
return ans%6==0?1:0;
}
int main(){
while(cin>>n){
int ans=0;
for(int i=0;i<n;i++)
scanf("%s",&a[i]);
for(int i=0;i<n;i++)
ans+=check(a[i]);
printf("%d\n",ans);
}
}
思路二:常规思路:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n;
long long a[100];
int check(long long n){
int ans=0;
while(n){
ans+=n%10;
n=n/10;
}
return ans%6==0?1:0;
}
int main(){
//cout<<(long long)(pow(10,18))<<endl;
while(cin>>n){
int ans=0;
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
for(int i=0;i<n;i++)
ans+=check(a[i]);
printf("%d\n",ans);
}
}