NOIP2007-09读程序写结果试题汇编

NOIP2009 普及组初赛C语言

1．

#include

int a,b;

int work(int a,int b){ if (a%b)

return work(b,a%b); return b; }

main(){

scanf(\

printf(\}

输入：20 12 输出：_______ 2．

#include

main() {

int a[3],b[3]; int i,j,tmp;

for (i=0;i<3;i++)

scanf(\ for (i=0;i<3;i++) {

a[i]=0;

for (j=0;j<=i;j++) {

a[i]+=b[j];

b[a[i]%3]+=a[j]; } }

tmp=1;

for (i=0;i<3;i++) {

a[i]%=10; b[i]%=10;

tmp*=a[i]+b[i]; }

printf(\}

输入：2 3 5 输出：_______ 3．

#include

const int c=2009;

main() {

int n,p,s,i,j,t;

scanf(\ s=0;t=1;

for(i=1;i<=n;i++) {

t=t*p%c;

for(j=1;j<=i;j++) s=(s+t)%c; }

printf(\}

输入：11 2 输出：

4．

#include #include

#define maxn 50

void getnext(char str[]) {

int l=strlen(str),i,j,k,temp; k=l-2;

while(k>=0&&str[k]>str[k+1]) k--; i=k+1;

while(istr[k]) i++; temp=str[k];

str[k]=str[i-1]; str[i-1]=temp;

for(i=l-1;i>k;i--) for(j=k+1;j

if(str[j]>str[j+1]) {

temp=str[j];

str[j]=str[j+1]; str[j+1]=temp; } return ; }

main() {

char a[maxn]; int n;

scanf(\ while(n>0) {

getnext(a); n--; }

printf(\}

输入：NOIP 3 输出：

===========================================================================

NOIP2008 普及组初赛C语言

1. #include main() {

int i, a, b, c, d, f[4]; for(i = 0; i < 4; i++) scanf(\

a = f[0] + f[1] + f[2] + f[3]; a = a / f[0];

b = f[0] + f[2] + f[3]; b = b / a;

c = (b * f[1] + a) / f[2]; d = f[(b / c ) % 4];

if(f[(a + b + c + d) % 4] > f[2]) printf(\ else

printf(\}

输入：9 19 29 39 输出：_______________

2．#include

void foo(int a, int b, int c) {

if(a > b)

foo(c, a, b); else

printf(\}

main() {

int a, b, c;

scanf(\ foo(a, b, c); }

输入: 3 1 2

输出: __________

3．#include

void func(int ary[], int n ) {

int i=0, j, x; j=n-1;

while(i

while (i0) i++; while (i

ary[i++]=ary[j]; ary[j--]=x; } } }

main() {

int a[20], i, m; m=10;

for(i=0; i

scanf(\ func(a, m);

for (i=0; i

printf( \ printf(\}

输入：5 4 -6 -11 6 -59 22 -6 1 10

输出：____________________________________

4. #include

#define MAX 100

void solve(char first[], int spos_f, int epos_f, char mid[], int spos_m, int epos_m) {

int i, root_m;

if(spos_f > epos_f) return;

for(i = spos_m; i <= epos_m; i++) if(first[spos_f] == mid[i]) {

root_m = i;