oj.uz

Submission #483428

# Submission time Handle Problem Language Result Execution time Memory
483428 2021-10-29T12:18:56 Z rainboy Vepar (COCI21_vepar) C
70 / 70
 150 ms 12744 KB 
#include <stdio.h>

#define A	10000000

int pp[A], n;

void init() {
	static char composite[A + 1];
	int a, b;

	for (a = 2; a <= A; a++) {
		if (composite[a])
			continue;
		pp[n++] = a;
		for (b = a + a; b <= A; b += a)
			composite[b] = 1;
	}
}

int count(int a, int p) {
	return a < p ? 0 : count(a / p, p) + a / p;
}

int main() {
	int t;

	init();
	scanf("%d", &t);
	while (t--) {
		int a, b, c, d, i, da;

		scanf("%d%d%d%d", &a, &b, &c, &d);
		da = 1;
		for (i = 0; i < n; i++)
			if (count(b, pp[i]) - count(a - 1, pp[i]) > count(d, pp[i]) - count(c - 1, pp[i])) {
				da = 0;
				break;
			}
		printf(da ? "DA\n" : "NE\n");
	}
	return 0;
}

Compilation message

Main.c: In function 'main':
Main.c:28:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  scanf("%d", &t);
      |  ^~~~~~~~~~~~~~~
Main.c:32:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   scanf("%d%d%d%d", &a, &b, &c, &d);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 12660 KB Output is correct
2 Correct 104 ms 12612 KB Output is correct
3 Correct 87 ms 12612 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 12608 KB Output is correct
2 Correct 91 ms 12616 KB Output is correct
3 Correct 98 ms 12616 KB Output is correct
4 Correct 96 ms 12616 KB Output is correct
5 Correct 97 ms 12616 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 12616 KB Output is correct
2 Correct 91 ms 12604 KB Output is correct
3 Correct 93 ms 12604 KB Output is correct
4 Correct 98 ms 12744 KB Output is correct
5 Correct 96 ms 12612 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 12604 KB Output is correct
2 Correct 99 ms 12652 KB Output is correct
3 Correct 101 ms 12608 KB Output is correct
4 Correct 112 ms 12732 KB Output is correct
5 Correct 117 ms 12608 KB Output is correct
6 Correct 107 ms 12652 KB Output is correct
7 Correct 147 ms 12612 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 12728 KB Output is correct
2 Correct 94 ms 12604 KB Output is correct
3 Correct 100 ms 12612 KB Output is correct
4 Correct 101 ms 12620 KB Output is correct
5 Correct 105 ms 12616 KB Output is correct
6 Correct 146 ms 12736 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 12616 KB Output is correct
2 Correct 101 ms 12616 KB Output is correct
3 Correct 98 ms 12608 KB Output is correct
4 Correct 102 ms 12616 KB Output is correct
5 Correct 101 ms 12612 KB Output is correct
6 Correct 131 ms 12616 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 12616 KB Output is correct
2 Correct 101 ms 12616 KB Output is correct
3 Correct 103 ms 12740 KB Output is correct
4 Correct 107 ms 12608 KB Output is correct
5 Correct 94 ms 12616 KB Output is correct
6 Correct 132 ms 12608 KB Output is correct
7 Correct 150 ms 12656 KB Output is correct