33142023-02-25 08:52:27horvathabelTáblajátékcpp17Partially correct 29/503ms4016 KiB
#include <bits/stdc++.h>
using namespace std;
string kettes(int x){
	string mego="";
    while (x>0){
		mego+=to_string(x%2);
		x=x/2;
	}
	reverse(mego.begin(), mego.end());
	return (mego);
}
int main() {
	int n;
	cin>>n;
	pair<int, int> os={0,0};
	for (int i=0; i<n;i++){
		int k;
		cin>>k;
		if (k==0){
			os.first++;
			os.second=os.second*2;
		}
		if (k==1){
			os.first++;
			os.second=os.second*2+1;
		}	
		if (k==2){
			os.first--;
			os.second=os.second/2;
		}
		if (k==3){
			os.second--;
		}
		if (k==4){
			os.second++; 
		}
		} 
		cout<<os.first<<endl<<kettes(os.second); 

}
SubtaskSumTestVerdictTimeMemory
base29/50
1Accepted0/03ms1808 KiB
2Accepted0/03ms2056 KiB
3Partially correct1/33ms2220 KiB
4Accepted3/33ms2332 KiB
5Accepted3/33ms2548 KiB
6Partially correct1/33ms2780 KiB
7Accepted3/33ms2988 KiB
8Partially correct1/33ms3200 KiB
9Partially correct1/32ms3280 KiB
10Partially correct1/33ms3496 KiB
11Accepted3/32ms3464 KiB
12Partially correct1/33ms3576 KiB
13Accepted4/43ms3580 KiB
14Partially correct1/43ms3576 KiB
15Accepted4/43ms3592 KiB
16Partially correct1/43ms3804 KiB
17Partially correct1/43ms4016 KiB