Skip to content

Instantly share code, notes, and snippets.

@vo

vo/p406-ian.c

Created April 10, 2010 02:44
Show Gist options
  • Save vo/361782 to your computer and use it in GitHub Desktop.
Save vo/361782 to your computer and use it in GitHub Desktop.
Download ZIP
Prime Cuts (and computing primes)
Raw
p406-ian.c
#include <stdio.h>
const static int const prime_list[170] = { 1, 2, 3, 5, 7, 11, 13, 17, 19, 23,
29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103,
107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181,
191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269,
271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359,
367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449,
457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557,
563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643,
647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,
751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853,
857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953,
967, 971, 977, 983, 991, 997, 1001 };
static const char * const primes = " 1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997";
static const int const prime_idx[1001] = { 0, 1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6,
6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 12, 12, 12,
12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16,
17, 17, 17, 17, 17, 17, 18, 18, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 21,
21, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 25, 25,
25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 28, 28, 28, 28, 29, 29, 30,
30, 30, 30, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32, 32,
32, 32, 33, 33, 33, 33, 33, 33, 34, 34, 35, 35, 35, 35, 35, 35, 35, 35, 35,
35, 36, 36, 37, 37, 37, 37, 37, 37, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39,
40, 40, 40, 40, 40, 40, 41, 41, 41, 41, 41, 41, 42, 42, 43, 43, 43, 43, 43,
43, 43, 43, 43, 43, 44, 44, 45, 45, 45, 45, 46, 46, 47, 47, 47, 47, 47, 47,
47, 47, 47, 47, 47, 47, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 49,
49, 49, 49, 50, 50, 51, 51, 51, 51, 52, 52, 52, 52, 52, 52, 53, 53, 54, 54,
54, 54, 54, 54, 54, 54, 54, 54, 55, 55, 55, 55, 55, 55, 56, 56, 56, 56, 56,
56, 57, 57, 57, 57, 57, 57, 58, 58, 59, 59, 59, 59, 59, 59, 60, 60, 60, 60,
61, 61, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 64, 64, 64, 64, 65, 65, 66, 66, 66, 66, 67, 67,
67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 68, 68, 68, 68, 68, 68, 69,
69, 69, 69, 69, 69, 69, 69, 69, 69, 70, 70, 71, 71, 71, 71, 72, 72, 72, 72,
72, 72, 73, 73, 73, 73, 73, 73, 73, 73, 74, 74, 74, 74, 74, 74, 75, 75, 75,
75, 75, 75, 76, 76, 76, 76, 77, 77, 77, 77, 77, 77, 78, 78, 78, 78, 78, 78,
78, 78, 79, 79, 79, 79, 80, 80, 80, 80, 80, 80, 80, 80, 81, 81, 81, 81, 81,
81, 81, 81, 81, 81, 82, 82, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 84, 84,
85, 85, 85, 85, 85, 85, 86, 86, 86, 86, 87, 87, 87, 87, 87, 87, 88, 88, 88,
88, 88, 88, 88, 88, 89, 89, 89, 89, 90, 90, 91, 91, 91, 91, 92, 92, 92, 92,
92, 92, 92, 92, 92, 92, 92, 92, 93, 93, 93, 93, 93, 93, 93, 93, 94, 94, 94,
94, 95, 95, 95, 95, 95, 95, 95, 95, 96, 96, 96, 96, 97, 97, 97, 97, 97, 97,
98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 99, 99, 100, 100, 100, 100,
100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 101,
101, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102,
103, 103, 103, 103, 103, 103, 104, 104, 104, 104, 104, 104, 105, 105, 106,
106, 106, 106, 106, 106, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107,
108, 108, 108, 108, 108, 108, 109, 109, 109, 109, 109, 109, 110, 110, 111,
111, 111, 111, 111, 111, 112, 112, 112, 112, 112, 112, 113, 113, 113, 113,
114, 114, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 116,
116, 116, 116, 116, 116, 116, 116, 116, 116, 117, 117, 118, 118, 118, 118,
119, 119, 119, 119, 119, 119, 120, 120, 120, 120, 120, 120, 121, 121, 122,
122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 123, 123, 123, 123,
124, 124, 124, 124, 124, 124, 125, 125, 125, 125, 125, 125, 125, 125, 126,
126, 126, 126, 126, 126, 126, 126, 126, 126, 127, 127, 127, 127, 127, 127,
127, 127, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 129, 129, 129,
129, 129, 129, 129, 129, 130, 130, 130, 130, 130, 130, 131, 131, 131, 131,
131, 131, 132, 132, 132, 132, 133, 133, 133, 133, 133, 133, 133, 133, 134,
134, 134, 134, 134, 134, 135, 135, 135, 135, 136, 136, 136, 136, 136, 136,
136, 136, 137, 137, 137, 137, 138, 138, 138, 138, 138, 138, 138, 138, 138,
138, 138, 138, 138, 138, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139,
140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 141, 141, 142,
142, 142, 142, 142, 142, 142, 142, 142, 142, 143, 143, 144, 144, 144, 144,
145, 145, 146, 146, 146, 146, 146, 146, 146, 146, 146, 146, 147, 147, 147,
147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 148, 148, 148, 148,
149, 149, 150, 150, 150, 150, 151, 151, 151, 151, 151, 151, 151, 151, 151,
151, 151, 151, 151, 151, 152, 152, 152, 152, 153, 153, 154, 154, 154, 154,
155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155,
155, 155, 155, 155, 155, 156, 156, 156, 156, 157, 157, 157, 157, 157, 157,
157, 157, 158, 158, 158, 158, 158, 158, 158, 158, 158, 158, 159, 159, 159,
159, 159, 159, 159, 159, 160, 160, 160, 160, 161, 161, 161, 161, 161, 161,
162, 162, 162, 162, 162, 162, 163, 163, 163, 163, 163, 163, 163, 163, 163,
163, 163, 163, 163, 163, 164, 164, 164, 164, 165, 165, 165, 165, 165, 165,
166, 166, 166, 166, 166, 166, 167, 167, 167, 167, 167, 167, 167, 167, 168,
168, 168, 168, 168, 168, 169, 169, 169, 169 };
int main()
{
int n, c;
while (scanf(" %d %d", &n, &c) > 0) {
printf("%d %d:", n, c);
int t = prime_idx[n];
int A = (t + 1) / 2 - c, B = t / 2 + c;
if (A < 0) A = 0;
if (B > t) B = t;
int modA = 31;
int modB = 31;
if (A < 5) modA = 2 * A;
else if (A < 26) modA = A + 5;
if (B < 5) modB = 2 * B;
else if (B < 26) modB = B + 5;
B = B + B + B + B - modB;
A = A + A + A + A - modA;
B = B - A;
printf("%.*s\n\n", B, primes + A);
}
return 0;
}
Raw
p406.c
//
// Prime Cuts - Problem 406 ACM
// Christopher Vo (cvo1 at cs.gmu.edu)
// Optimized C version with caching
// Judge Time = 0.028, Rank 3
//
#include <stdio.h>
static const int const prime_list[170] = { 1, 2, 3, 5, 7, 11, 13, 17,
19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,
103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179,
181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263,
269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353,
359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443,
449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547,
557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641,
643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739,
743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839,
853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947,
953, 967, 971, 977, 983, 991, 997, 1001 };
static const char * const prime_str[170] = { " 1", " 2", " 3", " 5", " 7",
" 11", " 13", " 17", " 19", " 23", " 29", " 31", " 37", " 41", " 43", " 47",
" 53", " 59", " 61", " 67", " 71", " 73", " 79", " 83", " 89", " 97", " 101",
" 103", " 107", " 109", " 113", " 127", " 131", " 137", " 139", " 149",
" 151", " 157", " 163", " 167", " 173", " 179", " 181", " 191", " 193",
" 197", " 199", " 211", " 223", " 227", " 229", " 233", " 239", " 241",
" 251", " 257", " 263", " 269", " 271", " 277", " 281", " 283", " 293",
" 307", " 311", " 313", " 317", " 331", " 337", " 347", " 349", " 353",
" 359", " 367", " 373", " 379", " 383", " 389", " 397", " 401", " 409",
" 419", " 421", " 431", " 433", " 439", " 443", " 449", " 457", " 461",
" 463", " 467", " 479", " 487", " 491", " 499", " 503", " 509", " 521",
" 523", " 541", " 547", " 557", " 563", " 569", " 571", " 577", " 587",
" 593", " 599", " 601", " 607", " 613", " 617", " 619", " 631", " 641",
" 643", " 647", " 653", " 659", " 661", " 673", " 677", " 683", " 691",
" 701", " 709", " 719", " 727", " 733", " 739", " 743", " 751", " 757",
" 761", " 769", " 773", " 787", " 797", " 809", " 811", " 821", " 823",
" 827", " 829", " 839", " 853", " 857", " 859", " 863", " 877", " 881",
" 883", " 887", " 907", " 911", " 919", " 929", " 937", " 941", " 947",
" 953", " 967", " 971", " 977", " 983", " 991", " 997", " 1001" };
int main()
{
int n, c;
while (scanf(" %d %d", &n, &c) > 0) {
int t = -1;
while (prime_list[++t] <= n);
printf("%d %d:", n, c);
int A = (t + 1) / 2 - c, B = t / 2 + c;
if (A < 0) A = 0;
if (B > t) B = t;
while (A < B)
fputs(prime_str[A++], stdout);
puts("\n");
}
return 0;
}
Raw
p406.cpp
//
// Prime Cuts - Problem 406 ACM
// Christopher Vo (cvo1 at cs.gmu.edu)
// This version computes the primes first.
// Judge Time = 0.088, Rank 252
//
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
bool prime[1000];
int prime_list[1000], num_primes;
void find_primes()
{
int max = (int) ceil(sqrt(1000));
for (int i = 0; i < 1000 + 1; i++)
prime[i] = true;
prime[0] = false;
prime[1] = true;
for (int i = 2; i <= max; i++)
if (prime[i])
for (int k = i * i; k <= 1000; k += i)
prime[k] = false;
num_primes = 0;
for (int i = 0; i < 1000; i++)
if (prime[i])
prime_list[num_primes++] = i;
}
int main()
{
int n, c, t;
find_primes();
while (cin >> n >> c) {
for (t = 0; t < num_primes && prime_list[t] <= n; t++);
printf("%d %d:", n, c);
for (int i = max(0, (t + 1) / 2 - c); i < min(t / 2 + c, t); i++)
printf(" %d", prime_list[i]);
printf("\n\n");
}
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment