top of page

CCC 2014 J4: Party Invitation

This is a math question.

The original list is from 1 to N.

Then remove elements that are multiple cn_i from the list.

N = int(input())
list1 = []
for i in range(1, N+1, 1):

M = int(input())
for i in range(M):
    cn = int(input())
    list2 = []
    for j in range(len(list1)):
        if (j+1)%cn != 0:
    list1 = list2

for x in list1:

Recent Posts

See All

CCC '24 J5 - Harvest Waterloo

#include<iostream> #include <vector> #include <algorithm> #include <cmath> #include <stack> using namespace std; int main() { int r, c, sr, sc; cin >> r; cin >> c; int p[r][c]; bool v

CCC '24 J4 - Troublesome Keys

#include <iostream> #include <string> #include <map> #include <vector> #include <algorithm> #include <cmath> using namespace std; int main() { string ps; string ds; cin >> ps; cin >> ds;

CCC '22 J5 - Square Pool

#include<iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; bool rowcom(pair<int, int> a, pair<int, int> b){ return a.first < b.first; } bool colcom(pair<int,


bottom of page