题目都在这个链接:http://ac.jobdu.com/graoldexamset.php
(1)
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=120000;
const int maxk=10000;
int vis[maxn];
int prime[maxk];
int c;
void getprime()
{
for(int i=2;i*i<maxn;i++)
{
if(!vis[i])
for(int j=2;j*i<maxn;j++)
vis[i*j]=1;
}
for(int i=2;i<maxn;i++)
if(!vis[i])
prime[c++]=i;
}
int main()
{
getprime();
int k;
while(scanf("%d",&k)!=EOF)
printf("%d\n",prime[k-1]);
return 0;
}
(2)
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int maxn=1000+10;
int a[maxn],b[maxn];
int n;
int main()
{
while(scanf("%d",&n)!=EOF)
{
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
b[0]=a[0];
int c=0;
for(int i=1;i<n;i++)
if(b[c]!=a[i])
{
b[++c]=a[i];
}
for(int i=0;i<c;i++)
printf("%d ",b[i]);
printf("%d\n",b[c]);
}
return 0;
}
(3)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
const int maxn=100+10;
int d[maxn][maxn],v[maxn][maxn];
char s[maxn],t[maxn];
int max(int a,int b)
{
return a>b?a:b;
}
int dp(int i,int j)
{
if(v[i][j]) return d[i][j];
v[i][j]=1;
if(i==strlen(s)||j==strlen(t))
{
return d[i][j]=0;
}
if(s[i]==t[j])
{
return d[i][j]=dp(i+1,j+1)+1;
}
else return d[i][j]=max(dp(i+1,j),dp(i,j+1));
}
int main()
{
while(scanf("%s%s",s,t)==2)
{
memset(v,0,sizeof(v));
printf("%d\n",dp(0,0));
}
return 0;
}
(4)这一题有很简单的算法,我想的太麻烦了
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char mon[12][12]={"January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};
char week[7][12]={"Sunday", "Monday", "Tuesday", "Wednesday","Thursday", "Friday", "Saturday"};///faulty
int m[12]={31,28,31,30,31,30,31,31,30,31,30,31};
const int newy=2001;
const int lefd=78;从2001年10月14号剩余的天数
int main()
{
char month[12];
int day,year,j,sum=0;
for(j=0;j<12;j++)
{
sum+=m[j];
m[j]=sum;
///printf("%d\n",m[j]);
}
while(scanf("%d%s%d",&day,month,&year)!=EOF)
{
int i;
for(i=0;i<12;i++)
if(!strcmp(month,mon[i]))
break;
if(year>newy)
{
int run=(year/400+year/4-year/100)-(newy/400+newy/4-newy/100);///这两年之间闰年的个数
int days=(year-newy-1)*365+run+lefd;
if(i>0) days+=m[i-1];
if((!year%400)||(year%4==0&&(year%100)))///如果最后一年是闰年
{
if(i<2) days--;///把最后一年的2月29减去
}
days+=day;
printf("%s\n",week[days%7]);
}
else if(year<newy)
{
int run=(newy/400+newy/4-newy/100)-(year/400+year/4-year/100);///这两年之间闰年的个数
int days=(newy-year-1)*365+run+365-lefd;
int preday=0;
if(i>0) preday=m[i-1];
days+=(365-preday);
days-=day;
if((year%400==0)||(year%4==0&&(year%100)))
{
if(i<2) days++;
}
printf("%s\n",week[(7-days%7)%7]);
}
else///年份相等
{
int days=day;
///看月份
if(i<9)///如果在10月份之前
{
if(i>0)
days+=m[i-1];
days=365-lefd-days;
printf("%s\n",week[(7-days%7)%7]);///faulty
}
else if(i>9)
{
days=m[i-1]+day;
days=days-(365-lefd);
printf("%s\n",week[days%7]);
}
else
{
if(day>14) printf("%s\n",week[(day-14)%7]);
else printf("%s\n",week[(7-(14-day)%7)%7]);
}
}
}
}
(5)还没做出来。。。