Tag: Codeforces Round #473 (Div. 2)
Codeforces Round #473 (Div....
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn =...
Codeforces Round #473 (Div....
#include <stdio.h>
long long n,res,a=1;
int main()
{
for (scanf("%I64d",&n);a<n;res+=(n-1)/a*(a-(a>>1)),a<<=1ll);
printf("%I64dn",res);
return 0;
}
Codeforces Round #473 (Div....
#include<stdio.h>
int vi={0};
int main(void)
{
int n, a, now = 2;
int ans;
scanf("%d",...
Codeforces Round #473 (Div....
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
if(n <= 5)
printf("-1n");
else{
printf("1 2n2 3n2 4n");
for(int i...
Codeforces Round #473 (Div....
#include<bits/stdc++.h>
using namespace std;
map<string,int> ms;
string str;
int arr,temp,mn;
int main()
{
int n,k,m;cin>>n>>k>>m;
for(int i=1;i<=n;i++)cin>>str,ms=i;
for(int...
Codeforces Round #473 (Div....
#include <stdio.h>
int main() {
int N;
scanf("%d", &N), puts(N&1 ? "Ehab"...