思路
把每一个都算出来发现之后发现有规律,前面的特判就行
代码
// Problem: 末三位 // Contest: NowCoder // URL: https://ac.nowcoder.com/acm/contest/9986/C // Memory Limit: 524288 MB // Time Limit: 2000 ms // // Powered by CP Editor (https://cpeditor.org) #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=1000; const double eps=1e-6; const double PI=acos(-1.0); ll n; void solve(){ while(cin>>n){ if(!n) cout<<"001\n"; else if(n==1) cout<<"005\n"; else if(n==2) cout<<"025\n"; else if(n&1) cout<<"125\n"; else cout<<"625\n"; } } int main(){ ios::sync_with_stdio(0);cin.tie(0); // int t;cin>>t;while(t--) solve(); return 0; }