Click here to view the problem
/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
#define new_line pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647
int main()
{
int sum,i,k,len ,indx;
char str[1000] ,ch;
while(gets(str))
{
len = strlen(str) ;
indx = len-4 ;
k=1 ;
sum =0;
if(str[0]=='|')
{
for(i=0 ; i<len ; i++)
{
if(str[i]=='o')
{
sum = sum + pow(2,indx) ;
k =0 ;
}
if(str[i]=='o'|| str[i]==' ')
indx-- ;
}
}
ch = sum+'\0' ;
if(k==0)
cout<<ch;
}
return 0;
}
/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
#define new_line pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647
int main()
{
int sum,i,k,len ,indx;
char str[1000] ,ch;
while(gets(str))
{
len = strlen(str) ;
indx = len-4 ;
k=1 ;
sum =0;
if(str[0]=='|')
{
for(i=0 ; i<len ; i++)
{
if(str[i]=='o')
{
sum = sum + pow(2,indx) ;
k =0 ;
}
if(str[i]=='o'|| str[i]==' ')
indx-- ;
}
}
ch = sum+'\0' ;
if(k==0)
cout<<ch;
}
return 0;
}
No comments:
Post a Comment