/* Task042 */
/* 配列を他の配列に保存、出力 */
/* 2019.10.16 S.Konno */
#include<stdio.h>
#define DATAMAX 20
int main(void){
int n;
int number;
int dataA[DATAMAX];
int dataB[DATAMAX];
int dataC[DATAMAX];
int i,i2=0;
int count1,count2;
printf("好きな正の整数をいくつか入力してください。\n"); printf("終了するときはゼロを入力してください。\n"); n=0;
while(number!=0){
dataA[n++]=number;
if(n==DATAMAX){
printf("データ数の上限%dを越えました。\n",DATAMAX
); break;
}
}
for(i=0;i<=n-1;i++){
dataB[i2++]=dataA[i];
i++;
count1++;
}
i2=0;
for(i=0;i<=n-1;i++){
dataC[i2++]=dataA[(n-2)-i];
i++;
count2++;
}
for(i=0;i<=count1-1;i++){
}
for(i=0;i<=count2-2;i++){
}
return 0;
}
LyogVGFzazA0MgkJCQkJCSovCi8qIOmFjeWIl+OCkuS7luOBrumFjeWIl+OBq+S/neWtmOOAgeWHuuWKmwkqLwovKgkJCTIwMTkuMTAuMTYgUy5Lb25ubwkqLwoKI2luY2x1ZGU8c3RkaW8uaD4KCiNkZWZpbmUgREFUQU1BWCAyMAoKaW50IG1haW4odm9pZCl7CglpbnQgbjsKCWludCBudW1iZXI7CglpbnQgZGF0YUFbREFUQU1BWF07CglpbnQgZGF0YUJbREFUQU1BWF07CglpbnQgZGF0YUNbREFUQU1BWF07CglpbnQgaSxpMj0wOwoJaW50IGNvdW50MSxjb3VudDI7CgkKCXByaW50Zigi5aW944GN44Gq5q2j44Gu5pW05pWw44KS44GE44GP44Gk44GL5YWl5Yqb44GX44Gm44GP44Gg44GV44GE44CCXG4iKTsKCXByaW50Zigi57WC5LqG44GZ44KL44Go44GN44Gv44K844Ot44KS5YWl5Yqb44GX44Gm44GP44Gg44GV44GE44CCXG4iKTsKCW49MDsKCXNjYW5mKCIlZCIsJm51bWJlcik7Cgl3aGlsZShudW1iZXIhPTApewoJCWRhdGFBW24rK109bnVtYmVyOwoJCWlmKG49PURBVEFNQVgpewoJCQlwcmludGYoIuODh+ODvOOCv+aVsOOBruS4iumZkCVk44KS6LaK44GI44G+44GX44Gf44CCXG4iLERBVEFNQVgpOwoJCQlicmVhazsKCQl9CgkJc2NhbmYoIiVkIiwmbnVtYmVyKTsKCX0KCQoJZm9yKGk9MDtpPD1uLTE7aSsrKXsKCQlkYXRhQltpMisrXT1kYXRhQVtpXTsKCQlpKys7CgkJY291bnQxKys7Cgl9CglpMj0wOwoJCglmb3IoaT0wO2k8PW4tMTtpKyspewoJCWRhdGFDW2kyKytdPWRhdGFBWyhuLTIpLWldOwoJCWkrKzsKCQljb3VudDIrKzsKCX0KCQoJZm9yKGk9MDtpPD1jb3VudDEtMTtpKyspewoJCXByaW50ZigiJWQgIixkYXRhQltpXSk7Cgl9CgkKCWZvcihpPTA7aTw9Y291bnQyLTI7aSsrKXsKCQlwcmludGYoIiVkICIsZGF0YUNbaV0pOwoJfQoJCglwcmludGYoIlxu57WC5LqG44GX44G+44GZ44CCXG4iKTsKCXJldHVybiAwOwp9Cgo=