Submission #2411513


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#include <fstream>
#define FI first
#define SE second
#define VE vector<int>
#define PB push_back
#define PA pair<int,int>
#define MA make_pair
#define LL long long
#define LI long int
#define LLI long long int
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define POS(i) cout<<(i?"POSSIBLE":"IMPOSSIBLE")<<endl
using namespace std;
//
const int INF=1e9+7;
const int LINF=1e18;
const int MOD=1e9+7;
//
int main(){
    int n; cin>>n;
    int k=n%8;
    int d[8][4]={{1,1,1,1},{1,0,1,0},{1,0,1,0},{0,0,1,1},{0,1,1,0},{0,1,1,1},{1,1,1,0},{1,1,1,0}};
    //int a[8]={0,2,2,2,1,1,1,1};
    //n-=a[k];
    int s[4]={2,3,4,6};
    int p=0;
    if(n==3){
        cout<<"2 5 63";
        exit(0);
    }
    FOR(i,0,4){
        if(d[k][i]){
            cout<<s[i]<<" ";
            p++;
        }
    }
    FOR(i,0,n/4+1){
        FOR(j,0,4){
            if(p>=n){
                break;
            }else{
                p++;
                cout<<s[j]+6*(i+1)<<" ";
            }
        }
    }
    return 0;
}

Submission Info

Submission Time
Task B - GCD Sequence
User dama_math
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1345 Byte
Status AC
Exec Time 3 ms
Memory 384 KB

Compile Error

./Main.cpp:28:16: warning: overflow in implicit constant conversion [-Woverflow]
 const int LINF=1e18;
                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 40
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 3 ms 384 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 3 ms 384 KB
17.txt AC 3 ms 384 KB
18.txt AC 3 ms 384 KB
19.txt AC 3 ms 384 KB
20.txt AC 3 ms 384 KB
21.txt AC 3 ms 384 KB
22.txt AC 3 ms 384 KB
23.txt AC 3 ms 384 KB
24.txt AC 3 ms 384 KB
25.txt AC 3 ms 384 KB
26.txt AC 3 ms 384 KB
27.txt AC 3 ms 384 KB
28.txt AC 3 ms 384 KB
29.txt AC 3 ms 384 KB
30.txt AC 3 ms 384 KB
31.txt AC 3 ms 384 KB
32.txt AC 1 ms 256 KB
33.txt AC 1 ms 256 KB
34.txt AC 3 ms 384 KB
35.txt AC 2 ms 256 KB
36.txt AC 2 ms 256 KB
37.txt AC 3 ms 384 KB
38.txt AC 2 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB