int main() {
char str[] = ":blue:red:yellow:black:";
char *p = strtok(str, ":");
while (p != NULL) {
printf("[%s]\n", p);
p = strtok(NULL, ":");
}
return 0;
}
char *p = strtok(分割対象文字列のアドレス, 分割文字);int popcount1(int x) {
int ret = 0;
for (int i = 0; i < 32; i++)
ret += x >> i & 1;
return ret;
}
int popcount2(int x) {
int ret = 0;
while (x) {
x &= x-1;
++ret;
}
return ret;
}
int popcount3(int x) {
x = (x & 0x55555555) + (x >> 1 & 0x55555555);
x = (x & 0x33333333) + (x >> 2 & 0x33333333);
x = (x & 0x0F0F0F0F) + (x >> 4 & 0x0F0F0F0F);
x = (x & 0x00FF00FF) + (x >> 8 & 0x00FF00FF);
x = (x & 0x0000FFFF) + (x >> 16 & 0x0000FFFF);
return x;
}
| Function Name | Elapsed Time[s] | ||
| popcount1 | 10.31 | ||
| popcount2 | 0.65 | ||
| popcount3 | 2.35 | ||
| __builtin_popcount | 0.84 |
#include <bitset>追記：
int main() {
int a = 20004;
// high 7 and 8 bits
int mask = 1 << 8 | 1 << 7;
cout << bitset<16>(a) << endl;
cout << bitset<16>(a | mask) << endl << endl;
// low 9 and 10 bits
mask = 1 << 9 | 1 << 10;
cout << bitset<16>(a) << endl;
cout << bitset<16>(a & ~mask) << endl << endl;
// flip 0 and 1 bits
mask = 1 << 0 | 1 << 1;
cout << bitset<16>(a) << endl;
cout << bitset<16>(a ^ mask) << endl << endl;
// the leaset significant non-zero bit
cout << bitset<16>(a) << endl;
cout << bitset<16>(-a) << endl;
cout << bitset<16>(a&-a) << endl;
return 0;
}
int ck1(int a, int b) {
return a;
}
int ck2 (int a, int b) {
return b;
}
int ck3(int a, int b) {
return a<b?a:b;
}
int ck4(int a, int b) {
return a<b?b:a;
}
int main() {
vector<int>A, B, wanted;
A.push_back(1);
A.push_back(2);
A.push_back(3);
A.push_back(4);
B.push_back(4);
B.push_back(3);
B.push_back(2);
B.push_back(1);
wanted.push_back(1);
wanted.push_back(2);
wanted.push_back(2);
wanted.push_back(1);
bool ck = true;
int sz = A.size();
// func1
REP(i, sz)
if (ck1(A[i], B[i]) != wanted[i])
ck = false;
if (ck)
cout << "ck1 holds" << endl;
// func2
ck = true;
REP(i, sz)
if (ck2(A[i], B[i]) != wanted[i])
ck = false;
if (ck)
cout << "ck2 holds" << endl;
// func3
ck = true;
REP(i, sz)
if (ck3(A[i], B[i]) != wanted[i])
ck = false;
if (ck)
cout << "ck3 holds" << endl;
// func4
ck = true;
REP(i, sz)
if (ck4(A[i], B[i]) != wanted[i])
ck = false;
if (ck)
cout << "ck3 holds" << endl;
}
vector A, B, wantedのすべての要素が与えられた関数に対して条件を満たしているかどうかをしらべています。でも上のソースコードは明らかに冗長です。SRMのときは時間勝負だったので上のような実装をしました（汗）bool check(vector<int>A, vector<int>B, vector<int>wanted, int (*func)(int, int)) {
int sz = A.size();
REP(i, sz)
if (func(A[i], B[i]) != wanted[i])
return false;
return true;
}
int main() {
vector<int>A, B, wanted;
A.push_back(1);
A.push_back(2);
A.push_back(3);
A.push_back(4);
B.push_back(4);
B.push_back(3);
B.push_back(2);
B.push_back(1);
wanted.push_back(1);
wanted.push_back(2);
wanted.push_back(2);
wanted.push_back(1);
if (check(A, B, wanted, ck1))
cout << "ck1 holds" << endl;
if (check(A, B, wanted, ck2))
cout << "ck2 holds" << endl;
if (check(A, B, wanted, ck3))
cout << "ck3 holds" << endl;
if (check(A, B, wanted, ck4))
cout << "ck4 holds" << endl;
}
int main() {
vector<int>A, B, wanted;
A.push_back(1);
A.push_back(2);
A.push_back(3);
A.push_back(4);
B.push_back(4);
B.push_back(3);
B.push_back(2);
B.push_back(1);
wanted.push_back(1);
wanted.push_back(2);
wanted.push_back(2);
wanted.push_back(1);
int (*funcs[4])(int, int) = {ck1, ck2, ck3, ck4};
string funcName[] = {"ck1", "ck2", "ck3", "ck4"};
REP(i, SIZE(funcs)) {
if (check(A, B, wanted, funcs[i]))
cout << funcName[i] << " holds" << endl;
}
}
おー、結構きれいになりましたね。。int main () {
vector<int> nums;
for (int i = 0; i < 100; i++)
nums.push_back(rand()%10);
for (int i = 0; i < 10; i++)
cout << count(nums.begin(), nums.end(), i) << endl;
return 0;
}
int main () {
string name = "tanaka tarou";
cout << count(name.begin(), name.end(), 'a') << endl;
return 0;
}
int main () {
double x[] = {0.0, 0.1, 0.14, 0.0, 0.3, 0.6};
int sz = sizeof(x) / sizeof(double);
cout << count(x, x+sz, 0.0) << endl;
return 0;
}
class Trie {
public:
Trie *next[26];
Trie () {
fill(next, next+26, (Trie *)0);
}
void insert(char *s) {
if (*s == '\0') return;
if (this->next[*s-'a'] == NULL)
this->next[*s-'a'] = new Trie();
this->next[*s-'a']->insert(s+1);
}
bool find(char *s) {
if (*s == '\0') return true;
if (this->next[*s-'a'] == NULL)
return false;
return this->next[*s-'a']->find(s+1);
}
};
@ECHO OFF
echo System Test Starts..
:: set variables
SET MAX_SEED=100
SET SEED=0
SET OUTPUT=%1.txt
:: solve problems
:LOOP
echo Solving #%SEED% ....
IF %SEED%==0 echo SEED = %SEED% > %OUTPUT%
IF NOT %SEED%==0 echo SEED = %SEED% >> %OUTPUT%
java -jar hogehogeVis.jar -exec "hogehoge.exe" -seed %SEED% -novis >> %OUTPUT%
SET /A SEED=%SEED%+1
IF %SEED%==%MAX_SEED% GOTO LOOPEND
GOTO LOOP
:LOOPEND
echo System Test Ends!
echo -----------------------
echo [Overall Result]
perl parse.pl %1
open(INPUT, "<" . $ARGV[0] . ".txt");
@list = <INPUT>;
$pointSum = 0;
$timeOver = 0;
foreach $line( @list ) {
if ($line =~ /(^Time)/) {
$line =~ /([0-9\.]+)/;
$time = $1;
if ($time > 10) {
$timeOver++ ;
}
}
elsif ($line =~ /^Score/) {
$line =~ /([0-9\.]+)/;
$point = $1;
$pointSum += $point
}
}
print "Point: " . $pointSum . "\n";
print "Time Over: " . $timeOver . "\n";
int main() {
int x[10][10][10];
fill(x, x+10, INF);
cout << x[0][0][0] << endl;
}
ダメだった。なぜ。。3次元だけど、メモリは縦に連続して展開されるんじゃないの？？int main() {
int x[10][10][10];
fill_n(x, 10*10*10, INF);
cout << x[0][0][0] << endl;
}
ま、マジか。。。int main() {
int x[10][10][10];
REP(i, 10) REP(j, 10) REP(k, 10) x[i][j][k] = INF;
cout << x[0][0][0] << endl;
}
int main() {
int x[10][10][10];
memset(x, 0xFF, sizeof(x));
cout << x[0][0][0] << endl;
}
とするのはNG。これでは、すべての要素が-1にセットされます。（2の補数ですね。）int main() {
int x[10][10][10];
memset(x, 0x3F, sizeof(x));
cout << x[0][0][0] << endl;
}
ちなみに、上記の値は、十進数で”1061109567”です。
main = putStr $ unlines $ map fizzBuzz [1..100]
where fizzBuzz x
| x `mod` 3 == 0 && x `mod` 5 == 0 = "fizz buzz"
| x `mod` 3 == 0 = "fizz"
| x `mod` 5 == 0 = "buzz"
| otherwise = show x
main = putStr $ unlines $ map fizzBuzz [1..100]
where fizzBuzz x = case [x `mod` 3, x `mod` 5] of
[0, 0] -> "fizz buzz"
[0, _] -> "fizz"
[_, 0] -> "buzz"
otherwise -> show x
main = putStr $ unlines $ map nabeatsu [1 .. 100]
where hasThree x = any (== '3') $ show x
nabeatsu x
| x `mod` 3 == 0 = "aho" ++ " (" ++ (show x) ++ ")"
| hasThree x = "aho" ++ " (" ++ (show x) ++ ")"
| otherwise = show x
main = print $ map (sin . sq) [1..10]まあ、そのままですね。。
where sq x = x * x
main = print $ myZip [1, 3 .. 10] [2,4 .. 10]
where myZip [] [] = []
myZip (x:xs) (y:ys) = (x,y) : myZip xs ys
myReduce f [] = 0まぁこんな感じでしょう。
myReduce f (x:xs) = f x (myReduce f xs)
myMap f [] = []
myMap f (x:xs) = [f x] ++ (myMap f xs)
myFilter f [] = []
myFilter f (x:xs) = if f x
then [x] ++ (myFilter f xs)
else myFilter f xs
a = [1 .. 10]なんか、意味不明な記号が多くて若干pe○lみたいで嫌ですが。。
main = do print $ myMap (\x -> x*x) a
print $ myFilter (\x -> x `mod` 2 /= 0) a
print $ myReduce (\x y -> x+y) a
a = [31, 10, 19, 90, 100, 1, 3, 4]
qsort [] = []
qsort (x:xs) = qsort (filter (<x) xs) ++ [x] ++ qsort (filter (>=x) xs)
main = print $ qsort a
vector<pair<int, int> >vec, ret;
int main() {
int n, s, t;
scanf("%d", &n);
while (n--) {
scanf("%d %d", &s, &t);
vec.PB(MP(s,t));
}
sort(ALL(vec));
int pos = 0;
for (;pos < (int)vec.size(); pos++) {
int s = vec[pos].first;
int t = vec[pos].second;
for (; pos+1 < (int)vec.size() && vec[pos+1].first <= t; pos++)
t = max(t, vec[pos+1].second);
ret.PB(MP(s, t));
}
REP(i, ret.size())
printf("%d %d\n", ret[i].first, ret[i].second);
return 0;
}
int dp[16][16];
void init() {
REP(i, 16)
dp[i][0] = 0, dp[0][i] = 1;
dp[0][0] = 1;
FOR (i, 1, 16) FOR (j, 1, 16) {
if (i-j >= 0)
dp[i][j] = dp[i][j-1] + dp[i-j][j];
else
dp[i][j] = dp[i][j-1];
}
}
int main() {
int t, n, m;
init();
scanf("%d", &t);
REP(i, t) {
scanf("%d %d", &n, &m);
printf("%d\n", dp[n][m]);
}
return 0;
}