oj.uz

Submission #475740

# Submission time Handle Problem Language Result Execution time Memory
475740 2021-09-23T23:40:42 Z CaroLinda Vepar (COCI21_vepar) C++14
70 / 70
 325 ms 43852 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= 10000000 ;
const int MAX_PRIMES = 664589 ;

using namespace std ;

int T ;
vector<int> primes ;
int d[MAX+10] ;

int getQtd(int x, int j)
{
	int ans = 0 ;
	ll k = primes[j] ;
	while(k <= x)
	{
		ans += x/k ;
		k *= primes[j] ;
	}
	return ans ;
}

int main()
{

	for(int i = 2 ; i <= MAX ; i++ )
	{
		if(d[i] > 0 ) continue ;

		primes.pb(i) ;
 
		for(int j = i ; j <= MAX ; j += i )
			if(d[j] == 0 ) d[j] = i ;
	}

	scanf("%d", &T ) ;
	for(int i = 1 ; i <= T ; i++ )
	{

		int a , b , c , d ;
		scanf("%d %d %d %d", &a, &b, &c, &d ) ;

		bool ok = true ;

		for(int j = 0 ; j < sz(primes) ; j++ )
		{
			if( getQtd(b,j)-getQtd(a-1,j) > getQtd(d,j)-getQtd(c-1,j) )
			{
				ok = false ;
				break ;
			}
			
		}

		printf("%s\n" , ok ? "DA" : "NE") ;

	}
	
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  scanf("%d", &T ) ;
      |  ~~~~~^~~~~~~~~~~
Main.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   scanf("%d %d %d %d", &a, &b, &c, &d ) ;
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 43612 KB Output is correct
2 Correct 242 ms 43616 KB Output is correct
3 Correct 251 ms 43644 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 43652 KB Output is correct
2 Correct 226 ms 43580 KB Output is correct
3 Correct 237 ms 43852 KB Output is correct
4 Correct 245 ms 43672 KB Output is correct
5 Correct 271 ms 43556 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 43692 KB Output is correct
2 Correct 228 ms 43600 KB Output is correct
3 Correct 278 ms 43572 KB Output is correct
4 Correct 239 ms 43616 KB Output is correct
5 Correct 222 ms 43572 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 43612 KB Output is correct
2 Correct 234 ms 43568 KB Output is correct
3 Correct 298 ms 43616 KB Output is correct
4 Correct 317 ms 43644 KB Output is correct
5 Correct 272 ms 43620 KB Output is correct
6 Correct 276 ms 43744 KB Output is correct
7 Correct 307 ms 43648 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 43608 KB Output is correct
2 Correct 227 ms 43724 KB Output is correct
3 Correct 281 ms 43616 KB Output is correct
4 Correct 265 ms 43568 KB Output is correct
5 Correct 278 ms 43580 KB Output is correct
6 Correct 323 ms 43604 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 43616 KB Output is correct
2 Correct 267 ms 43628 KB Output is correct
3 Correct 270 ms 43624 KB Output is correct
4 Correct 245 ms 43644 KB Output is correct
5 Correct 244 ms 43612 KB Output is correct
6 Correct 307 ms 43608 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 43572 KB Output is correct
2 Correct 224 ms 43608 KB Output is correct
3 Correct 279 ms 43568 KB Output is correct
4 Correct 259 ms 43700 KB Output is correct
5 Correct 294 ms 43568 KB Output is correct
6 Correct 285 ms 43640 KB Output is correct
7 Correct 325 ms 43616 KB Output is correct