id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
25,800 | void main()
{
int m,n,i,a[200],*p=a;
scanf("%d%d",&n,&m);
p=p+m;
for(i=1;i<=n-m;i++)
{
scanf("%d",p);
p++;
}
p=a;
for(i=1;i<=m;i++)
{
scanf("%d",p);
p++;
}
p=a;
for(i=0;i<=n-2;i++)
{
printf("%d ",*p);
p++;
}
printf("%d",*p);
}
| 52 |
25,801 | int main(int argc, char* argv[])
{
int*p,*point,*start,*begin,*temp,i,n,m;
scanf("%d%d",&n,&m);
p=(int*)malloc(sizeof(int)*n);
point=p;
start=p;
begin=p;
for(i=0;i<n;i++,start++)
{
scanf("%d",start);
}
point+=(n-m);
temp=point;
for(;point<start;point++)
{
printf("%d ",*point);
}
for(;begin<temp-1;begin++)
{
printf("%d ",*begin);
}
printf("%d",*begin);
free(p);
return 0;
}
| 52 |
25,802 | void main()
{
int *a,i,n,j,m;
scanf("%d %d",&n,&m);
a=(int *)malloc((n+1)*sizeof(int));
for(i=1;i<=n;i++)
scanf("%d",a+i);
for(i=1;i<=m;i++)
{
*(a+0)=*(a+n);
for(j=n;j>0;j--)
*(a+j)=*(a+j-1);
}
for(i=1;i<n;i++)
printf("%d ",*(a+i));
printf("%d",*(a+i));
}
| 52 |
25,803 | struct n
{
int pi;
struct n * next;
}num[100];
void main()
{
int a[100],i,n,m;
struct n *p;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
num[i].pi=a[i];
}
for(i=0;i<n-1;i++)
{
num[i].next=&num[i+1];
}
num[n-1].next=&num[0];
p=&num[n-m];
for(i=0;i<n-1;i++)
{
printf("%d ",p->pi);
p=p->next;
}
printf("%d\n",p->pi);
}
| 52 |
25,804 | /************************************
* ???? *
* *
* Created on: 2010-12-14 *
* Author: ?? *
************************************/
void move(int *p,int m,int n) //???????????
{
int a;
a=*(p+m-1); //?????????????a?
for(int i=m-1;i>0;i--)
{
*(p+i)=*(p+i-1); //??????????
}
*p=a;
}
int main()
{
int a,b;
cin>>a>>b; //???????????
const int a1=a;
int num[a1];
for(int j=0;j<a;j++)
{
cin>>num[j]; //????
}
while(b>0)
{
move(&num[0],a,b); //??????
b--;
}
cout<<num[0];
for(int j=1;j<a;j++)
{
cout<<" "<<num[j]; //????
}
return 0;
}
| 52 |
25,805 | int main()
{
int n,m,i,a[201];
scanf("%d %d\n",&n,&m);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<n-m;i++)
{
a[i+n+m]=a[i];
}
for (i=n-m;i<n;i++)
{
a[i+m]=a[i];
}
for (i=0;i<n;i++)
{
a[i]=a[i+n];
}
for (i=0;i<n-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-1]);
return 0;
} | 52 |
25,806 | int main()
{
int n,m;
int a[100];
int i,j,k;
int temp;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",a+i);
for(j=n-m;j<n;j++)
for(k=0;k<n-m;k++)
{
temp=*(a+j-k);
*(a+j-k)=*(a+j-1-k);
*(a+j-1-k)=temp;
}
for(i=0;i<n;i++)
printf("%d%c",*(a+i),(i==n-1)?'\n':' ');
return 0;
} | 52 |
25,807 |
int *p=NULL;
void rearrange(int str[100],int n)
{
int t;
t=str[n-1];
for(p=&str[n-2];p>=&str[0];p--)
{
*(p+1)=*p;
}
str[0]=t;
}
int main()
{
int number[100];
int n,m;
cin>>n>>m;
int i;
for(i=0;i<n;i++)
cin>>number[i];
while(m--)
{
rearrange(number,n);
}
for(i=0;i<n-1;i++)
cout<<number[i]<<" ";
cout<<number[n-1];
return 0;
}
| 52 |
25,808 |
int main() {
int n, m, i;
int a[220];
scanf("%d%d", &n, &m);
for(i = 0; i < n; i ++) {
scanf("%d", &a[i]);
}
for(i = n-1; i >= 0; i --) {
a[i+m] = a[i];
}
for(i = 0; i < m; i ++) {
a[i] = a[i+n];
}
int flag = 0;
for(i = 0; i < n; i ++) {
if(flag == 0) {
printf("%d", a[i]);
flag = 1;
continue;
}
if(flag == 1) {
printf(" %d", a[i]);
}
}
return 0;
}
| 52 |
25,809 | int main()
{
int i,j,k,m,n,a[100];
int *p;
p=a;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=p+n-m;
for(i=0;i<m;i++)
printf("%d ",*(p+i));
p=a;
for(i=0;i<n-m-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
return 0;
}
| 52 |
25,810 |
//
// main.cpp
// xunhuan
//
// Created by blues cookie on 12-12-9.
// Copyright (c) 2012? blues cookie. All rights reserved.
//
int main(int argc, const char * argv[])
{
int m,n,i,j,k;
int a[100];
cin>>n>>m;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=n-m+1;i<=n;i++) *(a+i+m)=*(a+i);//??m????m
for(i=n-m;i>=1;i--) *(a+i+m)=*(a+i);//?n-m?????
for(i=1;i<=m;i++) *(a+i)=*(a+i+n);//?M?????
for(i=1;i<=n-1;i++) cout<<a[i]<<' ';//?? ???
cout<<a[n];
return 0;
}
| 52 |
25,811 | void main()
{
int i,m,n,*a,*b;
scanf("%d %d",&n,&m);
a=(int*)malloc(n*sizeof(int));
b=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++) scanf("%d",a+i);
for(i=0;i<n-m;i++)*(b+i)=*(a+i);
for(i=0;i<m;i++)*(a+i)=*(a+n-m+i);
for(i=0;i<n-m;i++)*(a+m+i)=*(b+i);
for(i=0;i<n-1;i++)printf("%d ",*(a+i));printf("%d\n",*(a+i));
free(a);free(b);
}
| 52 |
25,812 | int main ( )
{
int n, m, i, j, t, a[100]; /*????????*/
cin >>n >>m;
for (i = 0;i < n;i++) /*???????????????*/
cin >>a[i];
for (i = 0;i < m;i++)
{
t = a[i];
a[i] = a[n-m+i]; /*?m???????????????????*/
for (j = n-m+i;j > i;j--) /*?n-m????????*/
{
if (j == i + 1)
a[j] = t;
else a[j] = a[j-1];
}
}
for (i = 0;i < n;i++)
{
if (i == 0)
cout <<a[i];
else cout <<' '<<a[i];
}
return 0;
} | 52 |
25,813 | int main()
{
int a[200];
int i,j,n,m,temp,temp2;
scanf("%d%d",&n,&m);
for (i=1; i<=n; i++) scanf("%d",&a[i]);
for (j=1; j<=m; j++) {
temp=a[n];
for (i=n; i>=2; i--) {
temp2=a[i];
a[i]=a[i-1];
a[i-1]=temp2;
}
a[1]=temp;
}
for (i=1; i<n; i++) printf("%d ",a[i]);
printf("%d",a[n]);
return 0;
} | 52 |
25,814 | void main ()
{
int n,m ,i,j;
scanf ("%d%d",&n,&m);
int a[100];
for (i=0;i<n;i++)
scanf ("%d",&a[i]);
int *p;
p=a;
for (i=1;i<(n-m+1);i++)
p++;
for (i=0;i<m;i++)
{
printf ("%d ",*p);
p++;}
p=a;
for (i=0;i<n-m-1;i++)
{printf("%d ",*p);
p++;}
printf("%d",*p);
}
| 52 |
25,815 |
int main(){
int n,m;
scanf("%d %d", &n, &m);
int num[100];
int *p=num;
int i;
for(i=0;i<n;i++){
scanf("%d",&num[i]);
}
for(i=0;i<m;i++){
int templast=*(p+n-1);
int j;
for(j=n-1;j>=1;j--){
*(p+j)=*(p+j-1);
}
*p=templast;
}
printf("%d",*p);
for(i=1;i<n;i++){
printf(" %d",*(p+i));
}
printf("\n");
return 0;
}
| 52 |
25,816 | int main(){
int n,m,a[100],i,b;
cin>>n>>m;
for(i=0;i<n;i++)
cin>>*(a+i);
while(m>0){
b=*(a+n-1);
for(i=n-1;i>0;i--)
*(a+i)=*(a+i-1);
*a=b;
m--;
}
for(i=0;i<n-1;i++)
cout<<*(a+i)<<" ";
cout<<*(a+n-1);
} | 52 |
25,817 | struct Node;
typedef struct Node *pNode;
struct Node
{
int x;
pNode next;
};
pNode create()/*??head*/
{
pNode p;
p=(pNode)malloc(sizeof(struct Node));
p->next=NULL;
return p;
}
void sort(pNode head,int n)/*head???????n???*/
{
pNode p=NULL,q=NULL,s=NULL;
int i;
for (i=1;i<=n;i++)
{
s=(pNode)malloc(sizeof(struct Node));
scanf("%d",&s->x);
q=head;
p=head->next;
while (p)
{
if (p->x>=s->x)
break;
q=p;
p=p->next;
}
q->next=s;
s->next=p;
}
}
void outputdata(pNode p)/*??head*/
{
p=p->next;
while(p->next)
{
printf("%d ",p->x);
p=p->next;
}
printf("%d",p->x);
}
pNode inputdata(int n)/*??head?????n???*/
{
pNode q=NULL,p=NULL,head=NULL;
int i;
head=create();
q=head;
for (i=1;i<=n;i++)
{p=(pNode)malloc(sizeof(struct Node));
if (p!=NULL)
{
scanf("%d",&p->x);
p->next=NULL;
q->next=p;
q=p;
}
}
return head;
}
void del(pNode p,int k)/*??head??k???*/
{
pNode q=NULL;
q=p;
p=p->next;
while(p)
if (p->x==k)
{
q->next=p->next;
free(p);
p=q->next;
}
else
{q=p;p=p->next;}
}
pNode rinputdata(int n)/*??head,????n???*/
{
pNode q=NULL,p=NULL,head=NULL;
int i;
head=create();
for (i=1;i<=n;i++)
{
p=(pNode)malloc(sizeof(struct Node));
if (p!=NULL)
{
scanf("%d",&p->x);
p->next=q;
q=p;
}
}
head->next=q;
return head;
}
void outputk(pNode p,int k)/*???k???*/
{
int i=1;
p=p->next;
while(p)
{
if (i==k)
printf("%d",p->x);
p=p->next;
i++;
}
}
void change(pNode p,int n,int m)/*?head?n?????m???????*/
{
int i=1;
pNode q=NULL,s=NULL,head=NULL;
q=p;
head=p;
p=p->next;
while(p)
{
if (i==n-m+1)
break;
i++;
q=p;
p=p->next;
}
s=head;
while(s->next)
s=s->next;
q->next=NULL;
s->next=head->next;
head->next=p;
}
void found(pNode p,int k)/*??head???k???*/
{
pNode head=p;
int ok=1;
p=head->next;
while(p)
{
if (k==p->x)
{
printf("%d\n",p->x);
ok=0;
}
p=p->next;
}
if (ok)
printf("No Found!");
}
int main()
{
int m,n;
pNode head=NULL;
scanf("%d %d",&n,&m);
head=inputdata(n);
change(head,n,m);
outputdata(head);
return 0;
}
| 52 |
25,818 |
int main(){
struct shu{
int z;
struct shu*next;
}*shu,*header;
int n,m,i,d=1;
scanf("%d""%d",&n,&m);
shu=(struct shu*)malloc(sizeof(struct shu)*n);
for(i=0;i<n;i++){
scanf("%d",&(shu[i].z));
}
header=&shu[n-m];
for(i=n-m;i<n-1;i++){
shu[i].next=&shu[i+1];
}
shu[n-1].next=&shu[0];
for(i=0;i<n-m-1;i++){
shu[i].next=&shu[i+1];
}
shu[n-m-1].next=NULL;
struct shu*p;
p=header;
while(p!=NULL){
printf("%d",p->z);
p=p->next;
if(d<n)printf(" ");
d++;
}
free(shu);
return 0;
}
| 52 |
25,819 | void main()
{
int i,n,m,a[100],j;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<m;j++)
{
if(j==0)
printf("%d",a[j+n-m]);
if(j!=0)
printf(" %d",a[j+n-m]);
}
for(j=0;j<n-m;j++)
printf(" %d",a[j]);
printf("\n");
}
| 52 |
25,820 | int t=0;
void range(int n,int m,int *p)
{
if(t==m)
return;
else
{
t++;
range(n,m,p);
int v=*(p+n-1);
int i;
for(i=n-1;i>0;i--)
*(p+i)=*(p+i-1);
*p=v;
}
}
void main()
{
int n,m;
scanf("%d %d",&n,&m);
int num[100];
int *p=num;
int i;
for(i=0;i<n;i++)
scanf("%d",&num[i]);
range(n,m,p);
for(i=0;i<n-1;i++)
printf("%d ",num[i]);
printf("%d",num[n-1]);
}
| 52 |
25,821 | /******************************************
?? ???1300017667
?? 20131211
?? ??????
******************************************/
int len, step; //????????????????
int num[102]; //??????????
void move(int *p, int n); //???????
int main()
{
memset(num, 0, sizeof(num)); //????
cin >> len >> step; //????????????
int i;
for(i = 0; i <= len - 1; i ++) //???????
cin >> *(num + i);
move(num, step); //??
for(i = 0; i <= len - 1; i ++) //?????????
{
if(i != 0)
cout << " ";
cout << *(num + i);
}
return 0;
}
void move(int *p, int n) //?????p??????????n??????
{
if(n == 0) //??0????????????
return;
int temp = *(p + len - 1); //???????????
int i;
for(i = len - 1; i >= 1; i --)
*(p + i) = *(p + i - 1); //???????????????????????????????
*p = temp; //???????????
move(p, n - 1); //????????????n - 1?????
} | 52 |
25,822 | int main()
{
int m,n,i,a[100],b[100];
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
b[i]=a[i];
if(i<m)
a[i]=a[n-m+i];
else
a[i]=b[i-m];
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
if(i=n-1)
printf("%d",a[n-1]);
return 0;
} | 52 |
25,823 | int main () {
int n,m;
scanf("%d%d",&n,&m);
int sz[100];
for(int i=m;i<=n-1;i++){scanf("%d",&(sz[i]));}
for(int j=0;j<=m-1;j++){scanf("%d",&(sz[j]));}
for(int p=0;p<=n-1;p++){
if(p==n-1){printf("%d",sz[p]);}
else {printf("%d ",sz[p]);}
}
return 0;
} | 52 |
25,824 | /*
* m,n.cpp
*
* Created on: 2011-12-11
* Author: FXD
*/
int main()
{
int a[1000],n,m,i,j,t;
int*p=NULL,*q=NULL,*r=NULL,*s=NULL,*x=NULL,*y=NULL;
cin>>n>>m;
for(i=0;i<n;i++)
{
cin>>a[i];
}
p=&a[0];
q=&a[n-1];
for(i=0,j=n-1;i<j;i++,j--)
{
t=*q;
*q=*p;
*p=t;
p++;
q--;
}
r=&a[0];
s=&a[m-1];
for(i=0,j=m-1;i<j;i++,j--)
{
t=*s;
*s=*r;
*r=t;
r++;
s--;
}
x=&a[m];
y=&a[n-1];
for(i=m,j=n-1;i<j;i++,j--)
{
t=*y;
*y=*x;
*x=t;
x++;
y--;
}
for(i=0;i<n-1;i++)
{
cout<<a[i]<<' ';
}
cout<<a[n-1]<<endl;
return 0;
}
| 52 |
25,825 | int main()
{
int m,n,i,j,k;//?? ?????????????????
cin>>n>>m;//????????
int a[2*n];//????
for(i=0;i<n;i++)//??????
{
cin>>a[i];
}
for(j=n-m;j<n;j++)//??m??????m???
{
a[j+m]=a[j];
}
for(k=0;k<n-m;k++)//??n-m??????m+n?
{
a[k+m+n]=a[k];
}
for(j=n;j<2*n-1;j++)//???2n-1?
{
cout<<a[j]<<" ";
}
cout<<a[2*n-1];//??????
return 0;
} | 52 |
25,826 |
int main()
{ const int max=100;
int i,n,m,a[max];
cin>>n>>m;
for(i=m;i<n;i++) cin>>a[i];
for(i=0;i<m;i++) cin>>a[i];
cout<<a[0];
for(i=1;i<n;i++) cout<<" "<<a[i];
return 0;
} | 52 |
25,827 | int main(){
int a[100],*p=NULL,*q=NULL,i,n,m,x;
cin>>n>>m;
for(i=0;i<n;i++)cin>>a[i];
for(i=1;i<=m;i++){
x=a[n-1];
p=&a[n-1];
for(;p!=&a[0];p--) *p=*(p-1);
*(p--)=x;
}
for(i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[i];
return 0;
} | 52 |
25,828 | int main()
{int i,n,m,a[101];
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
{int temp=a[n];
for(int k=n;k>=2;k--)
a[k]=a[k-1];
a[1]=temp;
}
for(i=1;i<n;i++)
cout<<a[i]<<' ';
cout<<a[i];
return 0;
}
| 52 |
25,829 | int main()
{
int n,m,i,g[100];
int *p;
cin>>n>>m;
for(i=0;i<n;i++)
cin>>g[i];
for(p=&g[n-1]-m+1;p<=&g[n-1];p++)
cout<<*p<<" ";
for(p=&g[0];p<&g[n-1]-m;p++)
cout<<*p<<" ";
cout<<*p;
return 0;
} | 52 |
25,830 | int a[105];
int main()
{
int n,i,j;
int m,k;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i = m;i >= 1;i --)
{
k = a[n - i + 1];
for(j = n - i + 1;j >= m - i + 2;j --)
a[j] = a[j-1];
a[m - i + 1] = k;
}
for(i = 1;i < n;i ++)
printf("%d ",a[i]);
printf("%d",a[n]);
return 0;
}
| 52 |
25,831 |
int main(int argc, char* argv[])
{
int n,m;
scanf("%d%d",&n,&m);
int a[100];
int i;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int pos=n-m;
for(i=0;i<n-1;i++){
printf("%d ",a[(pos+i)%n]);}
printf("%d\n",a[(pos+i)%n]);
return 0;
}
| 52 |
25,832 | int main(){
int m,n,i;
scanf("%d %d\n",&n,&m);
int sz[10000];
for(i=0;i<n;i++){
scanf("%d ",&sz[i]);}
for(i=n;i<n+n-m;i++){
sz[i]=sz[i-n];}
for(i=n-m;i<n+n-m-1;i++){
printf("%d ",sz[i]);}
printf("%d",sz[n+n-m-1]);
return 0;}
| 52 |
25,833 | void main()
{void move(int [20],int,int);
int num[20],n,m,i;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&num[i]);
move(num,n,m);
for(i=0;i<n;i++)
printf("%d%c",num[i],(i<n-1)?' ':'\n');
}
void move(int a[20],int n,int m)
{int *p,end;
end=*(a+n-1);
for(p=a+n-1;p>a;p--)
*p=*(p-1);
*a=end;
m--;
if(m>0)move(a,n,m);
} | 52 |
25,834 | void main()
{
int n,m,i,a[10000];
int *p;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(p=a+n;p<(a+n+n-m);p++)
*p=*(p-n);
p=(a+n-m);
printf("%d",*p);
for(p=(a+n-m+1);p<(a+n+n-m);p++)
printf(" %d",*p);
} | 52 |
25,835 | void main()
{
int n,i,m;
long a[200];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%ld ",&a[i]);
for(i=n-1;i>=0;i--)
a[i+m]=a[i];
for(i=0;i<m;i++) a[i]=a[i+n];
printf("%ld",a[0]);
for(i=1;i<n;i++)
printf(" %ld",a[i]);
} | 52 |
25,836 | int main()
{
int a,b,i;
scanf("%d%d",&a,&b);
int *pint;
pint=(int*)malloc(sizeof(int)*a);
for(i=0;i<a;i++)
{
scanf("%d",pint+i);
}
for(i=a-b;i<a;i++)
{
printf("%d ",*(pint+i));
}
for(i=0;i<a-b;i++)
{
printf("%d",*(pint+i));
if(i!=a-b-1)
printf(" ");
}
return 0;
}
| 52 |
25,837 | void main()
{
int no[201];
int n,m,t,i,j;
int *p;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&no[i]);
p=no+n;
for(i=1;i<=n;i++,p--)
*(p+m)=*p;
p++;
for(i=1;i<=m;i++,p++)
*p=*(p+n);
for(i=1;i<=n;i++)
printf((i==n)?"%d\n":"%d ",no[i]);
} | 52 |
25,838 | void move(int a[],int n,int m)
{
int last,*p;
last=*(a+n-1);
for(p=a+n-1;p>a;p--)
*p=*(p-1);
*p=last;
m--;
if(m>0) move(a,n,m);
}
void main()
{
int i,a[100],*p=a,n,m;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
move(a,n,m);
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[i]);
}
| 52 |
25,839 | int main()
{
int n;
int num[1000];
int *p;
int i,m;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
}
p=num;
for(i=0;i<m;i++)
{for(p=num+n;p>=num;p--)
{
*(p+1)=*p;
}
p=num;
*p=*(num+n);}
for(i=0;i<n-1;i++)
printf("%d ",num[i]);
printf("%d",num[i]);
return 0;
} | 52 |
25,840 | //???2010?12?8?
//??: 1000010586_???
//???????
int main()
{
int n , m , i , j , flag;
int a[ 100 ];
int *p;
cin >> n >> m;
for ( i = 0 ; i <= n - 1 ; i++ )
cin >> a[ i ];
p = a;
for ( i = 1 ; i <= n - m ; i++ )
{
flag = *p;
for( j = 0 ; j <= n - 2 ; j++ )
*( p + j ) = *( p + j + 1 );
*( p + n - 1 ) = flag;
}
for ( i = 0 ; i <= n - 2 ; i++ )
cout << *( p + i ) << " ";
cout << *( p + n - 1 );
return 0;
}
| 52 |
25,841 | void main()
{
int i,k,j,n,m,a[100];
int *p;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=&a[n-m];
for(k=n-m;k<n;k++,p++)
printf("%d ",*p);
p=&a[0];
for(j=0;j<n-m-1;j++,p++)
printf("%d ",*p);
printf("%d",a[n-m-1]);
} | 52 |
25,842 | //????
int main()
{
int a[100],n,m,b;
cin>>n>>m;
for(int i=0;i<n;++i)
{
cin>>b;
a[(i+m)%n]=b;//??
}
for(int i=0;i<n-1;++i)
{
cout<<a[i]<<" ";
}
cout<<a[n-1];//??????
return 0;
} | 52 |
25,843 | int main()
{
int n,m,i,j;
int a[100],c;
int *b;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b=a+m;
for(i=0;i<m;i++)
{
c=a[n-1];b=&a[n-1];
for(j=n-1;j>0;j--)
{
*b=*(b-1);
b=b-1;
}
a[0]=c;
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
} | 52 |
25,844 | void main()
{
int i,n,m,a[100],*p;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(p=a+m+n;p>=a+m;p--)
*p=*(p-m);
for(p=a+m-1;p>=a;p--)
*p=*(p+n);
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
} | 52 |
25,845 |
int main()
{
int n,m,i,a[100];
int *p;
cin>>n>>m;
for(i = 0;i < n;i ++)
{
cin>>a[i];
}
p = a + n - m;
do
{
cout<<*p<<" ";
p ++;
if(p > a + n - 1)
p = a;
if(p == a + n - m - 1)
break;
}
while(p <= a + n -1);
cout<< *p <<endl;
return 0;
}
| 52 |
25,846 | void swap(int *p,int *q)//???????
{
int *temp=p;
p=q;
q=temp;
return;
}
int main()
{
int m,n,a[100],temper=0;//????
cin>>n>>m;//??
for(int i=0;i<n;i++)
cin>>a[i];
int s=m;
while(m>0)//??????
{
swap(a[n-m],temper);
for(int j=n-m;j>s-m;j--)
swap(a[j],a[j-1]);
swap(a[s-m],temper);
m--;
}
for(int i=0;i<n-1;i++)//??
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
return 0;
}
| 52 |
25,847 | int main()
{
int n,i,k;
int a[100],b[100];
scanf("%d%d",&n,&k);
for(i=0;i<=(n-1);i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=(n-1);i++)
{
if(i<=(n-1-k))
{
b[i+k]=a[i];
}
else
{
b[i+k-n]=a[i];
}
}
for(i=0;i<=(n-1);i++)
{
if(i==0)
printf("%d",b[0]);
else
printf(" %d",b[i]);
}
} | 52 |
25,848 | void main()
{
int i,n,m,*p;
scanf("%d%d",&n,&m);
p=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=n-m;i<n;i++)
printf("%d ",*(p+i));
for(i=0;i<n-m-1;i++)
printf("%d ",*(p+i));
printf("%d\n",*(p+i));
}
| 52 |
25,849 | void main()
{int a[100],m,n,i,j,t=0;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=n-m;j<n;j++)
{if(t==0){printf("%d",a[j]);t=t+1;}
else printf(" %d",a[j]);}
for(j=0;j<n-m;j++)
printf(" %d",a[j]);} | 52 |
25,850 | int main()
{
int num[1000],n,m,i;
scanf("%d",&n);
scanf("%d",&m);
for(i=1;i<=n;i++)
{scanf("%d",&num[i]);}
for(i=n+1;i<=2*n;i++)
{num[i]=num[i-n];}
for(i=n+1-m;i<=2*n-m;i++)
{if(i==n+1-m)
printf("%d",num[i]);
else
printf(" %d",num[i]);}
getchar();
getchar();
return 0;}
| 52 |
25,851 | void shift(int *ptr,int n); //????
int main() //?????
{
int m,n,i;
int a[100],*pta=NULL; //???????
cin>>n>>m;
for(i=0;i<n;i++){ //???????
cin>>a[i];
}
pta=a; //??????a??????
shift(pta,n); //??shift????????????
shift(pta,m); //??m?????
shift(pta+m,n-m); //??n-m?????
for(i=0;i<n-1;i++){
cout<<pta[i]<<" "; //????
}
cout<<pta[i];
return 0;
}
void shift(int *pta,int n)
{
int *p=NULL,*q=NULL,temp; //????
p=pta;
q=pta+n;
while(p<q){ //???????
temp=*p;
*p=*q;
*q=temp;
p++;
q--;
}
}
| 52 |
25,852 |
int main()
{
int a[100],n,m,t,i,j,x;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<m;i++)
{
for(j=n-1;j>=-1;j--)
{
if(j==n-1)
x=a[n-1];
else if(j==-1)
a[0]=x;
else a[j+1]=a[j];
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
printf(" %d",a[i]);
}
return 0;
} | 52 |
25,853 | void main()
{
int i,j,k,m,n,a[100];
int *p;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=1;j<=m;j++)
{
p=a+n-1;
k=*p;
for(i=1;i<n;i++)
{
*p=*(p-1);
p--;
}
*p=k;
}
printf("%d",a[0]);
for(i=1;i<n;i++)
printf(" %d",a[i]);
} | 52 |
25,854 | int main()
{
int n,m,a[100],i,mid;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(n==2*m)//???????????????????????
for(i=0;i<m;i++)
{
mid=a[n-m+i];//????m?????????????
a[n-m+i]=a[i];
a[i]=mid;
}
if(n>2*m)//??????m?????????????????????
{
for(i=0;i<m;i++)
{
mid=a[n-m+i];
a[n-m+i]=a[i];
a[i]=mid;
}
for(int j=m;j>0;j--)
{for(i=j;n-i>m+m-j;i++)
{
mid=a[n-i];
a[n-i]=a[n-i-1];
a[n-i-1]=mid;
}}
}
if(n<m+m)
{
for(int j=m;j>0;j--)//???m?????????????????????????????????
{
for(i=n-j;i>m-j;i--)
{mid=a[i];
a[i]=a[i-1];
a[i-1]=mid;}
}
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
}
| 52 |
25,855 |
void main()
{
int m,n;
int num[100];
int temp;
int i,k,j;
scanf("%d %d",&n,&m);
for (i=0;i<n;i++)
scanf("%d",&num[i]);
for (i=0,k=1;k<=m;i++,k++)
{
temp=num[i];
num[i]=num[n-m+k-1];
for (j=0;j<n-m;j++)
{
num[n-m+k-1-j]=num[n-m+k-1-j-1];
}
num[i+1]=temp;
}
for (i=0;i<n;i++)
{
if (i!=0)
printf(" %d",num[i]);
else if (i==0)
printf("%d",num[i]);
}
}
| 52 |
25,856 | int main()
{
int i,j;
int n,m;
scanf("%d%d",&n,&m);
int *a=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",a+i);//a[i]====*a+i;
}
int t,t1;
for(j=0;j<m;j++)
{t=a[n-1];
for(i=0;i<n;i++)
{
t1=a[i];
a[i]=t;
t=t1;
}
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
if(i<n-1)printf(" ");
}
return 0;
}
| 52 |
25,857 | void move(int *pstart,int n,int m)
{
int lastnum;
int *pmove;
void (*pinfunction)(int *,int,int); //actually,it seems that it's useless.....
pinfunction=move;
if (m>0)
{
lastnum=*(pstart+n-1);
for (pmove=pstart+n-2;pmove>=pstart;pmove--) *(pmove+1)=*pmove;
*pstart=lastnum;
(*pinfunction)(pstart,n,m-1);
}
}
void main()
{
int flag,i,n,m;
int num[100];
int *pnum;
void (*pinfunction)(int *,int,int); //actually,it seems that it's useless.....
pnum=num;
scanf("%d",&n);
scanf("%d",&m);
for (i=0;i<=n-1;i++) scanf("%d",pnum++);
pnum=num;
pinfunction=move;
(*pinfunction)(pnum,n,m);
flag=0;
for (i=0;i<=n-1;i++)
{
if (flag) printf(" ");
else flag=1;
printf("%d",*pnum++);
}
}
| 52 |
25,858 | int main()
{
int n,m,i,*num;
scanf("%d%d",&n,&m);
num=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",num+i);
}
printf("%d",*(num+n-m));
for(i=n-m+1;i<n;i++)
{
printf(" %d",*(num+i));
}
for(i=0;i<n-m;i++)
{
printf(" %d",*(num+i));
}
free(num);
return 0;
} | 52 |
25,859 | void main()
{
int n,m,i,a[100],b[100],*p,j;
scanf("%d%d",&n,&m);
scanf("\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=b;
if(i=n-m)
{
*p=a[i];
printf("%d",*p);
}
for(i=n-m+1;i<n;i++)
{
j=(i+m)%(n-1);
*(p+j-1)=a[i];
printf(" %d",*(p+j-1));
}
for(i=0;i<n-m;i++)
{
*(p+i+m)=a[i];
printf(" %d",*(p+i+m));
}
}
| 52 |
25,860 | int main()
{
int n,m,t;
cin>>n>>m;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int j=n-m;j<n;j++)
{
t=a[j];
for(int l=j;l>j+m-n;l-=1)
{
a[l]=a[l-1];
}
a[j-n+m]=t;
}
for(int k=0;k<n-1;k++)
{
cout<<a[k]<<" ";
}
cout<<a[n-1];
}
| 52 |
25,861 | int a[102];
int main()
{ int *p=a;
int n,m,temp;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>*(p+i);
while(m--)
{ temp=*(p+n-1);
for(int i=n-1;i>0;i--)
*(p+i)=*(p+i-1);
*p=temp;
}
for(int i=0;i<n-1;i++)
cout<<*(p+i)<<" ";
cout<<*(p+n-1)<<endl;
}
| 52 |
25,862 | void main()
{
int n,m,i,a[100],k;
scanf("%d %d\n",&n,&m);
for(i=1;i<=n;i++)
scanf("%d\n",&a[i]);
for(i=1;i<=n;i++)
{if(i<=m)
k=a[n-m+i];
else
k=a[i-m];
if(i==n)
printf("%d\n",k);
else
printf("%d ",k);
}
}
| 52 |
25,863 | void main()
{
int n,m,i,a[10000];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
if(i<n-m)
scanf("%d",&a[i+m]);
if(i>=n-m)
scanf("%d",&a[i-n+m]);
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[i]);
} | 52 |
25,864 | int main()
{
int n,m,a[200],i;
cin>>n>>m;
for(i=100;i<n+100;i++)
{
cin>>a[i];
}
for(i=n-m+100;i<n+100;i++)
{
a[i-n]=a[i];
}
for(i=100-m;i<n+100-m-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n+100-m-1]<<endl;
return 0;
}
| 52 |
25,865 | void main()
{
int i,n,m,a[100];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=n;i<2*n-m;i++)
a[i]=a[i-n];
printf("%d",a[n-m]);
for(i=n-m+1;i<2*n-m;i++)
printf(" %d",a[i]);
printf("\n");
} | 52 |
25,866 |
int main()
{
int a,c,b,d,n,m,i,x[1000],y[1000];
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&x[i]);
}
for(i=1;i<=n-m;i++){
y[i+m]=x[i];
}
for(i=n-m+1;i<=n;i++){
y[i-n+m]=x[i];
}
for(i=1;i<=n;i++){
if(i==1)printf("%d",y[i]);
else printf(" %d",y[i]);
}
}
| 52 |
25,867 | void diaohuan(int *a,int m,int n);
main()
{
int m,n,i,a[10000];
scanf("%d%d",&n,&m);
for(i=0;i<n;i++) scanf("%d",&a[i]);
diaohuan(a,m,n);
printf("%d",a[0]);
for(i=1;i<n;i++) printf(" %d",a[i]);
}
void diaohuan(int *a,int m,int n)
{
int *i;
for(i=a;i<a+n-m;i++) *(i+n)=*i;
for(i=a;i<a+n;i++) *i=*(i+n-m);
}
| 52 |
25,868 | //????
//2010?11?13?
//1000012753 ???
int main()
{
int a[200], n, m, i, *p;
cin >> n >> m;
for (i = m; i < m + n; ++i)
cin >> a[i];
for (p = a + n; p < a + n + m; ++p)
*(p - n) = *p;
cout << *a;
for (p = a + 1; p < a + n; ++p)
cout << " " << *p;
cout << endl;
return 0;
} | 52 |
25,869 | void main()
{
int a[200];int i,j,k;
int n,m;
scanf("%d%d",&n,&m);
for(i=0;i<=n-1;i++)
{scanf("%d",&a[i]);}
for(j=n;j<=2*n-1;j++)
{a[j]=a[j-n];}
printf("%d",a[n-m]);
for(k=n-m+1;k<=2*n-1-m;k++)
{printf(" %d",a[k]);}
printf("\n");
}
| 52 |
25,870 | int main()
{
int m,n;
scanf("%d%d",&n,&m);
int i,j,sz[n],a;
int *ptr;
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(j=0;j<m;j++){
ptr=&sz[n-1];
a=*ptr;
for(i=n-1;i>0;i--){
sz[i]=sz[i-1];
}
sz[0]=a;
}
for(i=0;i<n-1;i++){
printf("%d ",sz[i]);
}
printf("%d",sz[n-1]);
return 0;
} | 52 |
25,871 | void main()
{
int m,n,i,a[100],b[100];
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-m;i++)
{
b[i+m]=a[i];
}
for(i=n-m;i<n;i++)
{
b[i-n+m]=a[i];
}
for(i=0;i<n-1;i++)
{
printf("%d ",b[i]);
}
printf("%d\n",b[n-1]);
} | 52 |
25,872 | void tz(int a[],int n,int m);
void main()
{
int a[20];
int m,n,i;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
tz(a,n,m);
}
void tz(int a[],int n,int m)
{
int *p;
for(p=a+n-m+1;p<=a+n;p++)
printf("%d ",*p);
for(p=a+1;p<a+n-m;p++)
printf("%d ",*p);
printf("%d\n",*p);
}
| 52 |
25,873 | int main(int argc, char* argv[])
{
int m,n,i,i1,temp;
int a[100];
scanf("%d%d",&m,&n);
n=n%m;
for(i=0;i<m;i++){
scanf("%d",&a[i]);
}
if (n==0||n==m)goto a;
else if(n!=0){
for(i=0;i<n;i++){
for(i1=m-1;i1>0;i1--){
temp=a[i1-1];
a[i1-1]=a[i1];
a[i1]=temp;
}
}
}
a: for(i=0;i<m-1;i++)printf("%d ",a[i]);
printf("%d",a[m-1]);
return 0;
}
| 52 |
25,874 | void main()
{
void move(int number[20],int n,int m);
int number[20],n,m,i;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&number[i]);
}
move(number,n,m);
for(i=0;i<n-1;i++)
{
printf("%d ",number[i]);
}printf("%d",number[n-1]);
}
void move(int a[20],int n,int m)
{
int *p,end;
end=*(a+n-1);
for(p=a+n-1;p>a;p--)
{*p=*(p-1);}
*a=end;
m--;
if(m>0)move(a,n,m);
} | 52 |
25,875 | int main()
{
int n,m,a[100],i;
int temp;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=n;i<100;i++)
{
a[i]=0;
}
for(i=0;i<n-m;i++)
{
temp=a[i];
a[i]=a[i+n];
a[i+n]=temp;
}
for(i=n-m;i<2*n-m-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[2*n-m-1]);
return 0;
}
| 52 |
25,876 | void main()
{
int n,m,i,j,k,s;
int a[2][110];
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[0][i]);
for(j=1;j<=m;j++)
a[1][j]=a[0][n-m+j];
for(k=1;k<=(n-m);k++)
a[1][m+k]=a[0][k];
printf("%d",a[1][1]);
for(i=2;i<=n;i++)
printf(" %d",a[1][i]);
}
| 52 |
25,877 | int main(){
int i,n,m,a[100]={0};
int *p;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++){
scanf("%d",&a[i]);
}
p=&a[n-m+1];
for (;p<=&a[n];p++){
printf("%d ",*p);
}
for (p=&a[1];p<=&a[n-m];p++){
if (p!=&a[n-m])
printf("%d ",*p);
else printf("%d",*p);
}
return 0;
}
| 52 |
25,878 | int main(){
int *p,*q,m,n,i;
scanf("%d %d",&n,&m);
int dk[100];
for(i=0;i<n;i++){
scanf("%d",&(dk[i]));
}
p=dk;
q=&dk[n-m];
for(i=0;i<m;i++){
printf("%d ",*(q));
q++;
}
for(i=0;i<n-m-1;i++){
printf("%d ",*(p));
p++;
}
printf("%d",*(p));
return 0;
} | 52 |
25,879 |
void main()
{
int a[100],n,m,i;
int*p;
scanf("%d %d",&n,&m);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
p=a;
for(i=1;i<=m;i++)
{
int j,t;
t=*(p+n-1);
for(j=n-1;j>=1;j--)
{
*(p+j)=*(p+j-1);
}
*p=t;
}
for(i=1;i<=n-1;i++)
{
printf("%d ",*(p+i-1));
}
printf("%d",*(p+n-1));
printf("\n");
}
| 52 |
25,880 |
int main()
{
int m, n, i, j;
int a[200] = {0};
cin >> n >> m;
for(i = 0; i < n; i++)
cin >> *(a + i);
for(i = n - 1; i >= 0; i--)
*(a + i + m) = *(a + i);
for(i = n, j = 0; i < n + m, j < m; i++, j++)
*(a + j)= *(a + i);
for(i = 0; i < n - 1; i++)
cout << *(a + i) << " ";
cout << *(a + n - 1) << endl;
return 0;
}
| 52 |
25,881 | void main()
{
int n,m,i;
int a[200]; /*?????????????????????????*/
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(;i<200;i++)
a[i]=0;
int *p1;
int *p2;
p1=a; /*p1??a[0]*/
p2=&a[99+m]; /*???a[0]??????????a[99]??????a[99+m]*/
for(i=0;i<n-m;i++)
{
*p2=*p1;
p1++;
p2++;
}
p1=&a[n-m]; /*???????*/
p2=&a[99]; /*?????????m????????100???m???????????m?*/
for(i=0;i<m;i++)
*p2++=*p1++;
printf("%d",a[99]);
for(i=100;i<99+n;i++)
printf(" %d",a[i]); /*??*/
} | 52 |
25,882 | int main()
{
int m,n,a[10000],i=0;
cin>>n>>m;
for(i=0;i<n;i++)
{
cin>>a[i];
}
i=n-m;
for(i=n-m;i<n;i++)
{
cout<<a[i]<<" ";
}
i=0;
for(i=0;i<n-m-1;i++)
{
cout<<a[i]<<" ";
}
if(i=n-m-1)
cout<<a[i];
return 0;
}
| 52 |
25,883 | int main()
{
int a[200],m,n,i;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=m;i++)
{
a[n+i]=a[n-m+i];
}
for(i=1;i<=n-m;i++)
{
a[n-i+1]=a[n-m-i+1];
}
for(i=1;i<=m;i++)
{
a[i]=a[n+i];
}
printf("%d",a[1]);
for(i=2;i<=n;i++)
{
printf(" %d",a[i]);
}
return 0;
}
| 52 |
25,884 | void change(int a[],int n,int m)
{
int a1[1000];
int *p=a,*p1=a1;
int i,j,t=1;
for(i=n-m,j=0;i<n;i++,j++)
*(p1+j)=*(p+i);
for(i=n-m-1;i>=0;i--,t++)
*(p+n-t)=*(p+i);
for(t=0;t<m;t++)
*(p+t)=*(p1+t);
}
void main()
{
int a[1000],n,m,i=0;
scanf("%d%d",&n,&m);
do
{
scanf("%d",&a[i]);
i++;
}
while(getchar()!='\n');
scanf("%d",&m);
n=i;
change(a,n,m);
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[i]);
}
| 52 |
25,885 | int main()
{
int n,m;
scanf("%d %d",&n,&m);
int a[100],i;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[n-m]);
for(i=n-m+1;i<n;i++)
printf(" %d",a[i]);
for(i=0;i<(n-m);i++)
printf(" %d",a[i]);
getchar();
getchar();
} | 52 |
25,886 | struct Node;
typedef struct Node *pNode;
struct Node
{
int x;
pNode next;
};
pNode create()/*??head*/
{
pNode p;
p=(pNode)malloc(sizeof(struct Node));
p->next=NULL;
return p;
}
void sort(pNode head,int n)/*head???????n???*/
{
pNode p=NULL,q=NULL,s=NULL;
int i;
for (i=1;i<=n;i++)
{
s=(pNode)malloc(sizeof(struct Node));
scanf("%d",&s->x);
q=head;
p=head->next;
while (p)
{
if (p->x>=s->x)
break;
q=p;
p=p->next;
}
q->next=s;
s->next=p;
}
}
void outputdata(pNode p)/*??head*/
{
p=p->next;
while(p->next)
{
printf("%d ",p->x);
p=p->next;
}
printf("%d",p->x);
}
pNode inputdata(int n)/*??head?????n???*/
{
pNode q=NULL,p=NULL,head=NULL;
int i;
head=create();
q=head;
for (i=1;i<=n;i++)
{p=(pNode)malloc(sizeof(struct Node));
if (p!=NULL)
{
scanf("%d",&p->x);
p->next=NULL;
q->next=p;
q=p;
}
}
return head;
}
void del(pNode p,int k)/*??head??k???*/
{
pNode q=NULL;
q=p;
p=p->next;
while(p)
if (p->x==k)
{
q->next=p->next;
free(p);
p=q->next;
}
else
{q=p;p=p->next;}
}
pNode rinputdata(int n)/*??head,????n???*/
{
pNode q=NULL,p=NULL,head=NULL;
int i;
head=create();
for (i=1;i<=n;i++)
{
p=(pNode)malloc(sizeof(struct Node));
if (p!=NULL)
{
scanf("%d",&p->x);
p->next=q;
q=p;
}
}
head->next=q;
return head;
}
void outputk(pNode p,int k)/*???k???*/
{
int i=1;
p=p->next;
while(p)
{
if (i==k)
printf("%d",p->x);
p=p->next;
i++;
}
}
void change(pNode p,int n,int m)/*?head?n?????m???????*/
{
int i=1;
pNode q=NULL,s=NULL,head=NULL;
q=p;
head=p;
p=p->next;
while(p)
{
if (i==n-m+1)
break;
i++;
q=p;
p=p->next;
}
s=head;
while(s->next)
s=s->next;
q->next=NULL;
s->next=head->next;
head->next=p;
}
void found(pNode p,int k)/*??head???k???*/
{
pNode head=p;
int ok=1;
p=head->next;
while(p)
{
if (k==p->x)
{
printf("%d\n",p->x);
ok=0;
}
p=p->next;
}
if (ok)
printf("No Found!");
}
pNode arrange(pNode p)
{
pNode q=NULL,head=NULL,min=NULL,headnew=NULL,ppre=NULL,minpre=NULL,s=NULL;
headnew=create();
q=headnew;
head=p;
while (head->next)
{
min=p=head->next;
ppre=minpre=head;
while(p)
{
if (min->x>p->x)
{
min=p;
minpre=ppre;
}
ppre=p;
p=p->next;
}
s=(pNode)malloc(sizeof(struct Node));
s->x=min->x;
q->next=s;
s->next=NULL;
q=s;
minpre->next=min->next;
free(min);
}
return headnew;
}
int main()
{
int m,n;
pNode head=NULL;
scanf("%d %d",&n,&m);
head=inputdata(n);
change(head,n,m);
outputdata(head);
return 0;
}
| 52 |
25,887 | // resort.c
//
// Copyright 2009 JacksonTB <jacksontb@jacksontb-laptop>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
// MA 02110-1301, USA.
typedef struct NODE{
int value;
struct NODE *fwd;
struct NODE *bwd;
}node;
int main(int argc, char** argv)
{
int m, n, i;
node *rootp, *recp, *prep,*lastp;
rootp = (node*) malloc(sizeof(node));
rootp -> fwd = NULL;
prep = rootp;
scanf("%d %d", &n, &m);
for(i = 1;i <= n;i ++)
{
recp = (node*) malloc(sizeof(node));
if(recp == NULL)
{
printf("Not enough memory");
return EXIT_FAILURE;
}
scanf("%d", &(recp -> value));
recp -> bwd = prep;
prep -> fwd = recp;
recp -> fwd = NULL;
prep = recp;
}
recp = rootp;
for(i = 1;i <= n - m + 1;i ++)
{
recp = recp -> fwd;
}
lastp = rootp;
while(lastp -> fwd != NULL)
{
lastp = lastp -> fwd;
}
lastp -> fwd = rootp -> fwd;
rootp -> fwd -> bwd = lastp;
rootp -> fwd = recp;
recp -> bwd -> fwd = NULL;
recp = rootp -> fwd;
while(recp != NULL)
{
printf("%d", recp -> value);
prep = recp;
recp = recp -> fwd;
if(recp != NULL) printf(" ");
free(prep);
}
return 0;
}
| 52 |
25,888 | int main()
{
int n,m;
scanf("%d%d",&n,&m);
int shu[100];
for(int i=0;i<n;i++)
{
scanf("%d",&shu[i]);
}
int*p;
p=&shu[n-1];
int a;
a=n-m;
for(int i=0;i<m+n;i++)
{
p++;
*p=shu[i];
}
for(int i=a;i<2*n-m-1;i++)
{
printf("%d ",shu[i]);
}
printf("%d",shu[2*n-m-1]);
getchar();
getchar();
getchar();
return 0;
}
| 52 |
25,889 | int main()
{
int n,m,s;
scanf("%d %d\n",&n,&m);
int a[n];
int i,j,k;
scanf("%d",&a[0]);
for(i=1;i<n;i++)
{
scanf(" %d",&a[i]);
}
scanf("\n");
for(j=1;j<=m;j++)
{
s=a[n-1];
for(k=n-2;k>=0;k--)
{
a[k+1]=a[k];
}
a[0]=s;
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
printf(" %d",a[i]);
}
return 0;
} | 52 |
25,890 | /*
* zhizhen2.cpp
*
* Created on: 2010-12-8
* Author: l
*/
int main(){
int n,i,t,c;
cin>>n>>t;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];//??
int *b=NULL;//????
b=a;
for(int j=1;j<=t;j++){//????????????????????????
c=a[n-1];
for(i=n-1;i>0;i--)
*(b+i)=a[i-1];//????
*b=c;}//?????????
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;//????
return 0;
}
| 52 |
25,891 | void main()
{ int a[100];
int n,m,i,j,t,r,p,b;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d ",&a[i]);
if(n>2*m)
{ for(i=0;i<m;i++)
{t=a[i];a[i]=a[i+n-m];a[i+n-m]=t;}
for(i=n-m;i<n;i++)
{ for(j=i-n+2*m;j<i;j++)
{r=a[i];a[i]=a[j];a[j]=r;}
}
}
else
{ for(i=0;i<m;i++)
{t=a[i];a[i]=a[i+n-m];a[i+n-m]=t;}
p=2*n-2*m;b=m;
while(p<n)
{for(i=b;i<p;i++)
{r=a[i];a[i]=a[p];a[p]=r;}
p++;b++;
}
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
} | 52 |
25,892 | int main()
{
int a[101];
int n,m,i;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
int j,k,t;
for(j=1;j<=m;j++)
for(k=n-1;k>=0;k--)
{
if(k==n-1)
{
t=a[k];
a[k]=a[k-1];
}
else if(k==0)
a[k]=t;
else
a[k]=a[k-1];
}
int l;
for(l=0;l<n-1;l++)
printf("%d ",a[l]);
printf("%d",a[n-1]);
return 0;
} | 52 |
25,893 |
int main()
{
int n,m,i;
scanf("%d%d",&n,&m);
int * p,* h;
p=(int *)malloc(sizeof(int)*n);
h=p;
for(i=0;i<n;i++)
{
scanf("%d",p);
p++;
}
p=h;
for(i=n-m;i<n;i++)
{
printf("%d ",*(p+i));
}
for(i=0;i<n-m-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+n-m-1));
free(p);
return 0;
} | 52 |
25,894 | int main()
{
int i,n,m,a[100];
int *p1,*p2,*p3,*p4;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
p1=&a[0];
p4=p2=&a[n-m];
p3=&a[n-1];
printf("%d",*p2);
p2++;
for(;p2<=p3;p2++)
{
printf(" %d",*p2);
}
for(;p1<p4;p1++)
{
printf(" %d",*p1);
}
return 0;
} | 52 |
25,895 |
int main()
{
int a[101],n,i,m,j,s;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=m;i>0;i--)
{
for(j=n;j>=n;j--)
{
a[0]=a[j];
a[j]=0;
for(s=n;s>=1;s--)
{a[s]=a[s-1];}
}
}
printf("%d",a[1]);
for(s=2;s<=n;s++)
{
printf(" %d",a[s]);
}
}
| 52 |
25,896 | void main()
{
int a[200];
int m,n,i;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
//?????
for(i=n-1+m;i>=m;i--)
a[i]=a[i-m];
for(i=0;i<m;i++)
a[i]=a[n+i];
printf("%d",a[0]);
for(i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
} | 52 |
25,897 | int main()
{
int a[200];
int i;
int j;
int *p1;
int *p2;
int n;
int m;
cin>>n;
cin>>m;
for(i=0;i<=n-1;i++)
cin>>a[i];
p2=a+n-m;
p1=a;
int temp;
for(i=0;i<=n-m;i++)
{
a[n+i]=*(p1+i);
}
for(i=0;i<=n-2;i++)
cout<<*(p2+i)<<' ';
cout<<*(p2+n-1);
return 0;
} | 52 |
25,898 | main()
{
int n,i,m;
int a[num];
scanf("%d %d",&n,&m);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=n+m-1;i>=m;i--)
a[i]=a[i-m];/*????m*/
for (i=0;i<m;i++)
a[i]=a[i+n];
for (i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[n-1]);
} | 52 |
25,899 | int main()
{
int n,m,i;
int a[MAX];
int *pa=0;
int x[MAX];
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-m;i++)
{
pa=&a[i];
x[i+m]=*pa;
}
for(i=n-m;i<n;i++)
{
pa=&a[i];
x[i+m-n]=*pa;
}
printf("%d",x[0]);
for(i=1;i<n;i++)
{
printf(" %d",x[i]);
}
printf("\n");
return 0;
}
| 52 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.