xmu 1325

來源:互聯網
上載者:User
#include<stdio.h>     #include<time.h>  #include<iostream>  using namespace std;  double Randomf(double a, double b)     {         double c;         c = (double)(a+(b-a)*1.0*rand()/RAND_MAX);         return c;     }     int Randomi(int a, int b)     {         int c;         c=(int)Randomf((double)a,(double)b);         return c;     }     int main()  {      int n;      int cnt,code1,code2;      int i;      int a[62];//儲存隨機出來的密碼      int b[62];      scanf("%d",&n);      srand((unsigned)time(NULL) );       while(n--)      {          scanf("%d%d%d",&cnt,&code1,&code2);          int code = 0;          while(true)          {              for(i=0;i<cnt;i++)              {                  a[i] = Randomi(0,10);                  b[cnt-i-1] = a[i];              }              code = 0;              //Code=(131*Code+(a[i]-‘0’))% 191              for(i=0;i<cnt;i++)              {                  code = (131*code + a[i])%191;              }              if(code == code1)              {                  code = 0;                  for(i=0;i<cnt;i++)                  {                      code = (131*code + b[i])%191;                  }                  if(code == code2)                      break;              }             }          for(i=0;i<cnt;i++)              printf("%d",a[i]);          printf("\n");      }      return 0;  }  

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.