label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
57 | 28200 |
int main()
{
int n,i,l,j;
char str[30];
scanf("%d",&n);
for(i=0;i<n;i++)
{
l=0;
scanf("%s",str);
l=strlen(str);
if(str[l-2]=='e'&&str[l-1]=='r')
{
for(j=0;j<l-2;j++)
{
printf("%c",str[j]);
}
printf("\n");
}
if(str[l-2]=='l'&&str[l-1]=='y')
{
for(j=0;j<l-2;j++)
{
printf("%c",str[j]);
}
printf("\n");
}
if(str[l-3]=='i'&&str[l-2]=='n'&&str[l-1]=='g')
{
for(j=0;j<l-3;j++)
{
printf("%c",str[j]);
}
printf("\n");
}
}
return 0;
} |
57 | 28201 | void main()
{
int n,i;
char a[50][21];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(a[i]);
int l=strlen(a[i]);
if(a[i][l-1]=='r'||a[i][l-1]=='y')
{
a[i][l-2]='\0';
a[i][l-1]='\0';
}
else
{
a[i][l-2]='\0';
a[i][l-1]='\0';
a[i][l-3]='\0';
}
}
int j;
for(j=0;j<n;j++) puts(a[j]);
} |
57 | 28202 | int main()
{
int n,i,j,l,t;
char word[50];
cin>>n;
for(i=1;i<=n;i++)
{
cin>>word;
l=strlen(word);
if(word[l-3]=='i'&&word[l-2]=='n'&&word[l-1]=='g')l-=3;
else if(word[l-2]=='e'&&word[l-1]=='r')l-=2;
else if(word[l-2]=='l'&&word[l-1]=='y')l-=2;
for(j=0;j<l;j++)
cout<<word[j];
cout<<endl;
}
return 0;
} |
57 | 28203 | int main(){
int n,k,i,j,len;
char ci[50][50];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",ci[i]);
}
char *ps;
//int m;
for( j=0;j<n;j++){
//m=strlen(ci[j]);
ps=ci[j]-1+strlen(ci[j]);
k=strcmp(ps,"g");
if(k!=0){
/*
for(int k=0;k<m-3;k++){
printf("%c",ci[j][k]);
printf("\n");
}
*/
len=strlen(ci[j]);
ci[j][len-2]='\0';
}
else if(k==0){
/*
for(int h=0;h<m-4;h++){
printf("%c",ci[j][h]);
printf("\n");
}
*/
len=strlen(ci[j]);
ci[j][len-3]='\0';
}
}
for( i=0;i<n;i++){
printf("%s\n",ci[i]);
}
return 0;
} |
57 | 28204 | main()
{
int n;
scanf("%d",&n);
char w[51];
char *c[]={"er","ly","ing"};
for(int i=0;i<n;i++)
{
scanf("%s",w);
for(int j=0;j<3;j++)
{
int len=strlen(w);
int slen=strlen(c[j]);
if(strcmp(c[j],w+len-slen)==0)
{
w[len-slen]=0;
printf("%s\n",w);
break;
}
}
}
} |
57 | 28205 | void main()
{
char a[50][20];
char b[]="er",c[]="ly",d[]="ing";
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<20;j++)
{
if(a[i][j]=='\0')
{
if(strcmp(&a[i][j-2],b)==0||strcmp(&a[i][j-2],c)==0)
{
a[i][j-2]='\0';
printf("%s\n",a[i]);
}
else if(strcmp(&a[i][j-3],d)==0)
{
a[i][j-3]='\0';
printf("%s\n",a[i]);
}
}
}
}
}
|
57 | 28206 |
int main()
{
int n,i,j,l;
char s[33];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s);
l=strlen(s);
for(j=0;j<l+1;j++)
{
if(s[j]=='\0' && s[j-1]=='r' && s[j-2]=='e')
{
s[j-1]='\0';
s[j-2]='\0';
}
else if(s[j]=='\0' && s[j-1]=='y' && s[j-2]=='l')
{
s[j-1]='\0';
s[j-2]='\0';
}
else if(s[j]=='\0' && s[j-1]=='g' && s[j-2]=='n' && s[j-3]=='i')
s[j-3]='\0';
}
printf("%s\n",s);
}
return 0;
}
|
57 | 28207 |
int main()
{
int n,k,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char w[50];
scanf("%s",w);
k=strlen(w);
if(w[k-1]=='g')
{
for(j=0;j<k-4;j++)
{
printf("%c",w[j]);
}
printf("%c\n",w[k-4]);
}
else
{
for(j=0;j<k-3;j++)
{
printf("%c",w[j]);
}
printf("%c\n",w[k-3]);
}
}
return 0;
}
|
57 | 28208 | void main()
{
int n,len,i,j;
char s[20],t[3];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s);
len=strlen(s);
t[0]=s[len-3];
t[1]=s[len-2];
t[2]=s[len-1];
if(t[0]=='i')
{
for(j=0;j<len-3;j++)
printf("%c",s[j]);
printf("\n");
}
else
{
for(j=0;j<len-2;j++)
printf("%c",s[j]);
printf("\n");
}
}
} |
57 | 28209 | void main()
{
char c[50][100];
int n,i,j,k,b;
int a[100];
scanf("%d",&n);
for(i=0,k=0;i<=n;i++,k++)
for(j=0;;j++)
{
scanf("%c",&c[i][j]);
if(c[i][j]=='\n')break;
a[k]=j+1;
}
for(i=1;i<n;i++)
{
b=a[i];
if(c[i][b-2]=='e'&&c[i][b-1]=='r'||c[i][b-2]=='l'&&c[i][b-1]=='y')
for(j=0;j<b-2;j++)printf("%c",c[i][j]);
if(c[i][b-3]=='i'&&c[i][b-2]=='n'&&c[i][b-1]=='g')
for(j=0;j<b-3;j++)printf("%c",c[i][j]);
printf("\n");
}
b=a[i];
if(c[i][b-2]=='e'&&c[i][b-1]=='r'||c[i][b-2]=='l'&&c[i][b-1]=='y')
for(j=0;j<b-2;j++)printf("%c",c[i][j]);
if(c[i][b-3]=='i'&&c[i][b-2]=='n'&&c[i][b-1]=='g')
for(j=0;j<b-3;j++)printf("%c",c[i][j]);
} |
57 | 28210 | int main()
{
int i,n;
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{char word[32],word1[30]="",c;
int t;
scanf("%s",word);
t=strlen(word);
c=word[t-1];
if(c=='g')
{strncpy(word1,word,t-3);
printf("%s\n",word1);
}
else
{strncpy(word1,word,t-2);
printf("%s\n",word1);}
}
return 0;
}
|
57 | 28211 | int main(int argc, char* argv[])
{
int n,p;
int i,j;
char a[50];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%s",a);
char*s=a;
p=strlen(a);
if(((*(s+p-2)=='e')&&(*(s+p-1)=='r'))||((*(s+p-2)=='l')&&(*(s+p-1)=='y')))
{
for (j=0;j<p-2;j++)
{
printf("%c",a[j]);
}
printf("\n");
}
else
{
for (j=0;j<p-3;j++)
{
printf("%c",a[j]);
}
printf("\n");
}
}
return 0;
} |
57 | 28212 |
int main()
{
int i, n, suffixLen;
char word[32], *p;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
// ?????????
scanf("%s", word);
// ????p????
for (p = word; *p; p++);
// ??????????????
switch (*(p-1))
{
case 'r': suffixLen = 2; break; // er
case 'y': suffixLen = 2; break; // ly
case 'g': suffixLen = 3; break; // ing
}
// ????????????0??????
*(p-suffixLen) = '\0';
// ???????????
printf("%s\n", word);
}
return 0;
} |
57 | 28213 | void main()
{
int n,i,j,k;
char a[50][20]={0};
scanf("%d",&n);
for(i=0;i<=n;i++)
gets(a[i]);
for(i=0;i<=n;i++)
{
j=strlen(a[i]);
if(a[i][j-3]=='i'&&a[i][j-2]=='n'&&a[i][j-1]=='g')
for(k=0;k<j-3;k++)
printf("%c",a[i][k]);
else if((a[i][j-2]=='e'&&a[i][j-1]=='r')||(a[i][j-2]=='l'&&a[i][j-1]=='y'))
for(k=0;k<j-2;k++)
printf("%c",a[i][k]);
else puts(a[i]);
printf("\n");
}
} |
57 | 28214 | void main()
{
int n,i=0,j=0,m;
char a[50][100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",&a[i]);
for(i=0;i<n;i++)
{
m=strlen(a[i]);
if(a[i][m-2]=='e'&&a[i][m-1]=='r')
a[i][m-2]=0;
else if(a[i][m-2]=='l'&&a[i][m-1]=='y')
a[i][m-2]=0;
else if(a[i][m-3]=='i'&&a[i][m-2]=='n'&&a[i][m-1]=='g')
a[i][m-3]=0;
printf("%s\n",a[i]);
}
} |
57 | 28215 | void main()
{
char a[30][30];
int n,i,m;
scanf("%d",&n);
for(i=0;i<n+1;i=i+1)
{
gets(a[i]);
m=strlen(a[i]);
if(a[i][m-2]=='e'&&a[i][m-1]=='r')
a[i][m-2]='\0';
else if(a[i][m-2]=='l'&&a[i][m-1]=='y')
a[i][m-2]='\0';
else if(a[i][m-3]=='i'&&a[i][m-2]=='n'&&a[i][m-1]=='g')
a[i][m-3]='\0';
printf("%s\n",a[i]);
}
} |
57 | 28216 | int main(){
char an[50][33];
int n,i,bn[50];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",an[i]);
for(i=0;i<n;i++)
bn[i]=strlen(an[i]);
for(i=0;i<n;i++){
if((an[i][bn[i]-2]=='e'&&an[i][bn[i]-1]=='r')||(an[i][bn[i]-2]=='l'&&an[i][bn[i]-1]=='y'))
an[i][bn[i]-2]='\0';
if(an[i][bn[i]-3]=='i'&&an[i][bn[i]-2]=='n'&&an[i][bn[i]-1]=='g')
an[i][bn[i]-3]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",an[i]);
return 0;
} |
57 | 28217 |
void main()
{
int n,i,a;
char word[20],*p;
scanf("%d",&n);
while(n>0)
{
scanf("%s",word);
a=strlen(word);
p=word+a-1;
if(*(p-1)=='e'&&*p=='r')
{
*(p-1)='\0';
printf("%s\n",word);
}
else if(*(p-1)=='l'&&*p=='y')
{
*(p-1)='\0';
printf("%s\n",word);
}
else if(*(p-2)=='i'&&*(p-1)=='n'&&*p=='g')
{
*(p-2)='\0';
printf("%s\n",word);
}
n--;
}
} |
57 | 28218 | void main()
{
int i,j,n,m;
char a[50][32],x[4],y[3],z[30];
x[3]='\0';
y[2]='\0';
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
}
for(i=0;i<n;i++)
{
m=strlen(a[i]);
for(j=0;j<3;j++)
x[j]=a[i][m-3+j];
for(j=0;j<2;j++)
y[j]=a[i][m-2+j];
if(strcmp(x,"ing")==0)
{
strncpy(z,a[i],m-3);
puts(z);
printf("\n");
}
else
{
if(strcmp(y,"er")==0||strcmp(y,"ly")==0)
{
strncpy(z,a[i],m-2);
puts(z);
printf("\n");
}
}
for(j=0;j<32;j++)
z[j]='\0';
}
} |
57 | 28219 | int main()
{
int n, i, j, len;
cin >> n;
char a[1000];
for(i = 1 ; i <= n ; i++)
{
cin >> a;
len = strlen(a);
j = 0;
do
{
if(a[j] == 'e' && a[j + 1] == 'r' && a[j + 2] == '\0')
{
a[j] = '\0';
a[j + 1] = '\0';
}
j++;
}while(j < len);
j = 0;
do
{
if(a[j] == 'l' && a[j + 1] == 'y' && a[j + 2] == '\0')
{
a[j] = '\0';
a[j + 1] = '\0';
}
j++;
}while(j < len);
j = 0;
do
{
if(a[j] == 'i' && a[j + 1] == 'n' && a[j + 2] == 'g' && a[j + 3] == '\0')
{
a[j] = '\0';
a[j + 1] = '\0';
a[j + 2] = '\0';
}
j++;
}while(j < len);
cout << a << endl;
}
return 0;
}
|
57 | 28220 | void main()
{
int n,i,j,k; char s[15];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",s);
k=strlen(s);
if(s[k-1]=='r')k=k-3;
if(s[k-1]=='y')k=k-3;
if(s[k-1]=='g')k=k-4;
for(j=0;j<=k;j++)
printf("%c",s[j]);
printf("\n");
}
} |
57 | 28221 | /*
* post.c
*
* Created on: 2010-1-5
* Author: Administrator
*/
int main(){
char a1[50],a2[50];
int n,i,j,len;
scanf("%d",&n);
for(i=1;i<=n;i++){
// gets(a1);
scanf("%s",a1);
len=strlen(a1);
if(a1[strlen(a1)-1]=='r'||a1[strlen(a1)-1]=='y'){
for(j=0;j<len-2;j++){
a2[j]=a1[j];
}
a2[j]=0;
printf("%s\n",a2);
}
else if(a1[strlen(a1)-1]=='g'){
for(j=0;j<len-3;j++){
a2[j]=a1[j];
}
a2[j]=0;
printf("%s\n",a2);
}
}
return 0;
}
|
57 | 28222 |
char word[100][33];
int main()
{
int n;
cin >> n;
for(int i=0;i<n;i++)
cin >> word[i];
for(int i=0;i<n;i++)
{
int len = strlen(word[i]);
if(len>2&&word[i][len-2]=='e'&&word[i][len-1]=='r')
{
word[i][len-2] = 0;
}
else if(len>2&&word[i][len-2]=='l'&&word[i][len-1]=='y')
{
word[i][len-2] = 0;
}
else if(len>3&&word[i][len-3]=='i'&&word[i][len-2]=='n'&&word[i][len-1]=='g')
{
word[i][len-3] = 0;
}
cout << word[i] << endl;
}
} |
57 | 28223 | int main()
{
int n,len;
char letter[200];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",letter);
len=strlen(letter);
if(letter[len-2]=='e'&&letter[len-1]=='r')
{
letter[len-2]='\0';
letter[len-1]='\0';
}
if(letter[len-2]=='l'&&letter[len-1]=='y')
{
letter[len-2]='\0';
letter[len-1]='\0';
}
if( letter[len-3]=='i'&&letter[len-2]=='n'&&letter[len-1]=='g')
{
letter[len-3]='\0';
letter[len-2]='\0';
letter[len-1]='\0';
}
printf("%s\n",letter);
for(int t=0;t<len;t++)
letter[t]=' ';
}
return 0;
} |
57 | 28224 | int main()
{
char a[51][33];
int i,n,j,s;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a[i]);
s=strlen(a[i]);
for(j=s-1;j>0;j--){
if(a[i][s-1]=='r'&&a[i][s-2]=='e')
a[i][j-1]='\0';
else if(a[i][j]=='y'&&a[i][j-1]=='l')
a[i][j-1]='\0';
else if(a[i][j]=='g'&&a[i][j-1]=='n'&&a[i][j-2]=='i')
a[i][j-2]='\0';
}
}
for(i=0;i<n;i++){
printf("%s\n",a[i]);
}
return 0;
} |
57 | 28225 | int main(){
int i,k,n;
int len;
char str[50][100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",str[i]);
}
for(i=0;i<n;i++){
len=strlen(str[i]);
for(k=0;k<len;k++){
if(str[i][len-1]=='g'){
str[i][len-3]='\0';
}
else{
str[i][len-2]='\0';
}
}
}
for(i=0;i<n;i++){
printf("%s\n",str[i]);
}
return 0;
} |
57 | 28226 | void main()
{
int n,i,t;
char a[10]={""};
scanf("%d",&n);
for(i=0;i<n;i++)
{
char b[10]={""};
scanf("%s",a);
t=strlen(a);
switch(a[t-1])
{
case'r':strncpy(b,a,t-2);break;
case'y':strncpy(b,a,t-2);break;
case'g':strncpy(b,a,t-3);break;
}
puts(b);
}
} |
57 | 28227 | int main()
{
int n,len;
char a[1000];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",a);
len=strlen(a);
if(a[len-1]=='r')
{
for(int j=0;j<len-2;j++)
printf("%c",a[j]);
}
printf("\n");
if(a[len-1]=='y')
{
for(int p=0;p<len-2;p++)
printf("%c",a[p]);
}
printf("\n");
if(a[len-1]=='g')
{
for(int q=0;q<len-3;q++)
printf("%c",a[q]);
}
printf("\n");
}
return 0;
} |
57 | 28228 | void main()
{
int n,i,len;
char str[50][15];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",str[i]);
for(i=0;i<n;i++)
{
len=strlen(str[i]);
if(str[i][len-1]=='g')
str[i][len-3]='\0';
else if(str[i][len-1]=='y'||str[i][len-1]=='r')
str[i][len-2]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",str[i]);
}
|
57 | 28229 | int main(int argc, char* argv[])
{
char s[100],t[100][100];int n,i,j,l[100];
scanf("%d",&n);
for(i=0;i<n+1;i++){gets(s);l[i]=strlen(s);
if(s[l[i]-1]=='r'){for(j=0;j<l[i]-2;j++)t[i][j]=s[j];l[i]=l[i]-2;}
else if(s[l[i]-1]=='y'){for(j=0;j<l[i]-2;j++)t[i][j]=s[j];l[i]=l[i]-2;}
else if(s[l[i]-1]=='g'){for(j=0;j<l[i]-3;j++)t[i][j]=s[j];l[i]=l[i]-3;}}
for(i=0;i<n+1;i++){for(j=0;j<l[i];j++)
{printf("%c",t[i][j]); }if(i!=0)printf("\n");}
return 0;
}
|
57 | 28230 | int main()
{
char a[60][50]={0};
int n, i, j, length[60]={0};
scanf("%d", &n);
getchar();
for(i=0;i<=n-1;i++)
{
for(j=0;j<50;j++)
{
scanf("%c", &a[i][j]);
if(a[i][j]=='\n')
{
a[i][j]=0;
length[i]=j-1;
break;
}
}
}
for(i=0;i<=n-1;i++)
{
if(a[i][length[i]]=='r' && a[i][length[i]-1]=='e')
{
for(j=0;j<=length[i]-2;j++)
printf("%c", a[i][j]);
printf("\n");
continue;
}
if(a[i][length[i]]=='y' && a[i][length[i]-1]=='l')
{
for(j=0;j<=length[i]-2;j++)
printf("%c", a[i][j]);
printf("\n");
continue;
}
if(a[i][length[i]]=='g' && a[i][length[i]-1]=='n' && a[i][length[i]-2]=='i')
{
for(j=0;j<=length[i]-3;j++)
printf("%c", a[i][j]);
printf("\n");
continue;
}
}
return 0;
}
|
57 | 28231 | int main()
{
char danci[2000][2000];
int n,i,len[2000],j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",danci[i]);
len[i]=strlen(danci[i]);}
for(i=0;i<n;i++){
if(danci[i][len[i]-1]!='g'){
danci[i][len[i]-2]='\0';}
else{
danci[i][len[i]-3]='\0';}}
for(i=0;i<n;i++){
printf("%s\n",danci[i]);}
return 0;
}
|
57 | 28232 | int main(){
char s1[35],s2[35];
int n,i,l;
scanf("%d",&n);
gets(s1);
while(n--){
gets(s1);
l=strlen(s1);
if(s1[l-1]=='r'){
for(i=0;i<l-2;i++){
s2[i]=s1[i];
if(i<l-3){
printf("%c",s2[i]);
}
else
printf("%c\n",s2[i]);
}
}
else if(s1[l-1]=='y'){
for(i=0;i<l-2;i++){
s2[i]=s1[i];
if(i<l-3){
printf("%c",s2[i]);
}
else
printf("%c\n",s2[i]);
}
}
else if(s1[l-1]=='g'){
for(i=0;i<l-3;i++){
s2[i]=s1[i];
if(i<l-4){
printf("%c",s2[i]);
}
else
printf("%c\n",s2[i]);
}
}
}
return 0;
} |
57 | 28233 | void main()
{int n,i,j,k,a[100];
char c[100][100];
char e;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s",c[i]);
for (i=0;i<n;i++)
a[i]=strlen(c[i]);
for(i=0;i<n;i++)
{ k=a[i];
if ((e=c[i][k-3])=='i')
{ for (j=0;j<k-3;j++)
printf("%c",c[i][j]);
printf("\n");
}
else
{ for (j=0;j<k-2;j++)
printf("%c",c[i][j]);
printf("\n");
}
}
} |
57 | 28234 | int main(int argc, char* argv[])
{
int i,n,j,l=0,a;
char temp[4];
char temp1[4];
scanf("%d",&n);
char s[100];
char result[100];
for(i=0;i<n;i++)
{
l=0;
scanf("%s",s);
a=strlen(s);
if (s[a-2]=='e'||s[a-2]=='l')
{
for(j=a-2;s[j]!='\0';j++)
{
temp[l]=s[j];
l++;
}
temp[l]='\0';
if (strcmp(temp,"er")==0)
{
for(j=0;j<a-2;j++)
{
result[j]=s[j];
}
result[j]='\0';
printf("%s\n",result);
}
if (strcmp(temp,"ly")==0)
{
for(j=0;j<a-2;j++)
{
result[j]=s[j];
}
result[j]='\0';
printf("%s\n",result);
}
}
if (s[a-3]=='i')
{
for(j=a-3;s[j]!='\0';j++)
{
temp1[l]=s[j];
l++;
}
temp1[l]='\0';
if (strcmp(temp1,"ing")==0)
{
for(j=0;j<a-3;j++)
{
result[j]=s[j];
}
result[j]='\0';
printf("%s\n",result);
}
}
}
return 0;
}
|
57 | 28235 | int main()
{
int n,i,tmp,j;
char word[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",word);
tmp=strlen(word);
if(word[tmp-2]=='e'||word[tmp-2]=='l'){
for(j=0;j<tmp-3;j++){
printf("%c",word[j]);
}
printf("%c\n",word[tmp-3]);
}
else{
for(j=0;j<tmp-4;j++){
printf("%c",word[j]);
}
printf("%c\n",word[tmp-4]);
}
}
return 0;
}
|
57 | 28236 |
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int i,j;
char s[30];
int len;
for(i=0;i<n;i++)
{
scanf("%s",s);
len=strlen(s);
if((s[len-1]=='r')&&(s[len-2]=='e'))
{
for(j=0;j<len-2;j++)
{printf("%c",s[j]);}
}
else if((s[len-1]=='y')&&(s[len-2]=='l'))
{
for(j=0;j<len-2;j++)
{
printf("%c",s[j]);}
}
else
{ for(j=0;j<len-3;j++)
{printf("%c",s[j]);}
}
printf("\n");
}
return 0;
}
|
57 | 28237 |
int main()
{
char input[100];
int n;
int len;
scanf("%d", &n);
// scanf("\n");
for(; n>0; n--){
scanf("%s", input);
len = strlen(input);
if ((input[len-2]=='e')&&(input[len-1]=='r'))
input[len-2] = 0;
if ((input[len-2]=='l')&&(input[len-1]=='y'))
input[len-2] = 0;
if ((input[len-3]=='i')&&(input[len-2]=='n')&&(input[len-1]=='g'))
input[len-3] = 0;
puts(input);
}
return 0;
} |
57 | 28238 | int main(){
int n,i,j,m;
char a[51];
scanf("%d",&n);
for(i=0;i<=n;i++){
gets(a);
m=strlen(a);
if(a[m-1]=='r'||a[m-1]=='y'){
a[m-2]=0;
puts(a);
}
if(a[m-1]=='g'){
a[m-3]=0;
puts(a);
}
}
return 0;
}
|
57 | 28239 | int main()
{ int change(char a[],int j);
int n,i,j=0,k;
char a[50][32];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",a[i]);
for(i=0;i<n;i++)
{ j=strlen(a[i]);
j=change(a[i],j);
for(k=0;k<j;k++)
printf("%c",a[i][k]);
printf("\n");
}
return 0;
}
int change(char a[],int j)
{if(a[j-1]=='r'&&a[j-2]=='e')
j=j-2;
if(a[j-1]=='y'&&a[j-2]=='l')
j=j-2;
if(a[j-1]=='g'&&a[j-2]=='n'&&a[j-3]=='i')
j=j-3;
return (j);
} |
57 | 28240 | void main()
{
char str[50][10];
int n,i,c;
scanf("%d",&n);
for(i=0,c=0;i<n;i++)
{
scanf("%s",str[i]);
c=strlen(str[i]);
if (str[i][c-1]=='r')
str[i][c-1]=str[i][c-2]='\0';
if (str[i][c-1]=='y')
str[i][c-1]=str[i][c-2]='\0';
if (str[i][c-1]=='g')
str[i][c-1]=str[i][c-2]=str[i][c-3]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",str[i]);
} |
57 | 28241 | main()
{
int n;
scanf("%d",&n);
char a[100];
char b[100];
for(int i=0;i<n;i++)
{
scanf("%s",a);
int m;
m=strlen(a);
if(a[m-2]=='l'||a[m-2]=='e')
{
for(int k=0;k<m-2;k++)
{
b[k]=a[k];
}
b[m-2]='\0';
}
if(a[m-3]=='i')
{
for(int k=0;k<m-3;k++)
{
b[k]=a[k];
}
b[m-3]='\0';
}
printf("%s\n",b);
}
}
|
57 | 28242 | void main()
{ int n,j=1,i,len;
char a[200],b[200]={""};
scanf("%d\n",&n);
while(j<=n)
{ gets(a); len=strlen(a);
if(a[len-1]=='r'||a[len-1]=='y')
for (i=0;i<=len-3;i++)printf("%c",a[i]);
else if(a[len-1]=='g')
for (i=0;i<=len-4;i++)printf("%c",a[i]); printf("\n"); j++; } } |
57 | 28243 | int main()
{
int n,i,j,m;
char cz[10000][32];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&cz[i]);
m=strlen(cz[i]);
if(cz[i][m-1]=='r'&&cz[i][m-2]=='e')
cz[i][m-2]=0;
if(cz[i][m-1]=='y'&&cz[i][m-2]=='l')
cz[i][m-2]=0;
while(m>=4)
{
if(cz[i][m-1]=='g'&&cz[i][m-2]=='n'&&cz[i][m-3]=='i')
cz[i][m-3]=0;
break;
}
}
for(j=0;j<n;j++)
{
printf("%s\n",cz[j]);
}
return 0;
} |
57 | 28244 |
int main()
{
int n;
cin >> n;
char vocab[36] = {0};
char suffix[3][6] = {"re", "yl" , "gni"};
for (int i = 0; i < n; i++)
{
memset(vocab,0,36);
cin >> vocab;
int k = strlen(vocab) - 1;
char c[10] = {0};
int p = 0;
if (k > 3)
{
for (int j = k; j > k - 3; j--)
{
c[p] = vocab[j];
p++;
}
if ((strcmp(suffix[2], c) == 0))
{
for (int y = k; y > k - 3; y--)
{
vocab[y] = '\0';
}
cout << vocab << endl;
continue;
}
memset(c,0,3);
p = 0;
for (int j = k; j > k - 2; j--)
{
c[p] = vocab[j];
p++;
}
if ((strcmp(c,suffix[0]) == 0) || strcmp(c,suffix[1]) == 0)
{
for (int y = k; y > k - 2; y--)
{
vocab[y] = '\0';
}
cout << vocab << endl;
}
}
}
return 0;
}
|
57 | 28245 | void main()
{
char a[50];
int n,i,j,k;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a);
k=strlen(a);
for(j=k-1;j>=0;j--)
{
if(a[k-1]=='r'||a[k-1]=='y')
{
a[k-1]='\0';a[k-2]='\0';
printf("%s\n",a);
}
if(a[k-1]=='g')
{a[k-1]='\0';
a[k-2]='\0';
a[k-3]='\0';
printf("%s\n",a);
}
}
}
} |
57 | 28246 | void main()
{
int n,i=1,j;
char str[51][32],t;
scanf("%d",&n);
while(i<=n)
{
scanf("%s",str[i]);
i++;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=32;j++)
{
if(str[i][j]=='e'&&str[i][j+1]=='r'&&str[i][j+2]=='\0')
str[i][j]='\0';
else if(str[i][j]=='l'&&str[i][j+1]=='y'&&str[i][j+2]=='\0')
str[i][j]='\0';
else if(str[i][j]=='i'&&str[i][j+1]=='n'&&str[i][j+2]=='g'&&str[i][j+3]=='\0')
str[i][j]='\0';
}
}
for(i=1;i<=n;i++)
{
printf("%s\n",str[i]);
}
}
|
57 | 28247 |
void main()
{ int n,i,l,k;
char a[50][20],b[2];
scanf("%d",&n);
for(i=0;i<=n;i++)
{ gets(a[i]);
l=strlen(a[i]);
b[0]=a[i][l-2];
b[1]=a[i][l-1];
k=strcmp(b,"ly");
if(k>0) a[i][l-3]='\0';
else a[i][l-2]='\0';}
for(i=1;i<=n;i++)
{ puts(a[i]);
}
} |
57 | 28248 | void main()
{
int n,i,j;
char a[50][50];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",a[i]);
for(i=0;i<n;i++)
{
if((a[i][strlen(a[i])-1]=='y')&&(a[i][strlen(a[i])-2]=='l'))
{
for(j=0;j<strlen(a[i])-2;j++)
printf("%c",a[i][j]);
}
if((a[i][strlen(a[i])-1]=='r')&&(a[i][strlen(a[i])-2]=='e'))
{
for(j=0;j<strlen(a[i])-2;j++)
printf("%c",a[i][j]);
}
if((a[i][strlen(a[i])-1]=='g')&&(a[i][strlen(a[i])-2]=='n')&&(a[i][strlen(a[i])-3]=='i'))
{
for(j=0;j<strlen(a[i])-3;j++)
printf("%c",a[i][j]);
}
printf("\n");
}
} |
57 | 28249 | int main(){
char dc[9999][33];
int n;
int i;
int sz[9999];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&dc[i]);
}
for(i=0;i<n;i++){
sz[i]=strlen(dc[i]);
}
for(i=0;i<n;i++){
if((dc[i][sz[i]-1]=='r')&&(dc[i][(sz[i]-2)]=='e')){
dc[i][(sz[i]-2)]='\0';
}else if(dc[i][sz[i]-1]=='y'&&dc[i][sz[i]-2]=='l'){
dc[i][sz[i]-2]='\0';
}else if(dc[i][sz[i]-1]=='g'&&dc[i][sz[i]-2]=='n'&&dc[i][sz[i]-3]=='i'){
dc[i][sz[i]-3]='\0';
}
printf("%s\n",dc[i]);
}
return 0;
}
|
57 | 28250 | void fy(char a[])
{
int i,j;
for(i=0;;i++)
{
if(a[i]=='\0')
break;
}
j=i;
if((a[i-2]=='l'&&a[i-1]=='y')||(a[i-2]=='e'&&a[i-1]=='r'))
j=i-2;
if(a[i-3]=='i'&&a[i-2]=='n'&&a[i-1]=='g')
j=i-3;
for(i=0;i<j;i++)
printf("%c",a[i]);
printf("\n");
}
void main()
{
int n,k;
char a[100];
scanf("%d",&n);
getchar();
for(k=0;k<n;k++)
{
gets(a);
fy(a);
}
} |
57 | 28251 | void houzhui()
{
int len;
char str[32];
gets(str);
len=strlen(str);
if((str[len-2]=='e'&&str[len-1]=='r')||(str[len-2]=='l'&&str[len-1]=='y'))
str[len-2]='\0';
if(str[len-3]=='i'&&str[len-2]=='n'&&str[len-1]=='g')
str[len-3]='\0';
puts(str);
}
main()
{
int a,i;
scanf("%d",&a);
getchar();
for(i=0;i<a;i++)
houzhui();
}
|
57 | 28252 | main()
{
char word[32];
int n,length;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",word);
length=strlen(word);
if(strcmp(word+length-2,"er")==0||strcmp(word+length-2,"ly")==0)
word[length-2]='\0';
else if(strcmp(word+length-3,"ing")==0)
word[length-3]='\0';
printf("%s\n",word);
}
} |
57 | 28253 | int main()
{
int n,i,j;
char a[]="er",b[]="ly",c[]="ing",d[]="\0";
struct
{
char s[30];
}p[60];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",p[i].s);
}
for(i=0;i<n;i++)
for(j=0;j<strlen(p[i].s);j++)
{
if(strcmp((p[i].s+j),a)==0)
strcpy((p[i].s+j),d);
else if(strcmp((p[i].s+j),b)==0)
strcpy((p[i].s+j),d);
else if(strcmp((p[i].s+j),c)==0)
strcpy((p[i].s+j),d);
}
for(i=0;i<n;i++)
printf("%s\n",p[i].s);
return 0;
} |
57 | 28254 |
void print_str(char* str, int len)
{
for(int i=0; i<len; i++) {
cout << str[i];
}
cout << endl;
}
int main()
{
int n, cur_i=0;
cin >> n;
while(cur_i < n) {
cur_i ++;
char str[300];
cin >> str;
int len=strlen(str);
if(str[len-2] == 'e' && str[len-1] == 'r') {
print_str(str, len-2);
} else if(str[len-2] == 'l' && str[len-1] == 'y') {
print_str(str, len-2);
} else if(str[len-3] == 'i' && str[len-2] == 'n' && str[len-1] == 'g') {
print_str(str, len-3);
} else {
print_str(str, len);
}
}
return 0;
} |
57 | 28255 | int main()
{
int n,l,i;
char sz[99][99];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",sz[i]);
for(i=0;i<n;i++){
l=strlen(sz[i]);
if(sz[i][l-1]=='r'||sz[i][l-1]=='y')
sz[i][l-2]='\0';
else if(sz[i][l-1]=='g')
sz[i][l-3]='\0';
}
for(i=0;i<n-1;i++)
printf("%s\n",sz[i]);
printf("%s",sz[n-1]);
return 0;
}
|
57 | 28256 | int main()
{
int n,i;
scanf("%d",&n);
char str[100];
for(i=0;i<n;i++)
{
scanf("%s",str);
int len=strlen(str);
if((str[len-1]=='r'&&str[len-2]=='e')||
(str[len-1]=='y'&&str[len-2]=='l'))
{str[len-1]='\0';
str[len-2]='\0';
}
else if(str[len-1]=='g'&&str[len-2]=='n'&&str[len-3]=='i')
{str[len-1]='\0';
str[len-2]='\0';
str[len-3]='\0';}
printf("%s\n",str);
}
return 0;
} |
57 | 28257 | int main(){
char zf[21];
int l,n,judge=0;
scanf("%d",&n);
for(int j=0;j<n;j++){
scanf("%s",zf);
l=strlen(zf);
if(zf[l-1]=='r'){
zf[l-2]='\0';
}
if(zf[l-1]=='y'){
zf[l-2]='\0';
}
if(zf[l-1]=='g'){
zf[l-3]='\0';
}
printf("%s\n",zf);
}
return 0;
} |
57 | 28258 | int main(int argc, char* argv[])
{
int n,i;
char s[100];
int m;
int j;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%s",s);
m=strlen (s);
if (s[m-1]=='r'&&s[m-2]=='e')
{
for (j=0;j<m-2;j++)
printf("%c",s[j]);printf ("\n");
}
else if (s[m-1]=='y'&&s[m-2]=='l')
{
for (j=0;j<m-2;j++)
printf("%c",s[j]);printf ("\n");
}
else if (s[m-1]=='g'&&s[m-2]=='n'&&s[m-3]=='i')
{
for (j=0;j<m-3;j++)
printf("%c",s[j]);printf ("\n");
}
else
printf ("%s\n",s);
}
return 0;
} |
57 | 28259 |
int main()
{
int n,i,l,j;
char s[20],str[20];
scanf("%d\n",&n);
for(i=0;i<n;i++){
gets(s);
l=strlen(s);
for(j=0;s[j];j++){
str[j]=s[l-j-1];}
if(str[0]=='r'||str[0]=='y')
{for(j=0;j<l-2;j++)
printf("%c",s[j]);}
if(str[0]=='g')
{for(j=0;j<l-3;j++)
printf("%c",s[j]);}
printf("\n");}
return 0;
}
|
57 | 28260 | int main(){
int n;
char s[33];
int c,i,j,t;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s);
c=strlen(s);
if((s[c-2]=='e'&&s[c-1]=='r')||(s[c-2]=='l'&&s[c-1]=='y')){
s[c-2]='\0';
}else{
s[c-3]='\0';
}
printf("%s\n",s);
}
return 0;
} |
57 | 28261 | void cancel(char a[])
{
int i,s;
s=strlen(a);
if(a[s-1]=='r'&&a[s-2]=='e')
{
for(i=0;i<s-2;i++)
{
printf("%c",a[i]);
}
}
else if(a[s-1]=='y'&&a[s-2]=='l')
{
for(i=0;i<s-2;i++)
{
printf("%c",a[i]);
}
}
else
for(i=0;i<s-3;i++)
{
printf("%c",a[i]);
}
printf("\n");
}
void main()
{
int n,i;
char a[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
cancel(a);
}
} |
57 | 28262 | int main(){
int n,a;
char s[50][50];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",s[i]);
a=strlen(s[i]);
if((s[i][a-1]=='r'&&s[i][a-2]=='e')||(s[i][a-1]=='y'&&s[i][a-2]=='l')){
s[i][a-2]='\0';
}else{
s[i][a-3]='\0';
}
puts(s[i]);
}
return 0;
} |
57 | 28263 |
int main()
{
int i, n, suffixLen;
char word[32], *p;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%s", word);
for (p = word; *p; p++);
switch (*(p-1))
{
case 'r': *(p-2) = '\0';; break;
case 'y': *(p-2) = '\0';; break;
case 'g': *(p-3) = '\0';; break;
}
printf("%s\n", word);
}
return 0;
} |
57 | 28264 | int main(){
int n;
char zfc[50][33];
scanf("%d",&n);
for(int z=0;z<n;z++){
scanf("%s",zfc[z]);
if(zfc[z][strlen(zfc[z])-1]=='g'){
zfc[z][strlen(zfc[z])-3]='\0';
}else{
zfc[z][strlen(zfc[z])-2]='\0';
}
}
for(int x=0;x<n;x++){
printf("%s\n",zfc[x]);
}
return 0;
}
|
57 | 28265 | main()
{
char str[20];
int n,i,a;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(str);
a=strlen(str);
if(str[a-2]=='e'&&str[a-1]=='r') str[a-2]='\0';
if(str[a-2]=='l'&&str[a-1]=='y') str[a-2]='\0';
if(str[a-3]=='i'&&str[a-2]=='n'&&str[a-1]=='g') str[a-3]='\0';
puts(str);
if(i<n-1) printf("\n");
}
}
|
57 | 28266 | int main(){
int n;
char N[100];
gets(N);
n=atoi(N);
int i;
for(i=0;i<n;i++){
char a[55][100];
gets(a[i]);
int l;
l=strlen(a[i]);
int j;
if(a[i][l-2]=='e'&&a[i][l-1]=='r'){
for(j=0;j<l-2;j++){
printf("%c",a[i][j]);
}
printf("\n");
}
if(a[i][l-2]=='l'&&a[i][l-1]=='y'){
for(j=0;j<l-2;j++){
printf("%c",a[i][j]);
}
printf("\n");
}
if(a[i][l-3]=='i'&&a[i][l-2]=='n'&&a[i][l-1]=='g'){
for(j=0;j<l-3;j++){
printf("%c",a[i][j]);
}
printf("\n");
}
if((a[i][l-2]!='e'||a[i][l-1]!='r')&&(a[i][l-2]!='l'||a[i][l-1]!='y')&&(a[i][l-3]!='i'||a[i][l-2]!='n'||a[i][l-1]!='g')){
for(j=0;j<l;j++){
printf("%c",a[i][j]);
}
printf("\n");
}
}
return 0;
} |
57 | 28267 | int main()
{
int n,i,j,a;
char s[50][15],b[2],c[3];
scanf("%d",&n);
getchar();
for(i=0;i<n;i++)gets(s[i]);
for(i=0;i<n;i++)
{
a=strlen(s[i]);
for(j=0;j<3;j++)c[j]=s[i][a-3+j];
if(s[i][a-2]=='l'&&s[i][a-1]=='y')s[i][a-2]='\0';
else if(s[i][a-2]=='e'&&s[i][a-1]=='r')s[i][a-2]='\0';
else if(strcmp(c,"ing")==0)s[i][a-3]='\0';
printf("%s\n",s[i]);
}
}
|
57 | 28268 | int main()
{
int i,n,len;
char dc[55][35];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",dc[i]);
len=strlen(dc[i]);
if(dc[i][len-1]-'r'==0&&dc[i][len-2]-'e'==0)
dc[i][len-2]='\0';
else if(dc[i][len-1]-'y'==0&&dc[i][len-2]-'l'==0)
dc[i][len-2]='\0';
else if(dc[i][len-1]-'g'==0&&dc[i][len-2]-'n'==0&&dc[i][len-3]-'i'==0)
dc[i][len-3]='\0';
printf("%s\n",dc[i]);
}
return 0;
}
|
57 | 28269 | int main()
{
int m;
scanf("%d", &m);
int i,len;
for(i=0;i<m;i++)
{
char s1[100];
scanf("%s", s1);
len=strlen(s1);
if((int)s1[len-1]==114)
{
s1[len-2]='\0';
printf("%s\n", s1);
}
else if((int)s1[len-1]==121)
{
s1[len-2]='\0';
printf("%s\n", s1);
}
else
{
s1[len-3]='\0';
printf("%s\n", s1);
}
}
return 0;
}
|
57 | 28270 | int main()
{
void sh(char c[32]);
int n,i;
char c[32];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c);
sh(c);
}
return 0;
}
void sh(char c[32])
{
int m,j;
m=strlen(c);
if(c[m-1]=='y')
{for(j=0;j<m-2;j++)
printf("%c",c[j]);
printf("\n");
}
else if(c[m-1]=='r')
{for(j=0;j<m-2;j++)
printf("%c",c[j]);
printf("\n");
}
else
{for(j=0;j<m-3;j++)
printf("%c",c[j]);
printf("\n");
}
} |
57 | 28271 | void main()
{
char words[50][10]={{0},{0}};
int i,n,l;
scanf("%d",&n);
for(i=0;i<n;i++)
// gets(words[i]);
scanf("%s",words[i]);
for(i=0;i<n;i++)
{
l=strlen(words[i]);
if(words[i][l-2]==101)
{
words[i][l-2]=0;
words[i][l-1]=0;
printf("%s\n",words[i]);
}
else if(words[i][l-2]==108)
{
words[i][l-2]=0;
words[i][l-1]=0;
printf("%s\n",words[i]);
}
else if(words[i][l-3]==105)
{
words[i][l-3]=0;
words[i][l-2]=0;
words[i][l-1]=0;
printf("%s\n",words[i]);
}
}
} |
57 | 28272 | int main()
{
char p[50];
int n,i=1;
int l;
scanf("%d",&n);
while(i<n+1)
{
scanf("%s",p);
l=strlen(p)-1;
if(p[l]=='y')
p[l]=p[l-1]='\0';
if(p[l]=='r')
p[l]=p[l-1]='\0';
if(p[l]=='g')
p[l]=p[l-1]=p[l-2]='\0';
printf("%s\n",p);
i++;
}
return 0;
}
|
57 | 28273 |
void main()
{int n;
char s[20];
int i;
int p;
char c[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s",&c[i]);
}
for(i=0;i<n;i++)
{
p=strlen(c[i]);
if(c[i][p-2]=='e' && c[i][p-1]=='r')
{
strncpy(s,c[i],p-2);
s[p-2]='\0';
printf("%s\n",s);
}
else if(c[i][p-2]=='l' && c[i][p-1]=='y')
{
strncpy(s,c[i],p-2);
s[p-2]='\0';
printf("%s\n",s);
}
else
{ strncpy(s,c[i],p-3);
s[p-3]='\0';
printf("%s\n",s);
}
}
} |
57 | 28274 | int main(){
int n,i,j,LEN;
scanf("%d",&n);
char zf[33],jg[33];
for(i=0;i<n;i++){
scanf("%s",zf);
LEN=strlen(zf);
for(j=0;j<LEN;j++){
if(j==LEN-3&&zf[j+2]=='g'){
zf[j]=0;
zf[j+1]=0;
zf[j+2]=0;
break;
}else if((j==LEN-2&&zf[j+1]=='y')||(j==LEN-2&&zf[j+1]=='r')){
zf[j]=0;
zf[j+1]=0;
break;
}
}
LEN=strlen(zf);
for(j=0;j<LEN;j++){
if(zf[j]!=0){
jg[j]=zf[j];
}
}
jg[j]='\0';
printf("%s\n",jg);
}
return 0;
}
|
57 | 28275 | void main()
{
char c[100][100];
int i,n,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s",c[i]);
for(i=1;i<=n;i++)
{
for(j=0;;j++)
{
if (c[i][j]=='\0')
{
k=j-1;
if(c[i][k]=='r')
{
for(j=0;j<k-1;j++)
printf("%c",c[i][j]);
}
if(c[i][k]=='y')
{
for(j=0;j<k-1;j++)
printf("%c",c[i][j]);
}
if(c[i][k]=='g')
{
for(j=0;j<k-2;j++)
printf("%c",c[i][j]);
}
printf("\n");
break;
}
}
}
} |
57 | 28276 | void main()
{
int n,i,j,d,k;
char a[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
}
for(i=0;i<n;i++)
{
j=strlen(a[i]);
if(a[i][j-1]=='g')
{
for(k=0;k<j-3;k++)
{
printf("%c",a[i][k]);
}
printf("\n");
}
else
{
for(k=0;k<j-2;k++)
{
printf("%c",a[i][k]);
}
printf("\n");
}
}
} |
57 | 28277 |
void main()
{
int n,a,b;
char words[50][30];
int len[50];
scanf("%d",&n);
for(a=0;a<n;a++)
{
scanf("%s",&words[a]);
}
for(a=0;a<n;a++)
{
len[a]=strlen(words[a]);
}
for(a=0;a<n;a++)
{
if(words[a][len[a]-2]=='e')
{
if(words[a][len[a]-1]=='r')
{
for(b=0;b<len[a]-2;b++)
{
printf("%c",words[a][b]);
}
printf("\n");
}
}
else if(words[a][len[a]-2]=='l')
{
if(words[a][len[a]-1]=='y')
{
for(b=0;b<len[a]-2;b++)
{
printf("%c",words[a][b]);
}
printf("\n");
}
}
else if(words[a][len[a]-3]=='i')
{
if(words[a][len[a]-2]=='n')
{
if(words[a][len[a]-1]=='g')
{
for(b=0;b<len[a]-3;b++)
{
printf("%c",words[a][b]);
}
printf("\n");
}
}
}
}
}
|
57 | 28278 | int main()
{
void str(char a[100]);
int n,i;
char b[100],c[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",b);
str(b);
printf("%s\n",b);
}
}
void str(char a[100])
{
int k,t;
k=strlen(a);
if(a[k-2]=='e'&&a[k-1]=='r')
a[k-2]='\0';
else if(a[k-2]=='l'&&a[k-1]=='y')
a[k-2]='\0';
else if(a[k-2]=='n'&&a[k-1]=='g'&&a[k-3]=='i')
a[k-3]='\0';
} |
57 | 28279 | int main(){
int n,i,j,len;
char a[33],b[33];
scanf("%d\n",&n);
for(i=0;i<n;i++){
len=0;
scanf("%s\n",a);
len=strlen(a);
if(a[len-1]=='r'){
for(j=0;j<len-2;j++){
b[j]=a[j];}
b[len-2]='\0';}
if(a[len-1]=='y'){
for(j=0;j<len-2;j++){
b[j]=a[j];}
b[len-2]='\0';}
if(a[len-1]=='g'){
for(j=0;j<len-3;j++){
b[j]=a[j];}
b[len-3]='\0';}
printf("%s\n",b);
}
return 0;
}
|
57 | 28280 | int main()
{
int i,l,n;
char s[200];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
char st[200]={'\0'};
gets(s);
l=strlen(s);
if((s[l-1]=='r')&&(s[l-2]=='e'))
strncpy(st,s,l-2);
else if((s[l-1]=='y')&&(s[l-2]=='l'))
strncpy(st,s,l-2);
else if((s[l-1]=='g')&&(s[l-2]=='n')&&(s[l-3]=='i'))\
strncpy(st,s,l-3);
puts(st);
}
return 0;
} |
57 | 28281 | void main()
{
int n,i,j,a[50];
char str[50][100];
scanf("%d",&n);
for(i=0;i<=n;i++)
gets(str[i]);//??????
for(i=0;i<=n;i++)
{
a[i]=strlen(str[i]);
if((str[i][a[i]-1]=='r'&& str[i][a[i]-2]=='e')||(str[i][a[i]-1]=='y' && str[i][a[i]-2]=='l'))
{
for(j=0;j<a[i]-2;j++)
printf("%c",str[i][j]);
printf("\n");
}
else if(str[i][a[i]-1]=='g'&&str[i][a[i]-2]=='n'&&str[i][a[i]-3]=='i')
{
for(j=0;j<a[i]-3;j++)
printf("%c",str[i][j]);
printf("\n");
}
else
puts(str[i]);
}
} |
57 | 28282 | int main()
{
char word[max];
int p,n,i;
void del(int x,char word[max]);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",word);
p=strlen(word)-1;
del(p,word);
printf("%s\n",word);
}
}
void del(int x,char word[max])
{
if(word[x]=='g')
word[x-2]=0;
else
word[x-1]=0;
} |
57 | 28283 | void main()
{
int n,i,j,len;
char words[50][15];
scanf("%d\n",&n);
for (i=0;i<=n-1;i++) gets(words[i]);
for (i=0;i<=n-1;i++)
{
len=strlen(words[i]);
if (words[i][len-1]=='r'&&words[i][len-2]=='e') len=len-2;
if (words[i][len-1]=='g'&&words[i][len-2]=='n'&&words[i][len-3]=='i') len=len-3;
if (words[i][len-1]=='y'&&words[i][len-2]=='l') len=len-2;
for (j=0;j<=len-1;j++) printf("%c",words[i][j]);
printf("\n");
}
}
|
57 | 28284 | main()
{
char s[100];
int i,j,k,x,n;
scanf("%d",&n);
for(x=0;x<n;x++)
{
scanf("%s",s);
k=strlen(s);
if(s[k-1]=='r'||s[k-1]=='y')
k=k-2;
else if(s[k-1]=='g')
k=k-3;
for(i=0;i<k;i++)
printf("%c",s[i]);
printf("\n");
}
} |
57 | 28285 | void main()
{
int n,i,j,a[100];
char str[100][50];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s\n",str[i]);
a[i]=strlen(str[i]);
}
for(i=0;i<n;i++)
{
if(str[i][a[i]-2]=='e'&&str[i][a[i]-1]=='r')
for(j=0;j<a[i]-2;j++)
printf("%c",str[i][j]);
printf("\n");
if(str[i][a[i]-2]=='l'&&str[i][a[i]-1]=='y')
{
for(j=0;j<a[i]-2;j++)
printf("%c",str[i][j]);
printf("\n");
}
if(str[i][a[i]-3]=='i'&&str[i][a[i]-2]=='n'&&str[i][a[i]-1]=='g')
{
for(j=0;j<a[i]-3;j++)
printf("%c",str[i][j]);
printf("\n");
}
}
}
|
57 | 28286 | int main()
{
char a[100];
int i,n,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
if(a[strlen(a)-1]=='r'&&a[strlen(a)-2]=='e'){a[strlen(a)-2]='\0';}
if(a[strlen(a)-1]=='g'&&a[strlen(a)-2]=='n'&&a[strlen(a)-3]=='i'){a[strlen(a)-3]='\0';}
if(a[strlen(a)-1]=='y'&&a[strlen(a)-2]=='l'){a[strlen(a)-2]='\0';}
printf("%s\n",a);
for(j=0;j<strlen(a);j++)
{
a[j]='\0';
}
}
return 0;
} |
57 | 28287 | int main(){
char str[MAX+1];
int n,i,j,len;
gets(str);
n=atoi(str);
for(i=0;i<n;i++){
gets(str);
len=strlen(str);
if((str[len-2]=='e')&&(str[len-1]=='r'))
str[len-2]=0;
else if((str[len-2]=='l')&&(str[len-1]=='y'))
str[len-2]=0;
else if((str[len-2]=='n')&&(str[len-1]=='g')&&(str[len-3]=='i'))
str[len-3]=0;
puts(str);
}
return 0;
}
|
57 | 28288 | int main(){
int n,i,j,len[100];
char danci[100][100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",danci[i]);
}
for(i=0;i<n;i++){
len[i]=strlen(danci[i]);
if(danci[i][len[i]-2]=='l'||danci[i][len[i]-2]=='e'){
danci[i][len[i]-2]='\0';
}
else if(danci[i][len[i]-3]=='i'){
danci[i][len[i]-3]='\0';
}
printf("%s\n",danci[i]);
}
return 0;
}
|
57 | 28289 | int main()
{
int n;
scanf("%d",&n);
char dc[50][30];
int i;
int sz[50];
for(i=0;i<n;i++)
{
scanf("%s",dc[i]);
sz[i]=strlen(dc[i]);
}
for(i=0;i<n;i++)
{
if(dc[i][sz[i]-1]=='g')
{
int j;
for(j=0;j<sz[i]-3;j++)
printf("%c",dc[i][j]);
}
else
{
int j;
for(j=0;j<sz[i]-2;j++)
printf("%c",dc[i][j]);
}
printf("\n");
}
return 0;
} |
57 | 28290 | int main(){
int n,i,cd[50];
char dc[50][32]={'0','0','0'};
scanf("%d",&n);
for(i=0;i<n+1;i++){
gets(dc[i]);
cd[i]=strlen(dc[i]);
}
for(i=0;i<n+1;i++){
if(dc[i][cd[i]-1]=='g')dc[i][cd[i]-3]=0;
if(dc[i][cd[i]-1]=='r')dc[i][cd[i]-2]=0;
if(dc[i][cd[i]-1]=='y')dc[i][cd[i]-2]=0;
}
for(i=0;i<n+1;i++)
printf("%s\n",dc[i]);
return 0;
}
|
57 | 28291 | char a[1000][256],b[1000][256];
int main(){
int len[1000],n=0,i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&a[i]);
len[i]=strlen(a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<len[i];j++){
if(a[i][len[i]-1]=='r'&&a[i][len[i]-2]=='e'){
a[i][len[i]-2]=0;
}
else if(a[i][len[i]-1]=='g'&&a[i][len[i]-2]=='n'&&a[i][len[i]-3]=='i'){
a[i][len[i]-3]=0;
}
else if(a[i][len[i]-1]=='y'&&a[i][len[i]-2]=='l'){
a[i][len[i]-2]=0;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",a[i]);
}
return 0;
} |
57 | 28292 | int main()
{
int n,i,j,k,sum[50],len[50];
char s[50][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&s[i]);
len[i]=strlen(s[i]);
}
for(i=0;i<n;i++)
{
if(s[i][len[i]-1]=='r'&&s[i][len[i]-2]=='e')
{
sum[i]=0;
}
if(s[i][len[i]-1]=='y'&&s[i][len[i]-2]=='l')
{
sum[i]=1;
}
if(s[i][len[i]-1]=='g'&&s[i][len[i]-2]=='n'&&s[i][len[i]-3]=='i')
{
sum[i]=2;
}
}
for(i=0;i<n;i++)
{
if(sum[i]==0||sum[i]==1)
{
for(k=0;k<=len[i]-4;k++)
printf("%c",s[i][k]);
printf("%c\n",s[i][len[i]-3]);
}
if(sum[i]==2)
{
for(k=0;k<=len[i]-5;k++)
printf("%c",s[i][k]);
printf("%c\n",s[i][len[i]-4]);
}
}
return 0;
}
|
57 | 28293 | int main()
{
char s[100];
int i , len , n ;
cin>>n;
for( i=1 ; i<=n ; i++ )
{
scanf("%s",s);
len=strlen(s);
if( s[len-1]=='r' && s[len-2]=='e' ){ s[len-2]='\0'; printf("%s\n",s); continue; }
if( s[len-1]=='y' && s[len-2]=='l' ){ s[len-2]='\0'; printf("%s\n",s); continue; }
if( s[len-1]=='g' && s[len-2]=='n' && s[len-3]=='i' ){ s[len-3]='\0'; printf("%s\n",s); continue; }
printf("%s\n",s);
}
} |
57 | 28294 | int main(){
int m,i,j,p;
scanf("%d",&m);
char sz[50][20]={'\0'};
int len[50];
for(i=0;i<m;i++){
scanf("%s",sz[i]);
len[i]=strlen(sz[i]);
}
for(i=0;i<m;i++){
p=len[i]-2;
if((sz[i][p]=='e')&&(sz[i][p+1]=='r')){
sz[i][p]='\0';
sz[i][p+1]='\0';
continue;
}
else if((sz[i][p]=='l')&&(sz[i][p+1]=='y')){
sz[i][p]='\0';
sz[i][p+1]='\0';
continue;
}
else if((sz[i][p-1]=='i')&&(sz[i][p]=='n')&&(sz[i][p+1]=='g')){
sz[i][p-1]='\0';
sz[i][p]='\0';
sz[i][p+1]='\0';
}
}
for(i=0;i<m;i++){
puts(sz[i]);
}
return 0;
}
|
57 | 28295 |
main()
{
int n,i,len;
char str[50][100],*p;
scanf("%d",&n);
for(i=0;i<=n;i++)
{
gets(str[i]);
}
for(i=1;i<=n;i++)
{
len=strlen(str[i]);
p=str[i]+len-1;
if(*p=='r') str[i][len-2]='\0';
else if(*p=='y') str[i][len-2]='\0';
else if(*p=='g') str[i][len-3]='\0';
puts(str[i]);
}
} |
57 | 28296 | int main()
{
int n,i,j,l;
char s[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
memset(s,0,sizeof(s));
scanf("%s",s);
l=strlen(s);
if(s[l-1]=='r') {for(j=0;j<l-2;j++) printf("%c",s[j]);printf("\n");}
if(s[l-1]=='y') {for(j=0;j<l-2;j++) printf("%c",s[j]);printf("\n");}
if(s[l-1]=='g') {for(j=0;j<l-3;j++) printf("%c",s[j]);printf("\n");}
}
}
|
57 | 28297 | int main(){
char s[33],o[51][33]={0};
int n,i,j;
int len[51];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&s);
len[i]=strlen(s);
if(s[len[i]-3]=='i'){
for(j=0;j<len[i]-3;j++){
o[i][j]=s[j];
}
}
else{
for(j=0;j<len[i]-2;j++){
o[i][j]=s[j];
}
}
}
for(i=0;i<n;i++){
printf("%s\n",o[i]);
}
return 0;
}
|
57 | 28298 | main()
{
char a[100];
int n,i;
scanf("%d",&n);
for(;n>0;n--)
{
scanf("%s",a);
for(i=0;a[i]!='\0';i++)
{
if(a[i]=='e'&&a[i+1]=='r'&&a[i+2]=='\0'||a[i]=='l'&&a[i+1]=='y'&&a[i+2]=='\0'||a[i]=='i'&&a[i+1]=='n'&&a[i+2]=='g'&&a[i+3]=='\0')
break;
else
printf("%c",a[i]);
}
printf("\n");
}
}
|
57 | 28299 | void main()
{
char a[51]={""},word[51][51]={""};
int n=0,i=0,k=0,m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
k=strlen(a);
if(a[k-1]==103)
{
a[k-2]='\0';
a[k-1]='\0';
a[k-3]='\0';
}
else
{
a[k-2]='\0';
a[k-1]='\0';
}
strcpy(word[i],a);
}
for(m=0;m<n;m++)
printf("%s\n",word[m]);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.