啊哈,今天终于居然在我的手提电脑上,在ubuntu14.04上,连上了我的校园wifi!!!(因为是peap连接,,网传network-manager的bug)
不知道这是因为我用wicd取代了network-manager(但是右上角还是有以前network-manager的图标),还是因为把unity改成了gnome(之前还真不知道gnome这么好用。。)
为了写博客,还换上了搜狗拼音(个人感觉挺好用的,尤其在linux里没什么选择的时候)
本来还想着在暑假的期间来用这个博客记录下学算法的点点滴滴,,,看来失败了,而且回到学校因为一直都没法连上学校的无线wifi,加之不想在宿舍里研究。。。就拖到了今天
而且发现,,在外网上sicily提交代码时,会出现restrict funtion的错误,使得我郁闷了一个夏天,也懒得做下去。。然而当我连上了校园网的wifi,一提交,oh,success!
因为年代久远,这是我前几题sicily的代码,,我也懒得回想并且解释了。。反正还有那么多题
问题1000
#include<stdio.h>
int main() {
int a, b, ans;
scanf("%d%d", &a, &b);
ans = a - b;
printf("%d\n", ans);
return 0;
}
#include<iostream>
#include<string>
using namespace std;
int main(void) {
int prianswer, currentanswer, answer, newnum, i, len;
string str;
cin >> str;
while (str[0] != '0') {
answer = 0;
prianswer = 1;
currentanswer = 1;
len = str.length();
if (len > 1) {
newnum = (str[0] - '0') * 10 + (str[1] - '0');
if ((11 <= newnum && newnum <= 19) || (21 <= newnum && newnum <= 26)) {
currentanswer = 2;
}
}
answer = currentanswer;
for (i = 2; i < len; ++i) {
newnum = (str[i - 1] - '0') * 10 + (str[i] - '0');
if ((11 <= newnum && newnum <= 19) || (21 <= newnum && newnum <= 26))
answer += prianswer;
else if (newnum == 10 || newnum == 20)
answer = prianswer;
prianswer = currentanswer;
currentanswer = answer;
}
cout << answer << endl;
cin >> str;
}
return 0;
}
问题1002
#include<iostream>
using namespace std;
int n, m, d, t;
int ans[1101];
int prime[10001];
int sign[1101];
int flag;
void getPrime() {
for (int i = 0; i < 10001; ++i)
prime[i] = true;
for (int i = 2; i <= 100; ++i) {
if (prime[i])
for (int j = 2; j * i <= 10000; ++j)
prime[j * i] = false;
}
prime[1] = false;
}
bool checkPrime(int current) {
int sum = ans[current];
for (int i = 2, j = current - 1; i <= d && j >= 0; ++i, --j) {
sum += ans[j];
if (prime[sum])
return false;
}
return true;
}
void dfs(int current) {
++t;
if (t > 4000)
return;
if (current == m - n + 1) {
flag = true;
return;
}
for (int i = n; i <= m; ++i) {
if (sign[i])
continue;
ans[current] = i;
if (checkPrime(current)) {
sign[i] = true;
dfs(current + 1);
if (flag)
return;
sign[i] = false;
}
}
}
int main(void) {
getPrime();
while (1) {
cin >> n >> m >> d;
if (n == 0)
break;
for (int i = 0; i < 1101; ++i)
sign[i] = false;
flag = false;
t = 0;
dfs(0);
if (flag) {
for (int i = 0; i < m - n; ++i)
cout << ans[i] << ",";
cout << ans[m - n] << endl;
} else {
cout << "No anti-prime sequence exists.\n";
}
}
return 0;
}
这些是刚刚开始打的。。其中也参考了网友的一些做法,,但是在哪参考的,现在也找不回来了。。