一道插线问线离线版的题 复杂度O(n); 代码如下: #include<stdio.h>#include<string.h>const int M = 1000003;const int mod=10003;int num[M];int main(){int n,c,q;scanf("%d%d%d",&n,&c,&q);while(c--){int a,b,x;scan
OJ题目 : 戳这里~ 描述 Vawio Sequence is very funny,it is a sequence of integers. It has some interesting properties. · Vawio is of odd length i.e. L = 2*n + 1. · The first (n+1) integers of Vawio s
OJ题目 : http://acm.nyist.net/JudgeOnline/problem.php?pid=749 描述 Hrdv is interested in a string,especially the palindrome string.So he wants some palindrome string. A sequence of characters is a
OJ题目 :http://acm.nyist.net/JudgeOnline/problem.php?pid=708 描述 Given a positive integer N (0<=N<=10000), you are to find an expression equals to N using only 1,+,*,(,). 1 should not appear continuo
just for you 时间限制: 1000 ms | 内存限制: 65535 KB 难度: 0 描述 今天tlp和ly想去看电影了到了电影院才发现买票的人特别多 ,ly不想让tlp等着急了,就先带她去逛商场了,tlp是个特别爱花钱的人,哎,女人嘛,你懂得,逛完商场就差不多到了看定影的时间了,然后他们去看了黄渤演的《心花路放》,片子里的黄渤演的真心很搞笑,看完了电影,
http://acm.nyist.net/JudgeOnline/problem.php?pid=151 package org.acm.math;/** 详情参考:http://blog.csdn.net/lyy289065406/article/details/6648551* 先说下,题意:( n + d ) % 23 = a , ( n + d ) % 28 = b , ( n + d
import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.io.StreamTokenizer;public class ProblemJ {private static int N, count;private static double R,
The Famous Clock 时间限制: 1000 ms | 内存限制: 65535 KB 难度: 1 描述 Mr. B, Mr. G and Mr. M are now in Warsaw, Poland, for the 2012’s ACM-ICPC World Finals Contest. They’ve decided to take a 5 hours tr