超级无敌简单题
http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1003&cid=843
題解:暴力就行
/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=150000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,q; int ans,cnt,flag,temp,sum; int a[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);a[++cnt]=1;for(int i=2;i<=1050000;i++){n=i;while(n!=1&&n!=4){k=n;//cout<<i<<" "<<n<<endl;t=0;while(n){t+=(n%10)*(n%10);n/=10;}n=t;}if(n==1){a[++cnt]=i;}if(cnt==150000)break;}//cout<<cnt<<endl;scanf("%d",&t);while(t--){scanf("%d",&n);printf("%d\n",a[n]);}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }?
總結
- 上一篇: 人类史上最大最好的希望事件
- 下一篇: 免费送气球