| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 3750 | 陶俊宸 | 奇偶位互换 | C++ | Time Limit Exceeded | 0 | 1000 MS | 252 KB | 351 | 2019-12-21 18:56:03 |
#include<iostream> using namespace std; int main(){ int a,i,j,k; cin>>a; char t,c[a-1][49]; for (i=0;i<a;i++){ scanf("%s",c[i]); } for(i=0;i<a;i++){ j=0; while(c[i][j]!='\0'){ t=c[i][j]; c[i][j]=c[i][j+1]; c[i][j+1]=t; j+=2; } } for (i=0;i<a;i++){ printf("%s\n",c[i]); } return 0; }