buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
|
|---|---|---|---|---|
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, b, s;
while (cin >> s, s) {
int a[10] = {0};
while (s--) {
cin >> b;
a[b]++;
}
r(i, 10) {
if (a[i])
r(j, a[n]) cout << '*';
else
cout << '-';
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, b, s;
while (cin >> s, s) {
int a[10] = {0};
while (s--) {
cin >> b;
a[b]++;
}
r(i, 10) {
if (a[i])
r(j, a[i]) cout << '*';
else
cout << '-';
cout << endl;
}
}
}
|
[["-", 31, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 31, 2, 3, 4, 0, 69, 341, 342, 0, 22]]
| 1
| 106
|
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, num;
while (scanf("%d", &n) && n != 0) {
vector<int> ice(n, 0);
for (int i = 0; i < n; i++) {
scanf("%d", &num);
ice[num]++;
}
for (int i = 0; i < n; i++) {
if (ice[i] == 0) {
printf("-");
} else {
for (int j = 0; j < ice[i]; j++)
printf("*");
}
printf("\n");
}
}
}
|
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, num;
while (scanf("%d", &n) && n != 0) {
vector<int> ice(10, 0);
for (int i = 0; i < n; i++) {
scanf("%d", &num);
ice[num]++;
}
for (int i = 0; i < 10; i++) {
if (ice[i] == 0) {
printf("-");
} else {
for (int j = 0; j < ice[i]; j++)
printf("*");
}
printf("\n");
}
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 148
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(9);
int n, sort;
while (cin >> n) {
if (n == 0)
break;
else {
fill(a.begin(), a.end(), 0);
for (int i = 0; i < n; i++) {
cin >> sort;
a[sort]++;
}
for (int i = 0; i < 10; i++) {
if (a[i] == 0) {
cout << "-";
} else {
for (int j = 0; j < a[i]; j++) {
cout << "*";
}
}
cout << endl;
}
}
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(10);
int n, sort;
while (cin >> n) {
if (n == 0)
break;
else {
fill(a.begin(), a.end(), 0);
for (int i = 0; i < n; i++) {
cin >> sort;
a[sort]++;
}
for (int i = 0; i < 10; i++) {
if (a[i] == 0) {
cout << "-";
} else {
for (int j = 0; j < a[i]; j++) {
cout << "*";
}
}
cout << endl;
}
}
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13]]
| 1
| 157
|
#include <cstdio>
main() {
int n;
while (scanf("%d", &n), n) {
int p[10] = {0}, t;
for (; n; n--)
scanf("%d", &t), p[t]++;
for (t = 0; t < 10; t++) {
if (p[t])
for (n = p[t]; n; n--)
printf("*");
else
printf("-");
}
}
}
|
#include <cstdio>
int main() {
int n;
while (scanf("%d", &n), n) {
int p[10] = {0}, t;
for (; n; n--)
scanf("%d", &t), p[t]++;
for (t = 0; t < 10; t++) {
if (p[t])
for (n = p[t]; n; n--)
printf("*");
else
printf("-");
puts("");
}
}
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 75, 76, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24]]
| 1
| 113
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N;
while (cin >> N, N) {
int d[10];
for (int i = 0; i < 10; i++)
d[i] = 0;
int No;
for (int i = 0; i < N; i++) {
cin >> No;
d[No - 1]++;
}
for (int i = 0; i < 10; i++) {
if (d[i] == 0)
printf("-");
else
for (int j = 0; j < d[i]; j++)
printf("*");
printf("\n");
}
}
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N;
while (cin >> N, N) {
int d[10];
for (int i = 0; i < 10; i++)
d[i] = 0;
int No;
for (int i = 0; i < N; i++) {
cin >> No;
d[No]++;
}
for (int i = 0; i < 10; i++) {
if (d[i] == 0)
printf("-");
else
for (int j = 0; j < d[i]; j++)
printf("*");
printf("\n");
}
}
return 0;
}
|
[["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 153
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n = 0;
int ice[10001];
for (int i = 0; i < 10001; i++) {
ice[i] = 0;
}
cin >> n;
if (n == 0) {
return false;
}
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
ice[tmp]++;
}
for (int i = 0; i < n; i++) {
if (ice[i] == 0) {
cout << '-';
}
else {
while (ice[i] != 0) {
cout << '*';
ice[i]--;
}
}
cout << endl;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n = 0;
int ice[10001];
for (int i = 0; i < 10001; i++) {
ice[i] = 0;
}
cin >> n;
if (n == 0) {
return false;
}
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
ice[tmp]++;
}
for (int i = 0; i < 10; i++) {
if (ice[i] == 0) {
cout << '-';
}
else {
while (ice[i] != 0) {
cout << '*';
ice[i]--;
}
}
cout << endl;
}
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 159
|
n=int(input())
x=[0 for i in range(10)]
while True:
if n==0:
break
for i in range(n):
a=int(input())
if a==0:
x[0]+=1
elif a==1:
x[1]+=1
elif a==2:
x[2]+=1
elif a==3:
x[3]+=1
elif a==4:
x[4]+=1
elif a==5:
x[5]+=1
elif a==6:
x[6]+=1
elif a==7:
x[7]+=1
elif a==8:
x[8]+=1
else:
x[9]+=1
for i in range(10):
if x[i]==0:
print('{}'.format('-'))
else:
print('{}'.format(x[i]*'*'))
|
while True:
n=int(input())
x=[0 for i in range(10)]
if n==0:
break
for i in range(n):
a=int(input())
if a==0:
x[0]+=1
elif a==1:
x[1]+=1
elif a==2:
x[2]+=1
elif a==3:
x[3]+=1
elif a==4:
x[4]+=1
elif a==5:
x[5]+=1
elif a==6:
x[6]+=1
elif a==7:
x[7]+=1
elif a==8:
x[8]+=1
else:
x[9]+=1
for i in range(10):
if x[i]==0:
print('{}'.format('-'))
else:
print('{}'.format(x[i]*'*'))
|
[["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 89], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 15, 146], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 0, 89], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 15, 146], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102]]
| 5
| 201
|
#!/usr/bin/env python3
while True:
n = int(input())
data = [0] * 10
if n == 0:
break
for _ in range(n):
in_data = int(input())
data[in_data - 1] += 1
for d in data:
for _ in range(d):
print("*", end="")
if d == 0:
print("-")
else:
print(end="\n")
|
#!/usr/bin/env python3
while True:
n = int(input())
data = [0] * 10
if n == 0:
break
for _ in range(n):
in_data = int(input())
data[in_data] += 1
for d in data:
for _ in range(d):
print("*", end="")
if d == 0:
print("-")
else:
print(end="\n")
|
[["-", 0, 1, 0, 677, 31, 206, 206, 657, 17, 33], ["-", 0, 1, 0, 677, 31, 206, 206, 657, 12, 612]]
| 5
| 94
|
#include <iostream>
#include <string>
using namespace std;
string convert(int n) {
string s = "";
while (n) {
s += n % 8 + '0';
n /= 8;
}
string _s = "";
for (int i = s.size() - 1; i >= 0; i--) {
char c = s[i];
if (c >= '6')
c++;
if (c >= '4')
c++;
_s += c;
}
return _s;
}
int main() {
int n;
cin >> n;
while (n) {
cout << convert(n) << endl;
cin >> n;
}
}
|
#include <iostream>
#include <string>
using namespace std;
string convert(int n) {
string s = "";
while (n) {
s += n % 8 + '0';
n /= 8;
}
string _s = "";
for (int i = s.size() - 1; i >= 0; i--) {
char c = s[i];
if (c >= '4')
c++;
if (c >= '6')
c++;
_s += c;
}
return _s;
}
int main() {
int n;
cin >> n;
while (n) {
cout << convert(n) << endl;
cin >> n;
}
}
|
[["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125]]
| 1
| 139
|
#define _USE_MATH_DEFINES
#define INF 10000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const double eps = 1e-8;
int main() {
const char oct[] = {'0', '1', '2', '3', '5', '7', '8', '9'};
ll n;
while (~scanf("%lld", &n)) {
if (n == 0)
break;
char buf[11];
sprintf(buf, "%llo", n);
for (int i = 10; i >= 0; i--) {
if (buf[i] - '0' < 0 || buf[i] - '0' >= 8)
continue;
buf[i] = oct[buf[i] - '0'];
}
printf("%s", buf);
}
}
|
#define _USE_MATH_DEFINES
#define INF 10000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const double eps = 1e-8;
int main() {
const char oct[] = {'0', '1', '2', '3', '5', '7', '8', '9'};
ll n;
while (~scanf("%lld", &n)) {
if (n == 0)
break;
char buf[11];
sprintf(buf, "%llo", n);
for (int i = 10; i >= 0; i--) {
if (buf[i] - '0' < 0 || buf[i] - '0' >= 8)
continue;
buf[i] = oct[buf[i] - '0'];
}
printf("%s\n", buf);
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 215
|
#include <iostream>
#include <vector>
using namespace std;
const int d2o[] = {0, 1, 2, 3, 5, 6, 7, 9};
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
vector<int> ans;
while (n > 0) {
ans.push_back(d2o[n % 8]);
n /= 8;
}
for (int i = ans.size() - 1; i >= 0; --i)
cout << ans[i];
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
const int d2o[] = {0, 1, 2, 3, 5, 7, 8, 9};
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
vector<int> ans;
while (n > 0) {
ans.push_back(d2o[n % 8]);
n /= 8;
}
for (int i = ans.size() - 1; i >= 0; --i)
cout << ans[i];
cout << endl;
}
return 0;
}
|
[["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]]
| 1
| 121
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int d[99] = {0}, c = 0;
while (n > 0) {
d[c++] = n % 8;
n /= 8;
}
while (c--)
cout << "01235789"[d[c]] << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int d[99] = {0}, c = 0;
while (n > 0) {
d[c++] = n % 8;
n /= 8;
}
while (c--)
cout << "01235789"[d[c]];
cout << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 52, 8, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22]]
| 1
| 83
|
#include <iostream>
using namespace std;
unsigned long int dec_to_oct(unsigned long int num) {
int result = 0;
for (int i = 1; num != 0; i *= 10) {
result += (num % 8) * i;
num = num / 8;
}
return result;
}
int main(void) {
unsigned long int room_num;
unsigned long int buf;
unsigned long int new_room_num;
int num_table[8] = {
0, 1, 2, 3, 5, 7, 8, 9,
};
while (true) {
cin >> room_num;
if (room_num == 0)
break;
buf = dec_to_oct(room_num);
new_room_num = 0;
for (int i = 1; buf != 0; i *= 10) {
new_room_num += num_table[(buf % 10)] * i;
buf /= 10;
}
cout << new_room_num << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
unsigned long int dec_to_oct(unsigned long int num) {
unsigned long int result = 0;
for (int i = 1; num != 0; i *= 10) {
result += (num % 8) * i;
num = num / 8;
}
return result;
}
int main(void) {
unsigned long int room_num;
unsigned long int buf;
unsigned long int new_room_num;
unsigned long int num_table[8] = {
0, 1, 2, 3, 5, 7, 8, 9,
};
while (true) {
cin >> room_num;
if (room_num == 0)
break;
buf = dec_to_oct(room_num);
new_room_num = 0;
for (int i = 1; buf != 0; i *= 10) {
new_room_num += num_table[(buf % 10)] * i;
buf /= 10;
}
cout << new_room_num << endl;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 178
|
def ge(arr):
for i in range(len(arr)):
tmp = int(arr[i])
if tmp >= 4:
tmp += 1
if tmp >= 6:
tmp += 1
arr[i] = str(tmp)
while True:
n = int(input)
if n == 0:
break
print("".join(ge(list(oct(n))[2:])))
|
def ge(arr):
for i in range(len(arr)):
tmp = int(arr[i])
if tmp >= 4:
tmp += 1
if tmp >= 6:
tmp += 1
arr[i] = str(tmp)
return arr
while True:
n = int(input())
if n == 0:
break
print("".join(ge(list(oct(n))[2:])))
|
[["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 38], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 89
|
inputlist=[]
while True:
inputnum=int(input())
if(inputnum==0):break
inputlist.append(inputnum)
def octnpower(num):
flag=0
maxi=0
maxj=0
if(num<8):
temp[-1]=num
return
for i in range(1,11):
for j in range(1,8):
if(num>=(8**i)*j):
flag=(8**i)*j
maxi=i
maxj=j
else:
temp[-maxi-1]=maxj
return octnpower(num-flag)
octdictionary={0:0,1:1,2:2,3:3,4:5,5:7,6:8,7:9}
for i in range(len(inputlist)):
temp=[0]*10
octnpower(inputlist[i])
print(temp)
#temp.reverse()
for j in range(len(temp)):
index=j
if(temp[j]!=0):break
temp=temp[index:]
for j in range(len(temp)):
temp[j]=octdictionary[temp[j]]
ansstr=""
for j in range(len(temp)):
ansstr+=str(temp[j])
print(ansstr)
|
inputlist=[]
while True:
inputnum=int(input())
if(inputnum==0):break
inputlist.append(inputnum)
def octnpower(num):
flag=0
maxi=0
maxj=0
if(num<8):
temp[-1]=num
return
for i in range(1,11):
for j in range(1,8):
if(num>=(8**i)*j):
flag=(8**i)*j
maxi=i
maxj=j
else:
temp[-maxi-1]=maxj
return octnpower(num-flag)
octdictionary={0:0,1:1,2:2,3:3,4:5,5:7,6:8,7:9}
for i in range(len(inputlist)):
temp=[0]*10
octnpower(inputlist[i])
for j in range(len(temp)):
index=j
if(temp[j]!=0):break
temp=temp[index:]
for j in range(len(temp)):
temp[j]=octdictionary[temp[j]]
ansstr=""
for j in range(len(temp)):
ansstr+=str(temp[j])
print(ansstr)
|
[["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]]
| 5
| 273
|
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
int INF = 1 << 28;
double EPS = 1e-9;
int m, n;
int[][] a, b;
void run() {
for (;;) {
m = sc.nextInt();
n = sc.nextInt();
if ((m | n) == 0) {
break;
}
a = new int[m][m];
b = new int[n][n];
for (int j = 0; j < m; j++) {
for (int i = 0; i < m; i++) {
a[j][i] = sc.nextInt();
}
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
b[j][i] = sc.nextInt();
}
}
solve();
}
}
void solve() {
int[][][] c = new int[4][n][n];
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
c[0][j][i] = b[j][i];
c[1][i][n - 1 - j] = b[j][i];
c[2][n - 1 - j][n - 1 - i] = b[j][i];
c[3][n - 1 - i][j] = b[j][i];
}
}
int p = m * m;
for (int i = 0; i < 4; i++) {
p = min(p, match(c[i]));
}
if (p == m * m) {
println("NA");
} else {
println((p % m + 1) + " " + (p / m + 1));
}
}
int match(int[][] c) {
for (int y = 0; y + n <= m; y++) {
for (int x = 0; x + n <= m; x++) {
boolean f = true;
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
f &= c[j][i] == -1 || c[j][i] == a[y + j][x + i];
}
}
if (f) {
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
if (c[j][i] != -1) {
return (y + j) * m + (x + i);
}
}
}
}
}
}
return n * n;
}
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
void print(String s) { System.out.print(s); }
void println(String s) { System.out.println(s); }
public static void main(String[] args) {
// System.setOut(new PrintStream(new BufferedOutputStream(System.out)));
new Main().run();
}
}
|
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
int INF = 1 << 28;
double EPS = 1e-9;
int m, n;
int[][] a, b;
void run() {
for (;;) {
m = sc.nextInt();
n = sc.nextInt();
if ((m | n) == 0) {
break;
}
a = new int[m][m];
b = new int[n][n];
for (int j = 0; j < m; j++) {
for (int i = 0; i < m; i++) {
a[j][i] = sc.nextInt();
}
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
b[j][i] = sc.nextInt();
}
}
solve();
}
}
void solve() {
int[][][] c = new int[4][n][n];
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
c[0][j][i] = b[j][i];
c[1][i][n - 1 - j] = b[j][i];
c[2][n - 1 - j][n - 1 - i] = b[j][i];
c[3][n - 1 - i][j] = b[j][i];
}
}
int p = m * m;
for (int i = 0; i < 4; i++) {
p = min(p, match(c[i]));
}
if (p == m * m) {
println("NA");
} else {
println((p % m + 1) + " " + (p / m + 1));
}
}
int match(int[][] c) {
for (int y = 0; y + n <= m; y++) {
for (int x = 0; x + n <= m; x++) {
boolean f = true;
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
f &= c[j][i] == -1 || c[j][i] == a[y + j][x + i];
}
}
if (f) {
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
if (c[j][i] != -1) {
return (y + j) * m + (x + i);
}
}
}
}
}
}
return m * m;
}
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
void print(String s) { System.out.print(s); }
void println(String s) { System.out.println(s); }
public static void main(String[] args) {
// System.setOut(new PrintStream(new BufferedOutputStream(System.out)));
new Main().run();
}
}
|
[["-", 0, 195, 8, 196, 0, 37, 0, 16, 31, 22], ["+", 0, 195, 8, 196, 0, 37, 0, 16, 31, 22], ["-", 0, 195, 8, 196, 0, 37, 0, 16, 12, 22], ["+", 0, 195, 8, 196, 0, 37, 0, 16, 12, 22]]
| 3
| 753
|
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
final int m = sc.nextInt();
if (n == 0 && m == 0) {
break;
}
int[][] map = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
map[i][j] = sc.nextInt();
}
}
int[][] pict = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict[i][j] = sc.nextInt();
}
}
int[][] pict90 = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict90[i][j] = pict[(m - 1) - j][i];
}
}
int[][] pict180 = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict180[i][j] = pict90[(m - 1) - j][i];
}
}
int[][] pict270 = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict270[i][j] = pict180[(m - 1) - j][i];
}
}
int count = 0;
int[][][] order = new int[4][][];
boolean p = false, p_90 = false, p_180 = false, p_270 = false;
END_O:
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (count >= 4) {
break END_O;
}
if (!p && pict[i][j] != -1) {
p = true;
order[count] = pict;
count++;
}
if (!p_90 && pict90[i][j] != -1) {
p_90 = true;
order[count] = pict90;
count++;
}
if (!p_180 && pict180[i][j] != -1) {
p_180 = true;
order[count] = pict180;
count++;
}
if (!p_270 && pict270[i][j] != -1) {
p_270 = true;
order[count] = pict270;
count++;
}
}
}
boolean flag = false;
END_2:
for (int i = 0; i < (n - m); i++) {
for (int j = 0; j < (n - m); j++) {
for (int[][] window : order) {
boolean found = true;
END:
for (int k = 0; k < m; k++) {
for (int l = 0; l < m; l++) {
if (window[k][l] == -1) {
continue;
}
if (window[k][l] != map[i + k][j + l]) {
found = false;
break END;
}
}
}
if (found) {
flag = true;
for (int k = 0; k < m; k++) {
for (int l = 0; l < m; l++) {
if (window[k][l] == -1) {
continue;
}
System.out.println((j + l + 1) + " " + (i + k + 1));
break END_2;
}
}
}
}
}
}
if (!flag) {
System.out.println("NA");
}
}
}
}
|
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
final int m = sc.nextInt();
if (n == 0 && m == 0) {
break;
}
int[][] map = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
map[i][j] = sc.nextInt();
}
}
int[][] pict = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict[i][j] = sc.nextInt();
}
}
int[][] pict90 = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict90[i][j] = pict[(m - 1) - j][i];
}
}
int[][] pict180 = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict180[i][j] = pict90[(m - 1) - j][i];
}
}
int[][] pict270 = new int[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pict270[i][j] = pict180[(m - 1) - j][i];
}
}
int count = 0;
int[][][] order = new int[4][][];
boolean p = false, p_90 = false, p_180 = false, p_270 = false;
END_O:
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (count >= 4) {
break END_O;
}
if (!p && pict[i][j] != -1) {
p = true;
order[count] = pict;
count++;
}
if (!p_90 && pict90[i][j] != -1) {
p_90 = true;
order[count] = pict90;
count++;
}
if (!p_180 && pict180[i][j] != -1) {
p_180 = true;
order[count] = pict180;
count++;
}
if (!p_270 && pict270[i][j] != -1) {
p_270 = true;
order[count] = pict270;
count++;
}
}
}
boolean flag = false;
END_2:
for (int i = 0; i < (n - m + 1); i++) {
for (int j = 0; j < (n - m + 1); j++) {
for (int[][] window : order) {
boolean found = true;
END:
for (int k = 0; k < m; k++) {
for (int l = 0; l < m; l++) {
if (window[k][l] == -1) {
continue;
}
if (window[k][l] != map[i + k][j + l]) {
found = false;
break END;
}
}
}
if (found) {
flag = true;
for (int k = 0; k < m; k++) {
for (int l = 0; l < m; l++) {
if (window[k][l] == -1) {
continue;
}
System.out.println((j + l + 1) + " " + (i + k + 1));
break END_2;
}
}
}
}
}
}
if (!flag) {
System.out.println("NA");
}
}
}
}
|
[["+", 0, 7, 15, 16, 12, 23, 0, 16, 17, 72], ["+", 0, 7, 15, 16, 12, 23, 0, 16, 12, 499]]
| 3
| 884
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(), (x).end())
#define all(x) (x).begin(), (x).end()
#define EQ(a, b) (abs((a) - (b)) < eps)
int f[120][120];
int p[55][55];
int tmp[55][55];
int n, m;
int adj;
P ans;
void rotate() {
memset(tmp, -1, sizeof(tmp));
for (int j = 0; j < m; j++) {
for (int i = m - 1; i >= 0; i--) {
tmp[j][m - 1 - i] = p[i][j];
}
}
memcpy(p, tmp, sizeof(tmp));
for (int i = 0; i < m; i++) {
if (p[0][i] != -1) {
adj = i;
return;
}
}
}
bool check(int x, int y) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (p[i][j] == -1)
continue;
if (x + i < 0 || x + i >= n || y + j < 0 || y + j >= n)
return false;
if (f[x + i][y + j] != p[i][j])
return false;
}
}
return true;
}
void solve() {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (check(i, j)) {
ans = min(ans, mp(i, j + adj));
return;
}
}
}
return;
}
int main() {
while (1) {
ans = mp(INF, INF);
memset(f, -1, sizeof(f));
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &f[i][j]);
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &p[i][j]);
}
}
for (int i = 0; i < 4; i++) {
rotate();
solve();
}
if (ans.fi == INF)
puts("NA");
else
printf("%d %d\n", ans.fi + 1, ans.sec + 1);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(), (x).end())
#define all(x) (x).begin(), (x).end()
#define EQ(a, b) (abs((a) - (b)) < eps)
int f[120][120];
int p[55][55];
int tmp[55][55];
int n, m;
int adj;
P ans;
void rotate() {
memset(tmp, -1, sizeof(tmp));
for (int j = 0; j < m; j++) {
for (int i = m - 1; i >= 0; i--) {
tmp[j][m - 1 - i] = p[i][j];
}
}
memcpy(p, tmp, sizeof(tmp));
for (int i = 0; i < m; i++) {
if (p[0][i] != -1) {
adj = i;
return;
}
}
}
bool check(int x, int y) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (p[i][j] == -1)
continue;
if (x + i < 0 || x + i >= n || y + j < 0 || y + j >= n)
return false;
if (f[x + i][y + j] != p[i][j])
return false;
}
}
return true;
}
void solve() {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (check(i, j)) {
ans = min(ans, mp(i, j + adj));
return;
}
}
}
return;
}
int main() {
while (1) {
ans = mp(INF, INF);
memset(f, -1, sizeof(f));
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &f[i][j]);
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &p[i][j]);
}
}
for (int i = 0; i < 4; i++) {
rotate();
solve();
}
if (ans.fi == INF)
puts("NA");
else
printf("%d %d\n", ans.sec + 1, ans.fi + 1);
}
return 0;
}
|
[["-", 0, 2, 3, 4, 0, 16, 31, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 16, 31, 118, 119, 120]]
| 1
| 667
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
int main() {
int field[128][128];
int piece[4][64][64];
int N, M;
while (N = in(), M = in()) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
field[i][j] = in();
}
}
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
piece[0][i][j] = in();
}
}
for (int r = 1; r < 4; r++) {
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
piece[r][i][j] = piece[r - 1][M - j - 1][i];
}
}
}
vector<duo> ps;
for (int i = 0; i < N - M; i++) {
for (int j = 0; j < N - M; j++) {
for (int r = 0; r < 4; r++) {
bool ok = true;
for (int k = 0; k < M; k++) {
for (int l = 0; l < M; l++) {
if (piece[r][k][l] == -1)
continue;
if (piece[r][k][l] == field[i + k][j + l])
continue;
ok = false;
goto END1;
}
}
END1:;
if (ok) {
for (int k = 0; k < M; k++) {
for (int l = 0; l < M; l++) {
if (piece[r][k][l] == -1)
continue;
ps.emplace_back(i + k + 1, j + l + 1);
goto END2;
}
}
END2:;
}
}
}
}
sort(begin(ps), end(ps));
if (ps.size())
printf("%d %d\n", get<1>(ps[0]), get<0>(ps[0]));
else
puts("NA");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
int main() {
int field[128][128];
int piece[4][64][64];
int N, M;
while (N = in(), M = in()) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
field[i][j] = in();
}
}
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
piece[0][i][j] = in();
}
}
for (int r = 1; r < 4; r++) {
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
piece[r][i][j] = piece[r - 1][M - j - 1][i];
}
}
}
vector<duo> ps;
for (int i = 0; i <= N - M; i++) {
for (int j = 0; j <= N - M; j++) {
for (int r = 0; r < 4; r++) {
bool ok = true;
for (int k = 0; k < M; k++) {
for (int l = 0; l < M; l++) {
if (piece[r][k][l] == -1)
continue;
if (piece[r][k][l] == field[i + k][j + l])
continue;
ok = false;
goto END1;
}
}
END1:;
if (ok) {
for (int k = 0; k < M; k++) {
for (int l = 0; l < M; l++) {
if (piece[r][k][l] == -1)
continue;
ps.emplace_back(i + k + 1, j + l + 1);
goto END2;
}
}
END2:;
}
}
}
}
sort(begin(ps), end(ps));
if (ps.size())
printf("%d %d\n", get<1>(ps[0]), get<0>(ps[0]));
else
puts("NA");
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 608
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define LT(a, b, c, d) (((a) < (c)) || ((a) == (c) && (b) < (d)))
#define INF 114514
int view[100][100];
int pict[50][50];
int supX, supP;
int mendoP, mendoQ;
int resX, resY;
bool rotPict() {
int buf[50][50];
FOR(p, 0, supP) FOR(q, 0, supP) buf[p][q] = pict[supP - 1 - q][p];
FOR(p, 0, supP) FOR(q, 0, supP) pict[p][q] = buf[p][q];
}
bool findMendo() {
FOR(p, 0, supP) FOR(q, 0, supP) if (pict[p][q] != -1) {
mendoP = p;
mendoQ = q;
return true;
}
return false;
}
bool match(int offX, int offY) {
FOR(p, 0, supP)
FOR(q, 0, supP) if (pict[p][q] != -1 &&
pict[p][q] != view[offX + p][offY + q]) return false;
return true;
}
bool letMatch() {
FOR(offX, 0, supX - supP) FOR(offY, 0, supX - supP) {
if (match(offX, offY)) {
if (LT(offX + mendoP, offY + mendoQ, resX, resY)) {
resX = offX + mendoP;
resY = offY + mendoQ;
}
return true;
}
}
}
int main() {
while (true) {
cin >> supX >> supP;
if (!supX && !supP)
return 0;
FOR(x, 0, supX) FOR(y, 0, supX) cin >> view[x][y];
// FOR(x,0,supX) {FOR(y,0,supX) cout << view[x][y] << " "; cout << endl;}
FOR(p, 0, supP) FOR(q, 0, supP) cin >> pict[p][q];
resX = INF;
resY = INF;
REP(i, 4) {
// cout << endl;
// FOR(p,0,supP) {FOR(q,0,supP) cout << pict[p][q] << " "; cout << endl;}
findMendo();
letMatch();
rotPict();
}
if (resX == INF && resY == INF) {
cout << "NA" << endl;
} else {
cout << resY + 1 << " " << resX + 1 << endl;
}
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define LT(a, b, c, d) (((a) < (c)) || ((a) == (c) && (b) < (d)))
#define INF 114514
int view[100][100];
int pict[50][50];
int supX, supP;
int mendoP, mendoQ;
int resX, resY;
bool rotPict() {
int buf[50][50];
FOR(p, 0, supP) FOR(q, 0, supP) buf[p][q] = pict[supP - 1 - q][p];
FOR(p, 0, supP) FOR(q, 0, supP) pict[p][q] = buf[p][q];
}
bool findMendo() {
FOR(p, 0, supP) FOR(q, 0, supP) if (pict[p][q] != -1) {
mendoP = p;
mendoQ = q;
return true;
}
return false;
}
bool match(int offX, int offY) {
FOR(p, 0, supP)
FOR(q, 0, supP) if (pict[p][q] != -1 &&
pict[p][q] != view[offX + p][offY + q]) return false;
return true;
}
bool letMatch() {
FOR(offX, 0, supX - supP + 1) FOR(offY, 0, supX - supP + 1) {
if (match(offX, offY)) {
if (LT(offX + mendoP, offY + mendoQ, resX, resY)) {
resX = offX + mendoP;
resY = offY + mendoQ;
}
return true;
}
}
}
int main() {
while (true) {
cin >> supX >> supP;
if (!supX && !supP)
return 0;
FOR(x, 0, supX) FOR(y, 0, supX) cin >> view[x][y];
// FOR(x,0,supX) {FOR(y,0,supX) cout << view[x][y] << " "; cout << endl;}
FOR(p, 0, supP) FOR(q, 0, supP) cin >> pict[p][q];
resX = INF;
resY = INF;
REP(i, 4) {
// cout << endl;
// FOR(p,0,supP) {FOR(q,0,supP) cout << pict[p][q] << " "; cout << endl;}
findMendo();
letMatch();
rotPict();
}
if (resX == INF && resY == INF) {
cout << "NA" << endl;
} else {
cout << resY + 1 << " " << resX + 1 << endl;
}
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 523
|
#include <iostream>
using namespace std;
int x[110][110];
int p[100][100][4];
int n, m;
int main() {
while (true) {
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> p[i][j][0];
}
}
for (int i = 1; i <= 3; i++) {
for (int j = 0; j < m; j++) {
for (int k = 0; k < m; k++) {
p[m - 1 - k][j][i] = p[j][k][i - 1];
}
}
}
int cnt = 0;
for (int i = 0; i <= n - m; i++) {
for (int j = 0; j <= n - m; j++) {
for (int k = 0; k < 4; k++) {
bool ok = true;
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (p[l][o][k] == -1) {
continue;
}
if (p[l][o][k] != x[i + l][j + o]) {
ok = false;
}
}
}
if (ok == true && cnt == 0) {
int ok2 = false;
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (p[l][o][k] >= 0 && ok2 == false) {
int X = i + l + 1;
int Y = j + o + 1;
cout << X << ' ' << Y << endl;
cnt = 1;
ok2 = true;
}
}
}
}
}
}
}
if (cnt == 0) {
cout << "NA" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int x[110][110];
int p[100][100][4];
int n, m;
int main() {
while (true) {
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> p[i][j][0];
}
}
for (int i = 1; i <= 3; i++) {
for (int j = 0; j < m; j++) {
for (int k = 0; k < m; k++) {
p[m - 1 - k][j][i] = p[j][k][i - 1];
}
}
}
int cnt = 0;
for (int i = 0; i <= n - m; i++) {
for (int j = 0; j <= n - m; j++) {
for (int k = 0; k < 4; k++) {
bool ok = true;
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (p[l][o][k] == -1) {
continue;
}
if (p[l][o][k] != x[i + l][j + o]) {
ok = false;
}
}
}
if (ok == true && cnt == 0) {
int ok2 = false;
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (p[l][o][k] >= 0 && ok2 == false) {
int X = i + l + 1;
int Y = j + o + 1;
cout << Y << ' ' << X << endl;
cnt = 1;
ok2 = true;
}
}
}
}
}
}
}
if (cnt == 0) {
cout << "NA" << endl;
}
}
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 64, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 498
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
const int inf = 1e9;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
int n, m;
while (scanf("%d %d", n, m), n) {
vvi in(n, vi(n));
vvi pic(m, vi(m));
rep(i, n) rep(j, n) scanf("%d", &in[i][j]);
rep(i, m) rep(j, m) scanf("%d", &pic[i][j]);
pii out(inf, inf);
rep(e, 4) {
rep(i, n - m + 1) rep(j, n - m + 1) {
pii t(inf, inf);
rep(k, m) rep(l, m) if (pic[k][l] != -1 &&
in[i + k][j + l] != pic[k][l]) goto en;
else if (pic[k][l] != -1) t = min(t, pii(i + k, j + l));
out = min(out, t);
goto end;
en:;
}
end:;
vvi tmp = pic;
rep(i, m) rep(j, m) pic[i][j] = tmp[j][m - i - 1];
}
if (out.first == inf)
cout << "NA" << endl;
else
cout << out.second + 1 << " " << out.first + 1 << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
const int inf = 1e9;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
int n, m;
while (scanf("%d %d", &n, &m), n) {
vvi in(n, vi(n));
vvi pic(m, vi(m));
rep(i, n) rep(j, n) scanf("%d", &in[i][j]);
rep(i, m) rep(j, m) scanf("%d", &pic[i][j]);
pii out(inf, inf);
rep(e, 4) {
rep(i, n - m + 1) rep(j, n - m + 1) {
pii t(inf, inf);
rep(k, m) rep(l, m) if (pic[k][l] != -1 &&
in[i + k][j + l] != pic[k][l]) goto en;
else if (pic[k][l] != -1) t = min(t, pii(i + k, j + l));
out = min(out, t);
goto end;
en:;
}
end:;
vvi tmp = pic;
rep(i, m) rep(j, m) pic[i][j] = tmp[j][m - i - 1];
}
if (out.first == inf)
cout << "NA" << endl;
else
cout << out.second + 1 << " " << out.first + 1 << endl;
}
}
|
[["+", 51, 34, 31, 2, 3, 4, 0, 66, 17, 67]]
| 1
| 437
|
#include <iostream>
using namespace std;
int n, m;
int w[100][100];
int p[50][50];
int b;
bool input() {
cin >> n >> m;
if (!n && !m) {
return false;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> w[i][j];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
cin >> p[i][j];
}
}
return true;
}
void rotate() {
int tmp[50][50];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
tmp[i][j] = p[i][j];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
p[i][j] = tmp[m - 1 - j][i];
}
}
}
bool check(int r, int c) {
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
if (p[i][j] == -1) {
continue;
}
if (p[i][j] != w[r + i][c + j]) {
return false;
}
}
}
return true;
}
void solve() {
b = n * n;
for (int i = 0; i < 4; ++i) {
bool found = false;
int dr = -1;
int dc = -1;
for (int r = 0; r < m; ++r) {
for (int c = 0; c < m; ++c) {
if (p[r][c] != -1) {
dr = r;
dc = c;
found = true;
break;
}
}
if (found) {
break;
}
}
found = false;
for (int r = 0; r < n - m; ++r) {
for (int c = 0; c < n - m; ++c) {
int bb = (r + dr) * n + c + dc;
if (check(r, c)) {
if (b > bb) {
b = bb;
}
found = true;
break;
}
}
if (found) {
break;
}
}
rotate();
}
if (b == n * n) {
cout << "NA" << endl;
return;
} else {
cout << b % n + 1 << " " << b / n + 1 << endl;
}
}
int main() {
while (input()) {
solve();
}
return 0;
}
|
#include <iostream>
using namespace std;
int n, m;
int w[100][100];
int p[50][50];
int b;
bool input() {
cin >> n >> m;
if (!n && !m) {
return false;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> w[i][j];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
cin >> p[i][j];
}
}
return true;
}
void rotate() {
int tmp[50][50];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
tmp[i][j] = p[i][j];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
p[i][j] = tmp[m - 1 - j][i];
}
}
}
bool check(int r, int c) {
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++j) {
if (p[i][j] == -1) {
continue;
}
if (p[i][j] != w[r + i][c + j]) {
return false;
}
}
}
return true;
}
void solve() {
b = n * n;
for (int i = 0; i < 4; ++i) {
bool found = false;
int dr = -1;
int dc = -1;
for (int r = 0; r < m; ++r) {
for (int c = 0; c < m; ++c) {
if (p[r][c] != -1) {
dr = r;
dc = c;
found = true;
break;
}
}
if (found) {
break;
}
}
found = false;
for (int r = 0; r <= n - m; ++r) {
for (int c = 0; c <= n - m; ++c) {
int bb = (r + dr) * n + c + dc;
if (check(r, c)) {
if (b > bb) {
b = bb;
}
found = true;
break;
}
}
if (found) {
break;
}
}
rotate();
}
if (b == n * n) {
cout << "NA" << endl;
return;
} else {
cout << b % n + 1 << " " << b / n + 1 << endl;
}
}
int main() {
while (input()) {
solve();
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 619
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, N) for (long long i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
int n, m;
int w[110][110];
int p[4][100][100];
int main() {
while (cin >> n >> m && n + m) {
REP(i, n) {
REP(j, n) { cin >> w[i][j]; }
}
REP(i, m) {
REP(j, m) {
cin >> p[0][i][j];
p[1][j][m - 1 - i] = p[0][i][j];
p[2][m - 1 - i][m - 1 - j] = p[0][i][j];
p[3][m - 1 - j][i] = p[0][i][j];
}
}
// REP(k, 4){
// REP(i, m){
// REP(j, m){
// cout << p[k][i][j] << " ";
// }
// cout << endl;
// }
// cout << endl;
//}
vector<P> vp;
REP(i, n - m) {
REP(j, n - m) {
REP(k, 4) {
bool f = 1;
REP(l, m) {
REP(o, m) {
if (p[k][l][o] != -1 && p[k][l][o] != w[i + l][j + o]) {
f = 0;
}
}
}
if (f) {
bool g = 1;
REP(l, m) {
REP(o, m) {
if (p[k][l][o] != -1) {
vp.push_back(P(i + l + 1, j + o + 1));
g = 0;
}
if (!g)
break;
}
if (!g)
break;
}
}
}
}
}
if (vp.size() == 0) {
cout << "NA" << endl;
} else {
sort(ALL(vp));
cout << vp[0].second << " " << vp[0].first << endl;
}
}
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, N) for (long long i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
int n, m;
int w[110][110];
int p[4][100][100];
int main() {
while (cin >> n >> m && n + m) {
REP(i, n) {
REP(j, n) { cin >> w[i][j]; }
}
REP(i, m) {
REP(j, m) {
cin >> p[0][i][j];
p[1][j][m - 1 - i] = p[0][i][j];
p[2][m - 1 - i][m - 1 - j] = p[0][i][j];
p[3][m - 1 - j][i] = p[0][i][j];
}
}
// REP(k, 4){
// REP(i, m){
// REP(j, m){
// cout << p[k][i][j] << " ";
// }
// cout << endl;
// }
// cout << endl;
//}
vector<P> vp;
REP(i, n - m + 1) {
REP(j, n - m + 1) {
REP(k, 4) {
bool f = 1;
REP(l, m) {
REP(o, m) {
if (p[k][l][o] != -1 && p[k][l][o] != w[i + l][j + o]) {
f = 0;
}
}
}
if (f) {
bool g = 1;
REP(l, m) {
REP(o, m) {
if (p[k][l][o] != -1) {
vp.push_back(P(i + l + 1, j + o + 1));
g = 0;
}
if (!g)
break;
}
if (!g)
break;
}
}
}
}
}
if (vp.size() == 0) {
cout << "NA" << endl;
} else {
sort(ALL(vp));
cout << vp[0].second << " " << vp[0].first << endl;
}
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 562
|
#include <iostream>
using namespace std;
typedef pair<int, int> P;
int pic[50][50];
void rotate(int m) {
int tmp[50][50];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
tmp[i][j] = pic[m - j - 1][i];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++)
pic[i][j] = tmp[i][j];
}
}
int main() {
int n, m;
while (cin >> n >> m, n) {
int field[100][100];
P mi = P(500, 500);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> field[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> pic[i][j];
}
}
for (int i = 0; i < 4; i++) {
rotate(m);
for (int j = 0; j < n - m + 1; j++) {
for (int k = 0; k < n - m + 1; k++) {
bool flag = true;
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (!(pic[l][o] == -1 || pic[l][o] == field[j + l][k + o]))
flag = false;
}
}
if (flag) {
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (pic[l][o] != -1) {
mi = min(mi, P(j + l, k + o));
}
}
}
}
}
}
}
if (mi == P(500, 500))
cout << "NA" << endl;
else
cout << mi.first + 1 << " " << mi.second + 1 << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
typedef pair<int, int> P;
int pic[50][50];
void rotate(int m) {
int tmp[50][50];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
tmp[i][j] = pic[m - j - 1][i];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++)
pic[i][j] = tmp[i][j];
}
}
int main() {
int n, m;
while (cin >> n >> m, n) {
int field[100][100];
P mi = P(500, 500);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> field[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> pic[i][j];
}
}
for (int i = 0; i < 4; i++) {
rotate(m);
for (int j = 0; j < n - m + 1; j++) {
for (int k = 0; k < n - m + 1; k++) {
bool flag = true;
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (!(pic[l][o] == -1 || pic[l][o] == field[j + l][k + o]))
flag = false;
}
}
if (flag) {
for (int l = 0; l < m; l++) {
for (int o = 0; o < m; o++) {
if (pic[l][o] != -1) {
mi = min(mi, P(j + l, k + o));
}
}
}
}
}
}
}
if (mi == P(500, 500))
cout << "NA" << endl;
else
cout << mi.second + 1 << " " << mi.first + 1 << endl;
}
return 0;
}
|
[["-", 31, 16, 31, 16, 12, 16, 31, 118, 119, 120], ["+", 31, 16, 31, 16, 12, 16, 31, 118, 119, 120], ["-", 0, 16, 31, 16, 12, 16, 31, 118, 119, 120], ["+", 0, 16, 31, 16, 12, 16, 31, 118, 119, 120]]
| 1
| 515
|
#include <cstdio>
using namespace std;
#define INF 101
int M, N;
int f[100][100];
int p[50][50][4];
void check(int x, int y, int d, int &ansx, int &ansy) {
int mx = INF, my = INF;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
if (p[j][i][d] == -1)
continue;
if (p[j][i][d] != f[j + x][i + y])
return;
if (my > (i + y) || (my == (i + y) && mx > (j + x))) {
mx = j + x;
my = i + y;
}
}
if (ansy > my || (ansy == my && ansx > mx)) {
ansx = mx;
ansy = my;
}
}
int main() {
while (scanf("%d%d", &M, &N), (N || M)) {
for (int i = 0; i < M; i++)
for (int j = 0; j < M; j++)
scanf("%d", &f[j][i]);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
scanf("%d", &p[j][i][0]);
for (int i = 0; i < 3; i++)
for (int j = 0; j < N; j++)
for (int k = 0; k < N; k++)
p[N - 1 - j][k][i + 1] = p[k][j][i];
int ansx = INF, ansy = INF;
for (int j = 0; j < (M - N); j++)
for (int k = 0; k < (M - N); k++)
for (int i = 0; i < 4; i++)
check(k, j, i, ansx, ansy);
if (ansx == 101)
puts("NA");
else
printf("%d %d\n", ansx + 1, ansy + 1);
}
}
|
#include <cstdio>
using namespace std;
#define INF 101
int M, N;
int f[100][100];
int p[50][50][4];
void check(int x, int y, int d, int &ansx, int &ansy) {
int mx = INF, my = INF;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
if (p[j][i][d] == -1)
continue;
if (p[j][i][d] != f[j + x][i + y])
return;
if (my > (i + y) || (my == (i + y) && mx > (j + x))) {
mx = j + x;
my = i + y;
}
}
if (ansy > my || (ansy == my && ansx > mx)) {
ansx = mx;
ansy = my;
}
}
int main() {
while (scanf("%d%d", &M, &N), (N || M)) {
for (int i = 0; i < M; i++)
for (int j = 0; j < M; j++)
scanf("%d", &f[j][i]);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
scanf("%d", &p[j][i][0]);
for (int i = 0; i < 3; i++)
for (int j = 0; j < N; j++)
for (int k = 0; k < N; k++)
p[N - 1 - j][k][i + 1] = p[k][j][i];
int ansx = INF, ansy = INF;
for (int j = 0; j <= (M - N); j++)
for (int k = 0; k <= (M - N); k++)
for (int i = 0; i < 4; i++)
check(k, j, i, ansx, ansy);
if (ansx == INF)
puts("NA");
else
printf("%d %d\n", ansx + 1, ansy + 1);
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]]
| 1
| 500
|
#include <iostream>
#include <vector>
using namespace std;
int scene[100][100], picture[50][50], temporary[50][50];
int main() {
while (true) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int y = 0; y < n; ++y) {
for (int x = 0; x < n; ++x) {
cin >> scene[y][x];
}
}
for (int y = 0; y < m; ++y) {
for (int x = 0; x < m; ++x) {
cin >> picture[y][x];
}
}
bool found = false;
int answerx = n, answery = n;
for (int r = 0; r < 4; ++r) {
for (int y = n - m - 1; y >= 0; --y) {
for (int x = n - m - 1; x >= 0; --x) {
bool flag = true;
int tx, ty;
for (int py = m - 1; py >= 0 && flag; --py) {
for (int px = m - 1; px >= 0; --px) {
if (picture[py][px] >= 0) {
if (picture[py][px] != scene[y + py][x + px]) {
flag = false;
break;
} else {
tx = x + px;
ty = y + py;
}
}
}
}
if (flag) {
found = true;
if (ty < answery) {
answery = ty;
answerx = tx;
} else if (ty == answery) {
answerx = min(answerx, tx);
}
}
}
}
for (int y = 0; y < m; ++y) {
for (int x = 0; x < m; ++x) {
temporary[y][x] = picture[x][m - y - 1];
}
}
for (int y = 0; y < m; ++y) {
for (int x = 0; x < m; ++x) {
picture[y][x] = temporary[y][x];
}
}
}
if (found) {
cout << (answerx + 1) << " " << (answery + 1) << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int scene[100][100], picture[50][50], temporary[50][50];
int main() {
while (true) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int y = 0; y < n; ++y) {
for (int x = 0; x < n; ++x) {
cin >> scene[y][x];
}
}
for (int y = 0; y < m; ++y) {
for (int x = 0; x < m; ++x) {
cin >> picture[y][x];
}
}
bool found = false;
int answerx = n, answery = n;
for (int r = 0; r < 4; ++r) {
for (int y = n - m; y >= 0; --y) {
for (int x = n - m; x >= 0; --x) {
bool flag = true;
int tx, ty;
for (int py = m - 1; py >= 0 && flag; --py) {
for (int px = m - 1; px >= 0; --px) {
if (picture[py][px] >= 0) {
if (picture[py][px] != scene[y + py][x + px]) {
flag = false;
break;
} else {
tx = x + px;
ty = y + py;
}
}
}
}
if (flag) {
found = true;
if (ty < answery) {
answery = ty;
answerx = tx;
} else if (ty == answery) {
answerx = min(answerx, tx);
}
}
}
}
for (int y = 0; y < m; ++y) {
for (int x = 0; x < m; ++x) {
temporary[y][x] = picture[x][m - y - 1];
}
}
for (int y = 0; y < m; ++y) {
for (int x = 0; x < m; ++x) {
picture[y][x] = temporary[y][x];
}
}
}
if (found) {
cout << (answerx + 1) << " " << (answery + 1) << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
}
|
[["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]]
| 1
| 515
|
#include <stdio.h>
int pat[4][50][50];
int scen[100][100];
void rote(int s, int e, int m) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pat[e][j][i] = pat[s][i][(m - 1) - j];
}
}
}
int main(void) {
int n, m;
int patx, paty;
bool end;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 || m == 0) {
break;
}
for (int y = 0; y < n; y++) {
for (int x = 0; x < n; x++) {
scanf("%d", &scen[x][y]);
}
}
for (int y = 0; y < m; y++) {
for (int x = 0; x < m; x++) {
scanf("%d", &pat[0][x][y]);
}
}
for (int i = 0; i < 3; i++) {
rote(i, i + 1, m);
}
end = false;
for (int y = 0; (y + m) < n; y++) {
for (int x = 0; (x + m) < n; x++) {
int dx, dy;
for (int i = 0; i < 4; i++) {
bool flag;
flag = true;
for (dy = 0; dy < m; dy++) {
for (dx = 0; dx < m; dx++) {
if (pat[i][dx][dy] != -1 &&
scen[x + dx][y + dy] != pat[i][dx][dy]) {
flag = false;
break;
}
}
if (!flag) {
break;
}
}
if (flag) {
int px, py;
px = py = -1;
for (dy = 0; dy < m; dy++) {
for (dx = 0; dx < m; dx++) {
if (pat[i][dx][dy] != -1) {
px = dx;
py = dy;
break;
}
}
if (px != -1)
break;
}
end = true;
printf("%d %d\n", x + px + 1, y + py + 1, i);
break;
}
}
if (end)
break;
}
if (end)
break;
}
if (!end) {
printf("NA\n");
}
}
return (0);
}
|
#include <stdio.h>
int pat[4][50][50];
int scen[100][100];
void rote(int s, int e, int m) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
pat[e][j][i] = pat[s][i][(m - 1) - j];
}
}
}
int main(void) {
int n, m;
int patx, paty;
bool end;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 || m == 0) {
break;
}
for (int y = 0; y < n; y++) {
for (int x = 0; x < n; x++) {
scanf("%d", &scen[x][y]);
}
}
for (int y = 0; y < m; y++) {
for (int x = 0; x < m; x++) {
scanf("%d", &pat[0][x][y]);
}
}
for (int i = 0; i < 3; i++) {
rote(i, i + 1, m);
}
end = false;
for (int y = 0; (y + m) <= n; y++) {
for (int x = 0; (x + m) <= n; x++) {
int dx, dy;
for (int i = 0; i < 4; i++) {
bool flag;
flag = true;
for (dy = 0; dy < m; dy++) {
for (dx = 0; dx < m; dx++) {
if (pat[i][dx][dy] != -1 &&
scen[x + dx][y + dy] != pat[i][dx][dy]) {
flag = false;
break;
}
}
if (!flag) {
break;
}
}
if (flag) {
int px, py;
px = py = -1;
for (dy = 0; dy < m; dy++) {
for (dx = 0; dx < m; dx++) {
if (pat[i][dx][dy] != -1) {
px = dx;
py = dy;
break;
}
}
if (px != -1)
break;
}
end = true;
printf("%d %d\n", x + px + 1, y + py + 1, i);
break;
}
}
if (end)
break;
}
if (end)
break;
}
if (!end) {
printf("NA\n");
}
}
return (0);
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 575
|
#include <iostream>
#include <vector>
using namespace std;
pair<int, int> match(const vector<vector<int>> &scenery, int x, int y,
const vector<vector<int>> &picture) {
const int M = picture.size();
pair<int, int> ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[i][j] != -1 && picture[i][j] != scenery[x + i][y + j]) {
goto L1;
}
if (picture[i][j] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
L1:
ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[j][M - i - 1] != -1 &&
picture[j][M - i - 1] != scenery[x + i][y + j]) {
goto L2;
}
if (picture[j][M - i - 1] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
L2:
ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[M - i - 1][M - j - 1] != -1 &&
picture[M - i - 1][M - j - 1] != scenery[x + i][y + j]) {
goto L3;
}
if (picture[M - i - 1][M - j - 1] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
L3:
ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[M - j - 1][i] != -1 &&
picture[M - j - 1][i] != scenery[x + i][y + j]) {
return make_pair(-1, -1);
}
if (picture[M - j - 1][i] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
}
pair<int, int> solve(const vector<vector<int>> &scenery,
const vector<vector<int>> &picture) {
const int N = scenery.size();
const int M = picture.size();
for (int i = 0; i < N - M; i++) {
for (int j = 0; j < N - M; j++) {
const pair<int, int> p = match(scenery, i, j, picture);
if (p.first >= 0) {
return p;
}
}
}
return make_pair(-1, -1);
}
int main() {
int N, M;
while (cin >> N >> M && N != 0) {
vector<vector<int>> scenery(N, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> scenery[i][j];
}
}
vector<vector<int>> picture(M, vector<int>(M));
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
cin >> picture[i][j];
}
}
const pair<int, int> ans = solve(scenery, picture);
if (ans.first == -1) {
cout << "NA" << endl;
} else {
cout << ans.second + 1 << ' ' << ans.first + 1 << endl;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
pair<int, int> match(const vector<vector<int>> &scenery, int x, int y,
const vector<vector<int>> &picture) {
const int M = picture.size();
pair<int, int> ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[i][j] != -1 && picture[i][j] != scenery[x + i][y + j]) {
goto L1;
}
if (picture[i][j] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
L1:
ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[j][M - i - 1] != -1 &&
picture[j][M - i - 1] != scenery[x + i][y + j]) {
goto L2;
}
if (picture[j][M - i - 1] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
L2:
ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[M - i - 1][M - j - 1] != -1 &&
picture[M - i - 1][M - j - 1] != scenery[x + i][y + j]) {
goto L3;
}
if (picture[M - i - 1][M - j - 1] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
L3:
ans = make_pair(1000, 1000);
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (picture[M - j - 1][i] != -1 &&
picture[M - j - 1][i] != scenery[x + i][y + j]) {
return make_pair(-1, -1);
}
if (picture[M - j - 1][i] != -1 && x + i < ans.first) {
ans.first = x + i;
ans.second = min(ans.second, y + j);
}
}
}
return ans;
}
pair<int, int> solve(const vector<vector<int>> &scenery,
const vector<vector<int>> &picture) {
const int N = scenery.size();
const int M = picture.size();
for (int i = 0; i <= N - M; i++) {
for (int j = 0; j <= N - M; j++) {
const pair<int, int> p = match(scenery, i, j, picture);
if (p.first >= 0) {
return p;
}
}
}
return make_pair(-1, -1);
}
int main() {
int N, M;
while (cin >> N >> M && N != 0) {
vector<vector<int>> scenery(N, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> scenery[i][j];
}
}
vector<vector<int>> picture(M, vector<int>(M));
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
cin >> picture[i][j];
}
}
const pair<int, int> ans = solve(scenery, picture);
if (ans.first == -1) {
cout << "NA" << endl;
} else {
cout << ans.second + 1 << ' ' << ans.first + 1 << endl;
}
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 963
|
#include <iostream>
#include <vector>
using namespace std;
#define INF 1 << 30
vector<vector<int>> rotate(vector<vector<int>> picture) {
int m = picture.size();
vector<vector<int>> result(m, vector<int>(m));
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
result[i][j] = picture[j][m - 1 - i];
return result;
}
vector<int> check(vector<vector<int>> scene, vector<vector<int>> picture) {
int n = scene.size();
int m = picture.size();
vector<int> result(2, INF);
bool ok = false;
for (int r = 0; r < 4; r++) {
for (int i = 0; i < n - m; i++)
for (int j = 0; j < n - m; j++) {
ok = true;
vector<int> first(2, INF);
for (int y = 0; y < m; y++)
for (int x = 0; x < m; x++) {
if (picture[y][x] == -1)
continue;
if (first[0] == INF) {
first[0] = i + y + 1;
first[1] = j + x + 1;
}
ok &= (scene[i + y][j + x] == picture[y][x]);
}
if (ok)
if ((first[0] < result[0]) ||
(first[0] == result[0] && first[1] < result[1]))
result = first;
}
picture = rotate(picture);
}
return result;
}
int main() {
int n, m;
while (cin >> n >> m, n | m) {
vector<vector<int>> scene(n, vector<int>(n)), picture(m, vector<int>(m));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> scene[i][j];
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
cin >> picture[i][j];
vector<int> ans;
ans = check(scene, picture);
if (ans[0] == INF)
cout << "NA" << endl;
else
cout << ans[1] << " " << ans[0] << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
#define INF 1 << 30
vector<vector<int>> rotate(vector<vector<int>> picture) {
int m = picture.size();
vector<vector<int>> result(m, vector<int>(m));
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
result[i][j] = picture[j][m - 1 - i];
return result;
}
vector<int> check(vector<vector<int>> scene, vector<vector<int>> picture) {
int n = scene.size();
int m = picture.size();
vector<int> result(2, INF);
bool ok = false;
for (int r = 0; r < 4; r++) {
for (int i = 0; i < n - m + 1; i++)
for (int j = 0; j < n - m + 1; j++) {
ok = true;
vector<int> first(2, INF);
for (int y = 0; y < m; y++)
for (int x = 0; x < m; x++) {
if (picture[y][x] == -1)
continue;
if (first[0] == INF) {
first[0] = i + y + 1;
first[1] = j + x + 1;
}
ok &= (scene[i + y][j + x] == picture[y][x]);
}
if (ok)
if ((first[0] < result[0]) ||
(first[0] == result[0] && first[1] < result[1]))
result = first;
}
picture = rotate(picture);
}
return result;
}
int main() {
int n, m;
while (cin >> n >> m, n | m) {
vector<vector<int>> scene(n, vector<int>(n)), picture(m, vector<int>(m));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> scene[i][j];
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
cin >> picture[i][j];
vector<int> ans;
ans = check(scene, picture);
if (ans[0] == INF)
cout << "NA" << endl;
else
cout << ans[1] << " " << ans[0] << endl;
}
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 7, 8, 7, 15, 16, 12, 16, 17, 72], ["+", 0, 7, 8, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 576
|
#include <iostream>
using namespace std;
int seen[100][100];
int pic[4][50][50];
int main() {
int n, m;
for (;;) {
cin >> n >> m;
if (!n && !m)
break;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> seen[i][j];
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
cin >> pic[0][i][j];
for (int i = 1; i < 4; i++)
for (int j = 0; j < m; j++)
for (int k = 0; k < m; k++)
pic[i][j][k] = pic[i - 1][m - k - 1][j];
int ansx = -1, ansy = -1;
for (int i = 0; i + m < n; i++)
for (int j = 0; j + m < n; j++)
for (int k = 0; k < 4; k++) {
int tmpx = -1, tmpy = -1;
bool f = true;
for (int l = 0; l < m; l++)
for (int h = 0; h < m; h++)
if (pic[k][l][h] >= 0) {
if (pic[k][l][h] != seen[i + l][j + h]) {
f = false;
break;
} else if (tmpx < 0) {
tmpy = i + l;
tmpx = j + h;
}
}
if (f) {
if (ansx < 0 || ansy > tmpy || (ansy == tmpy && ansx > tmpx)) {
ansy = tmpy;
ansx = tmpx;
}
}
}
if (ansx < 0)
cout << "NA\n";
else
cout << ansx + 1 << " " << ansy + 1 << endl;
}
}
|
#include <iostream>
using namespace std;
int seen[100][100];
int pic[4][50][50];
int main() {
int n, m;
for (;;) {
cin >> n >> m;
if (!n && !m)
break;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> seen[i][j];
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
cin >> pic[0][i][j];
for (int i = 1; i < 4; i++)
for (int j = 0; j < m; j++)
for (int k = 0; k < m; k++)
pic[i][j][k] = pic[i - 1][m - k - 1][j];
int ansx = -1, ansy = -1;
for (int i = 0; i + m - 1 < n; i++)
for (int j = 0; j + m - 1 < n; j++)
for (int k = 0; k < 4; k++) {
int tmpx = -1, tmpy = -1;
bool f = true;
for (int l = 0; l < m; l++)
for (int h = 0; h < m; h++)
if (pic[k][l][h] >= 0) {
if (pic[k][l][h] != seen[i + l][j + h]) {
f = false;
break;
} else if (tmpx < 0) {
tmpy = i + l;
tmpx = j + h;
}
}
if (f) {
if (ansx < 0 || ansy > tmpy || (ansy == tmpy && ansx > tmpx)) {
ansy = tmpy;
ansx = tmpx;
}
}
}
if (ansx < 0)
cout << "NA\n";
else
cout << ansx + 1 << " " << ansy + 1 << endl;
}
}
|
[["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 0, 7, 8, 7, 15, 16, 31, 16, 17, 33], ["+", 0, 7, 8, 7, 15, 16, 31, 16, 12, 13]]
| 1
| 446
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int m, n;
while (cin >> n >> m) {
if (!(m | n))
break;
bool matched[n][n];
int pic[n][n];
int pat[m][m];
int orig[m][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> pic[i][j];
matched[i][j] = false;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> orig[i][j];
}
}
for (int i = 0; i < 4; i++) { // 4ツ陛サツ古シ
// rotateツつオツつスpatツづーツ催ャツづゥ
if (i == 0) { // 0
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[p][q];
}
}
} else if (i == 1) { // 90
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[m - 1 - q][p];
}
}
} else if (i == 2) {
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[m - 1 - p][m - 1 - q];
}
}
} else {
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[q][m - 1 - p];
}
}
}
for (int p = 0; p < n - m + 1; p++) {
for (int q = 0; q < n - m - 1; q++) {
bool ok = true;
for (int r = 0; r < m; r++) {
for (int s = 0; s < m; s++) {
if (pat[r][s] != -1 && pat[r][s] != pic[p + r][q + s])
ok = false;
}
}
if (ok) {
for (int r = 0; r < m; r++) {
for (int s = 0; s < m; s++) {
if (pat[r][s] != -1) {
matched[p + r][q + s] = true;
}
}
}
}
}
}
}
int x = -1, y = -1;
for (int p = 0; p < n; p++) {
for (int q = 0; q < n; q++) {
if (matched[p][q]) {
x = p;
y = q;
break;
}
}
if (x != -1 && y != -1)
break;
}
if (x == -1 && y == -1) {
cout << "NA" << endl;
} else {
cout << y + 1 << " " << x + 1 << endl;
}
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int m, n;
while (cin >> n >> m) {
if (!(m | n))
break;
bool matched[n][n];
int pic[n][n];
int pat[m][m];
int orig[m][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> pic[i][j];
matched[i][j] = false;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> orig[i][j];
}
}
for (int i = 0; i < 4; i++) { // 4ツ陛サツ古シ
// rotateツつオツつスpatツづーツ催ャツづゥ
if (i == 0) { // 0
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[p][q];
}
}
} else if (i == 1) { // 90
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[m - 1 - q][p];
}
}
} else if (i == 2) {
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[m - 1 - p][m - 1 - q];
}
}
} else {
for (int p = 0; p < m; p++) {
for (int q = 0; q < m; q++) {
pat[p][q] = orig[q][m - 1 - p];
}
}
}
for (int p = 0; p < n - m + 1; p++) {
for (int q = 0; q < n - m + 1; q++) {
bool ok = true;
for (int r = 0; r < m; r++) {
for (int s = 0; s < m; s++) {
if (pat[r][s] != -1 && pat[r][s] != pic[p + r][q + s])
ok = false;
}
}
if (ok) {
for (int r = 0; r < m; r++) {
for (int s = 0; s < m; s++) {
if (pat[r][s] != -1) {
matched[p + r][q + s] = true;
}
}
}
}
}
}
}
int x = -1, y = -1;
for (int p = 0; p < n; p++) {
for (int q = 0; q < n; q++) {
if (matched[p][q]) {
x = p;
y = q;
break;
}
}
if (x != -1 && y != -1)
break;
}
if (x == -1 && y == -1) {
cout << "NA" << endl;
} else {
cout << y + 1 << " " << x + 1 << endl;
}
}
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72]]
| 1
| 722
|
from sys import stdin
readline = stdin.readline
from itertools import product
from operator import itemgetter
from math import isinf
def scrap_top_left(picture):
for py, px in product(range(len(picture)), repeat=2):
if picture[py][px] != -1:
return px, py
def is_match(window, picture, wx, wy):
for py, px in product(range(len(picture)), repeat=2):
if picture[py][px] == -1:
continue
if window[wy + py][wx + px] != picture[py][px]:
return False
return True
def search(window, picture):
for wy, wx in product(range(len(window) - len(picture)), repeat=2):
if is_match(window, picture, wx, wy):
px, py = scrap_top_left(picture)
return wx + px + 1, wy + py + 1
return float('inf'), float('inf')
# http://d.hatena.ne.jp/odz/20070622/1182497414
def rotate_clockwise(matrix):
return [list(row) for row in zip(*reversed(matrix))]
while True:
window_size, picture_size = map(int, readline().split())
if window_size == 0:
break
window = [list(map(int, readline().split())) for _ in range(window_size)]
picture = [list(map(int, readline().split())) for _ in range(picture_size)]
top_left = []
for _ in range(4):
top_left.append(search(window, picture))
picture = rotate_clockwise(picture)
top_left = min(top_left, key=itemgetter(1, 0))
if isinf(top_left[0]):
print('NA')
else:
print(*top_left)
|
from sys import stdin
readline = stdin.readline
from itertools import product
from operator import itemgetter
from math import isinf
def scrap_top_left(picture):
for py, px in product(range(len(picture)), repeat=2):
if picture[py][px] != -1:
return px, py
def is_match(window, picture, wx, wy):
for py, px in product(range(len(picture)), repeat=2):
if picture[py][px] == -1:
continue
if window[wy + py][wx + px] != picture[py][px]:
return False
return True
def search(window, picture):
for wy, wx in product(range(len(window) - len(picture) + 1), repeat=2):
if is_match(window, picture, wx, wy):
px, py = scrap_top_left(picture)
return wx + px + 1, wy + py + 1
return float('inf'), float('inf')
# http://d.hatena.ne.jp/odz/20070622/1182497414
def rotate_clockwise(matrix):
return [list(row) for row in zip(*reversed(matrix))]
while True:
window_size, picture_size = map(int, readline().split())
if window_size == 0:
break
window = [list(map(int, readline().split())) for _ in range(window_size)]
picture = [list(map(int, readline().split())) for _ in range(picture_size)]
top_left = []
for _ in range(4):
top_left.append(search(window, picture))
picture = rotate_clockwise(picture)
top_left = min(top_left, key=itemgetter(1, 0))
if isinf(top_left[0]):
print('NA')
else:
print(*top_left)
|
[["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 380
|
import java.util.*;
public class Main {
static int h;
static int w;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
w = sc.nextInt();
h = sc.nextInt();
if (w == 0 && h == 0)
break;
char[][] map;
boolean[][] alMove;
map = new char[h][w];
alMove = new boolean[h][w];
for (int i = 0; i < h; i++) {
map[i] = sc.next().toCharArray();
}
int i = 0;
for (i = 0; i < 180; i++) {
boolean check = false;
for (int j = 0; j < h; j++) {
for (int k = 0; k < w; k++) {
if (map[j][k] == 'E') {
check = true;
if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
} else if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
} else if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
} else if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
}
} else if (map[j][k] == 'N') {
check = true;
if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
} else if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
} else if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
} else if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
}
} else if (map[j][k] == 'W') {
check = true;
if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
} else if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
} else if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
} else if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
}
} else if (map[j][k] == 'S') {
check = true;
if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
} else if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
} else if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
} else if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
}
}
}
}
if (!check)
break;
for (int j = 0; j < h; j++) {
Arrays.fill(alMove[j], false);
}
for (int j = 0; j < h; j++) {
IN:
for (int k = 0; k < w; k++) {
if (map[j][k] == '.') {
if (rcheck(j, k + 1) && !alMove[j][k] && !alMove[j][k + 1] &&
map[j][k + 1] == 'W') {
map[j][k + 1] = '.';
map[j][k] = 'W';
alMove[j][k] = true;
alMove[j][k + 1] = true;
continue IN;
} else if (rcheck(j - 1, k) && !alMove[j][k] &&
!alMove[j - 1][k] && map[j - 1][k] == 'S') {
map[j - 1][k] = '.';
map[j][k] = 'S';
alMove[j][k] = true;
alMove[j - 1][k] = true;
continue IN;
} else if (rcheck(j, k - 1) && !alMove[j][k] &&
!alMove[j][k - 1] && map[j][k - 1] == 'E') {
map[j][k - 1] = '.';
map[j][k] = 'E';
alMove[j][k] = true;
alMove[j][k - 1] = true;
continue IN;
} else if (rcheck(j + 1, k) && !alMove[j][k] &&
!alMove[j + 1][k] && map[j + 1][k] == 'N') {
map[j + 1][k] = '.';
map[j][k] = 'N';
alMove[j][k] = true;
alMove[j + 1][k] = true;
continue IN;
}
} else if (map[j][k] == 'X') {
if (rcheck(j, k + 1) && map[j][k + 1] == 'W' && !alMove[j][k] &&
!alMove[j][k + 1]) {
map[j][k + 1] = '.';
alMove[j][k] = true;
alMove[j][k + 1] = true;
continue IN;
} else if (rcheck(j - 1, k) && map[j - 1][k] == 'S' &&
!alMove[j][k] && !alMove[j - 1][k]) {
map[j - 1][k] = '.';
alMove[j][k] = true;
alMove[j - 1][k] = true;
continue IN;
} else if (rcheck(j, k - 1) && map[j][k - 1] == 'E' &&
!alMove[j][k] && !alMove[j][k - 1]) {
map[j][k - 1] = '.';
alMove[j][k] = true;
alMove[j][k - 1] = true;
continue IN;
} else if (rcheck(j + 1, k) && map[j + 1][k] == 'N' &&
!alMove[j][k] && !alMove[j + 1][k]) {
map[j + 1][k] = '.';
alMove[j][k] = true;
alMove[j + 1][k] = true;
continue IN;
}
}
}
}
}
if (i <= 180) {
System.out.println(i);
} else {
System.out.println("NA");
}
}
}
public static boolean rcheck(int a, int b) {
if (a < 0 || b < 0 || a >= h || b >= w)
return false;
return true;
}
}
|
import java.util.*;
public class Main {
static int h;
static int w;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
w = sc.nextInt();
h = sc.nextInt();
if (w == 0 && h == 0)
break;
char[][] map;
boolean[][] alMove;
map = new char[h][w];
alMove = new boolean[h][w];
for (int i = 0; i < h; i++) {
map[i] = sc.next().toCharArray();
}
int i = 0;
for (i = 0; i <= 180; i++) {
boolean check = false;
for (int j = 0; j < h; j++) {
for (int k = 0; k < w; k++) {
if (map[j][k] == 'E') {
check = true;
if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
} else if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
} else if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
} else if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
}
} else if (map[j][k] == 'N') {
check = true;
if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
} else if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
} else if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
} else if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
}
} else if (map[j][k] == 'W') {
check = true;
if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
} else if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
} else if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
} else if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
}
} else if (map[j][k] == 'S') {
check = true;
if (rcheck(j, k - 1) &&
(map[j][k - 1] == '.' || map[j][k - 1] == 'X')) {
map[j][k] = 'W';
} else if (rcheck(j + 1, k) &&
(map[j + 1][k] == '.' || map[j + 1][k] == 'X')) {
map[j][k] = 'S';
} else if (rcheck(j, k + 1) &&
(map[j][k + 1] == '.' || map[j][k + 1] == 'X')) {
map[j][k] = 'E';
} else if (rcheck(j - 1, k) &&
(map[j - 1][k] == '.' || map[j - 1][k] == 'X')) {
map[j][k] = 'N';
}
}
}
}
if (!check)
break;
for (int j = 0; j < h; j++) {
Arrays.fill(alMove[j], false);
}
for (int j = 0; j < h; j++) {
IN:
for (int k = 0; k < w; k++) {
if (map[j][k] == '.') {
if (rcheck(j, k + 1) && !alMove[j][k] && !alMove[j][k + 1] &&
map[j][k + 1] == 'W') {
map[j][k + 1] = '.';
map[j][k] = 'W';
alMove[j][k] = true;
alMove[j][k + 1] = true;
continue IN;
} else if (rcheck(j - 1, k) && !alMove[j][k] &&
!alMove[j - 1][k] && map[j - 1][k] == 'S') {
map[j - 1][k] = '.';
map[j][k] = 'S';
alMove[j][k] = true;
alMove[j - 1][k] = true;
continue IN;
} else if (rcheck(j, k - 1) && !alMove[j][k] &&
!alMove[j][k - 1] && map[j][k - 1] == 'E') {
map[j][k - 1] = '.';
map[j][k] = 'E';
alMove[j][k] = true;
alMove[j][k - 1] = true;
continue IN;
} else if (rcheck(j + 1, k) && !alMove[j][k] &&
!alMove[j + 1][k] && map[j + 1][k] == 'N') {
map[j + 1][k] = '.';
map[j][k] = 'N';
alMove[j][k] = true;
alMove[j + 1][k] = true;
continue IN;
}
} else if (map[j][k] == 'X') {
if (rcheck(j, k + 1) && map[j][k + 1] == 'W' && !alMove[j][k] &&
!alMove[j][k + 1]) {
map[j][k + 1] = '.';
alMove[j][k] = true;
alMove[j][k + 1] = true;
continue IN;
} else if (rcheck(j - 1, k) && map[j - 1][k] == 'S' &&
!alMove[j][k] && !alMove[j - 1][k]) {
map[j - 1][k] = '.';
alMove[j][k] = true;
alMove[j - 1][k] = true;
continue IN;
} else if (rcheck(j, k - 1) && map[j][k - 1] == 'E' &&
!alMove[j][k] && !alMove[j][k - 1]) {
map[j][k - 1] = '.';
alMove[j][k] = true;
alMove[j][k - 1] = true;
continue IN;
} else if (rcheck(j + 1, k) && map[j + 1][k] == 'N' &&
!alMove[j][k] && !alMove[j + 1][k]) {
map[j + 1][k] = '.';
alMove[j][k] = true;
alMove[j + 1][k] = true;
continue IN;
}
}
}
}
}
if (i <= 180) {
System.out.println(i);
} else {
System.out.println("NA");
}
}
}
public static boolean rcheck(int a, int b) {
if (a < 0 || b < 0 || a >= h || b >= w)
return false;
return true;
}
}
|
[["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19]]
| 3
| 1,940
|
#include <iostream>
#include <string>
char maze[31][31], tempMaze[31][31];
int H, W;
using namespace std;
void changeDirection() {
int i, j;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if (maze[i][j] == 'E') {
if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
else if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
else if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
else if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
} else if (maze[i][j] == 'N') {
if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
else if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
else if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
else if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
} else if (maze[i][j] == 'W') {
if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
else if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
else if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
else if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
} else if (maze[i][j] == 'S') {
if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
else if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
else if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
else if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
}
}
}
}
void goStraight() {
int i, j, flag;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
tempMaze[i][j] = maze[i][j];
}
}
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
flag = 0;
if (tempMaze[i][j] == 'X') {
if (tempMaze[i][j + 1] == 'W') {
maze[i][j + 1] = '.';
flag += 1;
} else if (tempMaze[i - 1][j] == 'S' && flag == 0) {
maze[i - 1][j] = '.';
flag += 1;
} else if (tempMaze[i][j - 1] == 'E' && flag == 0) {
maze[i][j - 1] = '.';
flag += 1;
} else if (tempMaze[i + 1][j] == 'N' && flag == 0) {
maze[i + 1][j] = '.';
}
}
flag = 0;
if (tempMaze[i][j] == '.') {
if (tempMaze[i][j + 1] == 'W') {
maze[i][j + 1] = '.';
maze[i][j] = 'W';
flag += 1;
} else if (tempMaze[i - 1][j] == 'S' && flag == 0) {
maze[i - 1][j] = '.';
maze[i][j] = 'S';
flag += 1;
} else if (tempMaze[i][j - 1] == 'E' && flag == 0) {
maze[i][j - 1] = '.';
maze[i][j] = 'E';
flag += 1;
} else if (tempMaze[i + 1][j] == 'N' && flag == 0) {
maze[i + 1][j] = '.';
maze[i][j] = 'N';
}
}
}
}
}
int judge() {
int i, j, flag = 0;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if (maze[i][j] == 'E' || maze[i][j] == 'N' || maze[i][j] == 'W' ||
maze[i][j] == 'S') {
flag += 1;
}
}
}
if (flag == 0)
return 0;
else
return 1;
}
int main() {
int i, j, time;
while (cin >> W >> H, H + W) {
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
cin >> maze[i][j];
}
}
time = 0;
while (judge()) {
changeDirection();
goStraight();
time += 1;
if (time >= 180)
break;
}
if (time <= 180)
cout << time << endl;
else
cout << "NA" << endl;
}
}
|
#include <iostream>
#include <string>
char maze[31][31], tempMaze[31][31];
int H, W;
using namespace std;
void changeDirection() {
int i, j;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if (maze[i][j] == 'E') {
if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
else if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
else if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
else if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
} else if (maze[i][j] == 'N') {
if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
else if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
else if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
else if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
} else if (maze[i][j] == 'W') {
if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
else if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
else if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
else if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
} else if (maze[i][j] == 'S') {
if (maze[i][j - 1] == '.' || maze[i][j - 1] == 'X')
maze[i][j] = 'W';
else if (maze[i + 1][j] == '.' || maze[i + 1][j] == 'X')
maze[i][j] = 'S';
else if (maze[i][j + 1] == '.' || maze[i][j + 1] == 'X')
maze[i][j] = 'E';
else if (maze[i - 1][j] == '.' || maze[i - 1][j] == 'X')
maze[i][j] = 'N';
}
}
}
}
void goStraight() {
int i, j, flag;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
tempMaze[i][j] = maze[i][j];
}
}
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
flag = 0;
if (tempMaze[i][j] == 'X') {
if (tempMaze[i][j + 1] == 'W') {
maze[i][j + 1] = '.';
flag += 1;
} else if (tempMaze[i - 1][j] == 'S' && flag == 0) {
maze[i - 1][j] = '.';
flag += 1;
} else if (tempMaze[i][j - 1] == 'E' && flag == 0) {
maze[i][j - 1] = '.';
flag += 1;
} else if (tempMaze[i + 1][j] == 'N' && flag == 0) {
maze[i + 1][j] = '.';
}
}
flag = 0;
if (tempMaze[i][j] == '.') {
if (tempMaze[i][j + 1] == 'W') {
maze[i][j + 1] = '.';
maze[i][j] = 'W';
flag += 1;
} else if (tempMaze[i - 1][j] == 'S' && flag == 0) {
maze[i - 1][j] = '.';
maze[i][j] = 'S';
flag += 1;
} else if (tempMaze[i][j - 1] == 'E' && flag == 0) {
maze[i][j - 1] = '.';
maze[i][j] = 'E';
flag += 1;
} else if (tempMaze[i + 1][j] == 'N' && flag == 0) {
maze[i + 1][j] = '.';
maze[i][j] = 'N';
}
}
}
}
}
int judge() {
int i, j, flag = 0;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if (maze[i][j] == 'E' || maze[i][j] == 'N' || maze[i][j] == 'W' ||
maze[i][j] == 'S') {
flag += 1;
}
}
}
if (flag == 0)
return 0;
else
return 1;
}
int main() {
int i, j, time;
while (cin >> W >> H, H + W) {
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
cin >> maze[i][j];
}
}
time = 0;
while (judge()) {
changeDirection();
goStraight();
time += 1;
if (time > 180)
break;
}
if (time <= 180)
cout << time << endl;
else
cout << "NA" << endl;
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]]
| 1
| 1,543
|
while(h=gets.split[1].to_i)>u=t=0
a=[]
m=(0...h).map{|i|gets.chars.map{|c|(d="WSEN".index c)&&a<<[u,i,d]};u+=1;$_}
while a[0]&&181>t+=1
n=a.map{|i,j,d|[[i,j-1,3],[i-1,j,0],[i,j+1,1],[i+1,j,2]].rotate(d).find{|e,f|m[f][e]!=?#&&a.all?{|k,l|k!=e||l!=f}}}
a=n.zip(a).map{|l,k|i,j,d=l;l ?n.all?{|e,f,g|i!=e||j!=f||d<=g}?l:k[0,2]+[d]:k}.reject{|i,j|m[j][i]==?X}
end
puts t>180?:NA:t
end
|
while(h=gets.split[1].to_i)>u=t=0
a=[]
m=(0...h).map{|i|u=0;gets.chars.map{|c|(d="WSEN".index c)&&a<<[u,i,d];u+=1};$_}
while a[0]&&181>t+=1
n=a.map{|i,j,d|[[i,j-1,3],[i-1,j,0],[i,j+1,1],[i+1,j,2]].rotate(d).find{|e,f|m[f][e]!=?#&&a.all?{|k,l|k!=e||l!=f}}}
a=n.zip(a).map{|l,k|i,j,d=l;l ?n.all?{|e,f,g|i!=e||j!=f||d<=g}?l:k[0,2]+[d]:k}.reject{|i,j|m[j][i]==?X}
end
puts t>180?:NA:t
end
|
[["+", 12, 652, 196, 196, 8, 734, 0, 662, 31, 22], ["+", 12, 652, 196, 196, 8, 734, 0, 662, 0, 32], ["+", 12, 652, 196, 196, 8, 734, 0, 662, 12, 612], ["+", 0, 662, 12, 652, 196, 196, 8, 734, 0, 35], ["-", 196, 196, 8, 734, 0, 652, 196, 196, 0, 46], ["+", 196, 196, 8, 734, 0, 652, 196, 196, 0, 46]]
| 4
| 272
|
#include <stdio.h>
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
int main() {
long long n, g, l, i, a[20], b[20], c[20];
while (scanf("%lld", &n), n) {
for (i = 0; i < n; i++)
scanf("%lld %lld", &a[i], &b[i]);
g = a[0];
for (i = 0; i < n; i++)
g = gcd(g, a[i]);
l = 1;
for (i = 0; i < n; i++)
l = lcm(l, a[i] / g);
// printf("%lld\n",l);
for (i = 0; i < n; i++)
c[i] = l * b[i] / a[i];
g = c[0];
// printf("%lld\n",g);
for (i = 0; i < n; i++)
g = gcd(g, c[i]);
for (i = 0; i < n; i++)
printf("%lld\n", c[i] / g);
}
return 0;
}
|
#include <stdio.h>
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
int main() {
long long n, g, l, i, a[20], b[20], c[20];
while (scanf("%lld", &n), n) {
for (i = 0; i < n; i++)
scanf("%lld %lld", &a[i], &b[i]);
g = a[0];
for (i = 0; i < n; i++)
g = gcd(g, a[i]);
l = 1;
for (i = 0; i < n; i++)
l = lcm(l, a[i] / g);
// printf("%lld\n",l);
for (i = 0; i < n; i++)
c[i] = l * b[i] / (a[i] / g);
g = c[0];
// printf("%lld\n",g);
for (i = 0; i < n; i++)
g = gcd(g, c[i]);
for (i = 0; i < n; i++)
printf("%lld\n", c[i] / g);
}
return 0;
}
|
[["+", 8, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 85], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 22], ["+", 8, 1, 0, 11, 12, 16, 12, 23, 0, 25]]
| 0
| 295
|
#include <iostream>
#include <string>
using namespace std;
double pow(int a) {
double res = 1;
for (int i = 0; i < a; i++) {
res /= 2;
}
return res;
}
int main(int argc, char *argv[]) {
double d;
while (std::cin >> d) {
if (d < 0)
break;
int digit = 8;
string ans;
for (int i = digit; i >= 0; i--) {
if (d >= (1 << i)) {
ans = ans + '1';
d -= (1 << i);
} else {
ans = ans + '0';
}
}
ans = ans + ".";
for (int i = 0; i < 4; i++) {
if (d >= pow(i)) {
ans = ans + '1';
d -= pow(i);
} else {
ans = ans + '0';
}
}
if (d == 0)
std::cout << ans << std::endl;
else
std::cout << "NA" << std::endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
double pow(int a) {
double res = 1;
for (int i = 0; i < a; i++) {
res /= 2;
}
return res;
}
int main(int argc, char *argv[]) {
double d;
while (std::cin >> d) {
if (d < 0)
break;
int digit = 7;
string ans;
for (int i = digit; i >= 0; i--) {
if (d >= (1 << i)) {
ans = ans + '1';
d -= (1 << i);
} else {
ans = ans + '0';
}
}
ans = ans + ".";
for (int i = 1; i <= 4; i++) {
if (d >= pow(i)) {
ans = ans + '1';
d -= pow(i);
} else {
ans = ans + '0';
}
}
if (d == 0)
std::cout << ans << std::endl;
else
std::cout << "NA" << std::endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 235
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double N;
while (cin >> N, N >= 0) {
int n = N * 16 + 1e-8;
if (abs(N * 16 - (int)(N * 16)) < 1e-8 || n >= (1 << 12)) {
puts("NA");
break;
}
for (int i = 11; i >= 0; i--) {
printf("%d", (n >> i) & 1);
if (i == 4)
printf(".");
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double N;
while (cin >> N, N >= 0) {
int n = N * 16 + 1e-8;
if (abs(N * 16 - (int)(N * 16)) > 1e-8 || n >= (1 << 12)) {
puts("NA");
continue;
}
for (int i = 11; i >= 0; i--) {
printf("%d", (n >> i) & 1);
if (i == 4)
printf(".");
}
puts("");
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117]]
| 1
| 128
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;
int main(void) {
string n;
while (cin >> n) {
if (n[0] == '-')
break;
int i = 0, cnt = 0, flag = false;
rep(j, n.size()) {
if (n[j] == '.') {
cnt = 0, flag = true;
} else {
i = 10 * i + n[j] - '0';
cnt++;
}
}
if (flag == false)
cnt = 0;
bool ok = true;
rep(j, cnt) {
if (i % 5)
ok = false;
i /= 5;
}
rep(j, 4 - cnt) i *= 2;
if (i >= 4096)
ok = false;
if (ok) {
for (int j = 11; j >= 4; --j) {
cout << ((i & (1 << j)) > 0);
}
putchar('.');
for (int j = 3; j >= 0; --j) {
cout << ((i & (1 << j)) > 0);
}
puts("");
} else {
puts("NG");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;
int main(void) {
string n;
while (cin >> n) {
if (n[0] == '-')
break;
int i = 0, cnt = 0, flag = false;
rep(j, n.size()) {
if (n[j] == '.') {
cnt = 0, flag = true;
} else {
i = 10 * i + n[j] - '0';
cnt++;
}
}
if (flag == false)
cnt = 0;
bool ok = true;
rep(j, cnt) {
if (i % 5)
ok = false;
i /= 5;
}
rep(j, 4 - cnt) i *= 2;
if (i >= 4096)
ok = false;
if (ok) {
for (int j = 11; j >= 4; --j) {
cout << ((i & (1 << j)) > 0);
}
putchar('.');
for (int j = 3; j >= 0; --j) {
cout << ((i & (1 << j)) > 0);
}
puts("");
} else {
puts("NA");
}
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 472
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
double x;
while (scanf("%lf", &x)) {
if (x < 0)
break;
x *= 16;
if (x > (1 << 16) - 1)
printf("NA");
else if (x == (int)x) {
char str[20];
str[8] = '.';
str[13] = '\0';
int n = x;
for (int i = 0; i < 12; i++)
str[(i < 4) ? (12 - i) : (11 - i)] = (n & (1 << i)) ? '1' : '0';
printf("%s\n", str);
} else
printf("NA");
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
double x;
while (scanf("%lf", &x)) {
if (x < 0)
break;
x *= 16;
if (x > (1 << 16) - 1)
printf("NA\n");
else if (x == (int)x) {
char str[20];
str[8] = '.';
str[13] = '\0';
int n = x;
for (int i = 0; i < 12; i++)
str[(i < 4) ? (12 - i) : (11 - i)] = (n & (1 << i)) ? '1' : '0';
printf("%s\n", str);
} else
printf("NA\n");
}
return 0;
}
|
[["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 177
|
#include <iostream>
#include <vector>
using namespace std;
int A[8];
int B[4];
int main(int argc, char **argv) {
int a, c;
double b;
double d;
while (1) {
cin >> d;
if (d < 0.0)
break;
a = (int)d;
b = d - a;
for (int i = 7; i >= 0; i--) {
A[i] = a % 2;
a /= 2;
}
for (int i = 0; i < 4; i++) {
b *= 2.0;
if (b >= 1.0)
B[i] = 1, b -= 1.0;
else
B[i] = 0;
}
if (a == 0 && b == 0.0) {
for (int i = 0; i < 8; i++)
cout << A[i];
for (int i = 0; i < 4; i++)
cout << B[i];
cout << endl;
} else
cout << "NA" << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int A[8];
int B[4];
int main(int argc, char **argv) {
int a, c;
double b;
double d;
while (1) {
cin >> d;
if (d < 0.0)
break;
a = (int)d;
b = d - a;
for (int i = 7; i >= 0; i--) {
A[i] = a % 2;
a /= 2;
}
for (int i = 0; i < 4; i++) {
b *= 2.0;
if (b >= 1.0)
B[i] = 1, b -= 1.0;
else
B[i] = 0;
}
if (a == 0 && b == 0.0) {
for (int i = 0; i < 8; i++)
cout << A[i];
cout << ".";
for (int i = 0; i < 4; i++)
cout << B[i];
cout << endl;
} else
cout << "NA" << endl;
}
return 0;
}
|
[["+", 0, 57, 64, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]]
| 1
| 219
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) {
return n ? 1 + __builtin_popcount(n & (n - 1)) : 0;
}
#endif
#define foreach(it, c) \
for (__typeof__((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount
const double EPS = 1e-8;
typedef long long ll;
typedef pair<int, int> pint;
string integer_to_bin(int n, int digits) {
string res;
while (n) {
res += n & 1 ? '1' : '0';
n >>= 1;
}
return string(max(0, digits - (int)res.size()), '0') + res;
}
string fraction_to_bin(double n, int digits) {
string res;
while (n > EPS) {
n *= 2;
if (n + EPS > 1) {
n -= 1;
res += '1';
} else
res += '0';
}
return res + string(max(0, digits - (int)res.size()), '0');
}
int main() {
double n;
while (scanf("%lf", &n), n >= 0) {
string integer = integer_to_bin((int)n, 8);
string fraction = fraction_to_bin(n - (int)n, 4);
if (integer.size() <= 8 && fraction.size() <= 4)
printf("%s.%s\n", integer.c_str(), fraction.c_str());
else
puts("NA");
}
return 0;
}
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) {
return n ? 1 + __builtin_popcount(n & (n - 1)) : 0;
}
#endif
#define foreach(it, c) \
for (__typeof__((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount
const double EPS = 1e-8;
typedef long long ll;
typedef pair<int, int> pint;
string integer_to_bin(int n, int digits) {
string res;
while (n) {
res = (n & 1 ? '1' : '0') + res;
n >>= 1;
}
return string(max(0, digits - (int)res.size()), '0') + res;
}
string fraction_to_bin(double n, int digits) {
string res;
while (n > EPS) {
n *= 2;
if (n + EPS > 1) {
n -= 1;
res += '1';
} else
res += '0';
}
return res + string(max(0, digits - (int)res.size()), '0');
}
int main() {
double n;
while (scanf("%lf", &n), n >= 0) {
string integer = integer_to_bin((int)n, 8);
string fraction = fraction_to_bin(n - (int)n, 4);
if (integer.size() <= 8 && fraction.size() <= 4)
printf("%s.%s\n", integer.c_str(), fraction.c_str());
else
puts("NA");
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]]
| 1
| 374
|
#include <stdio.h>
#include <string.h>
struct cell {
struct cell *prev;
struct cell *next;
int flag;
} s[10000], *now;
int main() {
int i, flag, m, n, tmp;
char str[10000], t[10000];
while (scanf("%d%d", &m, &n), m + n) {
tmp = m;
for (i = 0; i < n; i++) {
if (i)
s[i].prev = &s[i - 1];
else
s[i].prev = &s[n - 1];
if (i == n - 1)
s[i].next = &s[0];
else
s[i].next = &s[i + 1];
s[i].flag = 1;
}
now = &s[0];
for (i = 1; i <= n; i++) {
scanf("%s", str);
if (tmp == 1)
continue;
if (i % 3 == 0) {
if (i % 5 == 0) {
flag = strcmp(str, "FizzBuzz");
} else {
flag = strcmp(str, "Fizz");
}
} else if (i % 5 == 0) {
flag = strcmp(str, "Buzz");
} else {
sprintf(t, "%d", i);
flag = strcmp(str, t);
/*
if(i == atoi(str))flag=0;///////
else flag=1;*/
}
if (flag) {
now->prev->next = now->next;
now->next->prev = now->prev;
now->flag = 0;
tmp--;
}
now = now->next;
}
for (i = 0, flag = 0; i < m; i++) {
if (s[i].flag == 1) {
if (!flag) {
printf("%d", i + 1);
flag = 1;
} else {
printf(" %d", i + 1);
}
}
}
puts("");
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
struct cell {
struct cell *prev;
struct cell *next;
int flag;
} s[10000], *now;
int main() {
int i, flag, m, n, tmp;
char str[10000], t[10000];
while (scanf("%d%d", &m, &n), m + n) {
tmp = m;
for (i = 0; i <= m; i++) {
if (i)
s[i].prev = &s[i - 1];
else
s[i].prev = &s[m - 1];
if (i == m - 1)
s[i].next = &s[0];
else
s[i].next = &s[i + 1];
s[i].flag = 1;
}
now = &s[0];
for (i = 1; i <= n; i++) {
scanf("%s", str);
if (tmp == 1)
continue;
if (i % 3 == 0) {
if (i % 5 == 0) {
flag = strcmp(str, "FizzBuzz");
} else {
flag = strcmp(str, "Fizz");
}
} else if (i % 5 == 0) {
flag = strcmp(str, "Buzz");
} else {
sprintf(t, "%d", i);
flag = strcmp(str, t);
/*
if(i == atoi(str))flag=0;///////
else flag=1;*/
}
if (flag) {
now->prev->next = now->next;
now->next->prev = now->prev;
now->flag = 0;
tmp--;
}
now = now->next;
}
for (i = 0, flag = 0; i < m; i++) {
if (s[i].flag == 1) {
if (!flag) {
printf("%d", i + 1);
flag = 1;
} else {
printf(" %d", i + 1);
}
}
}
puts("");
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 11, 12, 66, 28, 69, 71, 16, 31, 22], ["+", 0, 11, 12, 66, 28, 69, 71, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22]]
| 0
| 427
|
#include <algorithm>
#include <cctype>
#include <iostream>
#include <vector>
using namespace std;
inline int prev(int idx, int size) {
idx--;
if (idx < 0)
idx = size - 1;
return idx;
}
inline void adv(int &idx, int size) {
idx++;
if (idx == size)
idx = 0;
}
inline bool isNumber(const string &s, int &ret) {
ret = -1;
int tmp = 0;
int const size = s.size();
for (int i = 0; i < size; i++) {
if (!isdigit(s[i]))
return false;
(tmp *= 10) += s[i] - '0';
}
ret = tmp;
return true;
}
void rem(vector<int> &player, int &idx) {
adv(idx, player.size());
player.erase(player.begin() + prev(idx, player.size()));
if (player.size() == 1)
idx = 0;
else if (idx != 0)
idx--;
}
int main() {
int M, N;
while (cin >> M >> N && (M | N)) {
int idx = 0;
vector<int> player(M);
for (int i = 0; i < N; i++)
player[i] = i + 1;
for (int fcnt = 1; fcnt <= N; fcnt++) {
string s;
cin >> s;
if (player.size() == 1)
continue;
int num;
if (s == "Fizz" && fcnt % 3 != 0)
rem(player, idx);
else if (s == "Buzz" && fcnt % 5 != 0)
rem(player, idx);
else if (s == "FizzBuzz" && fcnt % 15 != 0)
rem(player, idx);
else if (isNumber(s, num)) {
if (num != fcnt)
rem(player, idx);
else if (num % 3 == 0)
rem(player, idx);
else if (num % 5 == 0)
rem(player, idx);
else if (num % 15 == 0)
rem(player, idx);
else
adv(idx, player.size());
} else {
if (s == "Fizz" || s == "Buzz" || s == "FizzBuzz")
adv(idx, player.size());
else
rem(player, idx);
}
}
for (int i = 0; i < player.size(); i++) {
if (i)
cout << " ";
cout << player[i];
}
cout << endl;
}
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <iostream>
#include <vector>
using namespace std;
inline int prev(int idx, int size) {
idx--;
if (idx < 0)
idx = size - 1;
return idx;
}
inline void adv(int &idx, int size) {
idx++;
if (idx == size)
idx = 0;
}
inline bool isNumber(const string &s, int &ret) {
ret = -1;
int tmp = 0;
int const size = s.size();
for (int i = 0; i < size; i++) {
if (!isdigit(s[i]))
return false;
(tmp *= 10) += s[i] - '0';
}
ret = tmp;
return true;
}
void rem(vector<int> &player, int &idx) {
adv(idx, player.size());
player.erase(player.begin() + prev(idx, player.size()));
if (player.size() == 1)
idx = 0;
else if (idx != 0)
idx--;
}
int main() {
int M, N;
while (cin >> M >> N && (M | N)) {
int idx = 0;
vector<int> player(M);
for (int i = 0; i < M; i++)
player[i] = i + 1;
for (int fcnt = 1; fcnt <= N; fcnt++) {
string s;
cin >> s;
if (player.size() == 1)
continue;
int num;
if (s == "Fizz" && fcnt % 3 != 0)
rem(player, idx);
else if (s == "Buzz" && fcnt % 5 != 0)
rem(player, idx);
else if (s == "FizzBuzz" && fcnt % 15 != 0)
rem(player, idx);
else if (isNumber(s, num)) {
if (num != fcnt)
rem(player, idx);
else if (num % 3 == 0)
rem(player, idx);
else if (num % 5 == 0)
rem(player, idx);
else if (num % 15 == 0)
rem(player, idx);
else
adv(idx, player.size());
} else {
if (s == "Fizz" || s == "Buzz" || s == "FizzBuzz")
adv(idx, player.size());
else
rem(player, idx);
}
}
for (int i = 0; i < player.size(); i++) {
if (i)
cout << " ";
cout << player[i];
}
cout << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 565
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double ESP = 1e-10;
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a || b) {
vector<bool> me(a, true);
int k = 0;
int co = 0;
loop(i, 1, b + 1) {
string s;
cin >> s;
bool h = false;
if (i % 15 == 0) {
if (s == "FizzBuzz")
h = true;
} else if (i % 5 == 0) {
if (s == "Buzz")
h = true;
} else if (i % 3 == 0) {
if (s == "Fizz")
h = true;
} else if (atoi(&s[0]) == i)
h = true;
// else cout<<"! "<<i<<endl;
while (1) {
if (!me[k]) {
k++;
if (k == b)
k = 0;
} else
break;
}
if (!h) {
co++;
me[k] = false;
}
if (co + 1 == a) {
rep(q, b - i) cin >> s;
break;
}
k++;
if (k == b)
k = 0;
// cout<<atoi(&s[0])<<endl;
}
vector<int> out;
rep(i, a) if (me[i]) out.pb(i + 1);
rep(i, out.size() - 1) cout << out[i] << " ";
cout << out[out.size() - 1] << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double ESP = 1e-10;
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a || b) {
vector<bool> me(a, true);
int k = 0;
int co = 0;
loop(i, 1, b + 1) {
string s;
cin >> s;
bool h = false;
if (i % 15 == 0) {
if (s == "FizzBuzz")
h = true;
} else if (i % 5 == 0) {
if (s == "Buzz")
h = true;
} else if (i % 3 == 0) {
if (s == "Fizz")
h = true;
} else if (atoi(&s[0]) == i)
h = true;
while (1) {
if (!me[k]) {
k++;
if (k == a)
k = 0;
} else
break;
}
if (!h) {
co++;
me[k] = false;
}
if (co + 1 == a) {
rep(q, b - i) cin >> s;
break;
}
k++;
if (k == a)
k = 0;
}
vector<int> out;
rep(i, a) if (me[i]) out.pb(i + 1);
rep(i, out.size() - 1) cout << out[i] << " ";
cout << out[out.size() - 1] << endl;
}
}
|
[["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 22]]
| 1
| 383
|
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
string s, temp;
int p = 0;
int size = n;
bool can[1010];
rep(i, n) can[i] = true;
getline(cin, temp);
REP(i, 1, m + 1) {
getline(cin, s);
if (size) {
while (!can[p % n])
p++;
if (i % 15 == 0)
temp = "FizzBuzz";
else if (i % 3 == 0)
temp = "Fizz";
else if (i % 5 == 0)
temp = "Buzz";
else {
stringstream ss;
ss << i;
temp = ss.str();
}
if (s != temp) {
can[p % n] = false;
size--;
}
p++;
}
}
bool flag = false;
rep(i, n) {
if (can[i]) {
if (flag)
cout << " ";
cout << i + 1;
flag = true;
}
}
cout << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
string s, temp;
int p = 0;
int size = n - 1;
bool can[1010];
rep(i, 1010) can[i] = true;
getline(cin, temp);
REP(i, 1, m + 1) {
getline(cin, s);
if (size) {
while (!can[p % n])
p++;
if (i % 15 == 0)
temp = "FizzBuzz";
else if (i % 3 == 0)
temp = "Fizz";
else if (i % 5 == 0)
temp = "Buzz";
else {
stringstream ss;
ss << i;
temp = ss.str();
}
if (s != temp) {
can[p % n] = false;
size--;
}
p++;
}
}
bool flag = false;
rep(i, n) {
if (can[i]) {
if (flag)
cout << " ";
cout << i + 1;
flag = true;
}
}
cout << endl;
}
}
|
[["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 22], ["+", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13]]
| 1
| 276
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
string mes[3] = {"Fizz", "Buzz", "FizzBuzz"};
int n, m;
while (scanf("%d%d", &n, &m), n || m) {
bool f[10000];
fill(f, f + 10000, true);
int idx = 0, cnt = 0;
for (int i = 1; i <= m; i++) {
while (!f[idx])
idx = (idx + 1) % n;
string str;
cin >> str;
if (cnt + 1 == n)
continue;
int state = -1;
if (i % 3 == 0)
state = 0;
if (i % 5 == 0)
state = 1;
if (i % 3 == 0 && i % 5 == 0)
state = 2;
stringstream ss;
ss << i;
string s;
ss >> s;
if (state == -1) {
if (s != str)
f[idx] = false;
cnt++;
} else {
if (mes[state] != str)
f[idx] = false;
cnt++;
}
// printf(":::%d\n",idx);
idx = (idx + 1) % n;
}
bool flag = false;
for (int i = 0; i < n; i++) {
if (!f[i])
continue;
if (flag)
printf(" ");
printf("%d", i + 1);
flag = true;
}
puts("");
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
string mes[3] = {"Fizz", "Buzz", "FizzBuzz"};
int n, m;
while (scanf("%d%d", &n, &m), n || m) {
bool f[10000];
fill(f, f + 10000, true);
int idx = 0, cnt = 0;
for (int i = 1; i <= m; i++) {
while (!f[idx])
idx = (idx + 1) % n;
string str;
cin >> str;
if (cnt + 1 == n)
continue;
int state = -1;
if (i % 3 == 0)
state = 0;
if (i % 5 == 0)
state = 1;
if (i % 3 == 0 && i % 5 == 0)
state = 2;
stringstream ss;
ss << i;
string s;
ss >> s;
if (state == -1) {
if (s != str) {
f[idx] = false;
cnt++;
}
} else {
if (mes[state] != str) {
f[idx] = false;
cnt++;
}
}
idx = (idx + 1) % n;
}
bool flag = false;
for (int i = 0; i < n; i++) {
if (!f[i])
continue;
if (flag)
printf(" ");
printf("%d", i + 1);
flag = true;
}
puts("");
}
return 0;
}
|
[["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 329
|
#include <iostream>
#include <string>
using namespace std;
string f(int d) {
int q, x = 1;
for (q = 0; d / x; q++)
x *= 10;
x /= 10;
string b;
for (int k = 0; k < q; k++) {
b += d / x + '0';
d -= d / x * x;
x /= 10;
}
return b;
}
main() {
int m, n;
while (cin >> n >> m, n) {
int table[10010] = {}, pre[10010] = {}, nxt[10010] = {};
for (int i = 1; i <= n; i++) {
table[i] = i;
pre[i] = i - 1;
nxt[i] = i + 1;
}
pre[1] = n;
nxt[n] = 1;
int cnt = n - 1, pos = 1;
string s;
for (int i = 1; i <= m; i++) {
cin >> s;
if (!cnt)
continue;
string num = f(i);
if (!(i % 15))
num = "FizzBuzz";
else if (!(i % 5))
num = "Buzz";
else if (!(i % 3))
num = "Fizz";
if (s != num) {
nxt[pre[pos]] = nxt[pos];
pre[nxt[pos]] = pre[pos];
table[pos] = 0;
pos = pre[pos];
}
pos = nxt[pos];
}
bool t = false;
for (int i = 1; i <= n; i++) {
if (table[i]) {
if (t)
cout << ' ';
cout << i;
t = true;
}
}
cout << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
string f(int d) {
int q, x = 1;
for (q = 0; d / x; q++)
x *= 10;
x /= 10;
string b;
for (int k = 0; k < q; k++) {
b += d / x + '0';
d -= d / x * x;
x /= 10;
}
return b;
}
main() {
int m, n;
while (cin >> n >> m, n) {
int table[10010] = {}, pre[10010] = {}, nxt[10010] = {};
for (int i = 1; i <= n; i++) {
table[i] = i;
pre[i] = i - 1;
nxt[i] = i + 1;
}
pre[1] = n;
nxt[n] = 1;
int cnt = n - 1, pos = 1;
string s;
for (int i = 1; i <= m; i++) {
cin >> s;
if (!cnt)
continue;
string num = f(i);
if (!(i % 15))
num = "FizzBuzz";
else if (!(i % 5))
num = "Buzz";
else if (!(i % 3))
num = "Fizz";
if (s != num) {
nxt[pre[pos]] = nxt[pos];
pre[nxt[pos]] = pre[pos];
table[pos] = 0;
cnt--;
}
pos = nxt[pos];
}
bool t = false;
for (int i = 1; i <= n; i++) {
if (table[i]) {
if (t)
cout << ' ';
cout << i;
t = true;
}
}
cout << endl;
}
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 73], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68]]
| 1
| 393
|
#include <iostream>
using namespace std;
int main() {
while (true) {
string a, b;
cin >> a;
cin >> b;
if (a == "0")
break;
int hit = 0;
int blow = 0;
for (int i = 0; i < 4; ++i) {
if (a[i] == b[i])
hit++;
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (i == j)
continue;
if (a[i] == b[j])
blow++;
}
}
cout << hit << " " << blow;
}
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
string a, b;
cin >> a;
cin >> b;
if (a == "0")
break;
int hit = 0;
int blow = 0;
for (int i = 0; i < 4; ++i) {
if (a[i] == b[i])
hit++;
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (i == j)
continue;
if (a[i] == b[j])
blow++;
}
}
cout << hit << " " << blow << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 147
|
loop do
l = gets.chomp
break if l == "0 0"
answer, call = l.split.map {|s| s.split("")}
hit = answer.zip(call).select {|a| a.inject(:==)}.size
blow = (Set[*answer] & Set[*call]).size - hit
puts "#{hit} #{blow}"
end
|
require 'set'
loop do
l = gets.chomp
break if l == "0 0"
answer, call = l.split.map {|s| s.split("")}
hit = answer.zip(call).select {|a| a.inject(:==)}.size
blow = (Set[*answer] & Set[*call]).size - hit
puts "#{hit} #{blow}"
end
|
[["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 62], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 6]]
| 4
| 88
|
while True:
r, a= input().split()
if r==a==0: break
print(sum(1 for i, j in zip(r, a) if i==j), sum(1 for i in range(len(r)) for j in range(len(a)) if r[i]==a[j] and i!=j))
|
while True:
r, a= input().split()
if r==a=='0': break
print(sum(1 for i, j in zip(r, a) if i==j), sum(1 for i in range(len(r)) for j in range(len(a)) if r[i]==a[j] and i!=j))
|
[["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 654], ["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 655]]
| 5
| 83
|
if __name__ == '__main__':
while True:
a,b = list(map(str,input().split(' ')))
if a == 0 and b == 0:
break
a = list(a)
b = list(b)
# print a
br = 0
hit = 0
for i,data in enumerate(b):
if data in a:
if a[i] == data:
hit += 1
else:
br += 1
print(hit,br)
|
if __name__ == '__main__':
while True:
a,b = list(map(str,input().split(' ')))
if a == '0' and b == '0':
break
# print a,b
a = list(a)
b = list(b)
# print a
br = 0
hit = 0
for i,data in enumerate(b):
if data in a:
if a[i] == data:
hit += 1
else:
br += 1
print(hit,br)
|
[["+", 0, 57, 15, 679, 31, 666, 0, 557, 0, 654], ["+", 0, 57, 15, 679, 31, 666, 0, 557, 0, 655], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 654], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 655]]
| 5
| 98
|
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/*
* Problem B: Thanksgiving
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line;
String[] words;
while ((line = br.readLine()) != null && !line.isEmpty()) {
int n, m;
n = parseInt(line.substring(0, line.indexOf(' ')));
m = parseInt(line.substring(line.indexOf(' ') + 1));
if ((n | m) == 0)
break;
int[] p = new int[n];
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < n; i++)
p[i] = parseInt(st.nextToken());
Arrays.sort(p);
//
int ans = 0;
if (n >= m) {
int r = n % m;
for (int i = 0; i < r; i++) {
ans += p[i];
}
for (int i = r; i < n; i++) {
if (((i - r) % m) != 0)
ans += p[i];
}
} else {
for (int i = 1; i < n; i++) {
ans += p[i];
}
}
System.out.println(ans);
}
}
}
|
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/*
* Problem B: Thanksgiving
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line;
String[] words;
while ((line = br.readLine()) != null && !line.isEmpty()) {
int n, m;
n = parseInt(line.substring(0, line.indexOf(' ')));
m = parseInt(line.substring(line.indexOf(' ') + 1));
if ((n | m) == 0)
break;
int[] p = new int[n];
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < n; i++)
p[i] = parseInt(st.nextToken());
Arrays.sort(p);
//
int ans = 0;
if (n >= m) {
int r = n % m;
for (int i = 0; i < r; i++) {
ans += p[i];
}
for (int i = r; i < n; i++) {
if (((i - r) % m) != 0)
ans += p[i];
}
} else {
for (int i = 0; i < n; i++) {
ans += p[i];
}
}
System.out.println(ans);
}
}
}
|
[["-", 75, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 75, 196, 0, 7, 502, 503, 49, 200, 51, 499]]
| 3
| 341
|
#include <stdio.h>
int main() {
int n, m, p[1000], i, j, sum = 0, k;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++)
scanf("%d", &p[i]);
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (p[j] < p[j + 1]) {
k = p[j];
p[j] = p[j + 1];
p[j + 1] = k;
}
}
}
for (i = 0; i < n; i++) {
if ((i + 1) % m == 0) {
p[i] = 0;
}
}
for (i = 0; i < n; i++) {
sum += p[i];
}
printf("%d\n", sum);
}
return 0;
}
|
#include <stdio.h>
int main() {
int n, m, p[1000], i, j, sum, k;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++)
scanf("%d", &p[i]);
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (p[j] < p[j + 1]) {
k = p[j];
p[j] = p[j + 1];
p[j + 1] = k;
}
}
}
for (i = 0; i < n; i++) {
if ((i + 1) % m == 0) {
p[i] = 0;
}
}
sum = 0;
for (i = 0; i < n; i++) {
sum += p[i];
}
printf("%d\n", sum);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 0
| 236
|
#include <stdio.h>
int main() {
int N, M;
int n[1001] = {};
while (1) {
int s = 0;
scanf("%d %d", &N, M);
if (N == 0 && M == 0)
break;
for (int i = 1; i <= N; i++)
scanf("%d", &n[i]);
for (int i = 1; i <= N; i++)
for (int j = N; j > i; j--)
if (n[j] > n[j - 1]) {
int t = n[j - 1];
n[j - 1] = n[j];
n[j] = t;
}
for (int i = 1; i <= N; i++) {
if (i % M != 0)
s += n[i];
}
printf("%d\n", s);
}
return 0;
}
|
#include <stdio.h>
int main() {
int N, M;
int n[1001] = {};
while (1) {
int s = 0;
scanf("%d %d", &N, &M);
if (N == 0 && M == 0)
break;
for (int i = 1; i <= N; i++)
scanf("%d", &n[i]);
for (int i = 1; i <= N; i++)
for (int j = N; j > i; j--)
if (n[j] > n[j - 1]) {
int t = n[j - 1];
n[j - 1] = n[j];
n[j] = t;
}
for (int i = 1; i <= N; i++) {
if (i % M != 0)
s += n[i];
}
printf("%d\n", s);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 1
| 201
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m; // n:konyu m:hukuro
std::cin >> n >> m;
while (n != 0 || m != 0) {
std::vector<int> price;
price.resize(n);
for (int i = 0; i < n; ++i) {
std::cin >> price[i]; // input
}
std::sort(price.begin(), price.end(), std::greater<int>());
int sum = 0;
for (int i = 0; i < n; ++i) {
if ((i + 1) % m != 0) {
i += price[i];
}
}
std::cout << sum << std::endl;
std::cin >> n >> m;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m; // n:konyu m:hukuro
std::cin >> n >> m;
while (n != 0 || m != 0) {
std::vector<int> price;
price.resize(n);
for (int i = 0; i < n; ++i) {
std::cin >> price[i]; // input
}
std::sort(price.begin(), price.end(), std::greater<int>());
int sum = 0;
for (int i = 0; i < n; ++i) {
if ((i + 1) % m != 0) {
sum += price[i];
}
}
std::cout << sum << std::endl;
std::cin >> n >> m;
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]]
| 1
| 168
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m; // n:konyu m:hukuro
std::cin >> n >> m;
while (n != 0 || m != 0) {
std::vector<int> price;
price.resize(n);
for (int i = 0; i < n; ++i) {
std::cin >> price[i]; // input
}
std::sort(price.begin(), price.end(), std::greater<int>());
int sum = 0;
for (int i = 0; i < n; ++i) {
if ((i + 1) % m != 0) {
i += price[i];
}
}
std::cout << sum << std::endl;
std::cin >> n >> m;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m; // n:purchase number, m:capacity of the bag
std::cin >> n >> m;
while (n != 0 || m != 0) {
std::vector<int> price; // price:the price of vegetable
price.resize(n);
for (int i = 0; i < n; ++i) {
std::cin >> price[i]; // input price
}
// sort in descending order
std::sort(price.begin(), price.end(), std::greater<int>());
int sum = 0; // sum:total amount
for (int i = 0; i < n; ++i) {
if ((i + 1) % m != 0) {
sum += price[i];
}
}
std::cout << sum << std::endl; // output sum
std::cin >> n >> m;
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]]
| 1
| 168
|
#include <algorithm>
#include <iostream>
using namespace std;
int n, m, x[1000000];
long long sum1, sum2;
int main() {
while (true) {
sum1 = 0;
sum2 = 0;
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> x[i];
sum1 += x[i];
}
sort(x, x + n);
for (int i = n - m + 1; i >= 0; i -= m) {
sum2 -= x[i];
}
cout << sum1 - sum2 << endl;
return 0;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int n, m, x[1000000];
long long sum1, sum2;
int main() {
while (true) {
sum1 = 0;
sum2 = 0;
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> x[i];
sum1 += x[i];
}
sort(x, x + n);
for (int i = n - m; i >= 0; i -= m) {
sum2 += x[i];
}
cout << sum1 - sum2 << endl;
}
return 0;
}
|
[["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 142
|
#include <algorithm>
#include <stdio.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m, p[1000];
int main() {
while (true) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
sort(p, p + n);
int ret = 0;
for (int i = 0; i < n; i++)
ret += p[i];
for (int i = 0; i + m <= n; i += m)
ret -= p[i];
printf("%d\n", ret);
}
return 0;
}
|
#include <algorithm>
#include <stdio.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m, p[1000];
int main() {
while (true) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
sort(p, p + n);
int ret = 0;
for (int i = 0; i < n; i++)
ret += p[i];
for (int i = n % m; i + m <= n; i += m)
ret -= p[i];
printf("%d\n", ret);
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 109], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 22]]
| 1
| 156
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
/*The function calculates vegetables which you purchase.*/
int purchase_price(const int n, const int m) {
// The price of purchased vegetables
std::vector<int> purchase;
// input
for (int i = 0; i < n; ++i) {
int tmp;
std::cin >> tmp;
purchase.push_back(tmp);
}
// descending sort (higher price)
std::sort(purchase.begin(), purchase.end(), std::greater<int>());
int sum = 0;
// surplus eqals to (m-1) is free
for (int i = 0; i < n; ++i) {
if (i % m != m - 1) {
sum += purchase.at(i);
}
}
return sum;
}
int main() {
// n:the number of purchase vegetables
// m:the number of you can stuff vegetables
int n, m;
// sum of price
int sum;
while (true) {
std::cin >> n >> m;
// case of input is (n,m)=(0,0)
if (n == 0 && m == 0) {
break;
}
sum = purchase_price(n, m);
std::cout << sum;
}
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
/*The function calculates vegetables which you purchase.*/
int purchase_price(const int n, const int m) {
// The price of purchased vegetables
std::vector<int> purchase;
// input
for (int i = 0; i < n; ++i) {
int tmp;
std::cin >> tmp;
purchase.push_back(tmp);
}
// descending sort (higher price)
std::sort(purchase.begin(), purchase.end(), std::greater<int>());
int sum = 0;
// surplus eqals to (m-1) is free
for (int i = 0; i < n; ++i) {
if (i % m != m - 1) {
sum += purchase.at(i);
}
}
return sum;
}
int main() {
// n:the number of purchase vegetables
// m:the number of you can stuff vegetables
int n, m;
// sum of price
int sum;
while (true) {
std::cin >> n >> m;
// case of input is (n,m)=(0,0)
if (n == 0 && m == 0) {
break;
}
sum = purchase_price(n, m);
std::cout << sum << std::endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 345, 348], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 0, 349], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 141, 22]]
| 1
| 201
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> vegetables;
int num, cap, price, i;
while (std::cin >> num >> cap) {
if (num == 0 && cap == 0) {
break;
}
int sum = 0;
for (i = 0; i < num; ++i) {
std::cin >> price;
vegetables.push_back(price);
}
sort(vegetables.begin(), vegetables.end(), std::greater<int>());
i = 0;
while (i < num) {
if ((i + 1) % cap != 0) {
sum += vegetables.at(i);
}
++i;
}
std::cout << sum << std::endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> vegetables;
int num, cap, price, i;
while (std::cin >> num >> cap) {
if (num == 0 && cap == 0) {
break;
}
int sum = 0;
for (i = 0; i < num; ++i) {
std::cin >> price;
vegetables.push_back(price);
}
sort(vegetables.begin(), vegetables.end(), std::greater<int>());
i = 0;
while (i < num) {
if ((i + 1) % cap != 0) {
sum += vegetables.at(i);
}
++i;
}
std::cout << sum << std::endl;
vegetables.clear();
}
}
|
[["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 160
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, i, sum = 0;
int c[a];
while (1) {
cin >> a >> b;
if (a == 0 && b == 0)
break;
for (i = 0; i < a; i++) {
cin >> c[i];
sum += c[i];
}
sort(c, c + a);
reverse(c, c + a);
for (i = b - 1; i < a; i += b) {
sum -= c[i];
}
cout << sum << endl;
sum = 0;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, i, sum = 0;
int c[10000];
while (1) {
cin >> a >> b;
if (a == 0 && b == 0)
break;
for (i = 0; i < a; i++) {
cin >> c[i];
sum += c[i];
}
sort(c, c + a);
reverse(c, c + a);
for (i = b - 1; i < a; i += b) {
sum -= c[i];
}
cout << sum << endl;
sum = 0;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]]
| 1
| 140
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int m, n;
while (cin >> n >> m, n) {
int plz[1050] = {0}, total = 0, cnt = 1;
for (int i = 0; i < n; i++) {
cin >> plz[i];
}
sort(plz, plz + n);
reverse(plz, plz + n);
for (int i = 0; i < n; i++) {
if (cnt != m) {
total += plz[i];
cnt++;
} else if (cnt == m) {
cnt = 1;
}
}
cout << total;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int m, n;
while (cin >> n >> m, n) {
int plz[1050] = {0}, total = 0, cnt = 1;
for (int i = 0; i < n; i++) {
cin >> plz[i];
}
sort(plz, plz + n);
reverse(plz, plz + n);
for (int i = 0; i < n; i++) {
if (cnt != m) {
total += plz[i];
cnt++;
} else if (cnt == m) {
cnt = 1;
}
}
cout << total << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 148
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int price[1000];
int n, m, pack, hoge, howmach;
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++)
cin >> price[i];
sort(price, price + n);
pack = n / m;
hoge = n % m;
howmach = accumulate(price + 1, price + n, 0);
for (int i = 1; i < pack; i++) {
howmach -= price[m * i + hoge];
}
cout << howmach << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int price[1000];
int n, m, pack, hoge, howmach;
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++)
cin >> price[i];
sort(price, price + n);
pack = n / m;
hoge = n % m;
howmach = accumulate(price, price + n, 0);
for (int i = 0; i < pack; i++) {
howmach -= price[m * i + hoge];
}
cout << howmach << endl;
}
return 0;
}
|
[["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 162
|
#define M 26
P[M], A[M], B[M];
int R(a) { return P[a] == a ? a : (P[a] = R(P[a])); }
char s[99];
main(k, l, d, x, y) {
for (; scanf("%d", &l), l; puts(k < M || d ? "NG" : "OK")) {
for (k = 0; k < M; k++)
A[k] = B[k] = 0, P[k] = k;
for (k = 0; k < l; k++)
scanf("%s", s), x = *s - 97, y = s[strlen(s) - 1] - 97, A[x]++, B[y]++,
P[R(x)] = R(y);
for (d = k = 0; k < M; k++) {
d += A[k] - B[k];
if ((A[k] | B[k]) && R(*s - 97) != R(k))
break;
}
}
exit(0);
}
|
#define M 26
P[M], A[M], B[M];
int R(a) { return P[a] == a ? a : (P[a] = R(P[a])); }
char s[99];
main(k, l, d, x, y) {
for (; scanf("%d", &l), l; puts(k < M || d ? "NG" : "OK")) {
for (k = 0; k < M; k++)
A[k] = B[k] = 0, P[k] = k;
for (k = 0; k < l; k++)
scanf("%s", s), x = *s - 97, y = s[strlen(s) - 1] - 97, A[x]++, B[y]++,
P[R(x)] = R(y);
for (d = k = 0; k < M; k++) {
d += abs(A[k] - B[k]);
if ((A[k] | B[k]) && R(*s - 97) != R(k))
break;
}
}
exit(0);
}
|
[["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]]
| 0
| 268
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <vector>
using namespace std;
char in[33];
int n, deg[26];
bool v[26];
vector<int> e[26];
void dfs(int c) {
v[c] = 1;
for (vector<int>::iterator i = e[c].begin(); i < e[c].end(); i++)
if (!v[*i])
dfs(*i);
}
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < 26; i++) {
e[i].clear();
deg[i] = 0;
v[i] = 1;
}
int a, b;
for (int i = 0; i < n; i++) {
scanf("%s", in);
a = in[0] - 'a';
b = in[strlen(in) - 1] - 'a';
e[a].push_back(b);
deg[a]++;
deg[b]--;
v[a] = v[b] = 0;
}
dfs(a);
bool flag = true;
for (int i = 0; i < 26; i++) {
if (!v[i] || deg[i] != 0) {
flag = false;
break;
}
}
printf("%s", (flag ? "OK" : "NG"));
}
}
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <vector>
using namespace std;
char in[33];
int n, deg[26];
bool v[26];
vector<int> e[26];
void dfs(int c) {
v[c] = 1;
for (vector<int>::iterator i = e[c].begin(); i < e[c].end(); i++)
if (!v[*i])
dfs(*i);
}
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < 26; i++) {
e[i].clear();
deg[i] = 0;
v[i] = 1;
}
int a, b;
for (int i = 0; i < n; i++) {
scanf("%s", in);
a = in[0] - 'a';
b = in[strlen(in) - 1] - 'a';
e[a].push_back(b);
deg[a]++;
deg[b]--;
v[a] = v[b] = 0;
}
dfs(a);
bool flag = true;
for (int i = 0; i < 26; i++) {
if (!v[i] || deg[i] != 0) {
flag = false;
break;
}
}
printf("%s\n", (flag ? "OK" : "NG"));
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 328
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
e.src != f.src ? e.src < f.src
: e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
int connectedNum(Graph g, int s) {
int n = g.size();
if (n <= 1)
return true;
vector<bool> visited(n);
priority_queue<int> Q;
int res = 0;
for (Q.push(s); !Q.empty();) {
int now = Q.top();
Q.pop();
if (visited[now])
continue;
visited[now] = 1;
res++;
FOR(f, g[now])
if (!visited[f->dst])
Q.push(f->dst);
}
return res;
}
int main() {
int n;
while (cin >> n, n) {
Graph g(26);
int v[26]; // m[hi Ìü
set<int> se;
REP(i, n) {
string s;
cin >> s;
int a = s[0] - 'a';
int b = s[s.size() - 1] - 'a';
g[a].push_back(Edge(a, b, 1));
v[b]++;
se.insert(a);
se.insert(b);
}
bool f = 0;
int ma = 0;
FOR(it, se) { ma = max(ma, connectedNum(g, *it)); }
if (ma == se.size()) {
FOR(it, se) {
if (g[*it].size() == v[*it]) {
f = 1;
break;
}
}
} else
f = 1;
if (f)
cout << "NG" << endl;
else
cout << "OK" << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
e.src != f.src ? e.src < f.src
: e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
int connectedNum(Graph g, int s) {
int n = g.size();
if (n <= 1)
return true;
vector<bool> visited(n);
priority_queue<int> Q;
int res = 0;
for (Q.push(s); !Q.empty();) {
int now = Q.top();
Q.pop();
if (visited[now])
continue;
visited[now] = 1;
res++;
FOR(f, g[now])
if (!visited[f->dst])
Q.push(f->dst);
}
return res;
}
int main() {
int n;
while (cin >> n, n) {
Graph g(26);
vector<int> v(26); // m[hi Ìü
set<int> se;
REP(i, n) {
string s;
cin >> s;
int a = s[0] - 'a';
int b = s[s.size() - 1] - 'a';
g[a].push_back(Edge(a, b, 1));
v[b]++;
se.insert(a);
se.insert(b);
}
bool f = 0;
int ma = 0;
FOR(it, se) { ma = max(ma, connectedNum(g, *it)); }
if (ma == se.size()) {
FOR(it, se) {
if (g[*it].size() != v[*it]) {
f = 1;
break;
}
}
} else
f = 1;
if (f)
cout << "NG" << endl;
else
cout << "OK" << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["-", 0, 52, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 24], ["-", 0, 52, 8, 9, 0, 43, 49, 80, 0, 73], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 25], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]]
| 1
| 533
|
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int graph[26][26];
void DFS(int i) {
for (int j = 0; j < 26; j++) {
if (graph[i][j] != 0) {
graph[i][j]--;
DFS(j);
}
}
}
int main() {
int n;
while (cin >> n) {
if (!n)
break;
int word[26] = {0};
memset(graph, 0, sizeof(graph));
for (int i = 0; i < n; i++) {
string str;
cin >> str;
word[static_cast<unsigned>(str[0] - 'a')]--;
word[static_cast<unsigned>(str[str.size() - 1] - 'a')]++;
graph[str[0] - 'a'][str[str.size() - 1] - 'a']++;
}
bool flag = true;
for (int i = 0; i < 26; i++) {
if (word[i] != 0) {
flag = false;
break;
}
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < 26; j++) {
if (graph[i][j] != 0)
DFS(i);
goto JUMP;
}
}
JUMP:;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < 26; j++) {
if (graph[i][j] != 0)
flag = false;
}
}
if (flag)
cout << "OK" << endl;
else
cout << "NG" << endl;
}
return 0;
}
|
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int graph[26][26];
void DFS(int i) {
for (int j = 0; j < 26; j++) {
if (graph[i][j] != 0) {
graph[i][j]--;
DFS(j);
}
}
}
int main() {
int n;
while (cin >> n) {
if (!n)
break;
int word[26] = {0};
memset(graph, 0, sizeof(graph));
for (int i = 0; i < n; i++) {
string str;
cin >> str;
word[static_cast<unsigned>(str[0] - 'a')]--;
word[static_cast<unsigned>(str[str.size() - 1] - 'a')]++;
graph[str[0] - 'a'][str[str.size() - 1] - 'a']++;
}
bool flag = true;
for (int i = 0; i < 26; i++) {
if (word[i] != 0) {
flag = false;
break;
}
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < 26; j++) {
if (graph[i][j] != 0) {
DFS(i);
goto JUMP;
}
}
}
JUMP:;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < 26; j++) {
if (graph[i][j] != 0)
flag = false;
}
}
if (flag)
cout << "OK" << endl;
else
cout << "NG" << endl;
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 380
|
<?php
for( $loop_cnt = 0;12000 > $loop_cnt; $loop_cnt++ )
{
$input = explode(" ", trim(fgets(STDIN)));
if( 0 == $input[0] &&
0 == $input[1]
)
{
break;
}
$r = str_split($input[0]);
$a = str_split($input[1]);
$hit = 0;
$brow = 0;
$loop_r = 0;
foreach( $r as $r_char )
{
$loop_a = 0;
foreach($a as $a_char)
{
if($r_char == $a_char)
{
if($loop_r == $loop_a)
{
$hit++;
}
else
{
$brow++;
}
break;
}
$loop_a++;
}
$loop_r++;
}
echo trim($hit . " " . $brow . "\n");
}
?>
|
<?php
for( $loop_cnt = 0;12000 > $loop_cnt; $loop_cnt++ )
{
$input = explode(" ", trim(fgets(STDIN)));
if( 0 == $input[0] &&
0 == $input[1]
)
{
break;
}
$r = str_split($input[0]);
$a = str_split($input[1]);
$hit = 0;
$brow = 0;
$loop_r = 0;
foreach( $r as $r_char )
{
$loop_a = 0;
foreach($a as $a_char)
{
if($r_char == $a_char)
{
if($loop_r == $loop_a)
{
$hit++;
}
else
{
$brow++;
}
break;
}
$loop_a++;
}
$loop_r++;
}
echo $hit . " " . $brow . "\n";
}
?>
|
[["-", 0, 7, 0, 9, 0, 608, 0, 613, 63, 141], ["-", 0, 9, 0, 608, 0, 613, 3, 3, 0, 24], ["-", 0, 9, 0, 608, 0, 613, 3, 3, 0, 25]]
| 6
| 183
|
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
for (;;) {
String n = cin.next();
String m = cin.next();
if ((n + m).equals("00"))
break;
char[] s1 = n.toCharArray();
char[] s2 = m.toCharArray();
int hit = 0, blow = 0;
for (int i = 0; i < s1.length; i++) {
if (s1[i] == s2[i]) {
hit++;
s1[i] = (char)i;
s2[i] = (char)(i + 4);
}
}
for (int i = 0; i < s1.length; i++) {
for (int j = 0; j < s2.length; j++) {
if (s1[i] == s2[j]) {
blow++;
s1[i] = (char)(i * 1000);
s2[j] = (char)(j * 3000);
}
}
}
System.out.println(hit + " " + blow);
}
}
}
|
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
for (;;) {
String n = cin.next();
String m = cin.next();
if ((n + m).equals("00"))
break;
char[] s1 = n.toCharArray();
char[] s2 = m.toCharArray();
int hit = 0, blow = 0;
for (int i = 0; i < s1.length; i++) {
if (s1[i] == s2[i]) {
hit++;
s1[i] = (char)i;
s2[i] = (char)(i + 4);
}
}
for (int i = 0; i < s1.length; i++) {
for (int j = 0; j < s2.length; j++) {
if (s1[i] == s2[j]) {
blow++;
s1[i] = (char)(i * 1000);
s2[j] = (char)(j * 10000);
}
}
}
System.out.println(hit + " " + blow);
}
}
}
|
[["-", 0, 11, 12, 74, 51, 23, 0, 16, 12, 499], ["+", 0, 11, 12, 74, 51, 23, 0, 16, 12, 499]]
| 3
| 264
|
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
while (true) {
String r, a;
r = scan.next();
a = scan.next();
if (r.equals("0") && a.equals("0"))
break;
int hit = 0, blow = 0;
for (int i = 0; i < 4; i++) {
if (r.charAt(i) == a.charAt(i))
hit++;
for (int j = 0; j < 3; j++) {
if ((r.charAt(i) == a.charAt(j)) && (i != j))
blow++;
}
}
System.out.println(hit + " " + blow);
}
}
}
|
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
while (true) {
String r, a;
r = scan.next();
a = scan.next();
if (r.equals("0") && a.equals("0"))
break;
int hit = 0, blow = 0;
for (int i = 0; i < 4; i++) {
if (r.charAt(i) == a.charAt(i))
hit++;
for (int j = 0; j < 4; j++) {
if ((r.charAt(i) == a.charAt(j)) && i != j)
blow++;
}
}
System.out.println(hit + " " + blow);
}
}
}
|
[["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499], ["-", 0, 57, 15, 15, 0, 16, 12, 23, 0, 24], ["-", 0, 57, 15, 15, 0, 16, 12, 23, 0, 25]]
| 3
| 185
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string taroNomber;
string hanakoNomber;
int hitCount = 0;
int blowCount = 0;
while (true) {
cin >> taroNomber >> hanakoNomber;
if (taroNomber == "0" && hanakoNomber == "0") {
break;
}
hitCount = 0;
blowCount = 0;
int taroSize = taroNomber.size();
int hanakoSize = hanakoNomber.size();
for (int i = 0; i < taroSize; i++) {
for (int j = 0; j < hanakoSize; j++) {
if (taroNomber[i] == hanakoNomber[j]) {
if (i == j) {
hitCount++;
} else {
blowCount++;
}
}
}
}
cout << hitCount << blowCount << '\n';
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string taroNomber;
string hanakoNomber;
int hitCount = 0;
int blowCount = 0;
while (true) {
cin >> taroNomber >> hanakoNomber;
if (taroNomber == "0" && hanakoNomber == "0") {
break;
}
hitCount = 0;
blowCount = 0;
int taroSize = taroNomber.size();
int hanakoSize = hanakoNomber.size();
for (int i = 0; i < taroSize; i++) {
for (int j = 0; j < hanakoSize; j++) {
if (taroNomber[i] == hanakoNomber[j]) {
if (i == j) {
hitCount++;
} else {
blowCount++;
}
}
}
}
cout << hitCount << ' ' << blowCount << '\n';
}
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 162
|
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string stra, strb;
cin >> stra >> strb;
int h, b;
if ((stra == "0") && (strb == "0")) {
break;
}
for (int i = 0; i < 4; i++) {
if (stra[i] == strb[i]) {
h++;
}
for (int j = 0; j < 4; j++) {
if (stra[i] == strb[j]) {
b++;
}
}
}
b = b - h;
cout << h << ' ' << b << '\n';
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string stra, strb;
cin >> stra >> strb;
int h = 0, b = 0;
if ((stra == "0") && (strb == "0")) {
break;
}
for (int i = 0; i < 4; i++) {
if (stra[i] == strb[i]) {
h++;
}
for (int j = 0; j < 4; j++) {
if (stra[i] == strb[j]) {
b++;
}
}
}
b = b - h;
cout << h << ' ' << b << '\n';
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 147
|
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string r;
string a;
cin >> r >> a;
if ((r == "0") && (a == "0")) {
break;
}
int h = 0, b = 0;
for (int i; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (r[i] == a[j]) {
if (i == j) {
h++;
} else {
b++;
}
}
}
}
cout << h << ' ' << b << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string r;
string a;
cin >> r >> a;
if ((r == "0") && (a == "0")) {
break;
}
int h = 0, b = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (r[i] == a[j]) {
if (i == j) {
h++;
} else {
b++;
}
}
}
}
cout << h << ' ' << b << '\n';
}
return 0;
}
|
[["+", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 104], ["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 44]]
| 1
| 139
|
#include <iostream>
int main() {
int h, b, i, j;
std::string r, a;
while (std::cin >> r >> a, r != "0" && a != "0") {
for (h = b = i = 0; i < 4; i++)
for (j = 4; j-- > 0;)
if (a[i] == r[j])
i = j ? h++ : b++;
printf("%d %d\n", h, b);
}
}
|
#include <iostream>
int main() {
int h, b, i, j;
std::string r, a;
while (std::cin >> r >> a, r != "0" && a != "0") {
for (h = b = i = 0; i < 4; i++)
for (j = 4; j-- > 0;)
if (a[i] == r[j])
i == j ? h++ : b++;
printf("%d %d\n", h, b);
}
}
|
[["-", 8, 7, 8, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 57, 64, 1, 0, 41, 15, 16, 17, 60]]
| 1
| 111
|
#include <iostream>
int main() {
int h, b, i, j;
std::string r, a;
while (std::cin >> r >> a, r != "0" && a != "0") {
for (h = b = i = 0; i < 4; i++)
for (j = 4; j-- > 0;)
if (a[i] == r[j])
i = j ? h++ : b++;
printf("%d %d\n", h, b);
}
}
|
#include <iostream>
int main() {
int h, b, i, j;
std::string r, a;
while (std::cin >> r >> a, r != "0" && a != "0") {
h = b = i = 0;
for (; i < 4; i++)
for (j = 4; j-- > 0;)
if (a[i] == r[j])
i == j ? h++ : b++;
printf("%d %d\n", h, b);
}
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 7, 0, 88], ["-", 8, 9, 0, 52, 8, 9, 0, 7, 0, 24], ["+", 8, 9, 0, 52, 8, 9, 0, 7, 0, 88], ["+", 8, 9, 0, 52, 8, 9, 0, 7, 0, 24], ["+", 8, 9, 0, 52, 8, 9, 0, 7, 0, 35], ["-", 8, 7, 8, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 57, 64, 1, 0, 41, 15, 16, 17, 60]]
| 1
| 111
|
#include <iostream>
#include <queue>
int main() {
std::priority_queue<u_int> vegetable;
u_int n, m, price;
while (1) {
std::cin >> n >> m;
if (n == 0 && m == 0)
break;
for (u_int i = 0; i < n; ++i) {
std::cin >> price;
vegetable.push(price);
}
u_int sum = 0;
for (u_int i = 1; i <= n; ++i) {
if (i % m == 0) {
sum += vegetable.top();
}
vegetable.pop();
}
std::cout << sum << std::endl;
}
return 0;
}
|
#include <iostream>
#include <queue>
int main() {
std::priority_queue<u_int> vegetable;
u_int n, m, price;
while (1) {
std::cin >> n >> m;
if (n == 0 && m == 0)
break;
for (u_int i = 0; i < n; ++i) {
std::cin >> price;
vegetable.push(price);
}
u_int sum = 0;
for (u_int i = 1; i <= n; ++i) {
if (i % m != 0) {
sum += vegetable.top();
}
vegetable.pop();
}
std::cout << sum << std::endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]]
| 1
| 138
|
#include <iostream>
#include <queue>
int main() {
int n, m;
while (std::cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
std::priority_queue<int> que;
int vegetable;
for (int i = 0; i < n; ++i) {
std::cin >> vegetable;
que.push(vegetable);
}
int price = 0;
for (int i = 0; i < n; ++i) {
if ((i % m) != (m - 1)) {
price += que.top();
que.pop();
}
}
std::cout << price << std::endl;
}
return 0;
}
|
#include <iostream>
#include <queue>
int main() {
int n, m;
while (std::cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
std::priority_queue<int> que;
int vegetable;
for (int i = 0; i < n; ++i) {
std::cin >> vegetable;
que.push(vegetable);
}
int price = 0;
for (int i = 0; i < n; ++i) {
if ((i % m) != (m - 1)) {
price += que.top();
}
que.pop();
}
std::cout << price << std::endl;
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 145
|
#include <iostream>
#include <queue>
int main() {
int m, n;
while (std::cin >> n >> m) {
// n,mがゼロで終了
if ((n = m) == 0) {
break;
}
int sum_cost = 0;
std::priority_queue<int> vegetable;
for (int i = 0; i < n; ++i) {
int cost;
std::cin >> cost;
vegetable.push(cost);
}
for (int i = 1; i <= n; ++i) {
if (i % m) {
sum_cost += vegetable.top();
vegetable.pop();
} else
vegetable.pop();
}
std::cout << sum_cost << std::endl;
}
return 0;
}
|
#include <iostream>
#include <queue>
int main() {
int m, n;
while (std::cin >> n >> m) {
// n,mがゼロで終了
if (n == 0 && m == 0) {
break;
}
int sum_cost = 0;
std::priority_queue<int> vegetable;
for (int i = 0; i < n; ++i) {
int cost;
std::cin >> cost;
vegetable.push(cost);
}
for (int i = 1; i <= n; ++i) {
if (i % m) {
sum_cost += vegetable.top();
vegetable.pop();
} else
vegetable.pop();
}
std::cout << sum_cost << std::endl;
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["-", 15, 339, 51, 16, 31, 23, 0, 42, 0, 32], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25]]
| 1
| 145
|
class ProblemB
def solve
while true
total = 0
n, m = gets.split.map(&:to_i)
return total if n <= 0
pn = gets.split.map(&:to_i).sort {|a, b| b <=> a }
while pn.count > 0
t = []
m.times do |i|
t.push pn.shift
break if pn.count <= 0
end
t.pop if t.count == m
t.each { |price| total += price }
end
total
end
end
end
thanksgiving = ProblemB.new
thanksgiving.solve
|
class ProblemB
def solve
while true
total = 0
n, m = gets.split.map(&:to_i)
break if n <= 0
pn = gets.split.map(&:to_i).sort {|a, b| b <=> a }
while pn.count > 0
t = []
m.times do
t.push pn.shift
break if pn.count <= 0
end
t.pop if t.count == m
t.each { |price| total += price }
end
p total
end
end
end
thanksgiving = ProblemB.new
thanksgiving.solve
|
[["-", 0, 89, 8, 170, 0, 751, 8, 38, 0, 38], ["-", 8, 170, 0, 751, 8, 38, 0, 4, 0, 22], ["+", 0, 89, 8, 170, 0, 751, 8, 94, 0, 94], ["-", 8, 170, 0, 652, 196, 737, 54, 758, 0, 139], ["-", 8, 170, 0, 652, 196, 737, 54, 758, 0, 22], ["+", 8, 736, 0, 89, 8, 170, 0, 652, 735, 22]]
| 4
| 115
|
for i in range(1, 101):
count = 0
temp = 0
SetCount = 0
try:
str1 = input()
list1 = str1.split(" ")
str2 = input()
list2 = str2.split(" ")
list2.sort(reverse=True)
for m in range(0, int(list1[0])):
if (m+1) % int(list1[1]) == 0:
SetCount = SetCount + 1
#elif (m+1) % int(list1[1]) != 0 | SetCount == int(list1[0])//int(list1[1]):
# count = count + int(list2[m])
else:
count = count + int(list2[m])
print(count)
except:
break
|
for i in range(1, 101):
count = 0
temp = 0
SetCount = 0
try:
str1 = input()
list1 = str1.split(" ")
str2 = input()
list2 = str2.split(" ")
list2.sort(key=int, reverse=True)
for m in range(0, int(list1[0])):
if (m+1) % int(list1[1]) == 0:
SetCount = SetCount + 1
#elif (m+1) % int(list1[1]) != 0 | SetCount == int(list1[0])//int(list1[1]):
# count = count + int(list2[m])
else:
count = count + int(list2[m])
print(count)
except:
break
|
[["+", 0, 1, 0, 652, 3, 4, 0, 653, 141, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 653, 0, 32], ["+", 0, 1, 0, 652, 3, 4, 0, 653, 51, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21]]
| 5
| 119
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String[] bit = new String[10];
bit[0] = "0111111";
bit[1] = "0000110";
bit[2] = "1011011";
bit[3] = "1001111";
bit[4] = "1100110";
bit[5] = "1101101";
bit[6] = "1111101";
bit[7] = "0100111";
bit[8] = "1111111";
bit[9] = "1101111";
int n, x;
String[] segment = new String[2];
while (true) {
try {
n = Integer.parseInt(reader.readLine());
if (n == -1)
break;
segment[0] = "0000000";
for (int i = 0; i < n; i++) {
segment[1] = "";
x = Integer.parseInt(reader.readLine());
for (int j = 0; j < 7; j++)
segment[1] += String.valueOf(
Integer.parseInt(String.valueOf(segment[0].charAt(j))) ^
Integer.parseInt(String.valueOf(bit[x].charAt(j))));
System.out.println(segment[1]);
segment[0] = segment[1];
}
} catch (IOException e) {
}
}
try {
reader.close();
} catch (IOException e) {
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String[] bit = new String[10];
bit[0] = "0111111";
bit[1] = "0000110";
bit[2] = "1011011";
bit[3] = "1001111";
bit[4] = "1100110";
bit[5] = "1101101";
bit[6] = "1111101";
bit[7] = "0100111";
bit[8] = "1111111";
bit[9] = "1101111";
int n, x;
String[] segment = new String[2];
while (true) {
try {
n = Integer.parseInt(reader.readLine());
if (n == -1)
break;
segment[0] = "0000000";
for (int i = 0; i < n; i++) {
segment[1] = "";
x = Integer.parseInt(reader.readLine());
for (int j = 0; j < 7; j++)
segment[1] += String.valueOf(
Integer.parseInt(String.valueOf(segment[0].charAt(j))) ^
Integer.parseInt(String.valueOf(bit[x].charAt(j))));
System.out.println(segment[1]);
segment[0] = bit[x];
}
} catch (IOException e) {
}
}
try {
reader.close();
} catch (IOException e) {
}
}
}
|
[["-", 8, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["-", 8, 196, 0, 1, 0, 11, 12, 504, 71, 499], ["+", 8, 196, 0, 1, 0, 11, 12, 504, 71, 22]]
| 3
| 355
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] disp = {"0111111", "0000110", "1011011", "1011111",
"1100110", "1101101", "1111101", "0100111",
"1111111", "1101111", "0000000"};
int[] disp_b = new int[11];
for (int i = 0; i < 11; i++) {
disp_b[i] = Integer.parseInt(disp[i], 2);
}
while (true) {
final int n = sc.nextInt();
if (n == -1) {
break;
}
int cur = 10;
for (int i = 0; i < n; i++) {
int next = sc.nextInt();
String str = Integer.toString(disp_b[cur] ^ disp_b[next], 2);
if (str.length() != 7) {
StringBuilder b = new StringBuilder();
for (int j = 0; j < 7 - str.length(); j++) {
b.append("0");
}
b.append(str);
str = b.toString();
}
System.out.println(str);
cur = next;
}
}
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] disp = {"0111111", "0000110", "1011011", "1001111",
"1100110", "1101101", "1111101", "0100111",
"1111111", "1101111", "0000000"};
int[] disp_b = new int[11];
for (int i = 0; i < 11; i++) {
disp_b[i] = Integer.parseInt(disp[i], 2);
}
while (true) {
final int n = sc.nextInt();
if (n == -1) {
break;
}
int cur = 10;
for (int i = 0; i < n; i++) {
int next = sc.nextInt();
String str = Integer.toString(disp_b[cur] ^ disp_b[next], 2);
if (str.length() != 7) {
StringBuilder b = new StringBuilder();
for (int j = 0; j < 7 - str.length(); j++) {
b.append("0");
}
b.append(str);
str = b.toString();
}
System.out.println(str);
cur = next;
}
}
}
}
|
[["-", 0, 503, 49, 200, 51, 518, 0, 5, 0, 491], ["+", 0, 503, 49, 200, 51, 518, 0, 5, 0, 491]]
| 3
| 286
|
import java.util.*;
public class Main {
public static void main(String[] args) {
String digits[] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
Scanner stdIn = new Scanner(System.in);
while (stdIn.hasNext()) {
int n = stdIn.nextInt();
if (n == -1) {
break;
}
String s = "0000000";
char[] current = s.toCharArray();
for (int i = 0; i < n; ++i) {
int num = stdIn.nextInt();
for (int j = 0; j < current.length; ++j) {
if (digits[num].charAt(j) == current[j]) {
System.out.print("0");
} else {
System.out.print("1");
if (current[j] == '0') {
current[j] = '1';
} else {
current[j] = '0';
}
}
}
}
System.out.println("");
}
}
}
|
import java.util.*;
public class Main {
public static void main(String[] args) {
String digits[] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
Scanner stdIn = new Scanner(System.in);
while (stdIn.hasNext()) {
int n = stdIn.nextInt();
if (n == -1) {
break;
}
String s = "0000000";
char[] current = s.toCharArray();
for (int i = 0; i < n; ++i) {
int num = stdIn.nextInt();
for (int j = 0; j < current.length; ++j) {
if (digits[num].charAt(j) == current[j]) {
System.out.print("0");
} else {
System.out.print("1");
if (current[j] == '0') {
current[j] = '1';
} else {
current[j] = '0';
}
}
}
System.out.println("");
}
}
}
}
|
[["-", 0, 52, 8, 196, 0, 7, 8, 196, 0, 46], ["+", 0, 52, 8, 196, 0, 7, 8, 196, 0, 46]]
| 3
| 255
|
import java.util.Scanner;
public class Main {
final static String zero = "0000000";
public static void main(String[] args) {
int[] num = {077, 06, 0133, 0117, 0146, 0155, 0175, 0147, 0177, 0157};
int n;
Scanner in = new Scanner(System.in);
while ((n = in.nextInt()) != -1) {
int now = 0;
int next;
while (n-- > 0) {
next = num[in.nextInt()];
final String binaryString = Integer.toBinaryString(now ^ next);
System.out.print(zero.substring(binaryString.length()));
System.out.println(binaryString);
now = next;
}
}
}
}
|
import java.util.Scanner;
public class Main {
final static String zero = "0000000";
public static void main(String[] args) {
int[] num = {077, 06, 0133, 0117, 0146, 0155, 0175, 047, 0177, 0157};
int n;
Scanner in = new Scanner(System.in);
while ((n = in.nextInt()) != -1) {
int now = 0;
int next;
while (n-- > 0) {
next = num[in.nextInt()];
final String binaryString = Integer.toBinaryString(now ^ next);
System.out.print(zero.substring(binaryString.length()));
System.out.println(binaryString);
now = next;
}
}
}
}
|
[["-", 8, 196, 0, 503, 49, 200, 51, 518, 0, 524], ["+", 8, 196, 0, 503, 49, 200, 51, 518, 0, 524]]
| 3
| 163
|
#include <stdio.h>
int main() {
char d[][8] = {"0111111", "0000110", "1011011", "1010000", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
int n, m, i;
while (scanf("%d", &n), n + 1) {
char l[8] = {"00000000"};
while (n--) {
scanf("%d", &m);
for (i = 0; i < 7; i++) {
if (l[i] == d[m][i])
printf("0");
else
printf("1");
l[i] = d[m][i];
}
printf("\n");
}
}
return 0;
}
|
#include <stdio.h>
int main() {
char d[][8] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
int n, m, i;
while (scanf("%d", &n), n + 1) {
char l[8] = {"0000000"};
while (n--) {
scanf("%d", &m);
for (i = 0; i < 7; i++) {
if (l[i] == d[m][i])
printf("0");
else
printf("1");
l[i] = d[m][i];
}
printf("\n");
}
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]]
| 0
| 180
|
#include <stdio.h>
int ans[7] = {0, 0, 0, 0, 0, 0, 0};
int num[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 0, 0, 0, 1, 1, 1},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 0, 1, 1, 1, 1}};
int main() {
int I, N;
int i, n;
for (;;) {
scanf("%d", &N);
if (N == -1)
break;
for (i = 0; i < 7; ++i)
ans[i] = 0;
for (I = 0; I < N; ++I) {
scanf("%d", &n);
for (i = 0; i < 7; ++i) {
printf("%d", ans[i] ^ num[n][i]);
ans[i] = num[n][i];
}
printf("\n");
}
}
return 0;
}
|
#include <stdio.h>
int ans[7] = {0, 0, 0, 0, 0, 0, 0};
int num[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 1, 0, 0, 1, 1, 1},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 0, 1, 1, 1, 1}};
int main() {
int I, N;
int i, n;
for (;;) {
scanf("%d", &N);
if (N == -1)
break;
for (i = 0; i < 7; ++i)
ans[i] = 0;
for (I = 0; I < N; ++I) {
scanf("%d", &n);
for (i = 0; i < 7; ++i) {
printf("%d", ans[i] ^ num[n][i]);
ans[i] = num[n][i];
}
printf("\n");
}
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]]
| 0
| 339
|
n, v;
s;
S[] = {0x3f, 0x06, 0x5b, 0x4f, 0x66, 0x6d, 0x7d, 0x27, 0x7f, 0x6f};
main(b, i) {
for (; scanf("%d", &n), ~n;) {
s = 0;
for (; n--;) {
scanf("%d", &v);
b = S[v] ^ s;
if (b) {
for (i = 7; i--;)
putchar('0' + (b >> i) % 2);
puts("");
}
s ^= b;
}
}
exit(0);
}
|
n, v;
s;
S[] = {0x3f, 0x06, 0x5b, 0x4f, 0x66, 0x6d, 0x7d, 0x27, 0x7f, 0x6f};
main(b, i) {
for (; scanf("%d", &n), ~n;) {
s = 0;
for (; n--;) {
scanf("%d", &v);
b = S[v] ^ s;
for (i = 7; i--;)
putchar('0' + (b >> i) % 2);
puts("");
s ^= b;
}
}
exit(0);
}
|
[["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["-", 0, 7, 8, 9, 0, 57, 15, 23, 0, 24], ["-", 0, 7, 8, 9, 0, 57, 15, 23, 0, 22], ["-", 0, 7, 8, 9, 0, 57, 15, 23, 0, 25], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]]
| 0
| 140
|
#include <stdio.h>
int main() {
int i, j, n, num, prev;
char segment[] = "0000000";
char nums[][8] = {"0111111", "0000110", "1011001", "1001111",
"1100110", "1101101", "1111101", "0100111",
"1111111", "1101111", "0000000"};
do {
scanf("%d", &n);
if (n == -1)
break;
for (prev = 10, i = 0; i < n; i++, prev = num) {
scanf("%d", &num);
for (j = 0; j < 7; j++) {
if (nums[prev][j] == nums[num][j]) {
segment[j] = '0';
} else {
segment[j] = '1';
}
}
printf("%s\n", segment);
}
} while (1);
return 0;
}
|
#include <stdio.h>
int main() {
int i, j, n, num, prev;
char segment[] = "0000000";
char nums[][8] = {"0111111", "0000110", "1011011", "1001111",
"1100110", "1101101", "1111101", "0100111",
"1111111", "1101111", "0000000"};
do {
scanf("%d", &n);
if (n == -1)
break;
for (prev = 10, i = 0; i < n; i++, prev = num) {
scanf("%d", &num);
for (j = 0; j < 7; j++) {
if (nums[prev][j] == nums[num][j]) {
segment[j] = '0';
} else {
segment[j] = '1';
}
}
printf("%s\n", segment);
}
} while (1);
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]]
| 0
| 210
|
#include <stdio.h>
#define M 110
int main(void) {
int i;
int n, num[M];
int sign[8], light[8];
for (;;) {
scanf("%d", &n);
if (n == -1)
break;
for (i = 0; i < n; i++)
scanf("%d", &num[i]);
for (i = 0; i < 8; i++)
light[i] = 0;
for (i = 0; i < n; i++) {
if (num[i] == 0) {
printf("%d", sign[0] = (light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 1) {
printf("%d", sign[0] = (light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 2) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 3) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 4) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 5) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 6) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 7) {
printf("%d", sign[0] = (light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 8) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 9) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
}
}
}
return 0;
}
|
#include <stdio.h>
#define M 110
int main(void) {
int i;
int n, num[M];
int sign[8], light[8];
for (;;) {
scanf("%d", &n);
if (n == -1)
break;
for (i = 0; i < n; i++)
scanf("%d", &num[i]);
for (i = 0; i < 8; i++)
light[i] = 0;
for (i = 0; i < n; i++) {
if (num[i] == 0) {
printf("%d", sign[0] = (light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 1) {
printf("%d", sign[0] = (light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 2) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 3) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 4) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 5) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 6) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 7) {
printf("%d", sign[0] = (light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 8) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (!light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
} else if (num[i] == 9) {
printf("%d", sign[0] = (!light[0]) ? 1 : 0);
if (sign[0])
light[0] = !light[0];
printf("%d", sign[1] = (!light[1]) ? 1 : 0);
if (sign[1])
light[1] = !light[1];
printf("%d", sign[2] = (light[2]) ? 1 : 0);
if (sign[2])
light[2] = !light[2];
printf("%d", sign[3] = (!light[3]) ? 1 : 0);
if (sign[3])
light[3] = !light[3];
printf("%d", sign[4] = (!light[4]) ? 1 : 0);
if (sign[4])
light[4] = !light[4];
printf("%d", sign[5] = (!light[5]) ? 1 : 0);
if (sign[5])
light[5] = !light[5];
printf("%d", sign[6] = (!light[6]) ? 1 : 0);
if (sign[6])
light[6] = !light[6];
printf("\n");
}
}
}
return 0;
}
|
[["+", 0, 11, 12, 41, 15, 23, 0, 91, 17, 111]]
| 0
| 3,230
|
#include <stdio.h>
int main(void) {
unsigned int current;
unsigned int need;
int n, i, j, sn;
unsigned int bit[7];
int data[10] = {
0x3f, // 0: 0011 1111
0x06, // 1: 0000 0110
0x5a, // 2: 0101 1011
0x4f, // 3: 0100 1111
0x66, // 4: 0110 0110
0x6d, // 5: 0110 1101
0x7d, // 6: 0111 1101
0x27, // 7: 0010 0111
0x7f, // 8: 0111 1111
0x6f // 9: 0110 1111
};
while (1) {
current = 0;
scanf("%d", &n);
if (n == -1) {
break;
}
for (j = 0; j < n; j++) {
scanf("%d", &sn);
need = current ^ data[sn];
current = data[sn];
for (i = 0; i < 7; i++) {
bit[i] = need % 2;
need /= 2;
}
for (i = 6; i >= 0; i--) {
printf("%d", bit[i]);
}
putchar('\n');
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
unsigned int current;
unsigned int need;
int n, i, j, sn;
unsigned int bit[7];
int data[10] = {
// n: gfe dcba
0x3f, // 0: 011 1111
0x06, // 1: 000 0110
0x5b, // 2: 101 1011
0x4f, // 3: 100 1111
0x66, // 4: 110 0110
0x6d, // 5: 110 1101
0x7d, // 6: 111 1101
0x27, // 7: 010 0111
0x7f, // 8: 111 1111
0x6f // 9: 110 1111
};
while (1) {
current = 0;
scanf("%d", &n);
if (n == -1) {
break;
}
for (j = 0; j < n; j++) {
scanf("%d", &sn);
need = current ^ data[sn];
current = data[sn];
for (i = 0; i < 7; i++) {
bit[i] = need % 2;
need /= 2;
}
for (i = 6; i >= 0; i--) {
printf("%d", bit[i]);
}
putchar('\n');
}
}
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13]]
| 0
| 207
|
#include <stdio.h>
void out(int s) {
int i;
for (i = 6; i >= 0; i--) {
printf("%d", s >> i & 1);
}
printf("\n");
}
int main() {
int p[10] = {077, 06, 0133, 0117, 0146, 0155, 0175, 0147, 0177, 0157};
int n, s, a;
while (scanf("%d", &n) == 1 && n != -1) {
s = 0;
while (n--) {
scanf("%d", &a);
out(s ^ p[a]);
s = p[a];
}
}
}
|
#include <stdio.h>
void out(int s) {
int i;
for (i = 6; i >= 0; i--) {
printf("%d", s >> i & 1);
}
printf("\n");
}
int main() {
int p[10] = {077, 06, 0133, 0117, 0146, 0155, 0175, 047, 0177, 0157};
int n, s, a;
while (scanf("%d", &n) == 1 && n != -1) {
s = 0;
while (n--) {
scanf("%d", &a);
out(s ^ p[a]);
s = p[a];
}
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13]]
| 0
| 147
|
#include <stdio.h>
#include <string.h>
int main(void) {
int len, i, num, j;
char seg[12][9] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1101101", "1111101", "1111111", "1101111"},
dis[9];
while (scanf("%d", &len) != EOF && len != -1) {
strcpy(dis, "0000000");
for (i = 0; i < len; i++) {
scanf("%d", &num);
for (j = 0; j < 7; j++) {
if (dis[j] == seg[num][j]) {
printf("0");
} else {
printf("1");
dis[j] = seg[num][j];
}
}
printf("\n");
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void) {
int len, i, num, j;
char seg[12][9] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"},
dis[9];
while (scanf("%d", &len) != EOF && len != -1) {
strcpy(dis, "0000000");
for (i = 0; i < len; i++) {
scanf("%d", &num);
for (j = 0; j < 7; j++) {
if (dis[j] == seg[num][j]) {
printf("0");
} else {
printf("1");
dis[j] = seg[num][j];
}
}
printf("\n");
}
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]]
| 0
| 202
|
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, num, j = 0;
string sig = "0000000", str;
cin >> n;
if (n == -1)
break;
for (int k = 0; k < n; k++) {
cin >> num;
string ans = "";
if (num == 0)
str = "0111111";
else if (num == 1)
str = "0000110";
else if (num == 2)
str = "1011011";
else if (num == 3)
str = "1001111";
else if (num == 4)
str = "1101101";
else if (num == 5)
str = "1101101";
else if (num == 6)
str = "1111101";
else if (num == 7)
str = "0100111";
else if (num == 8)
str = "1111111";
else
str = "1101111";
for (int i = 0; i < 7; i++) {
if (sig.at(i) != str.at(i))
ans += '1';
else
ans += '0';
}
sig = str;
cout << ans << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, num, j = 0;
string sig = "0000000", str;
cin >> n;
if (n == -1)
break;
for (int k = 0; k < n; k++) {
cin >> num;
string ans = "";
if (num == 0)
str = "0111111";
else if (num == 1)
str = "0000110";
else if (num == 2)
str = "1011011";
else if (num == 3)
str = "1001111";
else if (num == 4)
str = "1100110";
else if (num == 5)
str = "1101101";
else if (num == 6)
str = "1111101";
else if (num == 7)
str = "0100111";
else if (num == 8)
str = "1111111";
else
str = "1101111";
for (int i = 0; i < 7; i++) {
if (sig.at(i) != str.at(i))
ans += '1';
else
ans += '0';
}
sig = str;
cout << ans << endl;
}
}
return 0;
}
|
[["-", 0, 57, 64, 1, 0, 11, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 11, 12, 5, 0, 6]]
| 1
| 255
|
#include <stdio.h>
int main() {
int N, x;
int A[8] = {0, 0, 0, 0, 0, 0, 0};
int n[8] = {0, 0, 0, 0, 0, 0, 0};
int n0[8] = {0, 1, 1, 1, 1, 1, 1};
int n1[8] = {0, 0, 0, 0, 1, 1, 0};
int n2[8] = {1, 0, 1, 1, 0, 1, 1};
int n3[8] = {1, 0, 0, 1, 1, 1, 1};
int n4[8] = {1, 1, 0, 0, 1, 1, 0};
int n5[8] = {1, 1, 0, 1, 1, 0, 1};
int n6[8] = {1, 1, 1, 1, 1, 0, 1};
int n7[8] = {0, 1, 0, 0, 1, 1, 1};
int n8[8] = {1, 1, 1, 1, 1, 1, 1};
int n9[8] = {1, 1, 1, 1, 1, 1, 1};
while (1) {
scanf("%d", &N);
if (N == -1)
break;
for (int i = 0; i < 7; i++)
A[i] = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
switch (x) {
case 0:
for (int i = 0; i < 7; i++)
n[i] = n0[i];
break;
case 1:
for (int i = 0; i < 7; i++)
n[i] = n1[i];
break;
case 2:
for (int i = 0; i < 7; i++)
n[i] = n2[i];
break;
case 3:
for (int i = 0; i < 7; i++)
n[i] = n3[i];
break;
case 4:
for (int i = 0; i < 7; i++)
n[i] = n4[i];
break;
case 5:
for (int i = 0; i < 7; i++)
n[i] = n5[i];
break;
case 6:
for (int i = 0; i < 7; i++)
n[i] = n6[i];
break;
case 7:
for (int i = 0; i < 7; i++)
n[i] = n7[i];
break;
case 8:
for (int i = 0; i < 7; i++)
n[i] = n8[i];
break;
case 9:
for (int i = 0; i < 7; i++)
n[i] = n9[i];
break;
}
for (int i = 0; i < 7; i++) {
if (A[i] != n[i])
printf("1");
else if (A[i] == n[i])
printf("0");
A[i] = n[i];
}
printf("\n");
}
}
return 0;
}
|
#include <stdio.h>
int main() {
int N, x;
int A[8] = {0, 0, 0, 0, 0, 0, 0};
int n[8] = {0, 0, 0, 0, 0, 0, 0};
int n0[8] = {0, 1, 1, 1, 1, 1, 1};
int n1[8] = {0, 0, 0, 0, 1, 1, 0};
int n2[8] = {1, 0, 1, 1, 0, 1, 1};
int n3[8] = {1, 0, 0, 1, 1, 1, 1};
int n4[8] = {1, 1, 0, 0, 1, 1, 0};
int n5[8] = {1, 1, 0, 1, 1, 0, 1};
int n6[8] = {1, 1, 1, 1, 1, 0, 1};
int n7[8] = {0, 1, 0, 0, 1, 1, 1};
int n8[8] = {1, 1, 1, 1, 1, 1, 1};
int n9[8] = {1, 1, 0, 1, 1, 1, 1};
while (1) {
scanf("%d", &N);
if (N == -1)
break;
for (int i = 0; i < 7; i++)
A[i] = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
switch (x) {
case 0:
for (int i = 0; i < 7; i++)
n[i] = n0[i];
break;
case 1:
for (int i = 0; i < 7; i++)
n[i] = n1[i];
break;
case 2:
for (int i = 0; i < 7; i++)
n[i] = n2[i];
break;
case 3:
for (int i = 0; i < 7; i++)
n[i] = n3[i];
break;
case 4:
for (int i = 0; i < 7; i++)
n[i] = n4[i];
break;
case 5:
for (int i = 0; i < 7; i++)
n[i] = n5[i];
break;
case 6:
for (int i = 0; i < 7; i++)
n[i] = n6[i];
break;
case 7:
for (int i = 0; i < 7; i++)
n[i] = n7[i];
break;
case 8:
for (int i = 0; i < 7; i++)
n[i] = n8[i];
break;
case 9:
for (int i = 0; i < 7; i++)
n[i] = n9[i];
break;
}
for (int i = 0; i < 7; i++) {
if (A[i] != n[i])
printf("1");
else if (A[i] == n[i])
printf("0");
A[i] = n[i];
}
printf("\n");
}
}
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13]]
| 1
| 719
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
int main() {
int n;
string num[] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "010011", "111111", "1101111"};
while (cin >> n) {
if (n == -1)
break;
string now = "0000000";
rep(i, n) {
int a;
cin >> a;
rep(i, 7) {
if (now[i] != num[a][i])
cout << "1";
else
cout << "0";
}
cout << endl;
now = num[a];
}
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
int main() {
int n;
string num[] = {
"0111111", // 0
"0000110", // 1
"1011011", // 2
"1001111", // 3
"1100110", // 4
"1101101", // 5
"1111101", // 6
"0100111", // 7
"1111111", // 8
"1101111" // 9
};
while (cin >> n) {
if (n == -1)
break;
string now = "0000000";
rep(i, n) {
int a;
cin >> a;
rep(i, 7) {
if (now[i] != num[a][i])
cout << "1";
else
cout << "0";
}
cout << endl;
now = num[a];
}
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]]
| 1
| 231
|
#include <bits/stdc++.h>
using namespace std;
main() {
unsigned long num[11] = {63, 6, 91, 79, 66, 109, 125, 39, 127, 111, 0};
int n, a, b = 10;
while (cin >> n, n != -1) {
bitset<7> now((unsigned long)0);
b = 10;
for (int i = 0; i < n; i++) {
cin >> a;
now = num[b] ^ num[a];
for (int i = 6; i >= 0; i--) {
cout << now[i];
}
cout << endl;
b = a;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
main() {
unsigned long num[11] = {63, 6, 91, 79, 102, 109, 125, 39, 127, 111, 0};
int n, a, b = 10;
while (cin >> n, n != -1) {
bitset<7> now((unsigned long)0);
b = 10;
for (int i = 0; i < n; i++) {
cin >> a;
now = num[b] ^ num[a];
for (int i = 6; i >= 0; i--) {
cout << now[i];
}
cout << endl;
b = a;
}
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13]]
| 1
| 143
|
#include <stdio.h>
#define MAX 20000
#define MYSCAN scanf
int main(void) {
int n, m;
int i, j;
int nowseg[7];
int seg[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 1},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 1, 0, 0, 1, 1, 1},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 0, 1, 1, 1, 1}};
while (true) {
MYSCAN("%d", &n);
if (n == -1) {
break;
}
for (i = 0; i < 7; i++) {
nowseg[i] = 0;
}
for (i = 0; i < n; i++) {
MYSCAN("%d", &m);
for (j = 0; j < 7; j++) {
if (seg[m][j] == nowseg[j]) {
printf("0");
} else {
printf("1");
}
nowseg[j] = seg[m][j];
}
printf("\n");
}
}
return 0;
}
|
#include <stdio.h>
#define MAX 20000
#define MYSCAN scanf
int main(void) {
int n, m;
int i, j;
int nowseg[7];
int seg[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 1, 0, 0, 1, 1, 1},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 0, 1, 1, 1, 1}};
while (true) {
MYSCAN("%d", &n);
if (n == -1) {
break;
}
for (i = 0; i < 7; i++) {
nowseg[i] = 0;
}
for (i = 0; i < n; i++) {
MYSCAN("%d", &m);
for (j = 0; j < 7; j++) {
if (seg[m][j] == nowseg[j]) {
printf("0");
} else {
printf("1");
}
nowseg[j] = seg[m][j];
}
printf("\n");
}
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]]
| 1
| 347
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main() {
int n;
char num[10][8] = {{"0111111"}, {"0000110"}, {"1011011"}, {"1001111"},
{"1001111"}, {"1101101"}, {"1111101"}, {"1111101"},
{"1111111"}, {"1101111"}};
while (cin >> n, n != -1) {
char display[8] = {"0000000"};
while (n--) {
int inp;
cin >> inp;
rep(i, 7) {
if (display[i] == num[inp][i]) {
cout << '0';
} else {
cout << '1';
}
}
cout << endl;
strcpy(display, num[inp]);
}
}
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main() {
int n;
char num[10][8] = {{"0111111"}, {"0000110"}, {"1011011"}, {"1001111"},
{"1100110"}, {"1101101"}, {"1111101"}, {"0100111"},
{"1111111"}, {"1101111"}};
while (cin >> n, n != -1) {
char display[8] = {"0000000"};
while (n--) {
int inp;
cin >> inp;
rep(i, 7) {
if (display[i] == num[inp][i]) {
cout << '0';
} else {
cout << '1';
}
}
cout << endl;
strcpy(display, num[inp]);
}
}
}
|
[["-", 49, 50, 51, 83, 0, 83, 0, 5, 0, 6], ["+", 49, 50, 51, 83, 0, 83, 0, 5, 0, 6]]
| 1
| 223
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.