“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛题解&&源码【A,水,B,水,C,水,D,快速幂,E,优先队列,F,暴力,G,贪心+排序,H,STL乱搞,I,尼姆博弈,J,差分dp,K,二分+排序,L,矩阵快速幂,M,线段树区间更新+Lazy思想,N,超级快速幂+扩展欧里几德,O,BFS】

 1 #include <bits/stdc++.h>
 2 #define mod 1000000007
 3 typedef long long ll;
 4 using namespace std;
 5 int m;
 6 char s[100005];
 7 int main(){ 
 8 while(cin>>s>>m){
 9 stack<int> st;
10 ll sum=0;
11 for(int i=0;i<strlen(s);i++){
12 sum=sum*26+s[i]-‘a‘;
13 }
14 while(sum){
15 st.push(sum%m);
16 sum/=m;
17 }
18 if(st.size()==0){
19 cout<<0;
20 }else{
21 while(st.size()){
22 cout<<st.top();st.pop();
23 }
24 }
25 cout<<endl;
26 }
27 return 0;
28 } 

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <vector>
 4 #include <string>
 5 #include <cstring>
 6 #include <map>
 7 #include <queue>
 8 #include <algorithm>
 9 using namespace std;
10 
11 const int INF=0x3f3f3f3f;
12 const int maxn=1100;
13 
14 //109
15 char ss[15];
16 int a[110];
17 int main()
18 {
19 
20   int n,m,len;
21   long long s,x;
22   while (~scanf("%s%d",ss,&m))
23   {
24    len=strlen(ss);
25    x=1; s=0;
26 
27    for (int i=len-1;i>=0;i--)
28    {
29     s+=x*(ss[i]-‘a‘);
30     x*=26;
31    }
32   // printf("%lld\n",s);
33    n=0;
34    if (s==0) printf("0");
35    else
36   {
37          while (s)
38    {
39     a[++n]=s%m;
40     s=s/m;
41    }
42    for (int i=n;i>=1;i--) printf("%d",a[i]);
43   }
44     printf("\n");
45   }
46 
47     return 0;
48 }

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <vector>
 4 #include <string>
 5 #include <cstring>
 6 #include <map>
 7 #include <queue>
 8 #include <algorithm>
 9 using namespace std;
10 
11 const int INF=0x3f3f3f3f;
12 const int maxn=50010;
13 
14 //110
15 int a[maxn],l[maxn],r[maxn],d[maxn];
16 int main()
17 {
18 
19   int n,i,j,maxx,len;
20 
21   while (~scanf("%d",&n))
22   {
23     for (i=1;i<=n;i++) scanf("%d",&a[i]);
24     d[1]=a[1]; len=1; l[1]=1;
25     for (i=2;i<=n;i++)
26     {
27         if (a[i]>d[len]) { d[++len]=a[i]; l[i]=len; }
28         else
29         for (j=1;j<=len;j++)
30             if (d[j]>=a[i]) {d[j]=a[i]; l[i]=j; break; }
31     }
32   //  for (i=1;i<=n;i++) printf("%d ",l[i]); printf("\n");
33     r[n]=1; d[1]=a[n]; len=1;
34     maxx=1;
35     for (i=n-1;i>=1;i--)
36     {
37         if (a[i]>d[len]) { d[++len]=a[i]; maxx=max(maxx,min(l[i],len)*2-1); }
38         else
39        for (j=1;j<=len;j++)
40             if (d[j]>=a[i]) {d[j]=a[i]; maxx=max(maxx,min(l[i],len)*2-1); break; }
41     }
42    // for (i=1;i<=n;i++) printf("%d ",r[i]); printf("\n");
43     printf("%d\n",maxx);
44   }
45 
46     return 0;
47 }

 1 #include<iostream>
 2 #include<cstring>
 3 #include<ctime>
 4 #include<cstdlib>
 5 #include<cstdio>
 6 #include<vector>
 7 #include<algorithm>
 8 using namespace std;
 9 struct node{
10     int x,y;
11     bool operator<(node a)const{
12         if(y != a.y)    return y > a.y;
13         return x < a.x;
14     }
15 }a[15],b[15];
16 int n;
17 int flag;
18 bool check(){
19     node b1[15],b2[15];
20     for(int i = 0; i < n; i++){
21         b1[i] = a[i];
22         b2[i] = b[i];
23     }
24     int k = 0,j = 0;
25     for(;k<n&&j<n;){
26         int s1 = (b1[j].x-1)/b2[k].y+1;
27         int s2 = (b2[k].x-1)/b1[j].y+1;
28         if(s1>s2)
29             b1[j].x-=s2*b2[k].y,k++; 
30         else if(s2>s1)
31             b2[k].x-=s1*b1[j].y,j++;
32         else    k++,j++;
33     }
34     return k < n;
35 }
36 int main(){
37     int t;
38     scanf("%d",&t);
39     while(t--){
40         scanf("%d",&n);
41         for(int i = 0; i < n; i++)
42             scanf("%d%d",&a[i].x,&a[i].y);
43         for(int i = 0; i < n; i++)
44             scanf("%d%d",&b[i].x,&b[i].y);
45         sort(b,b+n);
46         check()?puts("YES"):puts("NO");
47     }
48     return 0;
49 }

 1 #include<iostream>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<cstdio>
 5 #include<set>
 6 #include<vector>
 7 using namespace std;
 8 const int mx = 20005;
 9 int n,m;
