1-N（1的总数）找规律

见：https://blog.csdn.net/dormousenone/article/details/75208903

 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);

 #include <cstdio>//sprintf islower isupper

 #include <cstdlib>//malloc  exit strcat itoa system("cls")

 #include <iostream>//pair

 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\草稿.txt","r",stdin);

 #include <bitset>

 //#include <map>

 //#include<unordered_map>

 #include <vector>

 #include <stack>

 #include <set>

 #include <string.h>//strstr substr

 #include <string>

 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;

 #include <cmath>

 #include <deque>

 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less

 #include <vector>//emplace_back

 //#include <math.h>

 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor

 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)

 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation

 #define fo(a,b,c) for(register int a=b;a<=c;++a)

 #define fr(a,b,c) for(register int a=b;a>=c;--a)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define pr printf

 #define sc scanf

 #define ls rt<<1

 #define rs rt<<1|1

 typedef long long ll;

 #define rint register int;

 void swapp(int &a,int &b);

 double fabss(double a);

 int maxx(int a,int b);

 int minn(int a,int b);

 int Del_bit_1(int n);

 int lowbit(int n);

 int abss(int a);

 //const long long INF=(1LL<<60);

 const double E=2.718281828;

 const double PI=acos(-1.0);

 const int inf=(<<);

 const double ESP=1e-;

 const int mod=(int)1e9+;

 const int N=(int)1e6+;

 ll ans[];

 char s[N];

 ll get(int l)

 {

     ll sum=;

     for(int i=;i<=l;++i)

         sum*=,sum+=s[i]-'';

     return sum;

 }

 int main()

 {

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     ans[]=;

     while(~sc("%s",s+))

     {

         int l=strlen(s+);

         if(l>)

             pr("83 1111111110\n");

         else

         {

             ll t=get(l);

             for(int i=;i<=;++i)

             {

                 if(i==||t<ans[i+])

                 {

                     pr("%d %lld\n",i,ans[i]);

                     break;

                 }

             }

         }

     }

     return ;

 }

 /**************************************************************************************/

 int maxx(int a,int b)

 {

     return a>b?a:b;

 }

 void swapp(int &a,int &b)

 {

     a^=b^=a^=b;

 }

 int lowbit(int n)

 {

     return n&(-n);

 }

 int Del_bit_1(int n)

 {

     return n&(n-);

 }

 int abss(int a)

 {

     return a>?a:-a;

 }

 double fabss(double a)

 {

     return a>?a:-a;

 }

 int minn(int a,int b)

 {

     return a<b?a:b;

 }
巴特西

1-N（1的总数）找规律

见：https://blog.csdn.net/dormousenone/article/details/75208903

最新文章

热门文章
