(UPD: 2024-12-04 14:48 UTC) Judge is not working due to Cloudflare incident. (URL) We can do nothing about it, sorry. After the incident is resolved, we will grade all submissions.

제출 #489661

#제출 시각아이디문제언어결과실행 시간메모리
489661inksamuraiHop (COCI21_hop)C++17
110 / 110
34 ms5260 KiB
#include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define all(a) a.begin(),a.end() #define rep(i,n) for(int i=0;i<n;i++) #define crep(i,x,n) for(int i=x;i<n;i++) #define drep(i,n) for(int i=n-1;i>=0;i--) #define vec(...) vector<__VA_ARGS__> #define _3oIUrY0 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0) using namespace std; typedef long long ll; typedef long double ld; using pii=pair<int,int>; using vi=vector<int>; using vll=vector<long long>; int main(){ _3oIUrY0; int n; cin>>n; vll a(n); rep(i,n){ cin>>a[i]; } vec(vi) tbl(n,vi(n)); auto g=[&](ll x){ drep(j,60){ if(x&(1<<j)) return j; } return -1; }; auto f=[&](int x,int y)->int{ int v1=g(a[x]),v2=g(a[y]); if(v1/4==v2/4) return 1; if(v1/16==v2/16) return 2; return 3; }; rep(i,n){ crep(j,i+1,n){ if(a[j]%a[i]==0){ tbl[i][j]=f(i,j); }else{ tbl[i][j]=1; } } } crep(i,1,n){ drep(j,i) cout<<tbl[j][i]<<" "; cout<<"\n"; } // return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...