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 <iostream>
int main() {
int input;
std::cin >> input;
std::cout << (input * input) << std::endl;
} | #include <iostream>
int main() {
int input;
std::cin >> input;
std::cout << (input * input * input) << std::endl;
} | [["+", 0, 16, 31, 16, 12, 23, 0, 16, 17, 48], ["+", 0, 16, 31, 16, 12, 23, 0, 16, 12, 22]] | 1 | 31 |
#include <stdio.h>
int main() {
int c;
scanf("%d", &c);
printf("%d\n", c * 3);
} | #include <stdio.h>
int main() {
int c;
scanf("%d", &c);
printf("%d\n", c * c * c);
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 33 |
#include <cmath>
#include <cstdio>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", pow(x, 3));
} | #include <cmath>
#include <cstdio>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", int(pow(x, 3)));
} | [["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 40], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 38 |
#include <iostream>
using namespace std;
int main() {
int a;
while (cin >> a) {
int ans = a * a * a;
cout << a << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
while (cin >> a) {
int ans = a * a * a;
cout << ans << endl;
}
return 0;
} | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 41 |
#include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
x = x ^ 3;
printf("%d\n", x);
return 0;
} | #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
x = x * x * x;
printf("%d\n", x);
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 140], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 42 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int x;
cin >> x;
double a = pow(x, 3);
cout << x << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int x;
cin >> x;
int a = pow(x, 3);
cout << a << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 40 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
scanf("%d", &n);
printf("%d\n", pow(n, 3));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
scanf("%d", &n);
printf("%d\n", (int)pow(n, 3));
return 0;
}
| [["+", 0, 1, 0, 2, 3, 4, 0, 74, 0, 24], ["+", 0, 2, 3, 4, 0, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 2, 3, 4, 0, 74, 0, 25]] | 1 | 45 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int integer;
cin >> integer;
integer = integer * integer;
cout << integer << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int integer;
cin >> integer;
integer = integer * integer * integer;
cout << integer << endl;
}
| [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 33 |
#include <iostream>
int main() {
int x;
std::cin >> x;
int answer = x ^ 3;
std::cout << answer << std::endl;
return 0;
}
| #include <iostream>
int main() {
int x;
std::cin >> x;
int answer = x * x * x;
std::cout << answer << std::endl;
return 0;
}
| [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 140], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 48], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 37 |
# -*- coding: utf-8 -*-
a = get.chomp.to_i
b = a * a * a
puts b | # -*- coding: utf-8 -*-
a = gets.chomp.to_i
b = a * a * a
puts b | [["-", 0, 493, 0, 662, 12, 652, 486, 652, 486, 22], ["+", 0, 493, 0, 662, 12, 652, 486, 652, 486, 22]] | 4 | 17 |
#!/usr/local/bin/ruby
x=gets.chomp.to_i
y=x*x*x
STDERR.print("%d\n",y) | #!/usr/local/bin/ruby
x=gets.chomp.to_i
y=x*x*x
printf("%d\n",y) | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 486, 743], ["-", 36, 36, 36, 36, 0, 493, 0, 652, 17, 131], ["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 26 |
x = gets.chomp
puts x * x * x | x = gets.to_i
puts x * x * x | [["-", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 11 |
x = gets
x = x ** 3
puts x | x = gets.to_i
x = x ** 3
puts x | [["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 10 |
A = gets.freeze
puts A * A * A | A = gets.to_i.freeze
puts A * A * A | [["+", 0, 493, 0, 662, 12, 652, 486, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131]] | 4 | 11 |
gets.to_i**3 | puts gets.to_i**3 | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 5 |
x= gets.chomp
y=x*x*x
puts y | x= gets.chomp.to_i
y=x*x*x
puts y | [["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 14 |
a = gets
p a.chomp.to_i*3 | a = gets
p a.chomp.to_i**3 | [["-", 0, 493, 0, 652, 3, 4, 0, 738, 17, 48], ["+", 0, 493, 0, 652, 3, 4, 0, 738, 17, 578]] | 4 | 11 |
x = gets.to_i
y = x ** 2
puts y | x = gets.to_i
y = x ** 3
puts y | [["-", 36, 36, 0, 493, 0, 662, 12, 738, 12, 612], ["+", 36, 36, 0, 493, 0, 662, 12, 738, 12, 612]] | 4 | 12 |
x = gets.to_i
y = x ** 2
puts y | x = gets.to_i
y = x **3
puts y | [["-", 36, 36, 0, 493, 0, 662, 12, 738, 12, 612], ["+", 0, 662, 12, 652, 3, 4, 0, 779, 0, 612]] | 4 | 12 |
#include <iostream>
using namespace std;
int main(void) {
int x;
cin >> x;
cout << x * x << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int x;
cin >> x;
cout << x * x * x << endl;
return 0;
}
| [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 48], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 22]] | 1 | 31 |
#include <iostream>
int main(int argc, const char *argv[]) {
int x;
std::cin >> x;
std::cout << x * x << std::endl;
return 0;
}
| #include <iostream>
int main(int argc, const char *argv[]) {
int x;
std::cin >> x;
std::cout << x * x * x << std::endl;
return 0;
}
| [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 48], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 22]] | 1 | 41 |
#include <iostream>
int main() {
int x;
std::cin >> x;
std::cout << x * 3 << std::endl;
return 0;
}
| #include <iostream>
int main() {
int x;
std::cin >> x;
std::cout << x * x * x << std::endl;
return 0;
}
| [["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 48], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 22]] | 1 | 32 |
#include <stdio.h>
int main() {
int x = 0;
scanf("%d", x);
if (x > 0 && x < 100) {
printf("%d\n", x * x * x);
} else {
}
return 0;
}
| #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
if (x >= 1 && x <= 100) {
printf("%d\n", x * x * x);
} else {
}
return 0;
}
| [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19... | 1 | 54 |
#include <stdio.h>
int main() {
int x = 0;
scanf("%d", x);
if (x > 0 && x < 100) {
printf("%d\n", x * x * x);
} else {
}
return 0;
}
| #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
if (x > 0 && x < 101) {
printf("%d\n", x * x * x);
} else {
}
return 0;
}
| [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 54 |
#include <iostream>
using namespace std;
int main() {
int x;
x = x * x * x;
cout << x << endl;
} | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
x = x * x * x;
cout << x << endl;
} | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 29 |
input = gets
data = input * input * input
puts data | input = gets.to_i
data = input * input * input
puts data | [["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 12 |
nput = gets.to_i
puts(input**3) | input = gets.to_i
puts(input**3) | [["-", 36, 36, 36, 36, 0, 493, 0, 662, 31, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 31, 22]] | 4 | 11 |
input = gets.to_i
puts "input" ** 3
| input = gets.to_i
puts input ** 3
| [["-", 0, 652, 3, 4, 0, 738, 31, 557, 0, 62]] | 4 | 11 |
x = STDIN.gets()
puts x * x * x | x = STDIN.gets().to_i
puts x * x * x | [["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 13 |
import sys
def main():
x = int(sys.stdin.readline())
print(x**2)
return
if __name__ == '__main__':
main()
| import sys
def main():
x = int(sys.stdin.readline())
print(x**3)
return
if __name__ == '__main__':
main()
| [["-", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 36 |
a = int(input())
print(a**2)
| a = int(input())
print(a**3)
| [["-", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 14 |
x = int(input())
if 1 <= x <= 100:
print(x ** 2)
| x = int(input())
if 1 <= x <= 100:
print(x ** 3)
| [["-", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 21 |
x = int(input())
print(**3)
| x = int(input())
print(x**3)
| [["+", 0, 1, 0, 652, 3, 4, 0, 657, 31, 22]] | 5 | 13 |
s=input()
x=int(s)*int(s)*int(s)
print('x=',x)
| s=input()
x=int(s)*int(s)*int(s)
print(x)
| [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21]] | 5 | 29 |
x = input() #文字列を読み込む
n = (int(x)**3)
print("n =" ,n)
| x = input() #文字列を読み込む
n = (int(x)**3)
print(n)
| [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21]] | 5 | 24 |
x = int(input())
print("x^3 = %d" % (x*x*x))
| x = int(input())
print("%d" %(x*x*x))
| [["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6]] | 5 | 22 |
num = int(input())
print("{1}".format(num**3))
| num = int(input())
print("{0}".format(num**3))
| [["-", 3, 4, 0, 652, 63, 319, 500, 557, 0, 6], ["+", 3, 4, 0, 652, 63, 319, 500, 557, 0, 6]] | 5 | 21 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, l;
int a[1000005];
set<int> s;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> l;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < l; ++i)
s.insert(a[i]);
cout << *s.begin();
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, l;
int a[1000005];
multiset<int> s;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> l;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < l; ++i)
s.insert(a[i]);
cout << *s.begin();
... | [["-", 36, 36, 0, 30, 0, 43, 39, 344, 141, 78], ["+", 36, 36, 0, 30, 0, 43, 39, 344, 141, 78], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 172 |
#include <algorithm>
#include <array>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define SENTINEL 1... | #include <algorithm>
#include <array>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define SENTINEL 1... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 24], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 31, 22], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 25]] | 1 | 352 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int a[1000001];
int main() {
int n, l;
cin >> n >> l;
rep(i, n) cin >> a[i];
deque<int> deq;
rep(i, n) {... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int a[1000001];
int main() {
int n, l;
cin >> n >> l;
rep(i, n) cin >> a[i];
deque<int> deq;
rep(i, n) {... | [["-", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72]] | 1 | 192 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
deque<int> deq;
for (int i = 0; i < N; ++i) {
while (!deq.empty() && a[deq.front()] >= a... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
deque<int> deq;
for (int i = 0; i < N; ++i) {
while (!deq.empty() && a[deq.back()] >= a[... | [["-", 31, 69, 341, 342, 0, 2, 63, 118, 119, 120], ["+", 31, 69, 341, 342, 0, 2, 63, 118, 119, 120], ["-", 0, 52, 8, 1, 0, 2, 63, 118, 119, 120], ["+", 0, 52, 8, 1, 0, 2, 63, 118, 119, 120]] | 1 | 193 |
#include <queue>
#include <stdio.h>
#include <utility>
using namespace std;
int main() {
int N, L, atmp;
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
pq;
scanf("%d%d", &N, &L);
for (int i = 0; i < L; i++) {
scanf("%d", &atmp);
pq.push(make_pair(a... | #include <queue>
#include <stdio.h>
#include <utility>
using namespace std;
int main() {
int N, L, atmp;
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
pq;
scanf("%d%d", &N, &L);
for (int i = 0; i < L; i++) {
scanf("%d", &atmp);
pq.push(make_pair(a... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 193 |
package main
import (
"bufio"
"fmt"
"math/rand"
"os"
"strconv"
)
var MIN int = 0
var sc = bufio.NewScanner(os.Stdin)
var writer *bufio.Writer = bufio.NewWriter(os.Stdout)
func printf(f string, a ...interface{}) { fmt.Fprintf(writer, f, a...) }
type Node struct {
key, pri int
left, rigth *Node
}
func ne... | package main
import (
"bufio"
"fmt"
"math/rand"
"os"
"strconv"
)
var MIN int = 0
var sc = bufio.NewScanner(os.Stdin)
var writer *bufio.Writer = bufio.NewWriter(os.Stdout)
func printf(f string, a ...interface{}) { fmt.Fprintf(writer, f, a...) }
type Node struct {
key, pri int
left, rigth *Node
}
func ne... | [["+", 0, 434, 0, 435, 8, 196, 0, 449, 0, 450], ["+", 8, 196, 0, 449, 0, 2, 63, 438, 439, 22], ["+", 8, 196, 0, 449, 0, 2, 63, 438, 0, 131], ["+", 8, 196, 0, 449, 0, 2, 63, 438, 119, 120], ["+", 8, 196, 0, 449, 0, 2, 3, 4, 0, 24], ["+", 8, 196, 0, 449, 0, 2, 3, 4, 0, 25], ["+", 36, 36, 0, 434, 0, 435, 8, 196, 0, 165]] | 7 | 886 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> Wx, Wy, Vx, Vy;
long long X1[2100], Y1[2100], X2[2100], Y2[2100], n, dp[4100][4100], sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i];
Wx.push_back(X1[i]);
W... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> Wx, Wy, Vx, Vy;
long long X1[2100], Y1[2100], X2[2100], Y2[2100], n, dp[4100][4100], sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i];
Wx.push_back(X1[i]);
W... | [["-", 0, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 23, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 12, 23, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 606 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static final int BIG_NUM = 2000000000;
public static final int MOD = 1000000007;
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(Sys... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static final int BIG_NUM = 2000000000;
public static final int MOD = 1000000007;
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(Sys... | [["+", 8, 196, 0, 503, 49, 200, 51, 504, 516, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 504, 0, 70], ["+", 8, 196, 0, 503, 49, 200, 51, 504, 0, 73]] | 3 | 307 |
// AOJ DSL_5_A The Maximum Number of Customers
// 2018.5.5 bal4u
#include <stdio.h>
#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in() {
int n = 0, c = gc();
do
n = 10 * n + (c & 0xf), c = gc();
while (c >= '0');
return n;
}
int s[100002];
// imos法で解く
int main() {
int N... | // AOJ DSL_5_A The Maximum Number of Customers
// 2018.5.5 bal4u
#include <stdio.h>
#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in() {
int n = 0, c = gc();
do
n = 10 * n + (c & 0xf), c = gc();
while (c >= '0');
return n;
}
int s[100002];
// imos法で解く
int main() {
int N... | [["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 0, 73]] | 0 | 192 |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 528 |
#include <bits/stdc++.h>
using namespace std;
int n, t, ans;
int a[100005];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> t;
while (n--) {
int l, r;
cin >> l >> r;
++a[l], --a[r + 1];
}
for (int i = 1; i <= t; i++)
a[i] += a[i - 1];
for (int i = 0; i <= t;... | #include <bits/stdc++.h>
using namespace std;
int n, t, ans;
int a[100005];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> t;
while (n--) {
int l, r;
cin >> l >> r;
++a[l], --a[r];
}
for (int i = 1; i <= t; i++)
a[i] += a[i - 1];
for (int i = 0; i <= t; i++... | [["-", 12, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 12, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 144 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [["+", 0, 42, 0, 356, 0, 42, 0, 69, 28, 22], ["+", 0, 356, 0, 42, 0, 69, 341, 342, 0, 70], ["+", 0, 356, 0, 42, 0, 69, 341, 342, 0, 73]] | 1 | 259 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int N, T;
vector<P> t;
int main() {
cin >> N >> T;
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
t.push_back(P(l, -1));
t.push_back(P(r, 1));
}
sort(t.begin(), t.end());
int sum = 0;
int ans = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int N, T;
vector<P> t;
int main() {
cin >> N >> T;
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
t.push_back(P(l, 1));
t.push_back(P(r, -1));
}
sort(t.begin(), t.end());
int sum = 0;
int ans = 0;
for (int i ... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 159 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define first first
#define second se
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define first first
#define second se
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;... | [["+", 8, 9, 0, 43, 49, 50, 51, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 70], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 73]] | 1 | 170 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t;
int num[100005] = {};
cin >> n >> t;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
num[a]++;
num[b + 1]--;
}
int ma = num[0];
for (int i = 1; i <= n; i++) {
num[i] += num[i - 1];
ma = max(num... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t;
int num[100005] = {};
cin >> n >> t;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
num[a]++;
num[b]--;
}
int ma = num[0];
for (int i = 1; i <= t; i++) {
num[i] += num[i - 1];
ma = max(num[i],... | [["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 132 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 22], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 31, 22], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 283 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r), end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r), end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 368 |
#include <bits/stdc++.h>
#define N 100010
using namespace std;
int A[N];
int main() {
int n, T;
cin >> n >> T;
for (int i = 0, s, t; i < n; i++) {
cin >> s >> t;
A[s]++;
A[t]--;
}
for (int i = 1; i < n; i++)
A[i] += A[i - 1];
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, ... | #include <bits/stdc++.h>
#define N 100010
using namespace std;
int A[N];
int main() {
int n, T;
cin >> n >> T;
for (int i = 0, s, t; i < n; i++) {
cin >> s >> t;
A[s]++;
A[t]--;
}
for (int i = 1; i < N; i++)
A[i] += A[i - 1];
int ans = 0;
for (int i = 0; i < N; i++)
ans = max(ans, A... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 136 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
struct Event {
int x;
int type; // 0 start, 1 end
int v;
Event(int x, int type, int v) : x(x), type(type), v(v) {}
};
bool cmp(const Event &a, const Event &b) {
return a.x < b.x || (a.x == b.x && a.type > b.typ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
struct Event {
int x;
int type; // 0 start, 1 end
int v;
Event(int x, int type, int v) : x(x), type(type), v(v) {}
};
bool cmp(const Event &a, const Event &b) {
return a.x < b.x || (a.x == b.x && a.type > b.typ... | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 246 |
s = raw_input()
n = int(s)
print(n ** 3)
| s = input()
n = int(s)
print(n ** 3)
| [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22]] | 5 | 17 |
import sys
input_number = int(raw_input())
if __name__ == '__main__':
print(str(input_number ** 3))
| import sys
input_number = int(input())
if __name__ == '__main__':
print(str(input_number ** 3))
| [["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22]] | 5 | 26 |
x = input('>> ')
x = int(x)
ans = int(pow(x,3))
print(ans)
| x = input('')
x = int(x)
ans = int(pow(x,3))
print(ans)
| [["-", 0, 662, 12, 652, 3, 4, 0, 557, 0, 6]] | 5 | 29 |
#16D8101012J 伊藤惇 dj Python3
def X_Cubic():
x=int(input("input_x:"))
print("{}".format(x**3))
if __name__ == '__main__':
X_Cubic()
| #16D8101012J 伊藤惇 dj Python3
def X_Cubic():
x=int(input())
print("{}".format(x**3))
if __name__ == '__main__':
X_Cubic()
| [["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 655]] | 5 | 40 |
#16D8101012J 伊藤惇 dj Python3
def X_Cubic():
x=int(input("input_x:"))
print("{}".format(x**3))
if __name__ == '__main__':
X_Cubic()
| def X_Cubic():
x=int(input())
print("{}".format(x**3))
if __name__ == '__main__':
X_Cubic()
| [["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 655]] | 5 | 40 |
int(input())
print(x * x * x)
| x =int(input())
print(x * x * x)
| [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32]] | 5 | 14 |
a = int(raw_input())
print(pow(a, 3))
| a = int(input())
print(pow(a,3))
| [["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22]] | 5 | 17 |
print(int(raw_imput()) ** 3) | print(int(input()) ** 3) | [["-", 0, 657, 31, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 657, 31, 652, 3, 4, 0, 652, 63, 22]] | 5 | 11 |
x=eval(input());
y=x*x*x ;
print(y) ;
return 0; | x=eval(input());
y=x*x*x ;
print(y) ; | [["-", 36, 36, 36, 36, 0, 656, 0, 37, 0, 38], ["-", 36, 36, 36, 36, 0, 656, 0, 37, 0, 612], ["-", 36, 36, 36, 36, 36, 36, 0, 656, 0, 35]] | 5 | 25 |
print(pow(int(raw_input()),3)) | print(pow(int(input()),3)) | [["-", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22]] | 5 | 14 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int b = scan.nextInt();
System.out.println(a * b);
System.out.print(" ");
System.out.print((a * 2) + (b * 2));
}
}
| import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int b = scan.nextInt();
System.out.print(a * b);
System.out.print(" ");
System.out.println((a * 2) + (b * 2));
}
}
| [["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 93 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int b = scan.nextInt();
System.out.print(a * b);
System.out.print("");
System.out.print((a + b) * 2);
}
}
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int b = scan.nextInt();
System.out.print(a * b);
System.out.print(" ");
System.out.println((a + b) * 2);
}
}
| [["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 89 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
System.out.println(h * w + " " + 2 * h + 2 * w);
}
}
| import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
System.out.println(h * w + " " + 2 * (h + w));
}
}
| [["+", 3, 4, 0, 16, 12, 16, 12, 23, 0, 24], ["-", 0, 492, 3, 4, 0, 16, 12, 16, 31, 499], ["-", 0, 492, 3, 4, 0, 16, 12, 16, 17, 48], ["+", 3, 4, 0, 16, 12, 16, 12, 23, 0, 25]] | 3 | 75 |
import java.math.*;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int x = in.nextInt();
int y = in.nextInt();
System.out.println(x * y + " " + 2 * (x * y));
}
} | import java.math.*;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int x = in.nextInt();
int y = in.nextInt();
System.out.println(x * y + " " + 2 * (x + y));
}
} | [["-", 0, 16, 12, 16, 12, 23, 0, 16, 17, 48], ["+", 0, 16, 12, 16, 12, 23, 0, 16, 17, 72]] | 3 | 82 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(Sys... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(Sys... | [["+", 0, 16, 31, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 16, 31, 16, 31, 16, 12, 23, 0, 25], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 25]] | 3 | 175 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
int b = in.nextInt();
System.out.println(a * b + " " + a * 2 + b * 2);
}
} | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
int b = in.nextInt();
System.out.println((a * b) + " " + (a * 2 + b * 2));
}
} | [["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 25], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 25]] | 3 | 78 |
function main(standardInput) {
var lenghtList = standardInput.split(' ');
var varticalLength = parseInt(lenghtList[0]);
var horizonLength = parseInt(lengshtList[1]);
console.log(varticalLength * horizonLength + ' ' +
2 * (varticalLength + horizonLength));
}
main(require('fs').readFileSync('/dev/... | function main(standardInput) {
var lenghtList = standardInput.split(' ');
var varticalLength = parseInt(lenghtList[0]);
var horizonLength = parseInt(lenghtList[1]);
console.log(varticalLength * horizonLength + ' ' +
2 * (varticalLength + horizonLength));
}
main(require('fs').readFileSync('/dev/s... | [["-", 0, 200, 51, 2, 3, 3, 0, 69, 500, 22], ["+", 0, 200, 51, 2, 3, 3, 0, 69, 500, 22]] | 2 | 83 |
let main =
(standardInput) => {
let lenghtList = standardInput.split(' ');
let varticalLength = Number.parseInt(lenghtList[0]);
let horizonLength = Number.parseInt(lengshtList[1]);
console.log(varticalLength * horizonLength + ' ' +
2 * (varticalLength + horizonLength));
... | let main =
(standardInput) => {
let lenghtList = standardInput.split(' ');
let varticalLength = Number.parseInt(lenghtList[0]);
let horizonLength = Number.parseInt(lenghtList[1]);
console.log(varticalLength * horizonLength + ' ' +
2 * (varticalLength + horizonLength));
... | [["-", 0, 200, 51, 2, 3, 3, 0, 69, 500, 22], ["+", 0, 200, 51, 2, 3, 3, 0, 69, 500, 22], ["-", 3, 3, 0, 2, 3, 3, 0, 557, 0, 491], ["+", 3, 3, 0, 2, 3, 3, 0, 557, 0, 491]] | 2 | 89 |
'use strict';
process.stdin.on('data', function(chunk) {
var lines = chunk.toString().split('\n');
var params = lines.split(' ').map(Number);
var result = (function(m, n) {
return [ m * n, 2 * (m + n) ].join(' ');
}(params[0], params[1]));
console.log(result);
});
process.stdin.resume();
process.stdin.s... | 'use strict';
process.stdin.on('data', function(chunk) {
var lines = chunk.toString().split('\n');
var params = lines[0].split(' ').map(Number);
var result = (function(m, n) {
return [ m * n, 2 * (m + n) ].join(' ');
}(params[0], params[1]));
console.log(result);
});
process.stdin.resume();
process.stdi... | [["+", 63, 558, 500, 2, 63, 558, 500, 69, 0, 70], ["+", 63, 558, 500, 2, 63, 558, 500, 69, 71, 555], ["+", 63, 558, 500, 2, 63, 558, 500, 69, 0, 73]] | 2 | 128 |
'use strict';
var Main = function(stdin) {
var line = stdin.split('\n');
var param = line.split(' ').map(Number);
var result = (function(height, width) {
return [ height * width, (height + width) * 2 ].join(' ');
}(param[0], param[1]));
console.log(result);
};
Main(require('fs').readFileSync('/dev/stdin'... | 'use strict';
var Main = function(stdin) {
var line = stdin.split('\n');
var param = line[0].split(' ').map(Number);
var result = (function(height, width) {
return [ height * width, (height + width) * 2 ].join(' ');
}(param[0], param[1]));
console.log(result);
};
Main(require('fs').readFileSync('/dev/std... | [["+", 63, 558, 500, 2, 63, 558, 500, 69, 0, 70], ["+", 63, 558, 500, 2, 63, 558, 500, 69, 71, 555], ["+", 63, 558, 500, 2, 63, 558, 500, 69, 0, 73]] | 2 | 118 |
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var lines = chunk.toString().split('\n');
var x = lines;
var men = x[0] * x[1];
var syu = x[0] * 2 + x[1] * 2;
console.log(men + " " + syu);
}); | process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var lines = chunk.toString().split(' ');
var x = lines;
var men = x[0] * x[1];
var syu = x[0] * 2 + x[1] * 2;
console.log(men + " " + syu);
}); | [["-", 0, 200, 51, 2, 3, 3, 0, 557, 0, 44], ["+", 0, 200, 51, 2, 3, 3, 0, 557, 0, 491]] | 2 | 101 |
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var input = parseInt(chunk.trim(), 10);
var kazu = input.split(" ");
var men = kazu[0] * kazu[1];
var syu = kazu[0] * 2 + kazu[1] * 2;
console.log(men + " " + syu);
}); | process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var input = chunk.toString();
var kazu = input.split(" ");
var men = kazu[0] * kazu[1];
var syu = kazu[0] * 2 + kazu[1] * 2;
console.log(men + " " + syu);
}); | [["-", 8, 556, 0, 198, 0, 200, 51, 2, 63, 22], ["-", 0, 198, 0, 200, 51, 2, 3, 3, 0, 24], ["-", 51, 2, 3, 3, 0, 2, 63, 558, 559, 560], ["+", 0, 198, 0, 200, 51, 2, 63, 558, 559, 560], ["-", 51, 2, 3, 3, 0, 2, 3, 3, 0, 25], ["-", 0, 198, 0, 200, 51, 2, 3, 3, 0, 21], ["-", 0, 198, 0, 200, 51, 2, 3, 3, 0, 555]] | 2 | 106 |
'use strict';
(function(stdin) {
var inputs = stdin.toString();
var params = inputs.split('\n')[0].split(' ').map(Number);
(function(a, b) {
console.log((a * b));
console.log((a + b) * 2);
}(params[0], params[1]));
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | 'use strict';
(function(stdin) {
var inputs = stdin.toString();
var params = inputs.split('\n')[0].split(' ').map(Number);
(function(a, b) { console.log((a * b), (a + b) * 2); }(params[0], params[1]));
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | [["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 25], ["-", 0, 2, 63, 63, 8, 556, 0, 1, 0, 35], ["-", 8, 556, 0, 1, 0, 2, 63, 558, 500, 22], ["-", 8, 556, 0, 1, 0, 2, 63, 558, 0, 131], ["-", 8, 556, 0, 1, 0, 2, 63, 558, 559, 560], ["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 24], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 21]] | 2 | 114 |
'use strict';
(function(stdin) {
var inputs = stdin.toString();
var params = inputs.split('\n')[0].split(' ').map(Number);
(function(a, b) {
//????????????????????????
console.log(a * b);
console.log(a + b) * 2;
}(params[0], params[1]));
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | 'use strict';
(function(stdin) {
var inputs = stdin.toString();
var params = inputs.split('\n')[0].split(' ').map(Number);
(function(a, b) {
//????????????????????????
console.log(a * b, (a + b) * 2);
}(params[0], params[1]));
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | [["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 25], ["-", 0, 2, 63, 63, 8, 556, 0, 1, 0, 35], ["-", 0, 1, 0, 16, 31, 2, 63, 558, 500, 22], ["-", 0, 1, 0, 16, 31, 2, 63, 558, 0, 131], ["-", 0, 1, 0, 16, 31, 2, 63, 558, 559, 560], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 21], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 25]] | 2 | 111 |
'use strict'(function(stdin) {
var inputs = stdin.toString();
var flines = inputs.split('\n')[0].split(' ').map(Number);
var a = flines[0];
var b = flines[1];
var area = a * b;
var pepriphery = 2 * (a + b);
console.log(area.periphery);
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | 'use strict';
(function(stdin) {
var inputs = stdin.toString();
var flines = inputs.split('\n')[0].split(' ').map(Number);
var a = flines[0];
var b = flines[1];
var area = a * b;
var periphery = 2 * (a + b);
console.log(area, periphery);
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | [["+", 36, 36, 36, 36, 0, 493, 0, 1, 0, 35], ["-", 63, 63, 8, 556, 0, 198, 0, 200, 141, 22], ["+", 63, 63, 8, 556, 0, 198, 0, 200, 141, 22], ["-", 0, 1, 0, 2, 3, 3, 0, 558, 0, 131], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 21]] | 2 | 110 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8')
var arr = input.split('').map(Number)
console.log(arr[0] * arr[1], (arr[0] + arr[1]) * 2) | var input = require('fs').readFileSync('/dev/stdin', 'utf8')
var arr = input.split(' ').map(Number)
console.log(arr[0] * arr[1], (arr[0] + arr[1]) * 2) | [["+", 63, 558, 500, 2, 3, 3, 0, 557, 0, 491]] | 2 | 63 |
process.stdin.on('data', function(chunk) {
var inputs = chunk.toString().trim().split('');
var a = Number(inputs[0]);
var b = Number(inputs[1]);
// ????????????????????????
console.log(a * b, (a + b) * 2);
});
process.stdin.resume();
process.stdin.setEncoding('utf8'); | process.stdin.on('data', function(chunk) {
var inputs = chunk.toString().trim().split(' ');
var a = Number(inputs[0]);
var b = Number(inputs[1]);
// ????????????????????????
console.log(a * b, (a + b) * 2);
});
process.stdin.resume();
process.stdin.setEncoding('utf8'); | [["+", 0, 200, 51, 2, 3, 3, 0, 557, 0, 491]] | 2 | 96 |
'use strict';
process.stdin.on('data', function(chunk) {
var inputs = chunk.toString().trim().split('');
var a = Number(inputs[0]);
var b = Number(inputs[1]);
console.log(a * b, (a + b) * 2);
});
process.stdin.resume();
process.stdin.setEncoding('utf8'); | 'use strict';
process.stdin.on('data', function(chunk) {
var inputs = chunk.toString().trim().split(' ');
var a = Number(inputs[0]);
var b = Number(inputs[1]);
console.log(a * b, (a + b) * 2);
});
process.stdin.resume();
process.stdin.setEncoding('utf8'); | [["+", 0, 200, 51, 2, 3, 3, 0, 557, 0, 491]] | 2 | 99 |
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var line = chunk.split(' ');
var a = paeseInt(line[0], 10);
var b = paeseInt(line[1], 10);
var manseki = a * b;
var nagasa = 2 * a + 2 * b;
console.log(menseki + ' ' + nagasa);
}); | process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var line = chunk.split(' ');
var a = parseInt(line[0], 10);
var b = parseInt(line[1], 10);
var menseki = a * b;
var nagasa = 2 * a + 2 * b;
console.log(menseki + ' ' + nagasa);
}); | [["-", 8, 556, 0, 198, 0, 200, 51, 2, 63, 22], ["+", 8, 556, 0, 198, 0, 200, 51, 2, 63, 22], ["-", 0, 63, 8, 556, 0, 198, 0, 200, 141, 22], ["+", 0, 63, 8, 556, 0, 198, 0, 200, 141, 22]] | 2 | 106 |
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var line = chunk.toString().split(' ');
var a = Number(line[0]);
var b = Number(line[0]);
var menseli = a * b;
var nagasa = a * 2 + b * 2;
console.log(menseli + ' ' + nagasa);
}); | process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var line = chunk.toString().split(' ');
var a = Number(line[0]);
var b = Number(line[1]);
var menseli = a * b;
var nagasa = a * 2 + b * 2;
console.log(menseli + ' ' + nagasa);
}); | [["-", 0, 200, 51, 2, 3, 3, 0, 69, 71, 555], ["+", 0, 200, 51, 2, 3, 3, 0, 69, 71, 555]] | 2 | 106 |
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var inputs = chunk.trim().split(" ");
var result1 = (parseInt(inputs[0]) + parseInt(inputs[1])) * 2;
var result2 = parseInt(inputs[0]) * parseInt(inputs[1]);
console.log(result1, result2);
}); | process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var inputs = chunk.trim().split(" ");
var result1 = (parseInt(inputs[0]) + parseInt(inputs[1])) * 2;
var result2 = parseInt(inputs[0]) * parseInt(inputs[1]);
console.log(result2, result1);
}); | [["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 22], ["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 21], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 21], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 22]] | 2 | 104 |
var stdin = require('fs').readFileSync('/dev/stdin', 'utf8');
var input = stdin.toString().trim().split(' ');
var a = parseInt(input[0], 10);
var b = parseInt(input[1], 10);
console.log(a * b);
console.log((a + b) * 2); | var stdin = require('fs').readFileSync('/dev/stdin', 'utf8');
var input = stdin.toString().trim().split(' ');
var a = parseInt(input[0], 10);
var b = parseInt(input[1], 10);
console.log(a * b, (a + b) * 2); | [["-", 0, 493, 0, 1, 0, 2, 3, 3, 0, 25], ["-", 36, 36, 36, 36, 0, 493, 0, 1, 0, 35], ["-", 0, 493, 0, 1, 0, 2, 63, 558, 500, 22], ["-", 0, 493, 0, 1, 0, 2, 63, 558, 0, 131], ["-", 0, 493, 0, 1, 0, 2, 63, 558, 559, 560], ["-", 0, 493, 0, 1, 0, 2, 3, 3, 0, 24], ["+", 0, 493, 0, 1, 0, 2, 3, 3, 0, 21]] | 2 | 89 |
'use strict';
(function(stdin) {
var inputs = stdin.toString().tim().split('\n');
var params = inputs[0].split(' ').map(Number);
(function(a, b) {
// ????????????????????????
console.log(a * b, (a + b) * 2);
})(params[0], params[1]);
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | 'use strict';
(function(stdin) {
var inputs = stdin.toString().trim().split('\n');
var params = inputs[0].split(' ').map(Number);
(function(a, b) {
// ????????????????????????
console.log(a * b, (a + b) * 2);
})(params[0], params[1]);
}(require('fs').readFileSync('/dev/stdin', 'utf8'))); | [["-", 51, 2, 63, 558, 500, 2, 63, 558, 559, 560], ["+", 51, 2, 63, 558, 500, 2, 63, 558, 559, 560]] | 2 | 112 |
//??????????????¨?????????
process.stdin.resume();
process.stdin.on('data', function(chunk) {
const chunks = chunk.split(' ');
var hight = parseInt(chunks[0]);
var width = parseInt(chunks[1]);
var areaOfRectanglar = hight * width;
var lengthOfRectanglar = (hight + width) * 2;
console.log(areaOfRectanglar, ... |
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
const chunks = chunk.split(' ');
var hight = parseInt(chunks[0]);
var width = parseInt(chunks[1]);
var areaOfRectanglar = hight * width;
var lengthOfRectanglar = (hight + width) * 2;
console.log(areaOfRectanglar, lengthOfRectan... | [["-", 0, 493, 0, 1, 0, 2, 63, 558, 559, 560], ["+", 0, 493, 0, 1, 0, 2, 63, 558, 559, 560], ["+", 0, 1, 0, 2, 3, 3, 0, 557, 0, 104], ["+", 0, 1, 0, 2, 3, 3, 0, 557, 0, 491]] | 2 | 87 |
<?php
fscanf(STDIN, "%d %d", $a, $b);
$area = getArea($a, $b);
$circum = getCircum($a, $b);
sprintf("%d %d", $area, $circum);
function getArea($length, $breadth)
{
return $length * $breadth;
}
function getCircum($length, $breadth)
{
return ($length + $breadth) * 2;
} | <?php
fscanf(STDIN, "%d %d", $a, $b);
$area = getArea($a, $b);
$circum = getCircum($a, $b);
echo sprintf("%d %d", $area, $circum), PHP_EOL;
function getArea($length, $breadth)
{
return $length * $breadth;
}
function getCircum($length, $breadth)
{
return ($length + $breadth) * 2;
} | [["+", 36, 36, 36, 36, 0, 493, 0, 608, 0, 621], ["+", 36, 36, 0, 493, 0, 608, 0, 563, 0, 21], ["+", 36, 36, 0, 493, 0, 608, 0, 563, 0, 141]] | 6 | 93 |
<?php
fscanf( STDIN, "%d%d", $a, $b );
echo $a*$b, ($a+$b)*2;
?> | <?php
fscanf( STDIN, "%d%d", $a, $b );
echo $a*$b, " ", ($a+$b)*2;
?> | [["+", 0, 608, 0, 563, 0, 563, 0, 609, 0, 62], ["+", 0, 608, 0, 563, 0, 563, 0, 609, 0, 610], ["+", 0, 493, 0, 608, 0, 563, 0, 563, 0, 21]] | 6 | 34 |
<?php
$stdin = explode(" ",fgets(STDIN));
$area = stdin[0] * stdin[1];
$length = 2 * (stdin[0] + stdin[1]);
echo($area ." " .$length);
?> | <?php
$stdin = explode(' ',fgets(STDIN));
$area = $stdin[0] * $stdin[1];
$length = 2 * ($stdin[0] + $stdin[1]);
echo($area ." " .$length);
?> | [["-", 12, 613, 3, 3, 0, 28, 0, 609, 0, 62], ["+", 12, 613, 3, 3, 0, 28, 0, 557, 0, 104], ["+", 0, 11, 12, 16, 31, 69, 0, 606, 0, 607], ["+", 0, 11, 12, 16, 12, 69, 0, 606, 0, 607], ["+", 12, 23, 0, 16, 31, 69, 0, 606, 0, 607], ["+", 12, 23, 0, 16, 12, 69, 0, 606, 0, 607]] | 6 | 60 |
<?php
list($x, $y) = explode(" ", fgetc(STDIN));
$area = $x * $y;
$around = ($x + $y) * 2;
print($area." ".$around); | <?php
list($x, $y) = explode(" ", fgets(STDIN));
$area = $x * $y;
$around = ($x + $y) * 2;
print($area." ".$around."\n"); | [["-", 12, 613, 3, 3, 0, 28, 0, 613, 63, 141], ["+", 12, 613, 3, 3, 0, 28, 0, 613, 63, 141], ["+", 0, 1, 0, 619, 0, 23, 0, 16, 17, 131], ["+", 0, 619, 0, 23, 0, 16, 12, 609, 0, 62], ["+", 0, 619, 0, 23, 0, 16, 12, 609, 0, 44]] | 6 | 57 |
<?php
// Here your code !
$input=trim(fgets(STDIN));
$arr=explode(" ",$input);
$a=$arr[0];
$b=$arr[1];
echo ($a*$b)." ".(2*$a*$b);
?> | <?php
// Here your code !
$input=trim(fgets(STDIN));
$arr=explode(" ",$input);
$a=$arr[0];
$b=$arr[1];
echo ($a*$b)." ".(2*($a+$b));
?> | [["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 24], ["-", 0, 608, 0, 16, 12, 23, 0, 16, 17, 48], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 17, 72], ["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 25]] | 6 | 68 |
<?php
$a = trim(fgets(STDIN));
$lens = exprode(" ",$a);
$a = $lens[0] * $lens[1];
$b = ($lens[0] + $lens[1]) * 2;
printf($a . " " . $b);
?> | <?php
$a = trim(fgets(STDIN));
$lens = explode(" ",$a);
$a = $lens[0] * $lens[1];
$b = ($lens[0] + $lens[1]) * 2;
printf($a . " " . $b);
?> | [["-", 0, 493, 0, 1, 0, 11, 12, 613, 63, 141], ["+", 0, 493, 0, 1, 0, 11, 12, 613, 63, 141]] | 6 | 73 |
<?php
$input_lines = trim(fgets(STDIN));
$s = explode(" ", $s);
echo $s[0] * $s[1]." ";
echo $s[0] * 2 + $s[1] * 2;
echo "\n" ; | <?php
$input_lines = trim(fgets(STDIN));
$s = explode(" ", $input_lines);
echo $s[0] * $s[1]." ";
echo $s[0] * 2 + $s[1] * 2;
echo "\n" ; | [["-", 12, 613, 3, 3, 0, 28, 0, 606, 0, 141], ["+", 12, 613, 3, 3, 0, 28, 0, 606, 0, 141]] | 6 | 64 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println((a * b) + ((a + b) * 2));
}
}
| import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println((a * b) + (" ") + ((a + b) * 2));
}
}
| [["+", 0, 16, 31, 16, 12, 23, 0, 5, 0, 62], ["+", 0, 16, 31, 16, 12, 23, 0, 5, 0, 491], ["+", 3, 4, 0, 16, 31, 16, 12, 23, 0, 25], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 24]] | 3 | 75 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int tate = sc.nextInt();
int yoko = sc.nextInt();
int a = tate * yoko;
int b = tate * 2 + yoko * 2;
System.out.println(a + "" + b);
}
}
| import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int tate = sc.nextInt();
int yoko = sc.nextInt();
int a = tate * yoko;
int b = tate * 2 + yoko * 2;
System.out.println(a + " " + b);
}
}
| [["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491]] | 3 | 84 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(a * b + "" + 2 * (a + b));
}
}
| import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(a * b + " " + 2 * (a + b));
}
}
| [["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491]] | 3 | 74 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.