Even Substrings

https://codeforces.com/contest/1139/problem/A

题解：末尾是偶数就是偶数

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int a[N];
char str[N];
struct node{};
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%s",&n,str);for(int i=0;i<n;i++){if((str[i]-'0')%2==0){ans+=i+1;}}cout<<ans<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Even Substrings相关推荐

LeetCode刷题记录6——696. Count Binary Substrings（easy）
LeetCode刷题记录6--696. Count Binary Substrings(easy) 目录 LeetCode刷题记录6--696. Count Binary Substrings(eas ...
hihocoder 1152 Lucky Substrings
#1152 : Lucky Substrings 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 A string s is LUCKY if and only if t ...
[NC13C]形态形成场/[Gym100430B]Divisible Substrings
[NC13C]形态形成场/[Gym100430B]Divisible Substrings 题目大意: 有\(m(m\le26)\)个字符串替换式\(S_i(|S_i\le100|)\),表示某个大写 ...
Lucky Substrings
而在26以内且属于fibonacci数列的数为1,2,3,5,8,13,21时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 A string s is LUCKY if ...
A. Many Equal Substrings（自己很水）
A. Many Equal Substrings You are given a string tt consisting of nn lowercase Latin letters and an i ...
spoj 8222 Substrings (后缀自动机)
spoj 8222 Substrings 题意:给一个字符串S,令F(x)表示S的所有长度为x的子串中,出现次数的最大值.求F(1)..F(Length(S)) 解题思路:我们构造S的SAM,那么对于 ...
647. Palindromic Substrings
题目描述: Given a string, your task is to count how many palindromic substrings in this string. The subs ...
leetcode 467. Unique Substrings in Wraparound String | 467. 环绕字符串中唯一的子字符串（动态规划）
题目 https://leetcode.com/problems/unique-substrings-in-wraparound-string/ 题解 1.dp 超时版本 class Solution ...
Codeforces Round #548 (Div. 2) A. Even Substrings
You are given a string ?=?1?2-??s=s1s2-sn of length ?n, which only contains digits 11, 22, ..., 99. ...
POJ - 3415 Common Substrings（长度不小于K的公共子串个数）
Common Substrings 后缀数组+单调栈题解1 题解2 题解3 #include<cstdio> #include<cstring> #include<io ...

Even Substrings

Even Substrings相关推荐

最新文章

热门文章