Happy New Year!
Happy New Year!
https://ac.nowcoder.com/acm/contest/9983/D
思路
从n+1开始枚举,把年份然后转为字符串后每位相加
代码
// Problem: Happy New Year!
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/9983/D
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp(aa,bb) make_pair(aa,bb)
#define _for(i,b) for(int i=(0);i<(b);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define X first
#define Y second
#define lowbit(a) (a&(-a))
#define debug(a) cout<<#a<<":"<<a<<"\n"
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
const int N=100010;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-6;
const double PI=acos(-1.0);
void solve(){
int n;cin>>n;
string ss=to_string(n);
int ans=0;
for(auto x:ss){
ans+=x-'0';
}
for(int i=n+1;;i++){
string s=to_string(i);
int res=0;
for(auto c:s){
res+=c-'0';
}
if(ans==res){
cout<<i<<"\n";
return;
}
}
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
// int t;cin>>t;while(t--)
solve();
return 0;
}
查看19道真题和解析