10 int a[mx];
11 vector<int>v[mx];
12 bool cmp(int a,int b){
13     return a>b;
14 }
15 int main(){
16     int t;
17     scanf("%d",&t);
18     while(t--){
19         scanf("%d%d",&n,&m);
20         for(int i = 0; i < n; i++){
21             scanf("%d",&a[i]);
22             v[i].clear();
23         }
24         for(int i = 1; i < n; i++){
25             for(int j = 0; j < n; j+=i)
26                 v[i].push_back(a[j]);
27             sort(v[i].begin(),v[i].end(),cmp);
28         }
29         while(m--){
30             int k,s;
31             scanf("%d%d",&k,&s);
32             if(k>=n){
33                 if(s>1)    puts("-1");
34                 else printf("%d\n",a[0]);
35             }
36             else{
37                 if(s>v[k].size())    puts("-1");
38                 else printf("%d\n",v[k][s-1]);
39             }
40         }
41     }
42     return 0;
43 }

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 
 4 int z[510],sg[510][510],vis[1030];
 5 int main()
 6 {
 7     int cases,i,j,k,n,m,x,s,len;
 8     bool flag;
 9     z[1]=2; len=1;
10     for (i=3;i<=500;i++)
11         {
12             flag=true;
13             for (j=2;j*j<=i;j++)
14             if (i%j==0) {flag=false; break;}
15          if (flag) z[++len]=i;
16         }
17 
18     sg[1][1]=0;
19     for (i=1;i<=500;i++)
20         for (j=1;j<=500;j++)
21         if (!(i==1 && j==1))
22         {
23             memset(vis,0,sizeof(vis));
24             for (k=1;k<=len;k++)
25             if (i-z[k]>=1 ||j-z[k]>=1)
26             {
27                 if (i-z[k]>=1) vis[sg[i-z[k]][j]]=1;
28                 if (j-z[k]>=1) vis[sg[i][j-z[k]]]=1;
29                 if (i-z[k]>=1 && j-z[k]>=1) vis[sg[i-z[k]][j-z[k]]]=1;
30             }
31             else break;
32             for (k=0;k<=1000;k++)
33                 if (!vis[k])
34                 {
35                     sg[i][j]=k;
36                     break;
37                 }
38 
39         }
40   while (~scanf("%d",&cases))
41    {
42     while (cases--)
43     {
44         scanf("%d%d",&n,&m);
45 
46         if (sg[n][m]) printf("Sora\n"); else printf("Shiro\n");
47     }
48    }