Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
numberOftweets
#include <bits/stdc++.h> using namespace std; int main() { int n,k,i,cnt=0,num; cin>>n>>k; string s; bool ar[n]; memset(ar,false,sizeof(ar)); while(k--){ cin>>s; if(s!="CLOSEALL"){ cin>>num; if(ar[num-1]){ ar[num-1]=0; cnt--; cout<<cnt<<endl; } else{ ar[num-1]=true; cnt++; cout<<cnt<<endl; } } else{ cnt=0; cout<<cnt<<endl; memset(ar,false,sizeof(ar)); } } }
run
|
edit
|
history
|
help
0
1
Deque EvenOdd
poker.hpp
StackPat
Primality Test | Fermat
unicodeのテスト
in shorted array print without duplicate o/p array
Dijkstra
Wygner aprendizado
Exploring the Transform Function and Operator Classes