oj.uz

Submission #483672

# Submission time Handle Problem Language Result Execution time Memory
483672 2021-10-31T14:44:04 Z CaroLinda Hop (COCI21_hop) C++14
110 / 110
 39 ms 1308 KB 
#include <bits/stdc++.h>
 
#define mkt make_tuple
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size())
#define ll long long
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define pii pair<int,int>
#define mk make_pair
#define pb push_back
 
const int MAX= 1010 ;
const int MAX_PRIMES = 664589 ;
 
using namespace std ;
 
int N ;
ll X[MAX];
 
int getIndex(ll a , ll b )
{
	int ak = 63-__builtin_clzll(a) ;
	int bk = 63 - __builtin_clzll(b) ;
	
	if((ak/4) == (bk/4)) return 1 ;
	if( (ak/16) == (bk/16) ) return 2 ;
	return 3 ;
}
 
int main()
{
 
	scanf("%d", &N  );
	for(int i = 1 ; i <= N ; i++ ) scanf("%lld", &X[i] ) ;
 
	for(int i = 2 ; i <= N ; i++,printf("\n") )
		for(int j = 1 ; j < i ; j++ ) printf("%d " , getIndex(X[j],X[i]) ) ;
		
 
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  scanf("%d", &N  );
      |  ~~~~~^~~~~~~~~~~~
Main.cpp:34:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  for(int i = 1 ; i <= N ; i++ ) scanf("%lld", &X[i] ) ;
      |                                 ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 39 ms 1288 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 33 ms 1128 KB Output is correct
12 Correct 38 ms 1300 KB Output is correct
13 Correct 34 ms 1092 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 35 ms 1116 KB Output is correct
16 Correct 34 ms 1124 KB Output is correct
17 Correct 35 ms 1160 KB Output is correct
18 Correct 35 ms 1160 KB Output is correct
19 Correct 34 ms 1092 KB Output is correct
20 Correct 35 ms 1200 KB Output is correct
21 Correct 35 ms 1136 KB Output is correct
22 Correct 34 ms 1116 KB Output is correct
23 Correct 39 ms 1308 KB Output is correct