# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595872 | AGE | Sob (COCI19_sob) | C++14 | 386 ms | 8336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define int long long
using namespace std;
const int N=2e6+10,M=2e3,mod=10;
bool vis[N];
main()
{
int n,m;
cin>>n>>m;
vector<pair<int,int>>v;
for(int i=m;i<n+m;i++){
bitset<32>bt;
int num=0;
bt=i;
for(int j=0;j<31;j++){
if(bt[j]==1){
num+=(1<<j);
if(vis[num]==0){
vis[num]=1;
break;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |