রবিবার, ২৮ আগস্ট, ২০১৬

UVA 483 - Word Scramble

///...................SUBHASHIS MOLLICK....................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///.....................SESSION-(14-15)....................///
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<ctype.h>
#include<bits/stdc++.h>
using namespace std;
main()
{
char s[100000]={0},s1[10000]={0};
while(gets(s))
{
long int l,i,j,k,count=0,k2=0;
l=strlen(s);
//printf("%ld",l);
s[l]=' ';
for(i=0;i<l;i++)
{

//printf("%c",s[i]);
if(count==0)
{

          k=0;
          long int k1;
for(j=0;j<=l;j++)
{
s1[k]=s[j];
//if(count==0)
if(s1[k]==' ')
{
if(k2>=1)
printf(" ");
for(k1=k-1;k1>=0;k1--)
{
printf("%c",s1[k1]);
k=-1;
}
k2++;
}
k++;
}

count++;

printf("\n");

      }
  }
    }
}


কোন মন্তব্য নেই:

একটি মন্তব্য পোস্ট করুন

Factorization with prime Sieve

vector <int> prime; char sieve[1000009]; int N=1000009; void primeSieve ( ) { sieve[0] = sieve[1] = 1; prime.push_back(2); ...