UVA 11192 Group Reverse Solution
Solve in C:
//AH Tonmoy
//Department of CSE ,Islamic University
#include<stdio.h>
#include<string.h>
int main()
{
char s[1000];
int n,d,i,j,l,a;
while(scanf("%d",&n)==1&&n!=0)
{
scanf("%s",s);
l=strlen(s);
d=l/n;
for(i=1; i<=n; i++)
{
a=i*d;
for(j=a-1; j>=a-d; j--)
{
printf("%c",s[j]);
}
}
printf("\n");
d=0,n=0;
}
}
//AH Tonmoy
//Department of CSE ,Islamic University
#include<stdio.h>
#include<string.h>
int main()
{
char s[1000];
int n,d,i,j,l,a;
while(scanf("%d",&n)==1&&n!=0)
{
scanf("%s",s);
l=strlen(s);
d=l/n;
for(i=1; i<=n; i++)
{
a=i*d;
for(j=a-1; j>=a-d; j--)
{
printf("%c",s[j]);
}
}
printf("\n");
d=0,n=0;
}
}
No comments