Submission #3194247
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <cmath> #include <math.h> #include <vector> #include <stack> #include <queue> #include <map> #include <set> #include <limits.h> using namespace std; #define INF LLONG_MAX/3 #define inf INT_MAX/3 #define MOD 1000000007 #define rep(i,n) for(int i=0;i<(n);i++) typedef pair<int, int> P; typedef long long ll; int gcd(int a, int b) { if (b == 0)return a; return gcd(b, a%b); } int lcm(int a, int b) { return a / gcd(a, b)*b; } int modpow(int a, int b) { if (b == 0)return 1; if (b == 1)return a % MOD; if (b % 2)return modpow(a, b - 1)*a%MOD; else return modpow(a, b / 2)*modpow(a, b / 2) % MOD; } int comb(int a, int b) { if (b == 0 || a == b)return 1; if (b == 1)return a % MOD; return (comb(a - 1, b - 1) + comb(a - 1, b)) % MOD; } int n; string s; int cnt = 0; int ans = 0; int main() { cin >> n >> s; for (int i = 0;i < n;i++) { if (s[i] == 'X')cnt++; else { ans += cnt / 3; cnt = 0; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 雨上がり |
User | anmichi |
Language | C++14 (GCC 5.4.1) |
Score | 50 |
Code Size | 1079 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 50 / 50 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_000.txt | AC | 1 ms | 256 KB |
case_001.txt | AC | 1 ms | 256 KB |
case_002.txt | AC | 1 ms | 256 KB |
case_003.txt | AC | 1 ms | 256 KB |
case_004.txt | AC | 1 ms | 256 KB |
case_005.txt | AC | 1 ms | 256 KB |
case_006.txt | AC | 1 ms | 256 KB |
case_007.txt | AC | 1 ms | 256 KB |
case_008.txt | AC | 1 ms | 256 KB |
case_009.txt | AC | 1 ms | 256 KB |
case_010.txt | AC | 1 ms | 256 KB |
case_011.txt | AC | 1 ms | 256 KB |
case_012.txt | AC | 1 ms | 256 KB |
case_013.txt | AC | 1 ms | 256 KB |
case_014.txt | AC | 1 ms | 256 KB |
case_015.txt | AC | 1 ms | 256 KB |
case_016.txt | AC | 1 ms | 256 KB |
case_017.txt | AC | 1 ms | 256 KB |
case_018.txt | AC | 1 ms | 256 KB |
case_019.txt | AC | 1 ms | 256 KB |
case_020.txt | AC | 1 ms | 256 KB |
case_021.txt | AC | 1 ms | 256 KB |
case_022.txt | AC | 1 ms | 256 KB |
case_023.txt | AC | 1 ms | 256 KB |
case_024.txt | AC | 1 ms | 256 KB |
case_025.txt | AC | 1 ms | 256 KB |
case_026.txt | AC | 1 ms | 256 KB |
case_027.txt | AC | 1 ms | 256 KB |
case_028.txt | AC | 1 ms | 256 KB |
case_029.txt | AC | 1 ms | 256 KB |
case_030.txt | AC | 1 ms | 256 KB |
case_031.txt | AC | 1 ms | 256 KB |
case_032.txt | AC | 1 ms | 256 KB |
case_033.txt | AC | 1 ms | 256 KB |
case_034.txt | AC | 1 ms | 256 KB |
case_035.txt | AC | 1 ms | 256 KB |
case_036.txt | AC | 1 ms | 256 KB |
case_037.txt | AC | 1 ms | 256 KB |
case_038.txt | AC | 1 ms | 256 KB |
case_039.txt | AC | 1 ms | 256 KB |
case_040.txt | AC | 1 ms | 256 KB |
case_041.txt | AC | 1 ms | 256 KB |
case_042.txt | AC | 1 ms | 256 KB |