text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int n, ans, c[3];
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == 'A')
++c[0];
else if (s[i] == 'F')
++c[1];
else
++c[2];
}
for (int i = 0; i < n; ++i) {
if (s[i] == 'A')
--c[0];
else if (s[i] == 'F')
--c[1];
else
--c[2];
if (s[i] != 'F') {
if (!c[2]) ++ans;
}
if (s[i] == 'A')
++c[0];
else if (s[i] == 'F')
++c[1];
else
++c[2];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int countf = 0, counta = 0, counti = 0, count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') counta++;
if (s[i] == 'I') counti++;
if (s[i] == 'F') countf++;
}
count = n - countf;
if (counti > 0) count = count - counta;
if (counti > 1) count = count - counti;
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[222222];
int main() {
int i, n, na = 0, ni = 0, nf = 0;
scanf("%d", &n);
scanf("%s", s);
n = strlen(s);
for (i = 0; i < n; i++) {
if (s[i] == 'A')
na++;
else if (s[i] == 'I')
ni++;
else if (s[i] == 'F')
nf++;
}
if (ni >= 2)
cout << 0 << endl;
else if (ni == 1)
cout << 1 << endl;
else {
cout << na << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int a = count(s.begin(), s.end(), 'A');
int i = count(s.begin(), s.end(), 'I');
int f = count(s.begin(), s.end(), 'F');
if (i > 1)
cout << 0;
else if (i == 1)
cout << 1;
else
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
std::cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
int ans = 0;
int main() {
std::ios_base::sync_with_stdio(false);
int n;
cin >> n;
string inp;
cin >> inp;
int a = 0, f = 0, i = 0;
for (auto& x : inp) {
if (x == 'A') {
a++;
} else if (x == 'F') {
f++;
} else {
i++;
}
}
if (i == 0) {
cout << a;
} else {
if (i == 1) {
cout << 1;
} else {
cout << 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int ans = 0;
cin >> s;
if (s.find("I") != -1) {
for (int i = 0; i < n; i++)
if (s[i] == 'I') {
if (!ans)
ans++;
else {
ans = 0;
break;
}
}
} else {
for (int i = 0; i < n; i++)
if (s[i] == 'A') ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, i, j, k, A = 0, F = 0, I = 0;
char a[200001];
scanf("%d", &n);
getchar();
gets(a);
for (i = 0; a[i] != '\0'; i++) {
if (a[i] == 'A')
A++;
else if (a[i] == 'I')
I++;
}
if (I == 0) {
printf("%d\n", A);
} else if (I == 1)
printf("%d\n", I);
else
printf("0\n");
}
|
#include <bits/stdc++.h>
char str[200010];
int main() {
int n, i, I = 0, A = 0, answer = 0;
scanf("%d%s", &n, str);
for (i = 0; i < n; i++)
if (str[i] == 'I')
I++;
else if (str[i] == 'A')
A++;
if (I == 1)
answer = 1;
else if (I > 1)
answer = 0;
else
answer = A;
printf("%d\n", answer);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (scanf("%d", &n) != EOF) {
char s;
int a = 0, b = 0, i;
getchar();
for (i = 0; i < n; i++) {
s = getchar();
if (s == 'A') a++;
if (s == 'I') b++;
}
if (b == 0) printf("%d\n", a);
if (b == 1) printf("1\n");
if (b > 1) printf("0\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, flag = 0, f1 = 0, f2 = 0, f3 = 0;
char a[200006];
scanf("%d", &n);
scanf("%s", a);
for (i = 0; i < n; i++) {
if (a[i] == 'A') {
f1++;
} else if (a[i] == 'F') {
f2++;
} else if (a[i] == 'I') {
f3++;
}
}
if (f3 >= 2) {
printf("0");
return 0;
} else if (f3 == 0) {
printf("%d", f1);
return 0;
} else {
printf("1");
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const double EPS = 1e-7;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int A = 0, F = 0, I = 0;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
if (c == 'I')
I++;
else if (c == 'F')
F++;
else
A++;
}
if (I == 1)
cout << 1 << endl;
else if (I > 1)
cout << 0 << endl;
else
cout << A << endl;
return 0;
}
|
#include <bits/stdc++.h>
char st[200005];
int main() {
int i = 0, j, n, a = 0, f = 0;
scanf("%d%s", &n, st);
for (j = 0; j < n; j++) {
if (st[j] == 'A')
a++;
else if (st[j] == 'I')
i++;
else
f++;
}
if (i > 1)
printf("0\n");
else if (i == 1)
printf("1\n");
else
printf("%d\n", a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const MAX = 1000 * 100 + 10;
int const MAX2 = 1000 * 1000 + 10;
int const MAX3 = 5000 + 10;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
string x;
cin >> x;
int in = 0;
for (int i = 0; i < x.size(); i++) {
if (x[i] == 'I') in++;
}
int ans = 0;
for (int i = 0; i < x.size(); i++) {
if (x[i] == 'I' && in == 1) ans++;
if (x[i] == 'A' && in == 0) ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
int main() {
int m, i, x, y, z;
char a[999999];
while (scanf("%d%s", &m, a) != EOF) {
x = 0;
y = 0;
z = 0;
for (i = 0; i < m; i++) {
if (a[i] == 'A')
x++;
else if (a[i] == 'F')
y++;
if (a[i] == 'I') z++;
}
if (z == 1)
printf("1\n");
else if (z > 1)
printf("0\n");
if (z == 0) printf("%d\n", x);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int allin = 0;
int in = 0;
int folded = 0;
unsigned char c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
if (c == 'A')
allin++;
else if (c == 'F')
folded++;
else
in++;
}
if (allin == 0 && folded == 0) {
cout << 0 << endl;
return 0;
}
if (in == 1) {
cout << 1 << endl;
return 0;
}
if (in > 1) {
cout << 0 << endl;
return 0;
}
cout << n - folded << endl;
}
|
#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;
string s;
cin >> s;
long long a = 0, b = 0, c = 0;
for (auto i : s) {
if (i == 'I')
b++;
else if (i == 'A')
a++;
else
c++;
}
if (b >= 2) {
return cout << 0, 0;
}
if (b)
cout << 1;
else
cout << a;
}
|
#include <bits/stdc++.h>
char s[200000 + 5];
int main() {
int n, i, A, I;
A = I = 0;
scanf("%d%s", &n, s);
for (i = 0; i < n; i++) {
if (s[i] == 'I')
++I;
else if (s[i] == 'A')
++A;
}
printf("%d", I ? (I == 1 ? 1 : 0) : A);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, i, f;
char c;
int n;
int main() {
scanf("%d", &n);
for (int j = 0; j < n; j++) {
scanf(" %c", &c);
if (c == 'A')
a++;
else if (c == 'I')
i++;
else
f++;
}
if (i == 1)
printf("%d\n", 1);
else if (i > 1)
printf("0\n");
else
printf("%d\n", a);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, in = 0;
int fol = 0;
int all = 0;
char* A;
cin >> n;
A = new char[n];
for (i = 0; i < n; i++) cin >> A[i];
for (i = 0; i < n; i++) {
if (A[i] == 'A') {
all++;
}
if (A[i] == 'I') {
in++;
}
if (A[i] == 'F') {
fol++;
}
}
if (in == 0) {
cout << all;
} else if (in == 1) {
cout << "1";
} else if (n > 1) {
cout << "0";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
string str;
cin >> str;
long long int a = 0, f = 0, i0 = 0, i, j;
for (i = 0; i < str.size(); i++) {
if (str[i] == 'I')
i0++;
else if (str[i] == 'A')
a++;
}
if (i0 > 1)
cout << 0;
else if (i0 == 1)
cout << 1;
else
cout << a;
}
|
#include <bits/stdc++.h>
int main() {
int n, af(0), r(0);
char s[200001];
std::scanf("%d%s", &n, s);
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>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string str;
cin >> str;
int a = 0, i = 0, f = 0;
for (int k = 0; k < str.length(); k++) {
if (str[k] == 'A')
a++;
else if (str[k] == 'I')
i++;
else
f++;
}
if (i == 1)
cout << 1;
else if (i == 0)
cout << a;
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 500100;
char S[N];
int n;
int main(void) {
scanf("%d", &n);
scanf("%s", S);
int len = strlen(S);
int allin = 0, in = 0, fold = 0;
for (int i = 0; S[i]; i++) {
allin += (S[i] == 'A');
in += (S[i] == 'I');
fold += (S[i] == 'F');
}
int sol = 0;
for (int i = 0; S[i]; i++) {
if (S[i] != 'F') {
if (S[i] == 'A') {
if (fold + allin == len) sol++;
} else if (in == 1)
sol++;
}
}
printf("%d\n", sol);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sol1, sol2, sol3, n;
string str;
int main() {
cin >> n >> str;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'A')
sol1++;
else if (str[i] == 'I')
sol2++;
}
sol3 = str.length() - sol1 - sol2;
if (sol2 == 0) {
cout << sol1 << endl;
return 0;
}
if (sol2 > 1)
cout << 0 << endl;
else
cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int count = 0;
string str;
cin >> str;
int A = 0;
int F = 0;
int I = 0;
for (int i = 0; i < n; i++) {
if (str[i] == 'A') {
A++;
} else if (str[i] == 'F') {
F++;
} else if (str[i] == 'I') {
I++;
}
}
if (I == 0) {
cout << A;
return 0;
}
if (I > 1) {
cout << 0;
return 0;
}
cout << I;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, in, all, folded;
char a[200001];
void quickSort(int arr[], int left, int right) {
int i = left, j = right;
int tmp;
int pivot = arr[(left + right) / 2];
while (i <= j) {
while (arr[i] < pivot) i++;
while (arr[j] > pivot) j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
};
if (left < j) quickSort(arr, left, j);
if (i < right) quickSort(arr, i, right);
}
int main() {
cin >> n >> a;
in = all = folded = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 'A')
all++;
else if (a[i] == 'F')
folded++;
else
in++;
}
if (in == 0) {
cout << all << endl;
} else if (in == 1) {
cout << in << endl;
} else {
cout << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int a[3];
int main() {
int p;
scanf("%d", &p);
for (int i = 0; i < p; ++i) {
char c;
scanf("\n%c", &c);
if (c == 'F') ++a[0];
if (c == 'I') ++a[1];
if (c == 'A') ++a[2];
}
if (a[1] > 1) {
printf("0\n");
return 0;
}
if (a[1] == 1) {
printf("1\n");
return 0;
}
printf("%d\n", a[2]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int str_len, I_count = 0, A_count = 0;
string inp;
cin >> str_len;
cin >> inp;
for (int i = 0; i < inp.size(); i++) {
if (inp[i] == 'I') I_count++;
if (inp[i] == 'A') A_count++;
}
if (I_count > 1)
cout << "0"
<< "\n";
else if (I_count == 1)
cout << "1"
<< "\n";
else
cout << A_count << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long p, ka = 0, ki = 0;
cin >> p;
char str;
for (long i = 0; i < p; i++) {
cin >> str;
if (str == 'A') ka++;
if (str == 'I') ki++;
}
if (ki > 1) cout << 0;
if (ki == 1) cout << 1;
if (ki == 0) cout << ka;
return 0;
}
|
#include <bits/stdc++.h>
char str[210000];
int a, f, i;
int main() {
int len;
scanf("%d", &len);
scanf("%s", str);
int cnt;
for (cnt = 0; cnt < len; cnt++) {
if (str[cnt] == 'A')
a++;
else if (str[cnt] == 'F')
f++;
else
i++;
}
if (0 == i)
printf("%d\n", a);
else if (1 == i)
printf("1\n");
else
printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x, y, z;
signed main() {
long long n;
cin >> n;
char w;
for (long long i = 1; i <= n; i++) {
cin >> w;
switch (w) {
case 'A': {
x++;
break;
}
case 'F': {
y++;
break;
}
case 'I': {
z++;
break;
}
}
}
if (z == 0) {
cout << x << endl;
return 0;
}
if (z == 1) {
cout << 1 << endl;
return 0;
}
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
vector<long long> a(3, 0);
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') a[0]++;
if (s[i] == 'I') a[1]++;
if (s[i] == 'F') a[2]++;
}
long long count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' && a[1] == 0) count++;
if (s[i] == 'I' && a[1] == 1) count++;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxint = -1u >> 1;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int a, f, t;
a = f = t = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'A') a++;
if (str[i] == 'I') t++;
if (str[i] == 'F') f++;
}
if (t == 0) {
cout << a << endl;
return 0;
}
if (t == 1) {
cout << t << endl;
return 0;
}
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long power(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long min(long long a, long long b) {
if (a > b)
return b;
else
return a;
}
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
vector<long long> div(long long n) {
vector<long long> v;
for (int i = 1; i * i <= n; i++) {
if ((n % i) == 0) {
if (i == n / i)
v.push_back(i);
else {
v.push_back(i);
v.push_back(n / i);
}
}
}
return v;
}
long long isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
bool isPowerOfTwo(long long n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
long long power1(long long x, long long y) {
long long temp;
if (y == 0) return 1LL;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
if (a.first > b.first)
return true;
else if (a.first < b.first)
return false;
else {
if (a.second < b.second)
return true;
else
return false;
}
}
const int N = 1000;
char s[N];
void solve() {
long long n, ca = 0, ci = 0, cf = 0;
char in;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> in;
if (in == 'A')
ca += 1;
else if (in == 'I')
ci += 1;
else if (in == 'F')
cf += 1;
}
if (ci >= 2)
cout << 0 << "\n";
else if (ci == 1)
cout << 1 << "\n";
else
cout << ca << "\n";
}
int main() {
int T;
T = 1;
while (T--) {
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
<< "ms\n";
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int a, b, c;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') a++;
if (s[i] == 'F') b++;
if (s[i] == 'I') c++;
}
if (c == 0) cout << a << endl;
if (c == 1) cout << c << endl;
if (c > 1) cout << "0" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[200001];
int main() {
int N;
while (~scanf("%d", &N)) {
scanf("%s", s);
int counter = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'I') counter++;
}
if (counter > 1) {
printf("0\n");
} else if (counter == 1) {
printf("1\n");
} else {
int result = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'A') result++;
}
printf("%d\n", result);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline double sqr(double x) { return x * x; }
int gcd(int a, int b) { return 0 == b ? a : gcd(b, a % b); }
char s[200002];
int main() {
int f, a, i, res;
f = a = i = res = 0;
int n;
scanf(" %d", &n);
for (int(j) = (0); (j) < (n); (j)++) {
scanf(" %c", &s[j]);
if ('F' == s[j])
f++;
else if ('A' == s[j])
a++;
else
i++;
}
if (i > 1)
res = 0;
else if (i == 1)
res = 1;
else
res = a;
printf("%d ", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int a = 0, i = 0;
for (char c : s) {
if (c == 'A')
a++;
else if (c == 'I')
i++;
if (i > 1) {
cout << 0;
return 0;
}
}
if (i == 1)
cout << 1;
else
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void play() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int arr[3];
int main() {
play();
int n;
string s;
cin >> n >> s;
for (int j = 0; j < n; j++) {
if (s[j] == 'I')
arr[0]++;
else if (s[j] == 'A')
arr[1]++;
}
if (arr[0] == 0)
cout << arr[1];
else if (arr[0] == 1)
cout << 1;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
string s;
cin >> s;
int ti = 0, ta = 0;
for (int i = 0; s[i]; ++i) {
if (s[i] == 'I')
++ti;
else if (s[i] == 'A')
++ta;
}
if (!ti)
cout << ta << '\n';
else if (ti == 1)
cout << 1 << '\n';
else
cout << 0 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, a, f, i, j, count;
a = f = i = count = 0;
cin >> n;
char s[n];
for (j = 0; j < n; j++) {
cin >> s[j];
if (s[j] == 'F')
f++;
else if (s[j] == 'A')
a++;
else if (s[j] == 'I')
i++;
}
if (i > 1)
count = 0;
else if (i == 1)
count = 1;
else
count = a;
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, res = 0, countOfI = 0;
cin >> n;
string str;
cin >> str;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'A') {
res++;
} else if (str[i] == 'I') {
countOfI++;
}
}
res = countOfI > 1 ? 0 : (countOfI == 0 ? res : countOfI);
cout << res << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, f = 0, in = 0, n;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') {
a++;
}
if (s[i] == 'F') {
f++;
}
if (s[i] == 'I') {
in++;
}
}
if (in > 0) {
if (in > 1) {
cout << 0 << endl;
return 0;
}
cout << in << endl;
return 0;
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
const long long INF = 2009000999;
const float cp = 2 * acos(0.0);
const float eps = 1e-18;
using namespace std;
int main() {
char x;
long long n, a = 0, b = 0, c = 0;
cin >> n;
for (int(i) = 0; (i) < (n); i++) {
cin >> x;
if (x == 'A') a++;
if (x == 'F') b++;
if (x == 'I') c++;
}
if (c > 1)
cout << "0";
else if (c == 1)
cout << "1";
else
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, z, ot = 0, x, in = 0, f = 0;
char s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
if (s == 'I') in++;
if (s == 'F') f++;
}
if (in > 1)
cout << "0" << endl;
else if (in == 1)
cout << "1" << endl;
else
cout << n - f << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[2 * 100000 + 5];
int main() {
int n, i, j, k, Ans;
while (scanf("%d", &n) != EOF) {
scanf("%s", str);
int A, F, I;
A = F = I = 0;
for (i = 0; i < n; i++) {
if (str[i] == 'A') A++;
if (str[i] == 'F') F++;
if (str[i] == 'I') I++;
}
if (I > 1) {
printf("0\n");
continue;
}
if (I == 1) {
printf("1\n");
continue;
}
if (I == 0) {
printf("%d\n", A);
continue;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int ans = 0;
int countA = 0;
for (int i = 0; i < n; i++) {
if (str[i] == 'I') {
ans++;
} else if (str[i] == 'A') {
countA++;
}
}
if (ans == 0) {
cout << countA;
} else {
if (ans > 1) {
cout << 0;
} else {
cout << 1;
}
}
int end;
cin >> end;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, ans = 0, f = 0, a = 0, ii = 0;
cin >> t;
char str[1000000];
cin >> str;
for (int i = 0; i < strlen(str); i++) {
if (str[i] == 'A')
a++;
else if (str[i] == 'F')
f++;
else
ii++;
}
if (ii > 1)
cout << 0;
else if (ii == 1)
cout << 1;
else
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int io = 0, ao = 0, showerCows = 0, n;
cin >> n;
vector<char> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] == 'I') io++;
if (v[i] == 'A') ao++;
}
if (io == 1) {
cout << "1";
return 0;
}
if (io > 1) {
cout << "0";
return 0;
}
cout << ao;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ci = 0, ca = 0;
cin >> n;
char arr[n];
cin >> arr;
for (int i = 0; i < n; i++) {
if (arr[i] == 'I')
ci++;
else if (arr[i] == 'A')
ca++;
}
if (ci == 0)
cout << ca;
else if (ci == 1)
cout << 1;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
int ui = 0, uf = 0, ua = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 'A') {
ua++;
} else if (a[i] == 'I') {
ui++;
}
}
if (ui >= 2) {
cout << 0;
} else if (ui == 1) {
cout << 1;
} else
cout << ua;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, A = 0, F = 0, I = 0, cnt = 0;
char data[200005];
cin >> n >> data;
for (i = 0; i < n; i++) data[i] == 'A' ? A++ : (data[i] == 'F' ? F++ : I++);
if (!I)
cnt = A;
else if (I == 1)
cnt = 1;
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a % b == 0) return b;
gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long int n, t, d = 0, f = 0, d2 = 0;
char str[200010];
scanf("%lld", &n);
scanf("%s", str);
for (long long int i = 0; i < n; i++) {
if (str[i] == 'A')
d++;
else if (str[i] == 'I')
d2++;
}
if (d2 == 1)
printf("1");
else if (d2 > 1)
printf("0");
else
printf("%lld", d);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
map<char, int> mapper;
char str[200010];
scanf("%d", &n);
scanf("%s", str);
for (int i = 0; i < n; i++) {
mapper[str[i]]++;
}
if (mapper['I'] == 0) {
printf("%d", mapper['A']);
} else if (mapper['I'] == 1)
printf("1");
else
printf("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[3] = {0};
cin >> n;
char c;
for (int i = 0; i < n; i++) {
cin >> c;
if (c == 'A') a[0]++;
if (c == 'I') a[1]++;
}
if (a[1] == 0) {
cout << a[0];
} else if (a[1] == 1)
cout << 1;
else if (a[1] > 1)
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[300000];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
scanf("%s", a);
int len = strlen(a);
int ii = 0, aa = 0;
for (int i = 0; i < len; ++i) {
if (a[i] == 'I')
ii++;
else if (a[i] == 'A')
aa++;
}
if (ii == 0)
printf("%d\n", aa);
else if (ii == 1)
printf("1\n");
else
printf("0\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string cows;
cin >> cows;
int cou = 0;
sort(cows.begin(), cows.end());
for (int i = 0; i < cows.size(); i++) {
if (cows[i] == 'A' || cows[i] == 'I') {
if (!binary_search(cows.begin(), cows.begin() + i, 'I') &&
!binary_search(cows.begin() + i + 1, cows.end(), 'I'))
cou++;
}
}
cout << cou << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n;
cin >> s;
int a = 0, b = 0, c = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'I') {
a++;
} else if (s[i] == 'A') {
b++;
} else {
c++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') {
b--;
if (b + c == n - 1) {
ans++;
}
b++;
} else if (s[i] == 'I') {
a--;
if (b + c == n - 1) {
ans++;
}
a++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000000];
int main() {
int N;
scanf("%d%s", &N, &s);
int a = 0;
int f = 0;
int i = 0;
for (int j = 0; j < N; j++) {
if (s[j] == 'A') a++;
if (s[j] == 'I') i++;
if (s[j] == 'F') f++;
}
int res = 0;
for (int j = 0; j < N; j++)
if ((s[j] == 'A' && i == 0) || (i == 1 && s[j] == 'I')) res++;
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, l, res = 0, in = 0, all = 0;
scanf("%d", &n);
char ch[n + 5];
scanf("%s", ch);
getchar();
res = 0;
for (i = 0; i < n; i++) {
if (ch[i] == 'A') all++;
if (ch[i] == 'I') in++;
}
if (in == 0)
res = all;
else if (in == 1)
res = 1;
else
res = 0;
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, A = 0, I = 0, F = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') I++;
if (s[i] == 'F') F++;
if (s[i] == 'A') A++;
}
if (I == 0)
cout << A;
else if (I == 1)
cout << 1;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
getchar();
int a = 0, f = 0, in = 0;
for (int i = 0; i < (n); ++i) {
char t;
scanf("%c", &t);
if (t == 'A') a++;
if (t == 'I') in++;
if (t == 'F') f++;
}
if (in > 1)
printf("0\n");
else {
if (in == 1)
printf("1\n");
else {
printf("%d\n", a);
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int num_players, bet_A, bet_I, i;
scanf("%d", &num_players);
char str[num_players + 1];
bet_A = bet_I = 0;
scanf("%s", str);
for (i = 0; i < num_players; i++) {
if (str[i] == 'A')
bet_A++;
else if (str[i] == 'I')
bet_I++;
}
if (bet_I >= 2)
printf("0");
else if (bet_I == 1)
printf("1");
else
printf("%d", bet_A);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, r, s, k, flag;
char a[200010];
while (scanf("%d", &n) != EOF) {
getchar();
gets(a);
r = 0;
s = 0;
k = 0;
for (i = 0; i < n; i++) {
if (a[i] == 'A')
r++;
else if (a[i] == 'I')
s++;
else
k++;
}
if (s == 0)
printf("%d\n", r);
else if (s == 1)
printf("%d\n", 1);
else
printf("%d\n", 0);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int atmosphere(0), temp(0);
char mode;
for (int i = 0; i < num; i++) {
cin >> mode;
if (mode == 'I') atmosphere++;
if (mode == 'A') temp++;
}
if (atmosphere == 0) cout << temp;
if (atmosphere == 1) cout << 1;
if (atmosphere >= 2) cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, i = 0;
cin >> n;
while (n--) {
char c;
cin >> c;
if (c == 'A')
a++;
else if (c == 'I')
i++;
}
cout << (i == 0 ? a : (i == 1 ? 1 : 0));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%i", &n);
char s[n];
scanf("%s", &s);
int cnt = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') cnt++;
if (s[i] == 'A') ans++;
}
if (cnt == 0)
printf("%i", ans);
else if (cnt == 1)
printf("1");
else
printf("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ca = 0, cf = 0, ci = 0;
cin >> n;
for (int i = 0; i < n; i++) {
char s;
cin >> s;
if (s == 'F') cf++;
if (s == 'I') ci++;
if (s == 'A') ca++;
}
if (ci == 0) cout << ca;
if (ci == 1) cout << 1;
if (ci > 1) cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, answer, cnt, acnt;
string p;
int main() {
cin >> n;
cin >> p;
answer = n;
for (int i = 0; i < n; i++) {
if (p[i] == 'F') {
answer--;
}
if (p[i] == 'I') {
cnt++;
}
if (p[i] == 'A') {
acnt++;
}
}
if (cnt >= 2) {
cout << 0;
}
if (cnt == 1) {
cout << 1;
}
if (cnt <= 0) {
cout << acnt;
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct coo {
long long a, b, c, d;
};
bool comp(struct coo a, struct coo b) { return a.a < b.a; }
int main() {
long long n, m;
long long i, j, k;
long long x;
long long t;
cin >> n;
string a;
cin >> a;
int l = a.size();
int couna = 0, couni = 0;
for (i = 0; i < l; i++) {
if (a[i] == 'A') couna++;
if (a[i] == 'I') couni++;
}
if (couni == 0) {
cout << couna << endl;
return 0;
}
if (couni == 1) {
cout << 1 << endl;
return 0;
}
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, l = 0, f = 0;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'A')
a++;
else if (s[i] == 'I')
l++;
else
f++;
}
if (l >= 2)
cout << 0;
else if (l == 1)
cout << 1;
else
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt = 0;
string s;
int cnta, cnti, cntf;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'F')
cntf++;
else if (s[i] == 'I')
cnti++;
else
cnta++;
}
if (cnti == 0)
cout << cnta << endl;
else if (cnti == 1)
cout << "1\n";
else
cout << "0\n" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ca, cf, ci;
ca = cf = ci = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A')
ca++;
else if (s[i] == 'F')
cf++;
else
ci++;
}
if (ci == 0)
cout << ca;
else if (ci == 1)
cout << "1";
else
cout << "0";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200002;
char str[maxn];
int n;
int main() {
while (~scanf("%d", &n)) {
scanf("%s", str);
int cnt = 0;
for (int i = 0; str[i] != '\0'; i++) {
if (str[i] == 'I') cnt++;
}
if (cnt == 1)
puts("1");
else if (cnt > 1)
puts("0");
else {
cnt = 0;
for (int i = 0; str[i] != '\0'; i++) {
if (str[i] == 'A') cnt++;
}
printf("%d\n", cnt);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 200005;
int n;
char str[NMAX];
int in, allin;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
cin >> str;
for (int i = 0; i < n; ++i)
if (str[i] == 'A')
++allin;
else if (str[i] == 'I')
++in;
if (!in)
cout << allin << "\n";
else
cout << (in == 1 ? 1 : 0) << "\n";
return 0;
}
|
#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 << "MAIN : char lidos =" << n << endl;
cout << "QTDE_I = " << qtde_i << endl;
cout << "QTDE_A = " << qtde_a << endl;
}
if (qtde_i > 0) {
if (qtde_i > 1) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} else {
cout << qtde_a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[200100];
cin >> s;
int a1 = 0, f1 = 0, i1 = 0, i;
for (i = 0; s[i] != '\0'; i++) {
if (s[i] == 'A') a1++;
if (s[i] == 'F') f1++;
if (s[i] == 'I') i1++;
}
if (i1 > 1) {
cout << "0"
<< "\n";
} else {
if (i1 == 1) {
cout << "1"
<< "\n";
} else {
cout << a1 << "\n";
}
}
cin >> i;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int p;
cin >> p;
string S;
cin >> S;
int numA = 0, numF = 0, numI = 0;
for (int i = (0); i < (int((S).size())); ++i) {
if (S[i] == 'A')
numA++;
else if (S[i] == 'F')
numF++;
else
numI++;
}
if (numI == 0)
cout << numA << endl;
else if (numI == 1)
cout << 1 << endl;
else
cout << 0 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string c;
cin >> c;
int ans = 0;
bool flag = true;
for (int i = (0); i <= (c.size()); i++) {
if (flag) {
(c[i] == 'A') ? ++ans : 0;
if (c[i] == 'I') {
flag = !flag;
ans = 1;
}
} else {
if (c[i] == 'I') {
cout << "0";
return 0;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
char s[200001];
scanf("%s", s);
int countA = 0, countI = 0;
for (int i = 0; s[i]; i++) {
if (s[i] == 'A')
countA++;
else if (s[i] == 'I')
countI++;
}
int ans = 0;
if (countI == 1)
printf("%d\n", countI);
else if (!countI)
printf("%d\n", countA);
else
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a = 0, f = 0, ii = 0, ans = 0;
cin >> n;
char *arr = new char[n];
for (i = 0; i < n; i++) cin >> arr[i];
for (i = 0; i < n; i++) {
if (arr[i] == 'A')
a++;
else if (arr[i] == 'F')
f++;
else
ii++;
}
if (ii > 1) {
cout << "0" << endl;
return 0;
} else if (ii == 0) {
cout << a << endl;
return 0;
} else if (ii == 1) {
cout << "1" << endl;
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long countdigit(long long n);
long long power(long long x, long long y);
long long eg(long long a, long long b);
bool isprime(long long n);
vector<long long> aaja(long long n);
vector<long long> soe(long long n);
vector<long long> aaja(long long n) {
long long i, j;
vector<long long> v;
for (i = 0; i < n; i++) {
cin >> j;
v.push_back(j);
}
return v;
}
long long mjekrtehai() {
long long i, n, a = 0, I = 0;
string s;
cin >> n >> s;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'A') a++;
if (s[i] == 'I') I++;
}
if (I and I <= 1) {
cout << 1 << "\n";
return 0;
} else if (I > 1) {
cout << 0 << "\n";
return 0;
}
cout << a << "\n";
return 0;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) mjekrtehai();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const long double pi = acos(-1);
const long long maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const long long INF = 1e18;
const int MX = 2000000001;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
long long t, q, n, a, b, c, d, k, l, m, r, x = 0, y = 0, z = 0, sum = 0,
ans = 0, temp = 0, res = 0;
string second;
cin >> n >> second;
a = b = c = 0;
for (auto x : second) {
a += (x == 'A');
b += (x == 'I');
c += (x == 'F');
}
cout << (b > 1 ? 0 : (b == 1 ? 1 : a));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char f;
int kol = 0;
long long a[3] = {0};
while (cin >> f) {
if (f == 'A') a[0]++;
if (f == 'I') a[1]++;
if (f == 'F') a[2]++;
}
if (a[1] == 1) cout << 1 << endl;
if (a[1] > 1) cout << 0;
if (a[1] == 0) cout << a[0] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long i64 = 4611686018427387904;
long double dist(long double x1, long double y1, long double x2,
long double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long nok(long long a, long long b) { return (a * b) / gcd(a, b); }
long long hash(string s, unsigned long long alph, unsigned long long mod) {
long long h = 0, p = alph;
for (int i = 0; i < s.size(); i++) {
h += (s[i] - 'a' + 1) * p;
p *= alph;
h %= i64;
}
return h;
}
bool F(long double ax1, long double ay1, long double ax2, long double ay2,
long double bx1, long double by1, long double bx2, long double by2) {
long double v1, v2, v3, v4;
v1 = (bx2 - bx1) * (ay1 - by1) - (by2 - by1) * (ax1 - bx1);
v2 = (bx2 - bx1) * (ay2 - by1) - (by2 - by1) * (ax2 - bx1);
v3 = (ax2 - ax1) * (by1 - ay1) - (ay2 - ay1) * (bx1 - ax1);
v4 = (ax2 - ax1) * (by2 - ay1) - (ay2 - ay1) * (bx2 - ax1);
return (v1 * v2 < 0) && (v3 * v4 < 0);
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
bool w = false;
int ans = 0;
for (int i = 0; i < n; i++) {
char t;
cin >> t;
if (t == 'I') {
if (w == true) {
cout << 0;
return 0;
} else {
w = true;
}
} else {
if (t == 'A') {
ans++;
}
}
}
if (w == true) {
cout << 1;
} else {
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[5];
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'A')
arr[0]++;
else if (s[i] == 'F')
arr[1]++;
else
arr[2]++;
}
if (arr[2] == 0)
cout << arr[0];
else if (arr[2] == 1)
cout << 1;
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1E-8;
char s[200001];
bool solve() {
int n;
if (scanf("%d%s", &n, s) == EOF) return false;
int a = 0, f = 0, i = 0;
for (char *c = s; *c; ++c) switch (*c) {
case 'A':
a++;
break;
case 'F':
f++;
break;
case 'I':
i++;
break;
}
if (i == 1)
printf("1\n");
else if (i == 0)
printf("%d\n", a + i);
else
printf("0\n");
return true;
}
int main() { solve(); }
|
#include <bits/stdc++.h>
using namespace std;
long long INF = 10000000000000001;
int k, n, m;
char line[2 * 100009];
int main() {
cin >> n;
cin >> line;
int a = 0, f = 0, I = 0;
for (int i = 0; i < strlen(line); i++) {
if (line[i] == 'A')
a++;
else if (line[i] == 'I')
I++;
else
f++;
}
if (I > 1) {
cout << 0 << endl;
} else if (I == 1 && (f || a)) {
cout << 1 << endl;
} else {
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T abs(T x) {
if (x < 0) return -x;
return x;
}
int n, res, nI, nA, nF;
string str;
int main() {
cin >> n;
cin >> str;
nI = 0;
nA = 0;
nF = 0;
for (int i = 0; i < n; i++) {
if (str[i] == 'A') {
nA++;
} else if (str[i] == 'F') {
nF++;
} else {
nI++;
}
}
res = 0;
for (int i = 0; i < n; i++)
if (str[i] == 'A') {
if (nI == 0) res++;
} else if (str[i] == 'I') {
if (nI == 1) res++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int SIZE;
cin >> SIZE;
char arr[SIZE];
for (int i = 0; i < SIZE; i++) {
cin >> arr[i];
}
int cntr = 0;
int k = 0;
for (int i = 0; i < SIZE; i++) {
if (arr[i] == 'A') {
cntr++;
}
if (arr[i] == 'I') {
k++;
}
}
if (k == 1) {
cout << 1;
} else if (k > 1) {
cout << 0;
} else {
cout << cntr;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int is, fs, as, n;
is = fs = as = 0;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'A') as++;
if (s[i] == 'I') is++;
if (s[i] == 'F') fs++;
}
if (is == 0)
cout << as << endl;
else if (is > 1)
cout << 0 << endl;
else if (is == 1)
cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x = 0, javab = 0;
string a;
int main() {
cin >> n >> a;
for (int i = 0; i < (int)a.size(); i++)
if (a[i] == 'I') x++;
for (int i = 0; i < (int)a.size(); i++) {
if (a[i] == 'A' && x <= 0)
javab++;
else if (a[i] == 'I' && x - 1 <= 0)
javab++;
}
cout << javab << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.first > b.first);
}
long long isPrime(long long n) {
if (n <= 1) return 0;
for (long long i = 2; i < n; i++)
if (n % i == 0) return 0;
return 1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
map<char, long long> m;
string s;
cin >> s;
for (long long i = 0; i < s.size(); i++) m[s[i]]++;
if (m['I'] > 1) {
cout << "0";
return 0;
} else if (m['I'] == 1) {
cout << "1";
return 0;
} else {
cout << m['A'];
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int flag1;
flag1 = 0;
int flag2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') {
flag1++;
}
if (s[i] == 'A') {
flag2++;
}
}
if (flag1 == 0) {
cout << flag2 << endl;
} else if (flag1 == 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long int n;
cin >> n;
getline(cin, s);
getline(cin, s);
long long int l = s.length();
long long int a = 0, ii = 0, f = 0;
for (long long int i = 0; i < l; i++) {
if (s[i] == 'A') {
a++;
} else {
if (s[i] == 'I') {
ii++;
} else {
f++;
}
}
}
if (ii == 0) {
cout << a << endl;
} else {
if (ii == 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long LLMAX = 9223372036854775807LL;
const int maxn = 1000 + 10;
char str[200000 + 100];
int main() {
int ans = 0, n;
int cnt[3] = {0};
scanf("%d\n", &n);
gets(str);
for (int i = 0; i < n; ++i) {
if (str[i] == 'A')
cnt[0]++;
else if (str[i] == 'F')
cnt[1]++;
else
cnt[2]++;
}
if (cnt[2] > 0) {
if (cnt[2] == 1)
puts("1");
else
puts("0");
} else
printf("%d\n", cnt[0]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, c = 0, x, y, z;
cin >> a;
char s[200001];
cin >> s;
x = count(s, s + a, 'A');
y = count(s, s + a, 'I');
z = count(s, s + a, 'F');
if (y == 1) {
cout << "1";
} else if (y == 0) {
cout << x;
} else {
cout << "0";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5;
int a[N];
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ii = 0, aa = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') ii++;
if (s[i] == 'A') aa++;
}
if (ii > 1) cout << 0 << endl;
if (ii == 1) cout << 1 << endl;
if (ii == 0) cout << aa << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string str, str2;
long long n, m, t, k, j, p;
void printVec(string desc, vector<unsigned long long> vec) {
cout << desc << ":" << endl;
for (unsigned long long x = 0; x < vec.size(); x++) {
cout << vec[x] << " ";
}
cout << endl;
}
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
cin >> n;
cin >> str;
int data[3];
memset(data, 0, sizeof(data));
for (int x = 0; x < n; x++) {
if (str[x] == 'A') {
data[0]++;
} else if (str[x] == 'F') {
data[1]++;
} else {
data[2]++;
}
}
int total = 0;
if (data[2] == 0) {
total += data[0];
}
if (data[2] == 1) {
total += 1;
}
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
char niz[200100];
int b[256];
int main() {
int n, i, j;
scanf("%d\n", &n);
scanf("%s", niz);
for (i = 0; i < n; i++) {
b[niz[i]]++;
}
if (b['I']) {
if (b['I'] > 1) {
printf("0\n");
} else {
printf("1\n");
}
} else {
printf("%d\n", b['A']);
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.