id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
16,400 | int main()
{
char a[N],b[N][N];
int i,j,k,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a);
k=strlen(a);
for(j=0;j<k;j++){
if(a[j]=='A'){
a[j]='T';
}
else if(a[j]=='T'){
a[j]='A';
}
else if(a[j]=='C'){
a[j]='G';
}
else if(a[j]=='G'){
a[j]='C';
}
}
strcpy(b[i],a);
}
for(i=0;i<n;i++){
printf("%s\n",b[i]);
}
return 0;
} | 33 |
16,401 | int main(){
int m,i,t,k;
char dna[256];
scanf("%d\n",&m);
for(i=0;i<m;i++){
scanf("%s",dna);
t=strlen(dna);
for(k=0;k<t;k++){
if(dna[k]=='A'){dna[k]='T';}
else if(dna[k]=='T'){dna[k]='A';}
else if(dna[k]=='C'){dna[k]='G';}
else if(dna[k]=='G'){dna[k]='C';}
}
for(k=0;k<t;k++){
if(k==t-1){printf("%c\n",dna[k]);}
else{printf("%c",dna[k]);}
}
}
return 0;
}
| 33 |
16,402 | int main(){
int n, i,k,j;
char DNA[MAX],S[MAX];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s", DNA);
for(k=0;DNA[k];k++){
switch(DNA[k]){
case'A':S[k]='T';break;
case'T':S[k]='A';break;
case'G':S[k]='C';break;
case'C':S[k]='G';break;
default:S[k]=DNA[k];break;
}
}
S[k] = DNA[k];
printf("%s\n", S);
}
return 0;
} | 33 |
16,403 | int main(){
int n,i=0,j=0;
char zfc[256];
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s",zfc);
for(i=0;zfc[i]!='\0';i++){
if(zfc[i]=='A')
zfc[i]='T';
else if(zfc[i]=='T')
zfc[i]='A';
else if(zfc[i]=='G')
zfc[i]='C';
else if(zfc[i]=='C')
zfc[i]='G';
}
printf("%s\n",zfc);
}
return 0;
} | 33 |
16,404 | int main()
{
int n,i,j;
scanf("%d",&n);
char s[n][255];
for(i=0;i<n;i++)
{
scanf("%s\n",s[i]);
for(j=0;s[i][j]!='\0';j++)
{
switch(s[i][j])
{
case 'C':
s[i][j]='G';
break;
case 'G':
s[i][j]='C';
break;
case 'A':
s[i][j]='T';
break;
case 'T':
s[i][j]='A';
break;
}
}
printf("%s\n",s[i]);
}
return 0;
}
| 33 |
16,405 | char peidui(char x);
char peidui(char x){
char s;
s=0;
if(x=='A'){s='T';}
if(x=='T'){s='A';}
if(x=='C'){s='G';}
if(x=='G'){s='C';}
return s;
}
int main(){
int n,i,j,len;
char jianji[256];
scanf("%d",&n);
for(i=0;i<n;i++){
len=0;
scanf("%s",jianji);
len=strlen(jianji);
for(j=0;j<len;j++){
printf("%c",peidui(jianji[j]));
}
printf("\n");
}
return 0;
} | 33 |
16,406 | int main()
{
char a[255];
int n,i,j;
scanf("%d",&n);
for(i=0;i<=n;i++)
{
if(i!=0)
printf("\n");
scanf("%s",&a);
for(j=0;j<strlen(a);j++)
{
if(a[j]=='A')
printf("T");
if(a[j]=='T')
printf("A");
if(a[j]=='C')
printf("G");
if(a[j]=='G')
printf("C");
}
memset(a,0,sizeof(a));
}
return 0;
}
| 33 |
16,407 |
int main()
{
int n, i, j;
char **dna;
scanf("%d", &n);
dna=(char**)malloc(sizeof(char*)*n);
for (i=0;i<n;i++)
dna[i]=(char*)malloc(sizeof(char)*255);
for (i=0;i<n;i++)
scanf("%s",dna[i]);
char ch;
for (i=0;i<n;i++)
{
for (j=0;(ch=dna[i][j])!=0;j++)
{
switch(ch)
{
case 'A':
printf("T");
break;
case 'T':
printf("A");
break;
case 'G':
printf("C");
break;
case 'C':
printf("G");
break;
}
}
printf("\n");
}
for (i=0;i<n;i++)
free(dna[i]);
free(dna);
return 0;
} | 33 |
16,408 | void main()
{
int i,l,k,j;
char b[3],c[1000][1000];
scanf("%d",&k);
gets(b);
for(i=0;i<k;i++)
{
gets(c[i]);
l=strlen(c[i]);
for(j=0;j<l;j++)
{
if(c[i][j]=='C')
printf("G");
if(c[i][j]=='A')
printf("T");
if(c[i][j]=='T')
printf("A");
if(c[i][j]=='G')
printf("C");
}
printf("\n");
}
} | 33 |
16,409 | void main()
{
int n,i,l,j;
char a[1000][300],b[1000][300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
l=strlen(a[i]);
for(j=0;j<l;j++)
{
if(a[i][j]=='A')
b[i][j]='T';
if(a[i][j]=='T')
b[i][j]='A';
if(a[i][j]=='C')
b[i][j]='G';
if(a[i][j]=='G')
b[i][j]='C';
}
for(j=0;j<l-1;j++)
printf("%c",b[i][j]);
printf("%c\n",b[i][l-1]);
}
}
| 33 |
16,410 | int main()
{
int n;
scanf("%d",&n);
char num[256];
for(int i=0;i<=n;i++)
{
gets(num);
for(int j=0;j<=255;j++)
{
if(num[j]=='A')
num[j]='T';
else if(num[j]=='C')
num[j]='G';
else if(num[j]=='G')
num[j]='C';
else if(num[j]=='T')
num[j]='A';
if(num[j]=='\0')
{printf("%s\n",num);break;}
}
}
return 0;
}
| 33 |
16,411 | int main(){
char s[1000];
int n;
scanf("%d", &n);
for(int i=1; i<=n; i++){
scanf("%s", &s);
for(int j=0; j<strlen(s); j++){
if(j<strlen(s)-1&&s[j]=='A')
printf("T");
if(j<strlen(s)-1&&s[j]=='T')
printf("A");
if(j<strlen(s)-1&&s[j]=='G')
printf("C");
if(j<strlen(s)-1&&s[j]=='C')
printf("G");
if(j==strlen(s)-1){
if(s[j]=='A')
printf("T\n");
if(s[j]=='T')
printf("A\n");
if(s[j]=='G')
printf("C\n");
if(s[j]=='C')
printf("G\n");
}
}
}
return 0;
}
| 33 |
16,412 | int main()
{
char str[256];
char ch;
int a,n,i=0,j=0;
scanf("%d%c",&n,&ch);
while(i++<n)
{
gets(str);
a=strlen(str);
if(str[0]=='A')
{
printf("T");
}else if(str[0]=='C')
{
printf("G");
}else if(str[0]=='G')
{
printf("C");
}else if(str[0]=='T')
{
printf("A");
}
while(j++<a)
{
if(str[j]=='A')
{
printf("T");
}else if(str[j]=='C')
{
printf("G");
}else if(str[j]=='G')
{
printf("C");
}else if(str[j]=='T')
{
printf("A");
}
}
printf("\n");
j=0;
}
} | 33 |
16,413 | int main()
{
int n,i,j,e;
char w[1000][256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",w[i]);
e=strlen(w[i]);
for(j=0;j<e;j++){
if(w[i][j]=='A'){
printf("T");
}else if(w[i][j]=='T'){
printf("A");
}else if(w[i][j]=='C'){
printf("G");
}else{
printf("C");
}
}
printf("\n");
}
return 0;
}
| 33 |
16,414 | int main(){
int i,n,j;
char a[256];
scanf("%d",&n);
for(i=0;i<=n;i++){
gets(a);
for(j=0;j<strlen(a);j++){
if(a[j]=='A'||a[j]=='T'){
if(a[j]=='T'){
a[j]='A';}
else{
a[j]='T';}
}
if(a[j]=='G'||a[j]=='C'){
if(a[j]=='C'){
a[j]='G';}
else{
a[j]='C';}
}
}
printf("%s\n",a);
}
return 0;
} | 33 |
16,415 |
void complement(char chain[])
{
int j;
for(j=0;j<strlen(chain);j++){
if(chain[j]=='A'){
chain[j]='T';
}else if(chain[j]=='T'){
chain[j]='A';
}else if(chain[j]=='C'){
chain[j]='G';
}else if(chain[j]=='G'){
chain[j]='C';
}
}
}
int main()
{
int n;
char chain[256];
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",chain);
complement(chain);
printf("%s\n",chain);
}
return 0;
}
| 33 |
16,416 | int main()
{
int n,i,j;
char a[1000][257];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=0;a[i][j]!='\0';j++)
{
switch(a[i][j])
{
case'A':
a[i][j]='T';
break;
case'G':
a[i][j]='C';
break;
case'C':
a[i][j]='G';
break;
case'T':
a[i][j]='A';
break;
}
}
}
for(i=0;i<n;i++)
{
printf("%s",a[i]);
if(i!=n-1)
{
printf("\n");
}
}
return 0;
}
| 33 |
16,417 | int main()
{
int n,i,j,len;
char str[1000][256],s[1000][256]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",str[i]);
len=strlen(str[i]);
for(j=0;j<len;j++)
{
if(str[i][j]=='A')
{
s[i][j]='T';
}
if(str[i][j]=='T')
{
s[i][j]='A';
}
if(str[i][j]=='G')
{
s[i][j]='C';
}
if(str[i][j]=='C')
{
s[i][j]='G';
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",s[i]);
}
return 0;
} | 33 |
16,418 | int main()
{
int i,j,n;
char a[256],b[5];
scanf("%d",&n);
gets(b);
for(i=0;i<n;i++)
{
gets(a);//gets(a);
for(j=0;a[j]!='\0';j++)
{
switch(a[j])
{
case 'A':a[j]='T';break;
case 'T':a[j]='A';break;
case 'C':a[j]='G';break;
case 'G':a[j]='C';break;
}
}
puts(a);
//printf("%s",a);
}
return 0;
}
| 33 |
16,419 | int main(){
char s[1000][256];
int n,i,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s[i]);
for(k=0;s[i][k]!='\0';k++){
if(s[i][k]=='T'){
s[i][k]='A';
}else if(s[i][k]=='A'){
s[i][k]='T';
}else if(s[i][k]=='C'){
s[i][k]='G';
}else if(s[i][k]=='G'){
s[i][k]='C';
}
}
}
for(i=0;i<n-1;i++){
printf("%s\n",s[i]);
}
printf("%s",s[n-1]);
return 0;
} | 33 |
16,420 | int main(){
int n,k,i,j;
scanf("%d",&n);
char zfc[1000][256];
for(i=0;i<n;i++){
scanf("%s",zfc[i]);
}
for(i=0;i<n;i++){
k=strlen(zfc[i]);
for(j=0;j<k;j++){
if(zfc[i][j]=='A'){
zfc[i][j]='T';
}else if(zfc[i][j]=='T'){
zfc[i][j]='A';
}else if(zfc[i][j]=='G'){
zfc[i][j]='C';
}else if(zfc[i][j]=='C'){
zfc[i][j]='G';
}
}
}
for(i=0;i<n-1;i++){
printf("%s\n",zfc[i]);
}
printf("%s",zfc[n-1]);
return 0;
}
| 33 |
16,421 | char a[5000][256];
int main()
{
int i,n,j;
scanf("%d",&n);
for(i=0;i<n;i++){scanf("%s",&a[i]);}
for(i=0;i<n;i++){
for(j=0;j<strlen(a[i]);j++){
switch(a[i][j]){
case'A':
a[i][j]='T';
break;
case'T':
a[i][j]='A';
break;
case'C':
a[i][j]='G';
break;
default:
a[i][j]='C';
}
}
}
for(i=0;i<n;i++){printf("%s\n",a[i]);}
return 0;
} | 33 |
16,422 | char mb[30000][300],fy[30000][300];
int main(){
int i=0,j=0,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",mb[i]);
}
for(i=0;i<n;i++){
for(j=0;j<strlen(mb[i]);j++){
if(mb[i][j]=='A'){
fy[i][j]='T';
}else if(mb[i][j]=='T'){
fy[i][j]='A';
}else if(mb[i][j]=='C'){
fy[i][j]='G';
}else /*if(mb[i][j]=='G')*/{
fy[i][j]='C';
}
}
}
for(i=0;i<n;i++){
for(j=0;j<strlen(mb[i]);j++){
printf("%c",fy[i][j]);
}
printf("\n");
}
return 0;
}
| 33 |
16,423 |
int main(){
int n,i,j,k;
char a[256],b[256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&a);
for(j=0;a[j]!='\0';j++){
if(a[j]=='A'){
b[j]='T';
}else if(a[j]=='T'){
b[j]='A';
}else if(a[j]=='G'){
b[j]='C';
}else if(a[j]=='C'){
b[j]='G';
}
}
for(j=0;j<256;j++){
if(a[j]=='\0'){
b[j]='\0';
}
}
printf("%s\n",b);
}
return 0;
}
| 33 |
16,424 | int main ()
{
char zs[257];
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",zs);
for(j=0;zs[j]!='\0';j++)
{
if(zs[j]=='A')
{
zs[j]='T';
}
else
{
if(zs[j]=='T')
{
zs[j]='A';
}
else
{
if(zs[j]=='C')
{
zs[j]='G';
}
else
{
if(zs[j]=='G')
{
zs[j]='C';
}
}
}
}
}
printf("%s\n",zs);
}
return 0;
}
| 33 |
16,425 | int main()
{
int n;
char s[300];
int i;
scanf("%d", &n);
while(n--)
{
scanf("%s", s);
i = 0;
while(s[i] != '\0')
{
if(s[i] == 'A')
printf("T");
if(s[i] == 'T')
printf("A");
if(s[i] == 'G')
printf("C");
if(s[i] == 'C')
printf("G");
i++;
}
printf("\n");
}
return 0;
} | 33 |
16,426 | int main(){
char xl[1000][256],hb[1000][256];
int i,m,n,cd[1000];
scanf("%d",&n);
for(m=0;m<n;m++){
scanf("%s",&xl[m]);
cd[m]=strlen(xl[m]);
}
for(m=0;m<n;m++){
for(i=0;i<cd[m];i++){
switch(xl[m][i]){
case'A':hb[m][i]='T';
break;
case'T':hb[m][i]='A';
break;
case'C':hb[m][i]='G';
break;
case'G':hb[m][i]='C';
break;
default:1;
}
}
hb[m][i]='\0';
}
for(m=0;m<n;m++){
printf("%s\n",hb[m]);
}
return 0;
} | 33 |
16,427 | int main(){
int n,i;
char base[256];
scanf("%d",&n);
while(n!=0){
scanf("%s",base);
for(i=0;base[i]!='\0';i++){
if(base[i]=='A')base[i]='T';
else if(base[i]=='T')base[i]='A';
else if(base[i]=='C')base[i]='G';
else if(base[i]=='G')base[i]='C';
}
n--;
printf("%s\n",base);
}
return 0;
} | 33 |
16,428 | int main(int argc, char* argv[])
{
int n,len=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
char s[256];
scanf("%s",s);
len=strlen(s);
for(int j=0;j<len;j++)
{
if(s[j]=='A') printf("T");
if(s[j]=='T') printf("A");
if(s[j]=='C') printf("G");
if(s[j]=='G') printf("C");
}
printf("\n");
}
return 0;
} | 33 |
16,429 | int main(){
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char DNA0[256],DNA1[256];
scanf("%s",DNA0);
for(j=0;j<strlen(DNA0);j++)
{
if(DNA0[j]=='A')
DNA1[j]='T';
if(DNA0[j]=='T')
DNA1[j]='A';
if(DNA0[j]=='C')
DNA1[j]='G';
if(DNA0[j]=='G')
DNA1[j]='C';
}
DNA1[strlen(DNA0)]='\0';
printf("%s\n",DNA1);
}
return 0;
} | 33 |
16,430 | char chaina[1000][260], chainb[1000][260];
int len;
int main()
{
int n, i, j;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s", chaina[i]);
len=strlen(chaina[i]);
for(j=0; j<len; j++)
{
switch(chaina[i][j])
{
case 'A':
chainb[i][j]='T';
break;
case 'T':
chainb[i][j]='A';
break;
case 'C':
chainb[i][j]='G';
break;
case 'G':
chainb[i][j]='C';
}
}
}
for(i=0; i<n; i++)
printf("%s\n", chainb[i]);
return 0;
}
| 33 |
16,431 | int main()
{
int a,b,c,i,k,m,n;
char sz[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",sz);
for(k=0;k<strlen(sz);k++)
{
switch(sz[k])
{
case 'A':
printf("T");
break;
case 'T':
printf("A");
break;
case 'C':
printf("G");
break;
case 'G':
printf("C");
break;
}
}
printf("\n");
}
return 0;
} | 33 |
16,432 | int main(){
int n,i,l,j;
char s[300];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s);
l=strlen(s);
for(j=0;s[j]!='\0';j++){
if(j==l-1){
if(s[j]=='A') printf("T\n");
if(s[j]=='T') printf("A\n");
if(s[j]=='C') printf("G\n");
if(s[j]=='G') printf("C\n");
}else{
if(s[j]=='A') printf("T");
if(s[j]=='T') printf("A");
if(s[j]=='C') printf("G");
if(s[j]=='G') printf("C");
}
}
}
return 0;
}
| 33 |
16,433 |
int main()
{
int n,i,l,j;
char s[1000][300],ds[1000][300];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",&s[i]);
l=strlen(s[i]);
for (j=0;j<l;j++)
{
if (s[i][j]=='A') ds[i][j]='T';
if (s[i][j]=='T') ds[i][j]='A';
if (s[i][j]=='G') ds[i][j]='C';
if (s[i][j]=='C') ds[i][j]='G';
}
ds[i][l]='\0';
}
for (i=0;i<n;i++) puts(ds[i]);
return 0;
} | 33 |
16,434 | int main()
{
int n;
char sz[100000];
scanf("%d",&n);
getchar();
for(int i=0;i<n;i++)
{
gets(sz);
for(int j=0;sz[j];j++)
{if(sz[j]=='A') sz[j]='T';
else if(sz[j]=='T') sz[j]='A';
else if(sz[j]=='G') sz[j]='C';
else if(sz[j]=='C') sz[j]='G';}
puts(sz);
}
return 0;
}
| 33 |
16,435 | int main(){
char jaji[1000][256];
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",jaji[i]);
}
for(i=0;i<n;i++){
for(j=0;j<strlen(jaji[i]);j++)
{
if(jaji[i][j]=='A'){
jaji[i][j]='T';
}
else if(jaji[i][j]=='T'){
jaji[i][j]='A';
}
else if(jaji[i][j]=='C'){
jaji[i][j]='G';
}
else if(jaji[i][j]=='G'){
jaji[i][j]='C';
}
}
jaji[i][strlen(jaji[i])]='\0';
}
for(i=0;i<n;i++)
{
printf("%s\n",jaji[i]);
}
return 0;
}
| 33 |
16,436 | int main()
{
int n,a,b,len;
char z[300];
scanf("%d",&n);
for(a=0;a<=n-1;a++)
{
scanf("%s",z);
len=strlen(z);
for(b=0;b<=len-1;b++)
{
if(z[b]=='A')
{
z[b]='T';
continue;
}
if(z[b]=='T')
{
z[b]='A';
continue;
}
if(z[b]=='G')
{
z[b]='C';
continue;
}
if(z[b]=='C')
{
z[b]='G';
continue;
}
}
printf("%s\n",z);
}
return 0;
} | 33 |
16,437 | int main(){
char DNA[chain][MAX];
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",DNA[i]);
}
for(i=0;i<n;i++){
for(j=0;DNA[i][j];j++){
if(DNA[i][j]=='A'){
DNA[i][j]='T';
}
else if(DNA[i][j]=='T'){
DNA[i][j]='A';
}
else if(DNA[i][j]=='C'){
DNA[i][j]='G';
}else{
DNA[i][j]='C';
}
}
}
for(i=0;i<n;i++){
printf("%s\n",DNA[i]);
}
return 0;
} | 33 |
16,438 | char b(char f);
int main(){
char s[256];
int i,j,n;
scanf("%d",&n);
for(j=0;j<n;j++) {
scanf("%s",s);
for(i=0;s[i];i++)
s[i]=b(s[i]);
printf("%s\n",s);
}
return 0;
}
char b(char f){
if(f=='A')return 'T';
if(f=='T')return 'A';
if(f=='C')return 'G';
if(f=='G')return 'C';
} | 33 |
16,439 | int main()
{
int n,i;
char zfc[10000][256],*ps;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",zfc[i]);
}
for(i=0;i<n;i++)
{
for(ps=zfc[i];*ps!='\0';ps++)
{
if(*ps==65)
{
printf("T");
}
else if(*ps==84)
{
printf("A");
}
else if(*ps==71)
{
printf("C");
}
else if(*ps==67)
{
printf("G");
}
}
printf("\n");
}
return 0;
} | 33 |
16,440 | int main(int argc, char* argv[])
{
int i,n,k,j;
scanf("%d",&n);
char s[256];
for(i=1;i<n+1;i++)
{
scanf("%s",s);
strlen(s);
k=strlen(s);
char ss[256];
for(j=0;j<k;j++)
{
if(s[j]=='A')
{
ss[j]='T';
}
if(s[j]=='T')
{
ss[j]='A';
}
if(s[j]=='G')
{
ss[j]='C';
}
if(s[j]=='C')
{
ss[j]='G';
}
}
ss[j]='\0';
printf("%s\n",ss);
}
return 0;
}
| 33 |
16,441 | int main()
{
int n,jishu;
int i,j;
char jianji[1001];
scanf("%d\n`", &n);
for(i=1;i<=n;i++)
{
for(j=1;j<=1000;j++)
{
jianji[j]=getchar();
if(jianji[j]=='\n')
{
jishu=j;break;
}
}
for(j=1;j<=jishu;j++)
{
switch(jianji[j])
{
case 'A':
printf("T");break;
case 'T':
printf("A");break;
case 'C':
printf("G");break;
case 'G':
printf("C");break;
default:
printf("\n");break;
}
}
}
return 0;
}
| 33 |
16,442 | int main(){
int n,i,j;
char zfc[1000][1000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",zfc[i]);
for(i=0;i<n;i++){
for(j=0;j<strlen(zfc[i]);j++){
if(zfc[i][j]=='A'){
printf("T");
}
else if(zfc[i][j]=='T'){
printf("A");
}
else if(zfc[i][j]=='G'){
printf("C");
}
else if(zfc[i][j]=='C'){
printf("G");
}
}
printf("\n");
}
return 0;
}
| 33 |
16,443 | int main()
{
char a[256];
int n, j, i;
cin >> n;
for(i = 0;i < n;i++)
{
cin >> a;
for(j = 0;j < strlen(a);j++)
switch(a[j])
{
case 'A': cout << 'T';break;
case 'T': cout << 'A';break;
case 'G': cout << 'C';break;
case 'C': cout << 'G';break;
}
cout << endl;
}
return 0;
}
| 33 |
16,444 |
int main()
{
int n,i,j;
//char lian[100][256],hubu[100][256];
char **lian, **hubu;
scanf("%d",&n);
lian = (char**)malloc(n*sizeof(char*));
hubu = (char**)malloc(n*sizeof(char*));
for(i=0; i<n; i++)
{
lian[i] = (char*)malloc(256*sizeof(char));
hubu[i] = (char*)malloc(256*sizeof(char));
}
for(i=0;i<n;i++)
{
scanf("%s",lian[i]);
}
for(i=0;i<n;i++)
{
for(j=0;lian[i][j]!='\0';j++)
{
if(lian[i][j]=='A')
{
hubu[i][j]='T';
}
if(lian[i][j]=='T')
{
hubu[i][j]='A';
}
if(lian[i][j]=='G')
{
hubu[i][j]='C';
}
if(lian[i][j]=='C')
{
hubu[i][j]='G';
}
}
hubu[i][j]='\0';
}
for(i=0; i<n; i++)
printf("%s\n",hubu[i]);
return 0;
} | 33 |
16,445 | int main(){
int n,len;
char zf[1000][1000];
scanf("%d",&n);
int i,j;
for (i=0;i<n;i++){
scanf("%s",zf[i]);
j=0;
len=strlen(zf[i]);
for (j=0;j<len;j++){
switch(zf[i][j]){
case 'A':
zf[i][j]='T';
break;
case 'T':
zf[i][j]='A';
break;
case 'C':
zf[i][j]='G';
break;
case 'G':
zf[i][j]='C';
break;
}
}
printf("%s\n",zf[i]);
}
return 0;
} | 33 |
16,446 | int main()
{
int n,i,j,len;
char str[1000][LEN];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",str[i]);
}
for(i=0;i<n;i++)
{
len=strlen(str[i]);
for(j=0;j<len;j++)
{
if(str[i][j]=='A')
{
str[i][j]='T';
}
else if(str[i][j]=='T')
{
str[i][j]='A';
}
else if(str[i][j]=='C')
{
str[i][j]='G';
}
else if(str[i][j]=='G')
{
str[i][j]='C';
}}}
for(i=0;i<n;i++)
{
printf("%s\n",str[i]);
}
return 0;
}
| 33 |
16,447 | int main()
{
int n,j,k;
char a[300],in;
scanf("%d",&n);
scanf("%c",&in);
for(int i=1;i<=n;i++)
{
for(j=1;j<=299;j++)
{
scanf("%c",&a[j]);
if(a[j]==10)
{
k=j;
break;
}
}
for(j=1;j<=k-1;j++)
{
if(a[j]=='A')printf("T");
if(a[j]=='C')printf("G");
if(a[j]=='G')printf("C");
if(a[j]=='T')printf("A");
}
printf("\n");
}
return 0;
}
| 33 |
16,448 |
void main()
{
int i,n;
scanf("%d",&n);
for (i=0;i<n;i++)
{
int len;
int j;
char line[256]={'\0'};
scanf("%s",line);
len=strlen(line);
for(j=0;j<len;j++)
switch(line[j])
{
case 'A': line[j]='T';continue;
case 'T': line[j]='A';continue;
case 'C': line[j]='G';continue;
case 'G': line[j]='C';continue;
}
printf("%s\n",line);
}
} | 33 |
16,449 | int main (){
char s[260],t[260]={0};
int n, i,j,len;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s);
for (j=0;s[j]!='\0';j++){
if (s[j]=='A'){
t[j]='T';}
if(s[j]=='T'){
t[j]='A';}
if(s[j]=='C'){
t[j]='G';}
if(s[j]=='G'){
t[j]='C';}
}
if(s[j]=='\0'){
t[j]='\0';}
printf ("%s\n",t);
}
return 0;
}
| 33 |
16,450 | int main(){
char z[1000][1000],s[1000][1000];
int n,i,k,a;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%s\n",z[i]);
}
for(i=0;i<=n-1;i++){
for(k=0;z[i][k]!=0;k++){
if(z[i][k]=='A'){
s[i][k]='T';
}
if(z[i][k]=='T'){
s[i][k]='A';
}
if(z[i][k]=='C'){
s[i][k]='G';
}
if(z[i][k]=='G'){
s[i][k]='C';
}
}
}
for(i=0;i<=n-1;i++){
printf("%s\n",s[i]);
}
return 0;
} | 33 |
16,451 | int main()
{
int n,i,t;
char a[260];
scanf("%d",&n);
scanf("%c",&a[0]);
i=1;
while(i<=n)
{
t=0;
do
{
scanf("%c",&a[t]);
if(a[t]=='A')
{
printf("T");
}
else if(a[t]=='G')
{
printf("C");
}
else if(a[t]=='T')
{
printf("A");
}
else if(a[t]=='C')
{
printf("G");
}
t=t+1;
}while(a[t-1]!='\n');
printf("\n");
i=i+1;
}
return 0;
}
| 33 |
16,452 |
char s[1000];
int main(){
//freopen("i.txt","r",stdin);
int T,i;
scanf("%d",&T);
while (T--){
scanf("%s",s);
for (i=0;s[i];i++){
if (s[i]=='A'){
putchar('T');
}
if (s[i]=='T'){
putchar('A');
}
if (s[i]=='G'){
putchar('C');
}
if (s[i]=='C'){
putchar('G');
}
}
puts("");
}
} | 33 |
16,453 | int main(){
int n;
cin>>n;
char z1[256],z2[256]; gets(z1);
for (int j=0;j<n;j++) {
gets(z1);
for (int i=0;z1[i]!='\0';i++){
if (z1[i]=='A') z2[i]='T';else
if (z1[i]=='T') z2[i]='A';else
if (z1[i]=='G') z2[i]='C';else
if (z1[i]=='C') z2[i]='G';
z2[i+1]=0;
}
puts(z2);
}
return 0;
} | 33 |
16,454 | int main()
{
int q;
char a[255];
scanf("%d",&q);
for(int i=0;i<=q-1;i++)
{
scanf("%s",a);
for(int j=0;j<=strlen(a)-1;j++)
{
if(a[j]==65){printf("T");}
else if(a[j]==84){printf("A");}
else if(a[j]==71){printf("C");}
else if(a[j]==67){printf("G");}
}
printf("\n");
}
int y;
scanf("%d",&y);
return 0;
}
| 33 |
16,455 | int main()
{
int n;
char b[100];
gets(b);
n=atoi(b);
int i;
for(i=0;i<n;i++)
{
char dna[255];
int j;
gets(dna);
for(j=0;(dna[j])!='\0';j++)
{
// scanf("%c",&dna[j]);
if(dna[j]=='A')
{
dna[j]='T';
}
else if(dna[j]=='T')
{
dna[j]='A';
}
else if(dna[j]=='C')
{
dna[j]='G';
}
else
{
dna[j]='C';
}
}
for(j=0;(dna[j])!='\0';j++)
{
printf("%c",dna[j]);
}
printf("\n");
}
return 0;
} | 33 |
16,456 | int main(){
int n,i,k,l;
char zfc[1000][256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",zfc[i]);
}
for(i=0;i<n;i++){
l=strlen(zfc[i]);
for(k=0;k<l;k++){
if(zfc[i][k]=='A'){
zfc[i][k]='T';
}
else if(zfc[i][k]=='C'){
zfc[i][k]='G';
}
else if(zfc[i][k]=='G'){
zfc[i][k]='C';
}
else{
zfc[i][k]='A';
}
}
printf("%s\n",zfc[i]);
}
return 0;
} | 33 |
16,457 | int main(){
int n,i,k;
char zfc0[100];
gets(zfc0);
n=atoi(zfc0);
for(i=0;i<n;i++){
char zfc[256];
gets(zfc);
int a;
a=strlen(zfc);
for(k=0;k<a;k++){
if(zfc[k]=='A'){
zfc[k]='T';
}
else if(zfc[k]=='G'){
zfc[k]='C';
}
else if(zfc[k]=='C'){
zfc[k]='G';
}
else if(zfc[k]=='T'){
zfc[k]='A';
}else{
zfc[k]='\0';
}}
printf("%s\n",zfc);
}
return 0;
}
| 33 |
16,458 | int main()
{
int n,len;
scanf("%d",&n);
char DNA[1000][1000],DNA2[1000][1000];
for(int i=0;i<n;i++)
{
scanf("%s",&DNA[i]);
len=strlen(DNA[i]);
for(int j=0;j<len;j++)
{
if(DNA[i][j]=='A') DNA2[i][j]='T';
if(DNA[i][j]=='T') DNA2[i][j]='A';
if(DNA[i][j]=='C') DNA2[i][j]='G';
if(DNA[i][j]=='G') DNA2[i][j]='C';
}
puts(DNA2[i]);
}
return 0;
}
| 33 |
16,459 | int main(){
int N,i,k;
char lian[300],fanlian[300]={0};
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%s",lian);
for(k=0;k<strlen(lian);k++){
if(lian[k]=='A'){fanlian[k]='T';}
if(lian[k]=='G'){fanlian[k]='C';}
if(lian[k]=='C'){fanlian[k]='G';}
if(lian[k]=='T'){fanlian[k]='A';}
printf("%c",fanlian[k]);
}
printf("\n");
}
return 0;
} | 33 |
16,460 | int main()
{
int n,i,j;
char an[1000][1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&an[i]);
for(j=0;an[i][j]!=0;j++)
{
if(an[i][j]=='A')
printf("T");
else if(an[i][j]=='T')
printf("A");
else if(an[i][j]=='C')
printf("G");
else if(an[i][j]=='G')
printf("C");
}
printf("\n");
}
return 0;
}
| 33 |
16,461 | void main(){
char str[1000][260];
int n,i,j,p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&str[i]);
}
for(i=0;i<n;i++){
p=strlen(str[i]);
for(j=0;j<p;j++){
switch(str[i][j]){
case'A':str[i][j]='T';break;
case'T':str[i][j]='A';break;
case'G':str[i][j]='C';break;
case'C':str[i][j]='G';break;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",str[i]);
}
}
| 33 |
16,462 | int main()
{
int n,i,j,k;
char a[300];
scanf("%d",&n);
getchar();
for(i=1;i<=n;i++)
{
for(j=1;j<300;j++)
{
scanf("%c",&a[j]);
if(a[j]==10)
{
k=j-1;
break;
}
}
for(j=1;j<=k;j++)
{
switch(a[j])
{
case'A':a[j]='T';break;
case'T':a[j]='A';break;
case'C':a[j]='G';break;
case'G':a[j]='C';break;
}
}
for(j=1;j<=k;j++)
{
printf("%c",a[j]);
}
printf("\n");
}
return 0;
} | 33 |
16,463 | int main()
{
int n;
scanf ("%d",&n);
char a[1000][256];
int i,j;
for (i=0;i<n;i++)
{
scanf ("%s",a[i]);
}
for (i=0;i<n;i++)
{
for (j=0;a[i][j]!='\0';j++)
{
if (a[i][j]=='A')
{a[i][j]='t';
}
if (a[i][j]=='T')
{ a[i][j]='A';
}
if (a[i][j]=='C')
{a[i][j]='g';
}
if (a[i][j]=='G')
{a[i][j]='C';
}
if (a[i][j]=='t')
{a[i][j]='T';
}
if (a[i][j]=='g')
{ a[i][j]='G';
}
}
printf("%s\n",a[i]);
}
return 0;
} | 33 |
16,464 | int main()
{
int i, j, n, l;
char s[300];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%s", &s);
l=strlen(s);
for(j=0;j<l;j++){
if(s[j]=='A'){
s[j]=s[j]+19;
}
else if(s[j]=='T'){
s[j]=s[j]-19;
}
else if(s[j]=='C'){
s[j]=s[j]+4;
}
else{
s[j]=s[j]-4;
}
}
printf("%s\n", s);
}
return 0;
}
| 33 |
16,465 | int main()
{
int n,i,j,m;
char A,T,C,G;
char a[10000],b[10000];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
for(j=0;1;j++)
{
a[j]=getchar();
if(a[j]=='\n')
{
break;
}
if(a[j]=='A')
{
b[j]='T';
}
else if(a[j]=='T')
{
b[j]='A';
}
else if(a[j]=='C')
{
b[j]='G';
}
else
{
b[j]='C';
}
}
for(m=0;m<=j-1;m++)
{
putchar(b[m]);
}
putchar('\n');
}
return 0;
}
| 33 |
16,466 | int main(){
int n,i,k;
scanf("%d\n",&n);
char z[n][N];
for(i=0;i<n;i++){
scanf("%s\n",z[i]);
}
for(k=0;k<n;k++){
i=0;
while(z[k][i]!='\0'){
if(z[k][i]=='T'){z[k][i]='A';}
else if(z[k][i]=='A'){z[k][i]='T';}
else if(z[k][i]=='G'){z[k][i]='C';}
else if(z[k][i]=='C'){z[k][i]='G';}
i++;}
}
for(i=0;i<n;i++){
puts(z[i]);}
return 0;
} | 33 |
16,467 | int main(){
char str[260],*ps,str2[260];
int n,i,k;
scanf("%d\n",&n);
for(k=0;k<n;k++){
gets(str);
i=0;
for(ps=str;*ps!='\0';ps++){
if(*ps=='A')str2[i]='T';
else if(*ps=='T')str2[i]='A';
else if(*ps=='G')str2[i]='C';
else str2[i]='G';
i++;}
str2[i] = '\0';
printf("%s\n",str2);}
return 0;
} | 33 |
16,468 | int main()
{
int n,i,j,len;
char a[256],b[256]={'\0'};
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
char b[256]={'\0'};
len=0;
gets(a);
len=strlen(a);
for(j=0;j<len;j++)
{
if(a[j]=='A')
{
b[j]='T';
}
else if(a[j]=='T')
{
b[j]='A';
}
else if(a[j]=='G')
{
b[j]='C';
}
else if(a[j]=='C')
{
b[j]='G';
}
}
puts(b);
}
return 0;
} | 33 |
16,469 | int main(int argc, char* argv[])
{
int n,i,len,j;
char a[256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a);
len=strlen(a);
for(j=0;j<len;j++){
switch(a[j]){
case 'A':a[j]='T';break;
case 'C':a[j]='G';break;
case 'G':a[j]='C';break;
case 'T':a[j]='A';break;
}
}
printf("%s\n",a);
}
return 0;
}
| 33 |
16,470 | int main()
{
int n,i,j,num;
char a[256],b[256];
scanf("%d",&n);
getchar();
for(i=0;i<n;i++){
gets(a);
num=strlen(a);
for(j=0;j<num;j++){
switch(a[j])
{
case'A':b[j]='T';continue;
case'T':b[j]='A';continue;
case'C':b[j]='G';continue;
case'G':b[j]='C';continue;
}
}
for(j=0;j<num;j++){
printf("%c",b[j]);
}
printf("\n");
}
return 0;
} | 33 |
16,471 | int main(){
int n,i,j,c;
scanf("%d",&n);
char a[1000][256],b[1000][256];
for(i=0;i<n;i++){
scanf("%s",&a[i]);
}
for(i=0;i<n;i++){
j=0;
c=strlen(a[i]);
for(j=0;j<c;j++){
if(a[i][j]=='A') b[i][j]='T';
if(a[i][j]=='T') b[i][j]='A';
if(a[i][j]=='G') b[i][j]='C';
if(a[i][j]=='C') b[i][j]='G';
printf("%c",b[i][j]);
}
printf("\n");
}
return 0;
}
| 33 |
16,472 | int main()
{
int n,i;
scanf("%d",&n);
char str[260],*ps;
int a=0;
for(i=0;i<n;i++)
{
scanf("%s",&str);
for(ps=str;*ps!='\0';ps++)
{
if(*ps=='A')
*ps='T';
else if(*ps=='T')
*ps='A';
else if(*ps=='C')
*ps='G';
else if(*ps=='G')
*ps='C';
}
printf("%s\n",str);
}
return 0;
} | 33 |
16,473 | int main(){
int n,i,j;
char q[256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&q);
for(j=0;q[j]!='\0';j++){
if(q[j]=='A'){
printf("T");
}else{
if(q[j]=='T'){
printf("A");
}else{
if(q[j]=='C'){
printf("G");
}else{
if(q[j]=='G'){
printf("C");
}
}
}
}
}
printf("\n");
}
return 0;
} | 33 |
16,474 | int main(){
int n;
scanf("%d",&n);
int i;
char **oldjianji=(char**)malloc(sizeof(char*)*n);
for(i=0;i<n;i++){
oldjianji[i]=(char*)malloc(sizeof(char)*256);
}
int j;
int *len=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%s",oldjianji[i]);
len[i]=strlen(oldjianji[i]);
}
char **jianji=(char**)malloc(sizeof(char*)*n);
for(i=0;i<n;i++){
jianji[i]=(char*)malloc(sizeof(char)*len[i]+1);
}
for(i=0;i<n;i++){
for(j=0;j<len[i];j++){
if(oldjianji[i][j]=='A'){
jianji[i][j]='T';
}else if(oldjianji[i][j]=='T'){
jianji[i][j]='A';
}else if(oldjianji[i][j]=='C'){
jianji[i][j]='G';
}else if(oldjianji[i][j]=='G'){
jianji[i][j]='C';
}
}
}
for(i=0;i<n;i++){
printf("%s\n",jianji[i]);
}
free(jianji);
free(oldjianji);
free(len);
return 0;
} | 33 |
16,475 | int main()
{
int n,b[1000];
char u[1000][256];
char a='A',t='T',g='G',c='C';
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%s",u[i]);
}
for(i=0;i<n;i++)
{
b[i]=strlen(u[i]);
for(j=0;j<b[i];j++)
{
if(u[i][j]=='A')
{u[i][j]='T';}
else if(u[i][j]=='T')
{ u[i][j]='A';}
else if(u[i][j]=='C')
{ u[i][j]='G';}
else if(u[i][j]=='G')
{u[i][j]='C';}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",u[i]);
}
return 0;
} | 33 |
16,476 | int main()
{
int n,i,j;
scanf("%d",&n);
char zfc[1000][300];
int k[1000];
for(i=0;i<n;i++)
{
scanf("%s",zfc[i]);
k[i]=strlen(zfc[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<k[i];j++)
{
if(zfc[i][j]=='A')
{
zfc[i][j]='T';
}
else if(zfc[i][j]=='T')
{
zfc[i][j]='A';
}
else if(zfc[i][j]=='G')
{
zfc[i][j]='C';
}
else if(zfc[i][j]=='C')
{
zfc[i][j]='G';
}
}
printf("%s\n",zfc[i]);
}
return 0;
} | 33 |
16,477 | void main()
{
int n,i,k,len;
char *p,str1[1000][300],str2[300][5];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",str1[i]);
}
for(i=1;i<=n;i++)
{
len=strlen(str1[i]);
for(k=len-1;k>=0;k--)
{
p=str1[i]+k;
if(strcmp(p,"A")==0)
{
strcpy(str2[k],"T");
}
if(strcmp(p,"G")==0)
{
strcpy(str2[k],"C");
}
if(strcmp(p,"C")==0)
{
strcpy(str2[k],"G");
}
if(strcmp(p,"T")==0)
{
strcpy(str2[k],"A");
}
strcpy(p,"\0");
}
for(k=0;k<len-1;k++)
{
printf("%s",str2[k]);
}
printf("%s\n",str2[len-1]);
}
} | 33 |
16,478 | int main()
{
int n,i,l,j;
char a[256],t='T',b='A',g='G',c='C';
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
if(a[j]=='A')
printf("%c",t);
if(a[j]=='T')
printf("%c",b);
if(a[j]=='C')
printf("%c",g);
if(a[j]=='G')
printf("%c",c);
}
printf("\n");
}
return 0;
} | 33 |
16,479 | int main()
{
int n, i;
char s[255];
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s", s);
int len=strlen(s);
char s1[255]={'\0'};
for(int j=0;j<len;j++)
{
if(s[j]=='A')
{
s1[j]='T';
}
else if(s[j]=='T')
{
s1[j]='A';
}
else if(s[j]=='C')
{
s1[j]='G';
}
else if(s[j]=='G')
{
s1[j]='C';
}
}
printf("%s\n", s1);
}
return 0;
} | 33 |
16,480 | int main(){
int i,j,n;
char zfc[256],jg[256];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", zfc);
for (j = 0; zfc[j]!='\0'; j++){
if (zfc[j]=='A'){
jg[j]='T';
} else if(zfc[j]=='T'){
jg[j]='A';
} else if(zfc[j]=='C'){
jg[j]='G';
} else {
jg[j]='C';
}
}
jg[j]='\0';
printf("%s\n",jg);
}
return 0;
}
| 33 |
16,481 | void main()
{
char f(char x);
int n, i, j;
char s[256];
scanf("%d\n", &n);
for(i=0; i<n; i++)
{
gets(s);
for(j=0; s[j]!='\0'; j++)
s[j]=f(s[j]);
s[j]='\0';
puts(s);
}
}
char f(char x)
{
switch(x)
{
case 'A': return 'T'; break;
case 'T': return 'A'; break;
case 'C': return 'G'; break;
case 'G': return 'C'; break;
}
} | 33 |
16,482 | char pd(char x);
int main(){
char a[256],b[256];
int i,j,l,n;
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%s",a);
l=strlen(a);
for (j=0;j<l;j++)
b[j]=pd(a[j]);
b[l]=0;
printf("%s\n",b);
}
return 0;
}
char pd(char x){
char y;
if (x=='A') y= 'T';
if (x=='T') y= 'A';
if (x=='C') y= 'G';
if (x=='G') y= 'C';
return y;
}
| 33 |
16,483 | int main(){
char zfc[256],*ps;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
char e[256]={0};
scanf("%s",zfc);
for(ps=zfc;*ps!='\0';ps++){
if(*ps=='A'){
strcat(e,"T");
}else if(*ps=='T'){
strcat(e,"A");
}else if(*ps=='G'){
strcat(e,"C");
}else{
strcat(e,"G");
}
}
printf("%s\n",e);
}
return 0;
} | 33 |
16,484 | int main(){
int n,i,j,a;
char num[4];
gets(num);
n=atoi(num);
for(i=0;i<n;i++){
char yl[256];
char bl[256];
gets(yl);
a=strlen(yl);
for(j=0;j<a;j++){
if(yl[j]==65){
bl[j]='T';
}else if(yl[j]==67){
bl[j]='G';
}else if(yl[j]==71){
bl[j]='C';
}else{
bl[j]='A';
}
printf("%c",bl[j]);
}
printf("\n");
}
return 0;
}
| 33 |
16,485 | int main(){
int n;
scanf("%d",&n);
char zfc[n][257];
for(int i=0;i<n;i++){
scanf("%s",zfc[i]);
}
for(int i=0;i<n;i++){
for(int j=0;j<257;j++){
if(zfc[i][j]=='A'){
zfc[i][j]='T';
}else{
if(zfc[i][j]=='T'){
zfc[i][j]='A';
}else{
if(zfc[i][j]=='C'){
zfc[i][j]='G';
} else{
if(zfc[i][j]=='G'){
zfc[i][j]='C';
}else{
break;
}}}}}}
for(int i=0;i<n;i++){
printf("%s\n",zfc[i]);
}
return 0;}
| 33 |
16,486 | int main()
{
int i,n,p;
char a[260];
scanf("%d",&n);
scanf("\n");
for(i=0;i<n;i++)
{
p=0;
do
{
scanf("%c",&a[p]);
switch(a[p])
{
case 'A': a[p] = 'T'; break;
case 'T': a[p] = 'A'; break;
case 'G': a[p] = 'C'; break;
case 'C': a[p] = 'G'; break;
}
printf("%c",a[p]);
p=p+1;
}while(a[p-1]!='\n');
}
return 0;
}
| 33 |
16,487 | int main(){
char a[1000][300],b[1000][300];
int i,j,n,t=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a[i]);
}
for(i=0;i<n;i++){
t=strlen(a[i]);
for(j=0;j<t;j++){
if(a[i][j]=='A') b[i][j]='T';
if(a[i][j]=='T') b[i][j]='A';
if(a[i][j]=='C') b[i][j]='G';
if(a[i][j]=='G') b[i][j]='C';
}
b[i][t]='\0';
}
for(i=0;i<n;i++){
printf("%s\n",b[i]);
}
return 0;
}
| 33 |
16,488 | int main(){
int i,n;
char c[N][L],d[N][L];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s/n",c[i]);
}
for(i=0;i<n;i++){
for(int j=0;j<strlen(c[i]);j++){
if(c[i][j]=='A'){
d[i][j]='T';
}else
if(c[i][j]=='G'){
d[i][j]='C';
}else
if(c[i][j]=='C'){
d[i][j]='G';
}else
if(c[i][j]=='T'){
d[i][j]='A';
}
}
}
for(i=0;i<n;i++){
printf("%s\n",d[i]);
}
}
| 33 |
16,489 | int main()
{
int n,i,j;
char zfcsz[N][256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&(zfcsz[i]));
}
for(i=0;i<n;i++){
for(j=0;zfcsz[i][j]!='\0';j++){
if(zfcsz[i][j]=='A'){
zfcsz[i][j]='T';
}else if(zfcsz[i][j]=='T'){
zfcsz[i][j]=zfcsz[i][j]+'A'-'T';
}else if(zfcsz[i][j]=='C'){
zfcsz[i][j]=zfcsz[i][j]+'G'-'C';
}else if(zfcsz[i][j]=='G'){
zfcsz[i][j]=zfcsz[i][j]+'C'-'G';
}
}
}
for(i=0;i<n;i++){
printf("%s\n",zfcsz[i]);
}
return 0;
} | 33 |
16,490 | int main(){
char zf[256],hb[256];
int n,judge=0;
scanf("%d",&n);
for(int j=0;j<n;j++){
scanf("%s",zf);
for(int k=0;k<256;k++){
hb[k]='\0';
}
for(int i=0;zf[i];i++){
if(zf[i]=='A'){
hb[i]='T';
}
if(zf[i]=='T'){
hb[i]='A';
}
if(zf[i]=='C'){
hb[i]='G';
}
if(zf[i]=='G'){
hb[i]='C';
}
}
printf("%s\n",hb);
}
return 0;
} | 33 |
16,491 |
int main()
{
int n,i,j,len[1000];
char s[1000][256];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s[i]);
}
for(i=0;i<n;i++){
len[i]=strlen(s[i]);
}
for(i=0;i<n;i++){
for(j=0;j<len[i];j++){
if(s[i][j]=='A')
s[i][j]='T';
else if(s[i][j]=='T')
s[i][j]='A';
else if(s[i][j]=='C')
s[i][j]='G';
else if(s[i][j]=='G')
s[i][j]='C';
}
}
for(i=0;i<n;i++){
printf("%s\n",s[i]);
}
return 0;
}
| 33 |
16,492 | int main()
{
int n,i,j;
char a[256];
scanf("%d",&n);
scanf("%c",&a[0]);
for(i=0;i<n;i++)
{
j=0;
while(j<=255)
{
scanf("%c",&a[j]);
if(a[j]=='A') printf("T");
else if(a[j]=='T') printf("A");
else if(a[j]=='C') printf("G");
else if(a[j]=='G') printf("C");
else break;
j=j+1;
}
printf("\n");
}
return 0;
} | 33 |
16,493 | int main()
{
char s[255]={'\0'},s1[255]={'\0'};int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char s[255]={'\0'};char s1[255]={'\0'};
scanf("%s",s);
for(j=0;s[j]!='\0';j++)
{
if(s[j]=='A')
{s1[j]='T';}
if(s[j]=='T')
{s1[j]='A';}
if(s[j]=='C')
{s1[j]='G';}
if(s[j]=='G')
{s1[j]='C';}
}
printf("%s\n",s1);
}
return 0;
} | 33 |
16,494 | int main(){
char s[1000][1000];
int len[1000]={0};
int n,i,j;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s",s[i]);
for(i=0;i<n;i++)
len[i]=strlen(s[i]);
for(i=0;i<n;i++)
{
for(j=0;j<len[i];j++)
{
if(s[i][j]=='A')
s[i][j]='T';
else if(s[i][j]=='T')
s[i][j]='A';
else if(s[i][j]=='C')
s[i][j]='G';
else if(s[i][j]=='G')
s[i][j]='C';
}
}
for(i=0;i<n;i++)
printf("%s\n",s[i]);
} | 33 |
16,495 | int main(){
int n;
cin>>n;
char z[256];
gets(z);
for (int j=0;j<n;j++) {
gets(z);
for (int i=0;z[i]!='\0';i++){
if (z[i]=='A') z[i]='T';
else if(z[i]=='T') z[i]='A';
else if(z[i]=='G') z[i]='C';
else if(z[i]=='C') z[i]='G';
}
puts(z);
}
return 0;
} | 33 |
16,496 | void main()
{
int n,l,i;char c[10];
char str[256];
scanf("%d",&n);gets(c);
while(n--)
{
memset(str,0,sizeof(str));
gets(str);
l=strlen(str);
for(i=0;i<l;i++)
{
switch(str[i])
{
case'A':printf("T");break;
case'T':printf("A");break;
case'C':printf("G");break;
case'G':printf("C");break;
}
}
printf("\n");
}
}
| 33 |
16,497 |
int main()
{
char data[1000]={0};
int i,j,n,len[1000]={0};
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s",data);
for(j=0;j<1000;j++){
if(data[j]=='T'){
data[j]='A';
continue;
}
if(data[j]=='A'){
data[j]='T';
continue;
}
if(data[j]=='C'){
data[j]='G';
continue;
}
if(data[j]=='G'){
data[j]='C';
continue;
}
}
printf("%s\n",data);
}
return 0;
}
| 33 |
16,498 | int main(){
int n;
scanf("%d",&n);
char pd[n][256];
char A,T,C,G;
for (int i=0;i<n;i++){
scanf("%s",(pd[i]));
for(int m=0;pd[i][m]!='\0';m++){
if (pd[i][m]=='A'){
pd[i][m]='T';
}else if(pd[i][m]=='T'){
pd[i][m]='A';
}else if(pd[i][m]=='C'){
pd[i][m]='G';
}else if(pd[i][m]=='G'){
pd[i][m]='C';
}
}
}
for (int i=0;i<n;i++){
printf("%s\n",pd[i]);
}
return 0;
}
| 33 |
16,499 | int main(){
int n,i,j;
char s[10000][260];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s",s[i]);
}
for(i=1;i<=n;i++){
for(j=0;s[i][j]!='\0';j++){
if(s[i][j]=='A'){
s[i][j]='T';
}
else if(s[i][j]=='C'){
s[i][j]='G';
}
else if(s[i][j]=='G'){
s[i][j]='C';
}
else if(s[i][j]=='T'){
s[i][j]='A';
}
}
printf("%s\n",s[i]);
}
return 0;
} | 33 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.