-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTYPING.cpp
More file actions
89 lines (82 loc) · 1.67 KB
/
TYPING.cpp
File metadata and controls
89 lines (82 loc) · 1.67 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
/// TYPING
// https://www.codechef.com/SNCK1A19/problems/TYPING
#include<bits/stdc++.h>
using namespace std ;
#define Fors(n) for(int i=1;i<=n;i++)
#define For(n) for(i=0;i<n;i++)
#define ll int
#define vint(s) vector<int> s
#define pb(x) push_back(x)
#define mpair(x,y) make_pair(x,y)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll x=0,y=0,n=0,i=0;
int main(){
IOS;
int t=0;
cin>>t;
while(t--){
cin>>n;
string s[n];
int a[n];
memset(a,0,sizeof(a));
for(i=0;i<n;i++){
cin>>s[i];
int sum=0;
bool flag=false;
for(x=0;x<s[i].length();x++){
if(x==0){
sum=+2;
if(s[i][x]=='j' || s[i][x]=='k')flag=1;
}
else{
if(s[i][x]=='d' && flag==0){
sum+=4;
flag=0;
}
if(s[i][x]=='d' && flag==1){
sum+=2;
flag=0;
}
if(s[i][x]=='f' && flag==0){
sum+=4;
flag=0;
}
if(s[i][x]=='f' && flag==1){
sum+=2;
flag=0;
}
if(s[i][x]=='j' && flag==1){
sum+=4;
flag=1;
}
if(s[i][x]=='j' && flag==0){
sum+=2;
flag=1;
}
if(s[i][x]=='k' && flag==1){
sum+=4;
flag=1;
}
if(s[i][x]=='k' && flag==0){
sum+=2;
flag=1;
}
}
}
a[i]=sum;
for(int j=0 ; j<i ;j++){
if(s[i]==s[j]){
a[i] = a[j]/2 ;
break;
}
}
}
For(n){
//cout<<a[i]<<" ";
y+=a[i];
}
cout<<y<<endl;
y=0;
}
return 0;
}