1 solutions
-
0
C :
#include<stdio.h> #define M 3 int main() { int n,a[1000],*p,*pp,i,tuichu=0,num=0; p=a,pp=a; scanf("%d",&n); for(i=0;i<n;i++,p++) *p=1; p=pp; while(tuichu!=n-1) { if(*p==1) num++; if(num==M) { *p=0,num=0, tuichu++; } p++; if(p==(pp+n)) p=pp; } p=pp; for(i=0;i<n;i++,p++) { if(*p==1) { printf("%d",p-pp+1);break;} } }
- 1
Information
- ID
- 19071
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By