text
stringlengths 49
983k
|
|---|
#include<iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int q;
cin >> q;
while (q--) {
int n, res = 0;
cin >> n;
while (n >= 10) {
int mx = 0;
for (int b = 10; b < n; b *= 10) {
if (mx < (n / b) * (n % b)) {
mx = (n / b) * (n % b);
}
}
n = mx;
++res;
}
cout << res << endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
#define INF 999999999
int main(){
int i, j, q, n;
int ans;
cin >> q;
for(i=0;i<q;i++){
ans = 0;
cin >> n;
while(n>=10){
ans++;
int mo=0;
//cout << n << endl;
for(j=1;n/pow(10,j)>0;j++){
if(mo<(n/(int)pow(10,j))*(n%(int)(pow(10,j)))){
mo = (n/(int)pow(10,j))*(n%(int)(pow(10,j)));
}
}
n = mo;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Q,N,s,m,i;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> Q;
for (;Q--;){
cin >> N;
for(i=0;N>10;++i){
s=10,m=0;
while(s<N){
m=max(m,(N/s)*(N%s));
s*=10;
}
N=m;
}
cout << i << '\n';
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int Q;
cin>>Q;
string now;
for(int i=0;i<Q;i++){
cin>>now;
int ans=0;
for(;;){
if(now.size()==1) break;
int ma=0;
for(int j=1;j<now.size();j++){
ma=max(ma,stoi(now.substr(0,j))*stoi(now.substr(j,now.size()-j)));
}
now=to_string(ma);
ans++;
}
cout<<ans<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int multi_max(int n)
{
int k = 10;
int maxi=0;
while(n/k > 0){
maxi = max(maxi, (n/k)*(n-n/k*k));
k *= 10;
}
return maxi;
}
int main(void)
{
int q;
cin >> q;
while(q--){
int n, ans=0;
cin >> n;
while(n >= 10){
n = multi_max(n);
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int q, n;
cin >> q;
for(int i = 0; i < q; i++){
cin >> n;
int cnt = 0;
while(n >= 10){
int d = 10;
int ma = 0;
while(int s = n / d){
ma = max(s * (n - s * d), ma);
d *= 10;
}
n = ma;
cnt++;
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
std::string next(std::string n) {
std::string str1;
std::string str2;
long max = -1;
for(int i = 1; i < n.size(); ++i) {
str1 = str2 = "";
for(int j = 0; j < i; ++j) {
str1 += n[j];
}
for(int j = i; j < n.size(); ++j) {
str2 += n[j];
}
max = std::max(max, stol(str1) * stol(str2));
}
return std::to_string(max);
}
int main() {
int Q;
std::cin >> Q;
for(int i = 0; i < Q; ++i) {
std::string N;
std::cin >> N;
int count = 0;
for(;;) {
if( N.size() == 1 ) {
std::cout << count << std::endl;
break;
}
std::string t = next(N);
N = t;
count += 1;
}
}
return 0;
}
|
#include <iostream>
#include <math.h>
using namespace std;
int DivideMul(int N,int a){
int L=N%(int)pow(10,a);
int U=(N-L)/pow(10,a);
return L*U;
}
int Next(int N){
int n=0;
double s=log(N)/log(10);
for(int i=1;i<s;++i){
n=max(n,DivideMul(N,i));
}
return n;
}
int main(){
int T;
cin >> T;
for(int i=0; i<T; ++i){
int N;
cin >> N;
if(N==0){
cout << 0 << endl;;
break;
}
int j=0;
for( j=0; N>9 ; ++j){
N=Next(N);
//cout <<N<<endl;
}
cout << j << endl;;
}
}
|
// 2016-12-12
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int q, n;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n;
int c = 0;
while (n >= 10) {
int m = 0;
for (int j = 10; j <= n; j *= 10) {
m = max(m, (n / j) * (n % j));
}
n = m;
c++;
}
cout << c << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int q;
cin >> q;
while(q--){
string s;
cin >> s;
int ans = 0;
while(s.size() != 1){
int maxi = 0;
REP(i, 1, s.size()){
int a = stoi(s.substr(0, i));
int b = stoi(s.substr(i));
maxi = max(maxi, a * b);
}
s = to_string(maxi);
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
for(int i=0;i<n;i++)
{
int x,count(0);
cin >> x;
while(x>9)
{
int a,b,y(1),max(0);
for(int i=1;i<7;i++)
{
a = x/y;
b = x%y;
if(a*b > max){ max=a*b; }
y*=10;
}
x=max;
count++;
}
cout << count << endl;
}
return 0 ;
}
|
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
int q;
cin >> q;
REP(i,q){
int n;
cin >> n;
int answer=0;
while(n>=10){
++answer;
int tmp=0;
for(int d=10;d<n;d*=10)
tmp=max(tmp,(n/d)*(n%d));
n=tmp;
}
cout << answer << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;
int main(){
int Q;
while(cin>>Q){
int N;
REP(k,0,Q){
int ans=0;
set<int> s;
cin>>N;
while(N/10>0){
int mx=0;
int waru=10;
s.insert(N);
for(int i=0;N/waru>0;i++){
int l=N/waru;
int r=N%waru;
mx=max(mx,l*r);
waru*=10;
}
N=mx;
ans++;
if(s.find(N)!=s.end()){
ans=-1;
break;
}
}
p(ans);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
int main(){
int q;
cin >> q;
int n;
int x;
int count;
for(int i=0;i<q;i++){
cin >> n;
count=0;
while(n>=10){
x=0;
for(int i=10;i<=n;i*=10){
x=max(x,(n/i)*(n%i));
}
n=x;
count++;
}
cout << count << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> ans;
int main(){
int q;
cin >> q;
for(int i = 0;i < q;i++){
int n;
cin >> n;
int tans = 0;
vector<int> used;
while(n >= 10){
int div = 10;
int next = 0;
for(int i = 0;i < 6;i++){
int l = n/div;
int r = n%div;
if(l != 0){
next = max(next,l*r);
}
div*=10;
}
if(find(used.begin(),used.end(),next) != used.end()){
tans = -1;
break;
}
used.push_back(next);
n = next;
tans++;
}
ans.push_back(tans);
}
for(int i = 0;i < ans.size();i++) cout << ans[i] << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int f(int r,int t,int r2){
if(r<10){
return t;
}else if(t>r2){
return -1;
}else{
priority_queue<int> a;
int keta=10;
while(r>keta){
int b=r/keta,c=r%keta;
a.push(b*c);
keta*=10;
}
return f(a.top(),t+1,r2);
}
}
int main(void){
int n;
cin>>n;
for(int k=0;k<n;k++){
int r;
cin>>r;
cout<<f(r,0,r)<<endl;
}
return 0;
}
|
// 2424_Kakezan.cpp
// 途中
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int cnt){
if(n<10) return cnt;
int m=-1;
for(int i=10;n/i>0;i*=10)
m=max(m, (n/i)*(n%i));
cnt++;
return solve(m,cnt);
}
int main() {
int q,n;
cin>>q;
for(int i=0;i<q;++i) {
cin>>n;
cout<<solve(n,0)<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int q,r;
int n;
int nmax;
int b;
void calc(){
if(n/10==0)return;
r++;
int keta=0;
b=0;
for (int i = n; i > 0; i/=10){
keta++;
}
for(int i=0; i<keta; i++){
int x,y;
int k=10;
for (int j = 0; j < i; ++j){
k*=10;
}
x=n/k;
y=n%k;
if(!b){
nmax=x*y;
b=1;
}
else{
if(nmax<x*y){
nmax=x*y;
}
}
}
n=nmax;
//cout<<"n:"<<n<<endl;
calc();
}
int main(){
cin>>q;
for (int i = 0; i < q; ++i){
cin>>n;
r=0;
calc();
cout<<r<<endl;
}
}
|
#include<iostream>
#include<cmath>
using namespace std;
long Q, N;
long multip(long n, long keta){
long maxn = 0;
long left ,right;
for(long i=keta-1;i>=1;i--){
left = n / pow(10,i);
right = n - left*pow(10,i);
long mul = left * right;
if(mul > maxn) maxn = mul;
}
return maxn;
}
int getketa(int n){
int i=0;
int keta = 1;
for(i=1;keta>0;i++){
keta = n / pow(10,i);
}
return i-1;
}
int main(){
cin >> Q;
for(long i=0;i<Q;i++){
cin >> N;
long keta;
long count = 0;
while(keta = getketa(N),keta != 1 && count < 10000){
N = multip(N, keta);
//cout << N << endl;
count ++;
}
cout << count << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;int n,q,X,A,i,j,s,t;int main(){cin>>n;for(i=0;i<n;i++){s=0;cin>>q;X=q;while(X>9){A=0;for(j=1;j<10;j++){t=pow(10.0,j);if(q/t<1){break;}A=max((X/t)*(X%t),A);}s++;if(s>=1000){s=-1;break;}X=A;}cout<<s<<endl;}}
|
//???????????????????????????????????????????°??????????????????¨?????????????????§, ???????????§???????????????
#include <iostream>
#include <algorithm>
using namespace std;
int power10[8];
int next(int n) {
int ret = 0;
for (int i = 1; i < 7; i++) {
int a = n / power10[i];
int b = n % power10[i];
ret = max(ret, a * b);
}
return ret;
}
int main() {
int q, n;
power10[0] = 1;
for (int i = 1; i < 8; i++) power10[i] = power10[i - 1] * 10;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n;
for (int j = 0; ; j++) {
if (n < 10) {
cout << j << endl;
break;
}
n = next(n);
}
}
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int q,n;
bool f[1111111];
int main(void){
cin >> q;
for(int k = 0; k < q; k++){
int c = 0;
memset(f,false,sizeof(f));
cin >> n;
while(n > 9){
if(f[n]){
c = -1;
break;
}
f[n] = true;
c++;
int best = 0;
for(int i = 10; i <= 1000000; i*=10){
best = max(best,(n/i)*(n%i));
}
n = best;
}
cout << c << endl;
}
}
|
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
typedef long long ll;
int calc(int n) {
int cnt = 0;
while(n >= 10) {
ll next = -1, r = 10;
while (r < n) {
next = max(next, ((ll)n/r) * (n%r));
r *= 10;
}
n = next;
cnt++;
}
return cnt;
}
int main() {
int q,n;
cin>>q;
for (int i=0; i<q; ++i) {
cin>>n;
cout<<calc(n)<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
int q;
cin>>q;
REP(i,q){
string str;
cin>>str;
int n=0;
while(1){
if(str.size() == 1) break;
int mx = 0;
REP(j,str.size()-1){
int fwd=stoi(str.substr(0,j+1));
int bwd=stoi(str.substr(j+1));
mx = max(mx, fwd*bwd);
}
str = to_string(mx);
++n;
}
cout<<n<<endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int fnc(int n){
if(n<10)return 0;
int ans=0;
for(int i=1;(int)pow(10,i)<n;i++){
int pre=n/(int)pow(10,i),la=n%((int)pow(10,i));
ans=max(ans,pre*la);
}
return fnc(ans)+1;
}
int main(){
int q;
cin>>q;
int num;
rep(p,q){
cin>>num;
cout<<fnc(num)<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int Pow(int t){
int ret = 1;
for(int i = 0; i < t; i++) ret *= 10;
return ret;
}
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
int r;
cin >> r;
int cnt = 0;
while(true){
if(r < 10) break;
int x = 10;
int rank;
for(int i = 2;;i++){
x *= 10;
if(x > r){
rank = i;
break;
}
}
int nr = 0;
for(int i = 1; i <= rank-1; i++){
int y = (r%Pow(i))*(r/Pow(i));
if(y > nr) nr = y;
}
r = nr;
cnt++;
}
cout << cnt << endl;
}
}
|
#include <iostream>
#include <set>
#define llint long long
using namespace std;
llint Q;
llint n;
set<llint> S;
llint get(llint x)
{
llint keta = 0;
for(llint t = x; t; t/=10) keta++;
llint mul = 10, ret = 0;
for(int i = 0; i < keta-1; i++){
ret = max(ret, x/mul * (x%mul));
mul *= 10;
}
return ret;
}
int main(void)
{
cin >> Q;
for(int i = 0; i < Q; i++){
cin >> n;
llint ans = 0;
S.clear();
S.insert(n);
while(1){
if(n < 10){
cout << ans << endl;
break;
}
n = get(n);
ans++;
if(S.count(n)){
cout << -1 << endl;
break;
}
S.insert(n);
}
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
int main ()
{
int q;
cin >> q;
while (q--) {
int n, res = 0;
cin >> n;
set<int> t;
while (n / 10) {
t.insert(n);
res++;
int MAX = 0;
int j = 1, k = 0;
while (n) {
k += j * (n % 10);
n /= 10;
MAX = max(MAX, k * n);
j *= 10;
}
n = MAX;
if (t.find(n) != t.end()) {
res = -1;
break;
}
}
cout << res << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
string StringChanger(int);
string StringChanger(int n){
stringstream ss;
ss << n;
return ss.str();
}
int main(){
int q,maxy;
string str;
cin >> q;
for(int i=0;i<q;i++){
cin >> str;
int cnt = 0;
while(str.size()!=1){
int maxy = 0;
for(int j=0,l=str.size();j<l;j++){
string sub1 = str.substr(0,j);
string sub2 = str.substr(j);
maxy = max(maxy,atoi(sub1.c_str())*atoi(sub2.c_str()));
}
str = StringChanger(maxy);
cnt++;
}
cout << cnt << endl;
}
}
|
#include<stdio.h>
#include<math.h>
int ketasuu(int n){
for(int i=6;i>=0;i--){
if((int)n/pow(10,i)>=1) return i+1;
}
return -1;
}
int divide(int n,int m){
return (int)(n/pow(10,m+1))*(int)(n%(int)pow(10,m+1));
}
int main(){
int q;
scanf("%d",&q);
for(int i=0;i<q;i++){
int count=0,newn,n;
scanf("%d",&n);
while(ketasuu(n)>=2){
newn=0;
int l=ketasuu(n);
for(int j=0;j<l-1;j++){
if(newn<divide(n,j)) newn=divide(n,j);
}
n=newn;
count++;
}
printf("%d\n",count);
}
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#define MAX(a,b) a>b?a:b
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
int main(){
int Q;
int N;
scanf("%d",&Q);
rep(i,Q){
int count = 0;
scanf("%d",&N);
while(N>=10){
int temp = N;
int digit = 0;
while(temp>0){
digit++;
temp/=10;
}
count++;
temp = 10;
int max = 0;
rep(i,digit-1){
max = MAX(max,(N/temp)*(N%temp));
temp*=10;
}
N = max;
}
printf("%d\n",count);
}
return 0;
}
|
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
int Q;
cin >> Q;
while(Q--){
ll n;
cin >> n;
set<ll> passed;
int step = 0;
while(n >= 10){
ll next = 0, lower = 0, dig = 1;
while(n > 0){
lower = lower + (n % 10) * dig;
n /= 10;
next = max(next, lower * n);
dig *= 10;
}
++step;
if(passed.find(next) != passed.end()){
step = -1;
break;
}
passed.insert(next);
n = next;
}
cout << step << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int q,n,i,j,max,can;
cin>>q;
for(i=0;i<q;i++){
cin>>n;
j=0;
for(;n>9;){
max=0;
for(int d=10;n%d!=n;){
can=(n%d)*(int)((n-(n%d))/d);
if(can>max) max=can;
d*=10;
}
j++; n=max;
}
cout<<j<<endl;
}
}
|
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int step(int n){
int digit=1,tmp;
tmp=n;
int res=0;
while((tmp=tmp / 10)>0)digit++;
for(int i=1;i<digit;i++){
int first,latter;
first=n/(int)pow(10,i);
latter=n%(int)pow(10,i);
res=max(res,first*latter);
}
return res;
}
int main(){
int q,n;
cin>>q;
for(int i=0;i<q;i++){
int ans=0,prev=n;
cin>>n;
while(n>9){
prev=n;
n=step(n);
if(n==prev){
cout << -1 << endl;
break;
}
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <sstream>
#include <set>
using namespace std;
int main() {
int q;
cin >> q;
while(q--) {
string s;
cin >> s;
int size = s.size();
int res, ans = 0;
bool f = true;
set<int> set1;
set1.insert(atoi(s.c_str()));
while(size > 1) {
res = 0;
for(int i=0; i<size-1; i++) {
string a = s.substr(0, i+1);
string b = s.substr(i+1);
res = max(atoi(a.c_str())*atoi(b.c_str()), res);
}
if(set1.count(res)) { f = false; break; }
set1.insert(res);
stringstream ss; ss << res; s = ss.str();
size = s.size();
ans ++;
}
cout << ( f ? ans : -1 ) << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
bool used[2000000];
int f(int n){
fill((bool*)used, (bool*)used+2000000, 0);
used[n]=1;
int cnt=0;
while(n>=10){
string s=to_string(n);
int nex=0;
for(int i=1; i<s.size(); i++){
nex=max<int>(nex, stoll(s.substr(0, i))*stoll(s.substr(i)));
}
if(used[nex]) return -1;
used[nex]=1;
n=nex; cnt++;
}
return cnt;
}
signed main(){
int Q;
cin>> Q;
for(int i=0; i<Q; i++){
int N;
cin>> N;
cout<< f(N)<< endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <set>
using namespace std;
template<typename T> inline void chmax(T& t, T f){if(t < f)t = f;}
int main(){
int Q;
cin >> Q;
while(Q--){
int N, R = 0;
cin >> N;
set<int> u{N};
for(; 10 <= N; ++R){
string s = to_string(N);
N = 0;
for(int i=1; i<(int)s.size(); ++i){
chmax(N, stoi(s.substr(0, i)) * stoi(s.substr(i)));
}
if(!u.insert(N).second)N = -1;
}
cout << (N < 0? N: R) << '\n';
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int solve(int x)
{
int num = x;
int count = 0;
while (num / 10 != 0) {
int maxx = 0;
for (int i = 1; num / i != 0; i *= 10) {
int temp1 = num / i;
int temp2 = num%i;
maxx = max(maxx, temp1*temp2);
}
num = maxx;
count++;
}
return count;
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cout << solve(x) << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int q;
cin >> q;
for(int i = 0; i < q; i++){
int n;
int cnt = 0;
cin >> n;
while(n >= 10){
int m = 0;
int a = n;
for(int j = 1; j < log10(n); j++){
int k = pow(10,j);
m = max(m,(n/k)*(n%k));
}
n = m;
if(a == n){
cnt = -1;
break;
}
cnt++;
}
cout << cnt << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> VI;
const int SIZE = 1000001;
VI memo( SIZE, -2 );
int dfs ( int num )
{
if ( memo[num] != -2 ) {
return memo[num];
}
if ( num < 10 ) {
return memo[num] = 0;
}
int m = 10,
next = 0,
res = -1;
memo[num] = -1;
while ( num >= m ) {
next = max( next, ( num / m ) * ( num % m ) );
m *= 10;
}
res = dfs( next );
if ( res != -1 ) {
++res;
}
return memo[num] = res;
}
int main ( void )
{
int q;
while ( cin >> q ) {
for ( int i = 0; i < q; ++i ) {
int n;
cin >> n;
cout << dfs( n ) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int q;
cin >> q;
for(int i=0;i<q;i++){
int n;
cin >> n;
int c=0;
while(n>=10){
string s = to_string(n);
n=0;
for(int unsigned j = 1;j<s.size();j++){
n = max(n,stoi(s.substr(0,j))*stoi(s.substr(j)));
}
c++;
}
cout << c << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ll q;
cin >> q;
while(q--){
string n;
cin >> n;
ll ans = 0;
while(n.size() > 1){
if(ans > 10000) break;
int maxi = 0;
for(int pos = 1; pos < n.size(); pos++){
int l = stoi(n.substr(0, pos));
int r = stoi(n.substr(pos));
maxi = max(maxi, l * r);
}
n = to_string(maxi);
ans++;
}
if(ans > 10000) cout << -1 << endl;
else cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
auto c = vector<int>(2, 0);
int ans = 0;
for (int i = 0; i < n; ++i) {
string f; cin >> f;
c[f[0] == 'l'] ^= 1;
if (all_of(begin(c), end(c), [](int x) { return x == 1; })) {
++ans;
c = vector<int>(2, 0);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
vector<string> v(n);
for(int i=0; i<n; ++i) {
cin >> v[i];
}
int ans = 0;
for(int i=1; i<v.size(); ++i) {
if((v[i-1] == "lu" && v[i] == "ru") || (v[i-1] == "ru" && v[i] == "lu") ||
(v[i-1] == "rd" && v[i] == "ld") || (v[i-1] == "ld" && v[i] == "rd")) {
ans++;
}
}
cout << ans << endl;
}
}
|
#include<iostream>
using namespace std;
#include<vector>
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int ans=0;
int sta=0;
int l=0;
int r=0;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s=="lu"){
l=1;
}else if(s=="ru"){
r=1;
}else if(s=="ld"){
l=0;
}else if(s=="rd"){
r=0;
}
if(sta==0&&l==1&&r==1){
ans++;
sta=1;
}else if(sta==1&&l==0&&r==0){
ans++;
sta=0;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
while(n != 0){
int ans = 0;
string s[150];
for(int i=0;i<n;i++) cin >> s[i];
for(int i=1;i<n;i++){
if((s[i] == "lu" && s[i-1] == "ru") || (s[i] == "ru" && s[i-1] == "lu")){
ans++;
}
if((s[i] == "ld" && s[i-1] == "rd") || (s[i] == "rd" && s[i-1] == "ld")){
ans++;
}
}
cout << ans << endl;
cin >> n;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
string f;
int cnt = 0;
char now, bef = 0;
for(int i = 0; i < n; ++i) {
cin >> f;
now = f[1];
if(now == bef) {
++cnt;
}
bef = now;
}
cout << cnt << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
using namespace std;
int main(){
int n,ans,r,l;
string s,t;
while(cin>>n && n>0){
ans=0;
r=0;
l=0;
for(int i=0;i<n/2;i++){
cin>>s>>t;
if((s=="lu"&&t=="ru")||(t=="lu"&& s=="ru")||(s=="ld"&&t=="rd")||(s=="rd"&&t=="ld")) ans++;
}
if(n%2==1) cin>>s;
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n,l,r,hantei,count;
string s;
while(1){
l = r = hantei = count = 0;
cin >> n;
if(n == 0)break;
for(int i = 0;i < n;i++){
cin >> s;
if(s == "lu"){
l = 1;
}
else if(s == "ru"){
r = 1;
}
else if(s == "ld"){
l = 0;
}
else if(s == "rd"){
r = 0;
}
if(l == 1 && r == 1 && hantei == 0){
count++;
hantei = 1;
}
else if(l == 0 && r == 0 && hantei == 1){
count++;
hantei = 0;
}
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#define llint long long
using namespace std;
llint n;
string s[105];
int main(void)
{
while(1){
cin >> n;
if(n == 0) break;
for(int i = 1; i <= n; i++) cin >> s[i];
llint ans = 0;
for(int i = 1; i+1 <= n; i++){
if(s[i][1] != s[i+1][1]) continue;
if(s[i][0] == s[i+1][0]) continue;
ans++;
}
cout << ans << endl;
}
return 0;
}
|
# include <stdio.h>
int main(){
int n,i,ans=0,r=0,l=0;
char s[3];
for(;;){
scanf("%d",&n);
if(n==0){
break;
}
for(i=1;i<=n;i++){
scanf("%s",s);
if(s[0]=='l'&&s[1]=='u'){
l=1;
}
if(s[0]=='l'&&s[1]=='d'){
l=0;
}
if(s[0]=='r'&&s[1]=='u'){
r=1;
}
if(s[0]=='r'&&s[1]=='d'){
r=0;
}
if(ans%2==0&&r==1&&l==1){
ans++;
}
if(ans%2!=0&&r==0&&l==0){
ans++;
}
}
printf("%d\n",ans);
ans=0;
r=0;
l=0;
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int n, r[101]; char c[3];
int main()
{
while (true)
{
scanf("%d", &n);
if (n == 0) break;
memset(r, 0, sizeof(r));
for (int i = 0; i < n; i++)
{
scanf("%s", &c);
switch (c[1])
{
case 'u': r[i + 1] = r[i] + 1; break;
case 'd': r[i + 1] = r[i] - 1; break;
}
}
int ret = 0;
for (int i = 2; i <= n; i++)
{
if (r[i - 2] == 0 && r[i] == 2) ret++;
if (r[i - 2] == 2 && r[i] == 0) ret++;
}
printf("%d\n", ret);
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n;
while (scanf("%d", &n), n) {
int cnt = 0;
string back;
rep(i, n) {
string s; cin >> s;
if (s == "lu"&&back == "ru")cnt++;
if (s == "ru"&&back == "lu")cnt++;
if (s == "ld"&&back == "rd")cnt++;
if (s == "rd"&&back == "ld")cnt++;
back = s;
}
printf("%d\n", cnt);
}
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin>>n,n){
int res=0,l=0,r=0,last=0;//floor->0 step->1
for(int i=0;i<n;i++){
string s;cin>>s;
if(s=="lu") l=1;
else if(s=="ru") r=1;
else if(s=="ld") l=0;
else r=0;
if(l!=r) continue;
if(last!=l){
res++;
last=l;
}
}
cout<<res<<endl;
}
}
|
#include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
char a[2][3];
int n;
int i;
int j=0;
while(1)
{
cin>>n;
j=0;
a[0][0]=a[1][0]=0;
if(n==0)
return 0;
for(i=0;i<n;i++)
{
scanf("%s", a[i%2]);
if(i%2==1)
if(a[0][0]+a[1][0]=='r'+'l')
j++;
}
printf("%d\n", j);
}
return 0;
}
|
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n),n){
int l=0,r=0,cnt=0,prev=0;
for(int i=0;i<n;i++){
char str[4];
scanf("%s",str);
int t;
if(str[1]=='u')t=1;
else t=0;
if(str[0]=='l')l=t;
else r=t;
if(l==r&&prev!=l){
prev=1-prev;
cnt++;
}
}
printf("%d\n",cnt);
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
bool l,r,u;
string s;
l=r=u=false;
int ans=0;
int n,i;
cin >> n;
while(n){
l=r=u=false;
ans=0;
for(i=0;i<n;i++){
cin >> s;
if(s=="lu")l=true;
if(s=="ld")l=false;
if(s=="ru")r=true;
if(s=="rd")r=false;
if(l==r){
if(u!=l)ans++;
u=l;
}
}
cout << ans << endl;
cin >> n;
}
return 0;
}
|
#include <iostream>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main(){
int oi=0;
while(true){
int fl;
cin >> fl; if(!fl) return 0;
int re=0;
bool l=false; //true==upped, false=downed
bool r=false;
bool p=false; //chokuzen no ryouashi sorotta noga
REP(fi,fl){
string fc;
cin>>fc;
if(fc=="lu") l=true;
if(fc=="ld") l=false;
if(fc=="ru") r=true;
if(fc=="rd") r=false;
if(l==r){
if(p!=l){
re++;
p=l;
}
}
}
cout<<re<<endl;//("<<oi++<<")";
}
}
|
#include<iostream>
using namespace std;
int main(){
int n,count;
char ch[201];
while(cin>>n){
if(n==0)break;
n=2*n;
count=0;
for(int i=0;i<n;i++)
cin>>ch[i];
for(int i=0;i+3<n;i+=4)
if(ch[i]!=ch[i+2])count++;
cout<<count<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
while(cin>>n){
int a=0,k=0,pre=0;
if(n==0) break;
string f;
for(int i=0;i<n;i++){
cin>>f;
if(f=="lu") a=a+1;
if(f=="ld") a=a-1;
if(f=="ru") a=a+10;
if(f=="rd") a=a-10;
if(pre==0&&a==11){
k++;
pre=11;
}
if(pre==11&&a==0){
k++;
pre=0;
}
}
cout<<k<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
bool l,r,b;
int n,ans;
string s;
int main(){
while(1){
cin>>n;
if(n==0)break;
ans=l=r=b=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu")l=true;
else if(s=="ru")r=true;
else if(s=="ld")l=false;
else if(s=="rd")r=false;
if(l==r&&l!=b){
b=l;
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
#define rep(i,a,b) for(int i=(int)a,i<(int)b;++i)
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
string s;
int ans=0;
int l=0,r=0,pre=0;
// rep(i,0,n){
for(int i = 0; i<n;i++){
cin >> s;
if(s[0] == 'l'){
l+=1;
l%=2;
}
if(s[0] == 'r'){
r+=1;
r%=2;
}
if(pre == 0 && l==1 && r==1){
ans++;
pre=1;
}
if(pre == 1 && l == 0 && r == 0){
ans++;
pre=0;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int state=0,cnt=0;
for(string step;n>0;--n){
cin>>step;
if(step=="lu"||step=="ru"){
if(state==1) cnt++;
state=1;
}else{
if(state==0) cnt++;
state=0;
}
}
cout<<cnt<<endl;
}
return EXIT_SUCCESS;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int l=0,r=0;
int n;
while(cin>>n){
if(n==0)break;
int state=0;
int cnt=0;
l=0;
r=0;
string str;
for(int i=0;i<n;i++){
cin>>str;
if(str=="lu"){
l=1;
}
else if(str=="ru"){
r=1;
}
else if(str=="ld"){
l=0;
}
else if(str=="rd"){
r=0;
}
if(state==0 && l==1 && r==1){
state++;
cnt++;
}
else if(state==1 && l==0 && r==0){
state=0;
cnt++;
}
}
cout<<cnt<<endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
int n;
while(cin >> n, n){
vector<string> s(n);
int cnt = 0;
int judge = 0;
for(int i = 0; i < n; i++){
cin >> s[i];
if(i > 0){
if((s[i][0] != s[i-1][0]) && (s[i][1] == s[i-1][1])) cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
char a[3];
int b,d,n,sum;
while(cin>>n,n!=0){
b=d=sum=0;
for(int i=0;i<n;i++){
scanf("%s",a);
if(b==1&&a[0]=='l')b--;
else if(d==1&&a[0]=='r')d--;
else if(a[0]=='l')b++;
else if(a[0]=='r')d++;
if(b==1&&d==1){sum++;b=0;d=0;}
}
cout<<sum<<endl;
}}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
while (1)
{
int n, ans=0;
string s[110];
cin>>n;
if (n==0) break;
for (int i=0; i<n; i++) cin>>s[i];
for (int i=0; i<n; i+=2)
{
if ((s[i]=="lu" && s[i+1]=="ru") || (s[i]=="ru" && s[i+1]=="lu") || (s[i]=="ld" && s[i+1]=="rd") || (s[i]=="rd" && s[i+1]=="ld")) ans++;
}
cout<<ans<<'\n';
}
return 0;
}
|
#include <cstdlib>
#include <iostream>
using namespace std;
#define REP(i, a, b) for(int i = (a); i < int(b); ++i)
#define rep(i, n) REP(i, 0, n)
int main(){
for(int n; cin >> n && n;) {
bool next = true, left = false, right = false;
int ans = 0;
rep(i, n) {
string f;
cin >> f;
(f[0] == 'l' ? left : right) = (f[1] == 'u' ? true : false);
if(next == left && next == right) {
next = !next;
++ans;
}
}
cout << ans << endl;
}
return EXIT_SUCCESS;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
bool lu=false,ru=false,u=false;
int cnt=0;
for(int i=0;i<n;i++){
string d;
cin >> d;
if(d=="lu") lu=true;
else if(d=="ld") lu=false;
else if(d=="ru") ru=true;
else ru=false;
if(ru==true&&lu==true&&u==false){
u=true;
cnt++;
}else if(ru==false&&lu==false&&u==true){
u=false;
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
while (1){
cin >> n;
if (n == 0) break;
int ans = 0;
string Step = "null";
string nextStep;
for (int i = 0; i < n; i++){
cin >> nextStep;
if (nextStep == "lu"){
if (Step == "ru") ans++;
}
else if(nextStep == "ru"){
if (Step == "lu") ans++;
}
else if (nextStep == "ld"){
if (Step == "rd") ans++;
}
else if (nextStep == "rd"){
if (Step == "ld") ans++;
}
Step = nextStep;
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
string ac;
while (cin >> n, n != 0){
int count = 0;
bool l = false, r = false;
bool next = true;
for (int i = 0; i < n; i++){
cin >> ac;
if (ac == "lu") l = true;
if (ac == "ru") r = true;
if (ac == "ld") l = false;
if (ac == "rd") r = false;
if (l == r&&l == next){
count++;
next = !next;
}
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
while(cin>>n and n>0){
string s[n]; rep(i,n) cin>>s[i];
int cnt=0;
rep(i,n-1){
if(s[i]=="lu" and s[i+1]=="ru") cnt++;
if(s[i]=="ru" and s[i+1]=="lu") cnt++;
if(s[i]=="ld" and s[i+1]=="rd") cnt++;
if(s[i]=="rd" and s[i+1]=="ld") cnt++;
}
cout<<cnt<<endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
int main(void){
while(1){
int n;
cin >> n;
if(n == 0) break;
bool f1 = 0;
bool f2 = 0;
bool ok = 0;
int ans = 0;
for(int i=0; i<n; i++){
string t;
cin >> t;
if(t[0] == 'l') f1 = f1 - 1;
if(t[0] == 'r') f2 = f2 - 1;
if(f1 == 1 && f2 == 1 && ok == 0){ ans++; ok = 1;}
if(f1 == 0 && f2 == 0 && ok == 1){ ans++; ok = 0;}
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
bool l=false,r=false;
int ans=0;
bool bf=false;
for(int i=0;i<n;i++){
string sa;
cin>>sa;
if(sa=="lu"){l=true;}
else if(sa=="ru")r=true;
else if(sa=="ld")l=false;
else if(sa=="rd")r=false;
if(l==r&&r!=bf){
ans++;
bf=l;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0) return 0;
int yk=0,h=0,m=0,ans=0;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s=="lu") h++;
else if(s=="ld") h--;
else if(s=="ru") m++;
else m--;
int nans;
if(h==m){
if(h==0&&m==0) nans=0;
else nans=1;
if(yk!=nans){
ans++;
yk=nans;
}
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s[101];
int n;
int main(){
while(1){
cin >> n;
if(n == 0) break;
for(int i=0; i<n; i++) cin >> s[i];
int r_foot = 0;
int l_foot = 0;
int past_l = 0;
int past_r = 0;
int ans = 0;
for(int i=0; i<n; i++){
if(s[i] == "lu") l_foot++;
else if(s[i] == "ru") r_foot++;
else if(s[i] == "ld") l_foot--;
else if(s[i] == "rd") r_foot--;
if(l_foot != past_l and r_foot != past_r){
ans++;
past_r = r_foot;
past_l = l_foot;
}
}
cout << ans << endl;
}//end
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
while(1){
int n;
int sum = 0;
int flag = 0;
int p = 0;
string ud[100];
cin >> n;
if (n == 0)
return 0;
for(int i = 0; i < n; i++){
cin >> ud[i];
if(ud[i] == "ru" || ud[i] == "lu"){
p++;
}
if(ud[i] == "rd" || ud[i] == "ld"){
p--;
}
if(p % 2 == 0 && p != flag){
flag = p;
sum++;
}
}
cout << sum << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
while(true){
int n;
cin >> n;
if(n == 0) break;
bool floor = true;
bool r = true, l = true;
string f;
int cnt = 0;
for(int i = 0; i < n; ++i){
cin >> f;
if(f == "lu"){
l = false;
}
if(f == "ru"){
r = false;
}
if(f == "ld"){
l = true;
}
if(f == "rd"){
r = true;
}
if(!floor && r && l){
cnt++;
floor = !floor;
}
if(floor && !r && !l){
cnt++;
floor = !floor;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n){
bool sink = true, l = true, r = true;
int ans = 0;
string op;
for(int i = 0; i < n; i++){
cin >> op;
if(op == "lu") l = false;
if(op == "ru") r = false;
if(op == "ld") l = true;
if(op == "rd") r = true;
if(l == r && l != sink){
ans++;
sink = !sink;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int i,n;
string foot[1000];
while(1){
int count=0;
cin >> n;
if(n==0)break;
for(i = 0; i < n; i++){
cin >> foot[i];
}
for(i = 0; i < n-1; i++){
if((foot[i]=="lu" && foot[i+1]=="ru")||(foot[i]=="ru" &&foot[i+1]=="lu" )||(foot[i]=="ld" &&foot[i+1]=="rd") ||(foot[i]=="rd" &&foot[i+1]=="ld"))count++;
}
cout << count << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(void){
int n;
while(cin >> n, n){
vector<string> a(n);
int cnt=0;
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i+1<n;i++)
cnt += a[i][1]==a[i+1][1];
cout << cnt << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
using namespace std;
int main() {
int n, count;
string cur, pre;
while (cin >> n, n) {
pre = "";
count = 0;
while (n--) {
cin >> cur;
if ((cur == "lu" && pre == "ru") || (cur == "ru" && pre == "lu") || (cur == "ld" && pre == "rd") || (cur == "rd" && pre == "ld")) count++;
pre = cur;
}
cout << count << el;
}
}
|
#include<iostream>
using namespace std;
int main(){
while(1){
string str,str2;
int N;
cin>>N;
if(N==0) break;
int count=0;
str2[1]=0;
for(int i=0;i<N;i++){
str2[1]=str[1];
cin>>str;
if(str[1]==str2[1]) count++;
}
cout<<count<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
string str,a="rldu";
bool leg[2]={};
int ans=0,now=1,num[2]={0,1};
for(;n>0;n--){
cin>>str;
for(int i=0;i<2;i++)if(str[0]==a[i])for(int j=0;j<2;j++)if(str[1]==a[2+j])leg[i]=num[j];
if(now==leg[0]&&now==leg[1]){
ans++;
now=(now+1)%2;
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n, n){
string op;
int ans = 0;
bool state = false;
bool l = false, r = false;
for(int i = 0 ; i < n ; i++){
cin >> op;
if(op == "lu") l = true;
if(op == "ru") r = true;
if(op == "ld") l = false;
if(op == "rd") r = false;
if(!state && l && r){ ans++; state = true; }
if(state && !l && !r){ ans++; state = false; }
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
string f[101];
while (cin >> n) {
if (!n) { break; }
for (int i = 0; i < n; i++) { cin >> f[i]; }
int ans = 0;
for (int i = 1; i < n; i++) {
if (f[i] == "lu" && f[i-1] == "ru") { ans++;}
else if (f[i] == "ru" && f[i-1] == "lu") { ans++; }
else if (f[i] == "ld" && f[i-1] == "rd") { ans++; }
else if (f[i] == "rd" && f[i-1] == "ld") { ans++; }
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
char ch[201];
while(cin>>n){
if(n==0)break;
int count=0;
for(int i=0;i<2*n;i++)
cin>>ch[i];
for(int i=0;i+3<2*n;i+=4)
if(ch[i]!=ch[i+2])count++;
cout<<count<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n,o,i,j;
int l,r,s;
string str;
cin >> n;
while(n!=0){
o=0;
l=0;r=0;s=0;
for(i=0;i<n;i++){
cin >> str;
if(str[0]=='l'){
if(str[1]=='u') l=1;
else l=0;
}else{
if(str[1]=='u') r=1;
else r=0;
}
if(l==1&&r==1&&s==0){
o++;
s=1;
}
if(l==0&&r==0&&s==1){
o++;
s=0;
}
}
cout << o << endl;
cin >> n;
}
}
|
#include <iostream>
using namespace std;
int n;
string s;
int le,ri,cnt,pos;
int main(){
while(1){
cin >> n;
if(n==0)break;
pos=cnt=le=ri=0;
for(int i=0;i<n;i++){
cin >>s;
if(s=="lu"){
le=1;
if(le&&ri&&!pos){
pos=1;
cnt++;
}
}else if(s=="ru"){
ri=1;
if(le&&ri&&!pos){
pos=1;
cnt++;
}
}else if(s=="ld"){
le=0;
if(!(le||ri)&&pos){
pos=0;
cnt++;
}
}else if(s=="rd")
ri=0;
if(!(le||ri)&&pos){
pos=0;
cnt++;
}
}
cout << cnt<<endl;
}
return 0;
}
|
#include <stdio.h>
int main(){
int stay,i,a,cou;
char m1[3],m2[3];
while(1){
scanf("%d",&a);
if(a==0)break;
stay=0;
cou=0;
for(i=0;i<a/2;i++){
scanf("%s %s",m1,m2);
if(stay==0&&m1[1]=='u'&&m2[1]=='u'){
cou++;
stay=1;
}else if(stay==1&&m1[1]=='d'&&m2[1]=='d'){
cou++;
stay=0;
}
}
if(a%2==1)scanf("%s",m1);
printf("%d\n",cou);
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void){
int st, l, r, n, i, ans;
char s[3];
while(1){
scanf("%d",&n);
if(n == 0){
break;
}
ans = 0;
st = l = r = 0;
for(i = 0;i < n;i++){
scanf("%s",&s);
if(!strcmp(s,"lu")){
l = 1;
}else if(!strcmp(s,"ru")){
r = 1;
}else if(!strcmp(s,"ld")){
l = 0;
}else if(!strcmp(s,"rd")){
r = 0;
}else{
printf("error\n");
}
if(st != l && st != r){
st = l;
ans++;
}
}
printf("%d\n",ans);
}
return 0;
}
|
#include<iostream>
using namespace std;
#define lp(i,n) for(int i=1;i<=n;i++)
int main(){
int n;
while(1){
cin>>n;
if(n == 0) break;
int a=0, count=0;
string s;
lp(i,n){
cin>>s;
if(s=="lu") a++;
if(s=="ld") a--;
if(s=="ru") a++;
if(s=="rd") a--;
if(a == 2 || a == -2) count++;
if(i % 2 == 0) a=0;
}
cout<<count<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int c[2]={},ch=0,ans=0;
for(int i=0;i<n;++i){
string s; cin>>s;
if(s=="lu" || s=="ru"){
if(ch==1){
ans++;
ch=0;
}else ch=1;
}else if(s=="ld" || s=="rd"){
if(ch==-1){
ans++;
ch=0;
}else ch=-1;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
const int updn[] = {3, 0};
int n;
while (scanf("%d", &n), n){
int res = 0;
int state = 0;
for (int i = 0; i < n; i++){
string str;
cin >> str;
if (str == "lu") state += 1;
if (str == "ru") state += 2;
if (str == "ld") state -= 1;
if (str == "rd") state -= 2;
if (state == updn[res % 2]) res++;
}
cout << res << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0){
break;
}
string f[n];
for(int i=0;i<n;i++){
cin>>f[i];
}
int t=0;
for(int i=1;i<n;i++){
if(f[i]=="lu"&&f[i-1]=="ru"){
t++;
}else if(f[i]=="ru"&&f[i-1]=="lu"){
t++;
}else if(f[i]=="ld"&&f[i-1]=="rd"){
t++;
}else if(f[i]=="rd"&&f[i-1]=="ld"){
t++;
}
}
cout<<t<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
string str;
bool right=0,left=0;
int ans=0,now=1;
for(;n>0;n--){
cin>>str;
if(str=="lu")left=1;
else if(str=="ru")right=1;
else if(str=="ld")left=0;
else right=0;
if(now==right&&right==left){
ans++;
now=(now+1)%2;
}
}
cout<<ans<<endl;
}
}
|
#include<iostream>
using namespace std;
int N;
int main()
{
while(cin>>N,N)
{
int pre=0,ans=0;
int x=0,y=0;
for(int i=0;i<N;i++)
{
string s;cin>>s;
if(s=="lu")
{
x=1;
}
else if(s=="ru")
{
y=1;
}
else if(s=="ld")
{
x=0;
}
else
{
y=0;
}
if(x==1&&y==1)
{
if(pre==0)ans++;
pre=1;
}
else if(x==0&&y==0)
{
if(pre==1)ans++;
pre=0;
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
while(1){
int n;
cin >> n;
if(n == 0) break;
int left = 0;
int right = 0;
int cnt = 0;
int dir = 1;
for(int i=0; i<n; i++){
string t;
cin >> t;
if(t[0] == 'l'){
left = 1 - left;
}else{
right = 1 - right;
}
if(left == right && dir == left){
cnt++;
dir = 1 - dir;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool lrp[2];
int lr[2];
void c(bool f,char s){
if(s=='u'){
if(lrp[f]==0){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=1;
}else {
if(lrp[f]==1){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=0;
}
}
int main(){
int n;
while(cin>>n&&n){
string s;
lrp[0]=lrp[1]=0;
lr[0]=lr[1]=0;
while(n--){
cin>>s;
if(s[0]=='l') c(0,s[1]);
else c(1,s[1]);
}
cout<<min(lr[0],lr[1])<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int n;
while(cin >> n, n){
vector<string> s(n);
rep(i, n) cin >> s[i];
int ans = 0;
rep(i, n-1){
if(s[i][1] == s[i+1][1]) ans++;
}
cout << ans << endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.