摘要：
很多时间超限的问题都与素数有关 #include <stdio.h>#define maxn 1000000//根据题意大概估算范围；int prime[maxn];void get_prime(){ for(int i=2;i<maxn;i++) { if(!prime[i]) { for(int 阅读全文
摘要：
Gargari is jealous that his friend Caisa won the game from the previous problem. He wants to prove that he is a genius. He has a n × n chessboard. Eac 阅读全文
摘要：
Little Joty has got a task to do. She has a line of n tiles indexed from 1 to n. She has to paint them in a strange pattern. An unpainted tile should 阅读全文