solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#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;
}
| 8 |
CPP
|
n=int(input())
a=input()
cnt=0
A=0
for i in range(0,n):
if(a[i]=='I'): cnt+=1
if(a[i]=='A'): A+=1
if(cnt==0):
print(A)
elif(cnt==1):
print(1)
else :print(0)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
n = int(input())
s=input()
c=0
if s.count("I")==1:
print(1)
elif s.count("I")>=2:
print(0)
else:
print(s.count("A"))
| 8 |
PYTHON3
|
a=int(input())
b=input()
if b.count('I')==0:
print(b.count('A'))
elif b.count('I')==1:
print(1)
else:
print(0)
| 8 |
PYTHON3
|
n = int(input())
s=input()
a = s.count('A')
f = s.count('F')
i = s.count('I')
if(i>0 and i==1):
print(1)
elif(i==0 and a>0):
print(a)
else:
print(0)
| 8 |
PYTHON3
|
n=int(input())
s=input()
if s.count('F')==n:
print(0)
exit()
if s.count('I')==0:
print(s.count('A'))
exit()
if s.count('I')==1:
print(1)
exit()
if s.count('I')>1:
print(0)
exit()
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
n = int(input())
t = input()
k = t.count('I')
if k > 1: print(0)
elif k == 1: print(1)
else: print(t.count('A'))
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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';
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
import math
import itertools
import collections
def getdict(n):
d = {}
if type(n) is list or type(n) is str:
for i in n:
if i in d:
d[i] += 1
else:
d[i] = 1
else:
for i in range(n):
t = ii()
if t in d:
d[t] += 1
else:
d[t] = 1
return d
def cdiv(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a*b) // math.gcd(a, b)
def wr(arr): return ' '.join(map(str, arr))
def prime(n):
if n == 2:
return True
if n % 2 == 0 or n <= 1:
return False
sqr = int(math.sqrt(n)) + 1
for d in range(3, sqr, 2):
if n % d == 0:
return False
return True
def revn(n):
m = 0
while n > 0:
m = m * 10 + n % 10
n = n // 10
return m
n = ii()
s = input()
cl = getdict(s)
keys = ['A', 'F', 'I']
for key in keys:
if key not in cl:
cl[key] = 0
if cl['I'] == 0:
print(cl['A'])
elif cl['I'] == 1:
print(1)
else:
print(0)
| 8 |
PYTHON3
|
n = int(input())
s = input()
A,I=0,0
for i in range(n):
if s[i]=="A":
A+=1
elif s[i]=="I":
I+=1
if I>1:
print(0)
elif I:
print(1)
else:
print(A)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
nb_cows = int(input())
status = input()
icount = status.count("I")
if icount == 1:
print(1)
elif icount > 1:
print(0)
else:
print(status.count("A"))
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
from collections import Counter
input()
s =Counter(input())
print([0,1][s['I'] == 1] if 'I' in s.keys() else s['A'])
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
import sys
f = sys.stdin
#f = open("input.txt", "r")
def solve():
n = int(f.readline())
b = f.readline()
count = 0
if b.count("I") == 1:
print(1)
return
elif b.count("I") > 1:
print(0)
return
else:
b = b.replace("I", "")
print(b.count("A"))
solve()
| 8 |
PYTHON3
|
N=int(input())
s=input()
x=s.count('I')
if(x==0):
print(s.count('A'))
elif(x==1):
print(1)
else:
print(0)
| 8 |
PYTHON3
|
n = int(input())
s = input()
a,i = s.count('A'), s.count('I')
print((a,1,0)[min(i,2)])
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
# your code goes here
n = int(input())
players = input()
show_players = 0
index = players.find('I')
index2 = players[index + 1:].find('I')
if index2 == -1:
if index == -1:
print(players.count('A'))
else:
print(1)
else:
print(0)
| 8 |
PYTHON3
|
a=int(input())
b=input()
c=b.count("I")
if(c>1):
print(0)
elif(c==1):
print(1)
else:
print(b.count("A"))
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
n=int(input())
arr=list(input())
if arr.count("I")==0:
print(arr.count("A"))
elif arr.count("I")==1:
print(1)
else:
print(0)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
a = int(input())
s = input()
b = {'A':0, 'I':0, 'F':0}
for i in s:
b[i] += 1
if b['I'] > 1:
print(0)
elif b['I'] == 1:
print(1)
else:
print(b['A'])
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
n = int(input())
ent = input()
a = 0
f = 0
i = 0
for _ in range (0, len(ent)):
if ent[_] == "A":
a+= 1
elif ent[_] == "F":
f += 1
elif ent[_] == "I":
i += 1
if i == 0:
print(a)
else:
if i >= 2:
print("0")
else:
print("1")
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
n = int(input());t = input();k = t.count('I')
if k > 1: print(0)
elif k == 1: print(1)
else: print(t.count('A'))
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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);
}
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
def solve():
import sys
f = sys.stdin
n = int(f.readline())
s = f.readline()
if "I" in s:
if s.count("I")==1:
print(1)
else:
print(0)
else:
print(s.count("A"))
if __name__=="__main__":
solve()
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
n = int(input())
s = input()
a=s.count("I")
if a==1:
print(1)
elif a>1:
print(0)
else:
b=s.count("A")
print(b)
| 8 |
PYTHON3
|
A = int(input())
V = input()
F=0
A=0
I=0
for i in range(len(V)):
if V[i]=='F':
F+=1
elif V[i]=='A':
A+=1
else:
I+=1
if I>=2:
print(0)
else:
if I:
print(1)
else:
if A:
print(A)
else:
print(0)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
from collections import Counter
def get_ans():
n = input()
c = Counter(input())
a = c['A']
f = c['F']
i = c['I']
if i != 0:
if i != 1:
return 0
else:
return 1
if c['A'] != 0:
return c['A']
return 0
ans = get_ans()
print(ans)
| 8 |
PYTHON3
|
n=int(input())
s=input()
a=0
f=0
j=0
for i in s:
if(i=="A"):
a=a+1
elif(i=="F"):
f=f+1
else:
j=j+1
z=0
if(a!=0 and j==0):
z=z+a
if(j==1):
z=z+j
print(z)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
}
| 8 |
CPP
|
a,f,ii,n,s=0,0,0,int(input()),str(input())
for i in range(n):
if s[i]=='I':
ii+=1
if s[i]=='A':
a+=1
if s[i]=='F':
f+=1
if ii>1:
ii=0
print(a if s.find('I')==-1 else ii)
| 8 |
PYTHON3
|
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import insort, bisect_right, bisect_left
import threading, sys
def main():
n = int(input())
s = input()
a = s.count('A')
i = s.count('I')
ans = 0
if i == 0:
ans = a
else:
if i == 1:
ans = 1
print(ans)
if __name__ == "__main__":
"""sys.setrecursionlimit(400000)
threading.stack_size(40960000)"""
thread = threading.Thread(target=main)
thread.start()
| 8 |
PYTHON3
|
from collections import Counter
def main():
input()
cnt = Counter(input())
if not cnt['I']:
print(cnt['A'])
elif cnt['I'] == 1:
print('1')
else:
print('0')
if __name__ == '__main__':
main()
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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";
}
| 8 |
CPP
|
x = int(input())
s = input()
if s.count("I") >1:
print(0)
elif s.count('I') == 0:
print(s.count('A'))
else:
print(1)
| 8 |
PYTHON3
|
n = int(input())
s = input()
if s.count("I")<2:
if s.count("I")==1:
print(1)
else:
print(s.count("A"))
else:
print(0)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
n=int(input())
s=input()
A=0
I=0
for i in range(n):
if(s[i]=='A'):
A+=1
elif(s[i]=='I'):
I+=1
if(I==1):
print(I)
elif(I>1):
print("0")
else:
print(A)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
n=int(input())
a=input()
A=a.count('A')
F=a.count('F')
I=a.count('I')
if A>=0 and F>=0 and I==0:
print(A)
elif F>=0 and I==1:
print(1)
else:
print(0)
| 8 |
PYTHON3
|
from collections import Counter
def go():
n = int(input())
d = Counter()
for c in input():
d[c] += 1
if d['I'] == 0: return d['A']
elif d['I'] == 1: return 1
else: return 0
print(go())
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
import sys
f = sys.stdin
n = int(f.readline())
s = f.readline()
if "I" in s:
if s.count("I")==1:
print(1)
else:
print(0)
else:
print(s.count("A"))
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
n=int(input())
s=input()
ic=s.count('I')
print(1 if ic==1 else 0 if ic>1 else s.count('A'))
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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));
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
n = int(input())
s = input()
if s.count('I') == 1:
print(1)
elif 'I' in s:
print(0)
else:
print(s.count('A'))
| 8 |
PYTHON3
|
#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;
}
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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(); }
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
import collections as cl
n, s = input(), cl.Counter(input())
print(int(s['I'] == 1) if 'I' in s.keys() else s['A'])
| 8 |
PYTHON3
|
''' ░░█ ▄▀█ █ █▀ █░█ █▀█ █▀▀ █▀▀ █▀█ ▄▀█ █▀▄▀█
█▄█ █▀█ █ ▄█ █▀█ █▀▄ ██▄ ██▄ █▀▄ █▀█ █░▀░█ '''
# [cf-284-b.py] => [21-07-2020 @ 19:02:12]
# Author & Template by : Udit "luctivud" Gupta
# https://www.linkedin.com/in/udit-gupta-1b7863135/
import math; from collections import *
import sys; from functools import reduce
import time; from itertools import groupby
# sys.setrecursionlimit(10**6)
def input() : return sys.stdin.readline()
def get_ints() : return map(int, input().strip().split())
def get_list() : return list(get_ints())
def get_string() : return list(input().strip().split())
def printxsp(*args) : return print(*args, end="")
def printsp(*args) : return print(*args, end=" ")
DIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (+1, -1)]
NEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\
(+1, +1), (+1, +0), (+1, -1), (+0, +1)]
CAPS_ALPHABETS = {chr(i+ord('A')) : i for i in range(26)}
SMOL_ALPHABETS = {chr(i+ord('a')) : i for i in range(26)}
INF = float('inf')
# Custom input output is now piped through terminal commands.
S34t = time.time()
# for _testcases_ in range(int(input())):
input()
s = input()
d = Counter(s)
i = d.get('I', 0)
if i == 0:
# print(d)
print(d.get('A', 0))
elif i == 1:
print(1)
else:
print(0)
S34p = time.time()
# print("Time Elapsed: {}".format(float(S34p-S34t)))
''' ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
SHREE RAM JAI RAM, JAI JAI RAM
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~'''
| 8 |
PYTHON3
|
n=int(input())
x=input()
ans=0
m={'A':0,'I':0,'F':0}
for i in x:
m[i]+=1
for i in x:
if i=='A' :
if m['I']==0:
ans+=1
elif i=='I':
if m[i]==1:
ans+=1
print(ans)
| 8 |
PYTHON3
|
n = int(input())
s = input()
d = {"A": 0, "I": 0, "F": 0}
for i in s:
if i == "A":
d[i] = d[i] + 1
if i == "I":
d[i] = d[i] + 1
if i == "F":
d[i] = d[i] + 1
if d["I"] == 0:
print(d["A"])
elif d["I"] == 1:
print(1)
else:
print(0)
| 8 |
PYTHON3
|
import sys
import math
n = int(sys.stdin.readline())
an = sys.stdin.readline()
d = [0] * 3
for i in range(n):
if(an[i] == 'A'):
d[0] += 1
elif(an[i] == 'I'):
d[2] += 1
if(d[2] == 1):
print(d[2])
elif(d[0] != 0 and d[2] == 0):
print(d[0])
else:
print(0)
| 8 |
PYTHON3
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
#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;
}
}
| 8 |
CPP
|
#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;
}
| 8 |
CPP
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.