text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int d[14] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string s;
bool ifis(int it) {
if (s[it + 2] != '-' || s[it + 5] != '-') {
return 0;
}
if (s[it] > '9' || s[it] < '0' || s[it + 1] > '9' || s[it + 1] < '0' ||
s[it + 3] > '9' || s[it + 3] < '0' ... |
#include <bits/stdc++.h>
using namespace std;
double pi = 3.1415926536;
const int oo = (int)1e9;
const long long OO = numeric_limits<long long>::max();
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int di[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dj[] = {1, -1, 0, 0, 1, -1, -1, 1};
int f1[] = {0, 0, 0, 1, 1, 1, -1, -1... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int f[40][20][10];
int dom[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
memset(f, 0, sizeof(f));
int maxi = 0, ansd, ansm, ansy;
for (int i = 0; i < s.length(); ++i) {
if (s[i + 2] != '-' || s[i + 5] != '-') cont... |
#include <bits/stdc++.h>
using namespace std;
bool is_valid(string s) {
int part = 0;
string ans = "";
bool ok = true;
int day = 0;
int month = 0;
int year = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '-') {
part++;
int num = stoi(ans);
ans = "";
if (part == 1)
... |
#include <bits/stdc++.h>
using namespace std;
map<string, int> cnt;
string str;
int ar[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
cin >> str;
for (int i = 0; i < str.size() - 9; i++) {
string s = str.substr(i, 10);
if (s[0] == '-' || s[1] == '-' || s[2] != '-' || s[3] == '-' ||
... |
#include <bits/stdc++.h>
using namespace std;
int months[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string s;
int main() {
while (getline(cin, s)) {
int n = (int)s.size();
vector<string> ans;
for (int i = 0; i <= n - 10; i++) {
if (isdigit(s[i]) && isdigit(s[i + 1]) && s[i + 2] == '-' ... |
#include <bits/stdc++.h>
using namespace std;
string s;
int a[2000] = {};
string r[2000];
const int mon[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
void tr(int p) {
int res = true;
for (int i = 0; res && i < 10; i++)
res = (((i == 2 || i == 5) && s[p + i] == '-') ||
(i != 2 && i != 5 && s... |
#include <bits/stdc++.h>
using namespace std;
string s;
string tmp;
string ans;
int mx;
map<string, int> m;
const int MD[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const bool flg[] = {0, 0, 1, 0, 0, 1, 0, 0, 0, 0};
bool check(int l, int r) {
int g = 0, d = 0, m = 0, y = 0;
for (int i = l; i <= r; i++... |
#include <bits/stdc++.h>
using namespace std;
int a[200000];
int day[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
vector<string> b;
int main() {
string s, d;
int i, j;
cin >> s;
int ma, k, da, m, y;
for (i = 0; i < s.length(); i++) {
if (s[i] == '-') a[i]++;
if (i > 0) a[i] += a[i - 1];
... |
#include <bits/stdc++.h>
using namespace std;
char data[13], s[100006], sol[13];
int vmax, an, l, zi, val, maxi;
int main() {
cin >> s;
maxi = 0;
for (an = 2013; an <= 2015; an++) {
for (l = 1; l <= 12; l++) {
int vmax;
if (l == 1 || l == 3 || l == 5 || l == 7 || l == 8 || l == 10 || l == 12)
... |
#include <bits/stdc++.h>
using namespace std;
long long ans, res, p, q, x;
int cnt[10];
void solve() {
string str, st = "", st1 = "", st2 = "", m = "";
cin >> str;
string s1 = "2013";
string s2 = "2014";
string s3 = "2015";
map<string, long long> mp;
for (int i = 6; i < str.size() - 3; i++) {
st = str... |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<string> subs;
int l;
string a, b;
cin >> a;
l = a.size();
for (int i = 0; i < l - 9; ++i) {
b = a.substr(i, 10);
if ((b[2] == '-' && b[5] == '-') &&
((((b[0] - '0') * 10 + b[1] - '0') <= 28) &&
(((b[0] - '0') * 10 + b... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
struct Node {
int d, m, y;
bool operator<(const Node &rhs) const {
return d < rhs.d ||
(d == rhs.d && (m < rhs.... |
#include <bits/stdc++.h>
char str[100100];
int a[20], f[60000];
int main() {
int i, j, l, r, y, n, x, p, s, ans, h;
memset(a, 0, sizeof(a));
a[4] = a[6] = a[9] = a[11] = 1;
while (~scanf("%s", str)) {
memset(f, 0, sizeof(f));
ans = 0;
h = 0;
l = strlen(str);
for (i = 0; i <= l - 10; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
int hash1(string s) {
int n = 0, b = 1;
for (int i = 0; i < s.size(); i++, b *= 10) n += s[i] * b;
return n;
}
int main(int argc, char const *argv[]) {
string str;
cin >> str;
int s;
int i, j, k, t, p;
string date;
map<int, int> m;
map<int, string> ref;
... |
#include <bits/stdc++.h>
using namespace std;
bool check(string s) {
if (s.length() < 10) {
return false;
}
if (s[2] != '-' || s[5] != '-') {
return false;
}
if (s[6] != '2' || s[7] != '0' || s[8] != '1' ||
(s[9] != '3' && s[9] != '4' && s[9] != '5')) {
return false;
}
if (s[0] < '0' || ... |
#include <bits/stdc++.h>
using namespace std;
char x[100100];
long x2[100100];
long mes[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
long wr = 0;
long res, cur, repsmax = -1;
long reps = 0;
long tmp1, tmp2, tmp3;
string s1;
int compare(const void *a, const void *b) { return (*(long *)a - *(long *)b); }
lo... |
#include <bits/stdc++.h>
using namespace std;
map<string, int> f;
int k[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool invalid(char a) { return a == '-'; }
void calc(string s) {
if (s[2] != '-' || s[5] != '-') return;
for (int i = 0; i < s.length(); i++)
if (i == 2 || i == 5)
continue;
... |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
char pro[M];
map<string, int> mp;
int moon[15] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool OK(string a) {
int len = a.length();
int year, month, day;
year = (a[len - 4] - '0') * 1000 + (a[len - 3] - '0') * 100 +
(a[len -... |
#include <bits/stdc++.h>
using namespace std;
string s;
int arr[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
pair<int, int> f(int i) {
if (i - 6 >= 0 && s[i - 4] == '-' && s[i - 1] == '-' && s[i - 3] >= '0' &&
s[i - 3] <= '9' && s[i - 2] >= '0' && s[i - 2] <= '9' &&
s[i - 6] >= '0' && s[i - 6] <=... |
#include <bits/stdc++.h>
namespace patch {
template <typename T>
std::string to_string(const T& n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
} // namespace patch
using namespace std;
long long int days[13] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
map<string, long long int> mp;
bool chk(c... |
#include <bits/stdc++.h>
using namespace std;
string in;
map<string, int> m;
int meses[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main(int argc, char *argv[]) {
cin >> in;
for (int i = 2; i < in.size() - 7; ++i) {
if (in[i] == '-') {
string date(in.c_str() + i - 2, 10);
int contador... |
#include <bits/stdc++.h>
using namespace std;
const int k[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
map<string, int> f;
string s;
int main() {
int i, j, n = 0, y, m, d;
string t, x;
cin >> s;
for (i = 0; i + 10 <= (int)s.length(); i++) {
x = s.substr(i, 10);
if (sscanf((x + "*1").c_str(),... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void pp(T v) {
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
cout << *it << ' ';
cout << endl;
}
template <class T>
void pp(T v, int n) {
for (int i = 0; i < (int)n; i++) cout << v[i] << ' ';
cout << endl;
}
template <cla... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b);
}
template <class T>
T maxm(T a, T b) {
return a > b ? a : b;
}
template <class T>
T minm(T a, T b) {
return a < b ? a : b;
}
template <class T>
T abs(T a) {
return a > 0 ? a : (-1) * a;
}
templ... |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.141592654;
int main() {
cin.tie(0);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
string str;
cin >> str;
int A = 0, F = 0, k = 0;
for (int i = 0; i < n; i++) {
if (str[i] == 'A')
A++;
else if (str[i] == 'F')
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, sum1 = 0, sum2 = 0;
cin >> n;
string str;
cin >> str;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'A') {
sum++;
} else if (str[i] == 'I') {
sum1++;
} else {
sum2++;
}
}
if (sum && sum1 =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int i = 0, A = 0;
for (int j = 0; j < n; j++) {
if (s[j] == 'I') i++;
if (s[j] == 'A') A++;
}
if (i == 1)
cout << 1 << "\n";
else if (i > 1)
cout << 0 << "\n";
else if (i == 0) {
cout << A <<... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
string s;
cin >> s;
int in = std::count(s.begin(), s.end(), 'I');
int ans = 0;
if (in <= 1) {
int all = std::count(s.begin(), s.end(), 'A');
if (in == 0)
ans = all;
else
ans = 1;
}
... |
#include <bits/stdc++.h>
int main() {
int n, A = 0, I = 0, F = 0, ans = 0;
char c[200001];
scanf("%d", &n);
scanf("%s", c);
for (int i = 0; i < n; i++) {
if (c[i] == 'A')
A++;
else if (c[i] == 'I')
I++;
else if (c[i] == 'F')
F++;
}
if (I == 0)
ans = A;
else if (I == 1)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int count = 0, i, n, a[3] = {0};
string s;
cin >> n >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] == 'A')
a[0]++;
else if (s[i] == 'I')
a[1]++;
else
a[2]++;
}
if (a[1] == 1)
cout << "1" << endl;
else if (... |
#include <bits/stdc++.h>
const int N = 100;
using namespace std;
map<char, int> mp;
int main() {
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
char ch;
cin >> ch;
mp[ch]++;
}
if (mp['I'] == 1) {
cout << 1 << endl;
} else if (mp['I'] >= 2) {
cout << 0 << endl;
} else {
... |
#include <bits/stdc++.h>
int main() {
long j, n, I, A, F;
char aux;
scanf("%li", &n);
scanf("%c", &aux);
A = I = F = 0;
for (j = 1; j <= n; j++) {
scanf("%c", &aux);
if (aux == 'A') {
A++;
}
if (aux == 'F') {
F++;
}
if (aux == 'I') {
I++;
}
}
if (I == 1) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
if (false) {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int n;
cin >> n;
int ni = 0;
int na = 0;
int nf = 0;
for (int i = 0; i < n; i++) {
char b;
cin >> b;
if (b == 'I') {
ni++;
} else ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
long int qtde_i, qtde_a;
char ch;
cin >> n;
qtde_i = 0;
qtde_a = 0;
for (long int i = 0; i < n; i++) {
cin >> ch;
if (ch == 'I') {
qtde_i += 1;
} else if (ch == 'A') {
qtde_a += 1;
}
}
if (0) {
cout ... |
#include <bits/stdc++.h>
using namespace std;
long long int a[200005], b[200005];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int n, count = 0, count1 = 0;
cin >> n;
char c[200005];
for (long long int i = 0; i < n; i++) {
cin >> c[i];
if (c[i] ==... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, i = 0;
cin >> n;
for (int j = 0; j < n; j++) {
char c;
cin >> c;
if (c == 'A')
a++;
else if (c == 'I')
i++;
}
if (i == 1)
cout << 1;
else if (i > 0)
cout << 0;
else if (i == 0)
cout << a;
ret... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, F = 0, I = 0, A = 0;
char c[200001];
cin >> a;
for (i = 1; i <= a; i++) {
cin >> c[i];
if (c[i] == 'I') {
I++;
} else if (c[i] == 'F') {
F++;
} else {
A++;
}
}
if (I == 1) {
cout << 1;
} else if ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, i, a, f, in;
char ch;
cin >> n;
a = 0;
in = 0;
f = 0;
for (i = 0; i < n; i++) {
cin >> ch;
if (ch == 'A')
a++;
else if (ch == 'I')
in++;
else
f++;
}
if (in == 1)
cout << in;
else if (in > 1)
... |
#include <bits/stdc++.h>
using namespace std;
int n, al, in;
char s[200010];
int main() {
al = in = 0;
scanf("%d%s", &n, s);
for (int i = 0; i < n; i++)
if (s[i] == 'A')
al++;
else if (s[i] == 'I')
in++;
if (in == 0)
printf("%d\n", al);
else if (in == 1)
printf("1\n");
else
p... |
#include <bits/stdc++.h>
using namespace std;
char c;
int n, a, i, j;
int main() {
scanf("%d\n", &n);
for (int j = 1; j <= n; j++) {
scanf("%c", &c);
switch (c) {
case 'A':
a++;
break;
case 'I':
i++;
break;
}
}
if (i) {
if (i == 1)
printf("1\n");... |
#include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main() {
int n;
scanf("%d", &n);
string x;
cin >> x;
for (int i = 0; i < x.length(); i++) {
cnt[x[i] - 'A']++;
}
int A = cnt[0], F = cnt['F' - 'A'], I = cnt['I' - 'A'];
int cnt = 0;
for (int i = 0; i < x.length(); i++) {
if (x[i] !... |
#include <bits/stdc++.h>
int main() {
int a[3], i, n, k;
char c;
while (scanf("%d", &n) != EOF) {
getchar();
memset(a, 0, sizeof(a));
k = 0;
for (i = 0; i < n; i++) {
scanf("%c", &c);
if (c == 'A') a[0]++;
if (c == 'F') a[1]++;
if (c == 'I') a[2]++;
}
if (a[0] > 0 &... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200004;
int main() {
int n;
char s[N];
map<char, int> mp;
scanf("%d%s", &n, s);
for (int i = 0; i < n; i++) mp[s[i]]++;
if (mp.count('I') > 0) {
if (mp['I'] >= 2)
puts("0");
else
puts("1");
} else
cout << count(s, s + n, '... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int I = 0, F = 0, A = 0;
for (auto ch : s) {
if (ch == 'A')
A += 1;
else if (ch == 'I')
I += 1;
else
F += 1;
}
if (I == 0) {
cout << A << endl;
return 0;
}
if (I > 0)... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T MAX(T a, T b) {
if (a > b) return a;
return b;
}
template <class T>
inline T MIN(T a, T b) {
if (a < b) return a;
return b;
}
template <class T>
inline T ABS(T x) {
if (x < 0) return -x;
return x;
}
inline void OPEN(const string &s) {... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long n, m;
while (cin >> n) {
string st;
cin >> st;
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (st[i] == 'I') cnt++;
}
if (cnt == 0) {
for (int i = 0;... |
#include <bits/stdc++.h>
using namespace std;
long long MD = 1000000007;
long long md = 998244353;
const long long INF = 1e18L + 5;
long long exp(long long a, long long b) {
long long r = 1ll;
while (b > 0) {
if (b & 1) {
r = r * (a % md);
r = (r + md) % md;
}
b /= 2;
a = (a % md) * (a %... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, A = 0, F = 0, I = 0;
char S[200005];
cin >> n;
cin >> S;
for (int i = 0; i < n; i++) {
if (S[i] == 'A')
A++;
else if (S[i] == 'I')
I++;
}
if (I == 0) {
cout << A << endl;
return 0;
}
if (I == 1) {
cout <<... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int contA = 0, contI = 0, contF = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'A') contA++;
if (s[i] == 'I') contI++;
if (s[i] == 'F') contF++;
}
if (contI <= 1) {
if (contI == 1)
cout ... |
#include <bits/stdc++.h>
using namespace std;
char ch[200009];
int main() {
int n;
scanf("%d", &n);
scanf("%s", ch);
int a = 0, b = 0;
for (int i = 0; i < n; i++)
if (ch[i] == 'I') a++;
for (int i = 0; i < n; i++)
if (ch[i] == 'A') b++;
if (a == 1)
printf("%d\n", a);
else if (a == 0)
pri... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
int sumA;
int sumF;
int sumI;
while (cin >> n) {
sumA = sumF = sumI = 0;
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == 'A')
sumA++;
else if (s[i] == 'F')
sumF++;
else
sumI+... |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int cnti = 0, cnta = 0;
for (int i = 0; i < ((int)(str).size()); i++) {
cnti += str[i] == 'I';
cnta += str[i] == 'A';
}
if (cnti > 1)
cout << 0;
else if (cnti == 1)
cout <... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int countF = 0, countAI = 0, countIN = 0;
int n;
int show = 0;
string game;
cin >> n;
cin >> game;
for (int i = 0; i < n; i++) {
if (game[i] == 'F')
countF++;
else if (game[i] == 'I')
countIN++;
else if (game[i] == 'A')
... |
#include <bits/stdc++.h>
using namespace std;
double PI = 3.1415926536;
int main() {
long long n;
cin >> n;
string s;
cin >> s;
int a = 0, f = 0, I = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'F')
f++;
else if (s[i] == 'I')
I++;
else if (s[i] == 'A')
a++;
}
if (a > 0 || ... |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
string s;
cin >> s;
long long int a = 0;
long long int b = 0;
long long int c = 0;
for (long long int i = 0; i < s.size(); ++i) {
if... |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s;
int i, j, n, all, in, fold, c, d;
all = 0;
in = 0;
fold = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s;
if (s == 'A') all++;
if (s == 'I') in++;
if (s == 'F') fold++;
}
if (in == 0)
cout << all;
else if (in ==... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, r = 0;
char s[200000];
cin >> n >> s;
int a = 0, f = 0, i = 0;
for (int j = 0; j < n; ++j) {
if (s[j] == 'A')
++a;
else if (s[j] == 'F')
++f;
else if (s[j] == 'I')
++i;
}
if (i > 0) {
cout << (i == 1 ? 1 : ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, l, a[4] = {}, cnt = 0, maxi = 0;
string s;
cin >> n >> s;
l = s.length();
for (i = 0; i < l; i++) {
if (s[i] == 'A') {
a[1]++;
} else if (s[i] == 'F') {
a[2]++;
} else if (s[i] == 'I') {
a[3]++;
... |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 200005;
int a[MAX];
int main() {
int n;
cin >> n;
string s;
cin >> s;
int a1 = 0, a2 = 0, a3 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') {
a1++;
} else if (s[i] == 'I') {
a2++;
} else {
a3++;
}
}
if (... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, A(0), I(0);
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') {
A++;
} else if (s[i] == 'I') {
I++;
}
}
if (I == 0) {
cout << A << endl;
}
if... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') cnt++;
}
if (cnt == 0) {
for (int i = 0; i < n; i++)
if (s[i] == 'A') cnt++;
cout << cnt;
} else if (cnt == 1) {
cout << 1;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d\n", &n);
char tmp;
int cnt_A = 0;
int cnt_I = 0;
for (int i = 0; i < n; i++) {
scanf("%c", &tmp);
if (tmp == 'A') cnt_A++;
if (tmp == 'I') cnt_I++;
}
if (cnt_I == 0)
printf("%d\n", cnt_A);
else {
if (cnt_I ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int f, i, a;
for (int m = f = i = a = 0; s[m]; ++m) {
if (s[m] == 'A')
++a;
else if (s[m] == 'I')
++i;
else
++f;
}
if (i > 1)
cout << 0;
else if (i == 1)
cout << 1;
else
... |
#include <bits/stdc++.h>
using namespace std;
int mas[30];
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') ++a;
if (s[i] == 'I') ++b;
if (s[i] == 'F') ++c;
}
int cnt = 0;
if (b == 1 && (a > 0 || c > 0)) cnt +=... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int i, cnt1 = 0, cnt2 = 0, cnt3 = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] == 'A')
cnt1++;
else if (s[i] == 'F')
cnt2++;
else
cnt3++;
}
if (cnt3 > 1 || cnt2 == n)
cout ... |
#include <bits/stdc++.h>
int main() {
int n, af(0), r(0);
char s[200002];
std::scanf("%d\n", &n);
std::fgets(s, sizeof(s), stdin);
for (int i(0); i < n; ++i) af += (s[i] == 'A') || (s[i] == 'F');
for (int i(0); i < n; ++i) r += (s[i] != 'F') & (n == af + (s[i] == 'I'));
std::printf("%d\n", r);
return 0;... |
#include <bits/stdc++.h>
char array[200005];
int main() {
long i, j, k, l, m, n, a, f;
scanf("%ld", &n);
scanf("%s", array);
i = 0;
a = 0;
f = 0;
for (j = 0; j < n; j++) {
if (array[j] == 'A')
a++;
else if (array[j] == 'I')
i++;
else
f++;
}
if (i > 1) {
printf("0\n");... |
#include <bits/stdc++.h>
using namespace std;
long long const INF = (long long)1e9;
long long const INF64 = (long long)4e18;
long long const v10e5 = (long long)100000;
long long const v10e6 = (long long)1000000;
long long const v10e9 = (long long)1000000000;
long long const s10e5 = (long long)100000 + 10;
long long con... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int countI = 0, countA = 0, countF = 0;
int n;
char c;
string s = "";
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
s += c;
}
for (int j = 0; j < s.length(); j++) {
if (s.at(j) == 'I')
countI++;
else if (s.at(j) == 'A')... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int length, a = 0, i = 0;
string status;
cin >> length >> status;
for (int x = 0; x < length; x++) {
if (status[x] == 'A') {
a++;
} else if (status[x] == 'I') {
i++;
}
}
if (i == 0) {
cout << a;
} else {
if (i == 1)... |
#include <bits/stdc++.h>
int main(void) {
int n, i, q[] = {0, 0, 0}, ans = 0;
char s[200001];
scanf("%d", &n);
scanf("%s", s);
for (i = 0; i < n; i++) {
if (s[i] == 'A')
q[0]++;
else if (s[i] == 'I')
q[1]++;
else
q[2]++;
}
if (q[1] == 0)
ans = q[0];
else if (q[1] == 1)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x = 0, y = 0;
string a;
cin >> n >> a;
for (int i = 0; i < n; i++) {
if (a[i] == 'I') {
x++;
if (x == 2) {
cout << "0";
return 0;
}
} else ... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
long long n;
scanf("%I64d", &n);
char stringinput[n + 1];
long long countI = 0;
long long countA = 0;
long long countF = 0;
bool flag = true;
scanf("%s", &stringinput);
for (long long i = 0; i < n; i++) {
if (stringin... |
#include <bits/stdc++.h>
using namespace std;
int b[200];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
b[s[i]]++;
}
int i = 'I', f = 'F', a = 'A';
if (!b[i]) {
cout << b[a] << endl;
} else if (b[i] == 1) {
cout << 1 << endl;
} else {
cout << ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int players;
cin >> players;
int probably = 0;
int prob_not = 0;
for (int i = 0; i < players; i++) {
char status;
cin >> status;
if (status == 'I') prob_not++;
if (status != 'F') probably++;
}
if (prob_not == 1 && probably > 1)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char x[1000000];
cin >> n;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
cin >> x[i];
if (x[i] == 'I') {
a++;
} else if (x[i] == 'A') {
b++;
}
}
if (a == 0) {
cout << b;
}
if (a == 1) {
cout << 1;
... |
#include <bits/stdc++.h>
using namespace std;
int a[200500];
int main() {
int n;
scanf("%d", &n);
char c;
int res = 0;
int A = 0;
int F = 0;
int I = 0;
scanf("\n");
for (int i = 0; i < n; i++) {
scanf("%c", &c);
if (c == 'A') {
A++;
}
if (c == 'F') {
F++;
}
if (c ==... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int A = 0, I = 0, F = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A')
A++;
else if (s[i] == 'I')
I++;
else
F++;
}
if (!I)
cout << A;
else if (I == 1)
cout << 1;
els... |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = (1ll << 32);
int main() {
int N;
string s;
cin >> N;
cin >> s;
int F = count(s.begin(), s.end(), 'F');
int A = count(s.begin(), s.end(), 'A');
int I = count(s.begin(), s.end(), 'I');
if (I == 1) {
cout << 1 << endl;
return 0... |
#include <bits/stdc++.h>
char s[200005];
int main() {
int N;
while (scanf("%d", &N) == 1) {
scanf("%s", s);
int n = 0, a = 0, f = 0;
for (int i = 0; i < N; ++i) {
if (s[i] == 'I') n++;
if (s[i] == 'A') a++;
if (s[i] == 'F') f++;
}
if (n >= 2) {
puts("0");
} else if (n... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int f = 0, a = 0, ii = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] == 'F') {
f = 1;
} else if (s[j] == 'A') {
a++;
} else {
ii++;
}
}
int res = 0;
if (ii == 0) {
f... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, l = 0;
string s;
bool tI = 1;
cin >> n >> s;
for (int i = 0; i < ((int)s.size()); i++) {
if (s[i] == 'A' && tI == 1) {
ans++;
}
if (s[i] == 'I') {
tI = 0;
ans = 1;
l++;
}
}
if (l > 1) ans = 0... |
#include <bits/stdc++.h>
using namespace std;
int n, c[2 * 100000 + 10], num[3];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i < n + 1; ++i) {
char t;
cin >> t;
if (t == 'A') {
c[i] = 0;
num[0]++;
} else if (t == 'I') {
c[i] = 1;
num[1]++;
} else... |
#include <bits/stdc++.h>
using namespace std;
std::string int2str(int n) {
std::ostringstream result;
result << n;
return result.str();
}
int str2int(const std::string& s) {
int result;
std::istringstream ss(s);
ss >> result;
if (!ss) throw std::invalid_argument("StrToInt");
return result;
}
int main() ... |
#include <bits/stdc++.h>
int main(void) {
int N;
scanf("%i", &N);
int A = 0;
int F = 0;
int I = 0;
char c;
int i;
scanf("%c", &c);
for (i = 0; i < N; i++) {
scanf("%c", &c);
if (c == 'A')
A++;
else if (c == 'F')
F++;
else if (c == 'I')
I++;
}
if (I == 0) {
pri... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
while (cin >> n >> s) {
int I = 0, A = 0, F = 0;
int len = s.size();
for (int i = 0; i < len; i++) {
if (s[i] == 'A')
A++;
else if (s[i] == 'F')
F++;
else
I++;
}
if (I >= 2) {
... |
#include <bits/stdc++.h>
using namespace std;
int ts, kk = 1;
long long MOD;
template <class T>
inline T _abs(T n) {
return (n < 0 ? -n : n);
}
template <class T>
inline T _max(T a, T b) {
return (a > b ? a : b);
}
template <class T>
inline T _min(T a, T b) {
return (a < b ? a : b);
}
template <class T>
inline T ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s;
int I = 0, A = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s == 'I') I++;
if (s == 'A') A++;
}
if (I == 0) {
cout << A;
}
if (I == 1) {
cout << 1;
}
if (I > 1) {
cout << 0;
}
return 0... |
#include <bits/stdc++.h>
using namespace std;
char s[300005];
int main(int argc, char* argv[]) {
std::ios::sync_with_stdio(false);
int n;
scanf("%d", &n);
scanf("%s", s);
int num_i = 0, num_a = 0;
bool flag_i = false;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') {
flag_i = true;
num_i++;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ic = 0, ac = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') {
ic++;
} else {
if (s[i] == 'A') {
ac++;
}
}
}
if (ic >= 2) {
cout << 0 << endl;
return 0;
}... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<char> v;
long long ca = 0, ci = 0, cf = 0;
for (long long i = 0; i < n; i++) {
char a;
cin >> a;
v.push_back(a);
if (a == 'A') ca++;
... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int I = count(s.begin(), s.end(), 'I');
if (I > 0) {
if (I == 1)
cout << I << endl;
else
cout << 0 << endl;
} else {
cout << count(s.begin(), s.end(), 'A') << endl;
;
}
}
int mai... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ara[3], i, n;
char ch;
cin >> n;
ara[0] = ara[1] = ara[2] = 0;
for (i = 0; i < n; i++) {
cin >> ch;
if (ch == 'A')
ara[0]++;
else if (ch == 'I')
ara[1]++;
else
ara[2]++;
}
if (ara[1] > 1) {
cout << 0 << en... |
#include <bits/stdc++.h>
using namespace std;
int A, I, F;
int main() {
int n, m, i, j, k, sum;
int x, y;
int tc, t;
string str;
cin >> n >> str;
for (i = 0; i < n; i++) {
if (str[i] == 'A')
A++;
else if (str[i] == 'I')
I++;
else
F++;
}
if (I == 0)
cout << A;
else if ... |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 2000000000000000000LL;
const int inf = 0x3f3f3f3f;
const long double EPS = 1e-9;
long long n, m;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
map<char, long long> maps;
int test = 1, tc = 1;
while (t... |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)(INT_MAX - 100);
const int N = (int)(0);
const long long mod = (int)(1e+9 + 7);
int c[3];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int v = 0; v < n; v++) {
if (s[v] == 'F')
c[2]++;
else
c[(s[v] == 'I')]++;
}... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, f = 0, i = 0;
for (int j = 0; j < n; j++) {
if (s[j] == 'A') ++a;
if (s[j] == 'F') ++f;
if (s[j] == 'I') ++i;
}
if (i == 1) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
string s;
cin >> s;
int countA = 0;
int countI = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
countA++;
} else if (s[i] == 'I') {
countI... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, cnt = 0;
cin >> n;
char a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] == 'A') {
ans++;
}
if (a[i] == 'I') {
cnt++;
}
}
if (cnt == 0) {
cout << ans;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.