UVA-1585

最新推荐文章于 2021-04-25 16:30:13 发布

Yuki14544869

最新推荐文章于 2021-04-25 16:30:13 发布

阅读量137

点赞数

文章标签： AOAPC-II UVA 小粉书AK之路水题

本文链接：https://blog.csdn.net/yuki14544869/article/details/52223951

版权

#include <algorithm>
#include <iostream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <deque>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define mm(a,i) memset(a, i, sizeof(a));
#define LL    long long
#define Mod 1000000007
#define SC_C(s)           scanf("%c", &s)
#define SC(a)             scanf("%d", &a)
#define SCC(a,b)          scanf("%d %d", &a, &b)
#define SCCC(a,b,c)       scanf("%d %d %d", &a, &b, &c)
#define FXA(i,a,n)        for(i=a; i<n; i++)
#define FDA(i,a,n)        for(i=a; i>n; i++)
#define FXDA(i,a,n)       for(i=a; i<=n; i++)
#define FDDA(i,a,n)       for(i=a; i>=n; i++)
#define FXB(i,a,n)        for(i=a; i<n; i--)
#define FDB(i,a,n)        for(i=a; i>n; i--)
#define FXDB(i,a,n)       for(i=a; i<=n; i--)
#define FDDB(i,a,n)       for(i=a; i>=n; i--)
#define PF(n)             printf("%d\n", n);
#define PFF(n,m)          printf("%d %d\n", n, m);
#define PFFF(x,y,z)       printf("%d %d %d\n", x, y, z);
#define PF_Case(i)        printf("Case %d:\n",i);
#define PF_C(i)           printf("%d:\n",i);
#define PF_L(x)           printf("%I64d\n",x);
#define IN                freopen("D:\\in.txt","r",stdin);
#define MAX(a,b)          a>b?a:b
#define MIN(a,b)          a<b?a:b
int maxx =  999999999;
int minn = -999999999;
bool flag;
int i,j,k,T,ans,sum,m,n,cnt;
//string s;
int main() {
    char s[100];
    //scanf("%s",s);
    int T;
    while(cin>>T) {
        while(T--) {
            memset(s,0,sizeof(s));
            cin>>s;
            int t=strlen(s),count=0,ans=0;
            for(int i=0; i<t; i++) {
                if(s[i]=='O') 
                    ans+=++count;
                else if(s[i]=='X') 
                    count=0;
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}
'''