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
| change_count
int64 0
100
|
|---|---|---|---|---|---|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long int n, ans = 1;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 60
| 2
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
if (n)
ans++;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
long long int ans = 0;
cin >> n;
if (n)
ans++;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 61
| 2
|
#include <iostream>
unsigned int factorial(int i) {
if (i <= 1)
return 1;
else
return i * factorial(i - 1);
}
int main() {
int n;
std::cin >> n;
std::cout << factorial(n) << std::endl;
return 0;
}
|
#include <iostream>
unsigned long long int factorial(int i) {
if (i <= 1)
return 1;
else
return i * factorial(i - 1);
}
int main() {
int n;
std::cin >> n;
std::cout << factorial(n) << std::endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 62
| 2
|
#include <iostream>
using namespace std;
int factorial(int n) {
if (n == 1)
return 1;
else {
return n * factorial(n - 1);
}
}
int main() {
int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long factorial(int n) {
if (n == 1)
return 1;
else {
return n * factorial(n - 1);
}
}
int main() {
int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 61
| 3
|
#include <iostream>
using namespace std;
int factorial(int n) {
if (n == 0)
return 1;
else
return n * factorial(n - 1);
}
int main() {
int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long int factorial(long long int n) {
if (n == 0)
return 1;
else
return n * factorial(n - 1);
}
int main() {
long long int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 59
| 6
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int fact(int n) {
if (n == 1)
return 1;
return n * fact(n - 1);
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
long long int fact(int n) {
if (n <= 1)
return 1;
return n * fact(n - 1);
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]]
| 1
| 70
| 4
|
#include <stdio.h>
int main() {
int a = 0, r = 0;
scanf("%d", &a);
r = a;
for (int i = a - 1; i > 0; i--) {
r = r * i;
}
printf("%d\n", r);
}
|
#include <stdio.h>
int main() {
long int a, r = 0;
scanf("%ld", &a);
r = a;
for (int i = a - 1; i > 0; i--) {
r = r * i;
}
printf("%ld\n", r);
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 65
| 7
|
#include <stdio.h>
int main(void) {
char line[80];
int n;
if (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%d", &n) == 1) {
int r = 1;
for (int i = 2; i <= n; i++) {
r *= i;
}
printf("%d\n", r);
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
char line[80];
int n;
if (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%d", &n) == 1) {
long long r = 1;
for (int i = 2; i <= n; i++) {
r *= i;
}
printf("%lld\n", r);
}
}
return 0;
}
|
[["-", 64, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 0, 57, 64, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 88
| 5
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#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 rp(a) while (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;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
int out = 1;
cin >> n;
rep(i, n) out *= i + 1;
cout << out << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#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 rp(a) while (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;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
ll out = 1;
cin >> n;
rep(i, n) out *= i + 1;
cout << out << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]]
| 1
| 123
| 2
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 1;
for (int i = n; i > 0; i--) {
sum *= i;
}
cout << sum << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long int sum = 1;
for (int i = n; i > 0; i--) {
sum *= i;
}
cout << sum << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 65
| 1
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = n;
int i;
for (i = n; i > 1; i--) {
if (n == 1) {
cout << n << endl;
} else {
ans = ans * (i - 1);
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long long n, ans;
cin >> n;
ans = n;
int i;
for (i = n; i > 1; i--) {
if (n == 1) {
cout << n << endl;
} else {
ans = ans * (i - 1);
}
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 85
| 3
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n;
if (n == 0)
n = 1;
m = n - 1;
while (m > 0)
n *= m--;
cout << n << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
unsigned long long n, m;
cin >> n;
if (n == 0)
n = 1;
m = n - 1;
while (m > 0)
n *= m--;
cout << n << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 59
| 4
|
#include <iostream>
using namespace std;
int f(int n) {
if (n > 0)
return n * f(n - 1);
else
return 1;
}
int main() {
int n;
cin >> n;
cout << f(n) << endl;
}
|
#include <iostream>
using namespace std;
long long int f(long long int n) {
if (n > 0)
return n * f(n - 1);
else
return 1;
}
int main() {
long long int n;
cin >> n;
cout << f(n) << endl;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 56
| 6
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int i = 1;
while (n >= 1) {
i *= n;
n--;
}
cout << i << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int i = 1;
while (n >= 1) {
i *= n;
n--;
}
cout << i << endl;
;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 48
| 3
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 1;
while (n > 0) {
ans *= n;
n--;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long LL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
LL ans = 1;
while (n > 0) {
ans *= n;
n--;
}
cout << ans << endl;
return 0;
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 157], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 49, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]]
| 1
| 66
| 7
|
#include <stdio.h>
int main() {
int n, x;
x = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
x *= i;
}
printf("%d\n", x);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
long x;
x = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
x *= i;
}
printf("%ld\n", x);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 60
| 5
|
#include <iostream>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
ans *= i;
}
if (n == 0)
cout << 0 << endl;
else
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
ans *= i;
}
if (n == 0)
cout << 0 << endl;
else
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 63
| 2
|
/*
NOTE :
*min_element(.begin(),.end())
*max_element(.begin(),.end())
stack push pop top
queue push pop front
priority_queue<> pq
push() pop() size() top()
map<>
find() begin() end() insert(map<>::value_type())
pair<>
sort(.begin(), .end())
sort(arr, arr+N)
sort(a, a+N, greater<int>())
binary_search(vc.begin(), vc.end(), x) //binary_search???true, false?????????
vector<int>::iterator lit = lower_bound(vc.begin(), vc.end(), x);
lower_bound?????????????????????"??\???"????????????????????????????????????????????¬???????????????
vector<int>::iterator uit = upper_bound(vc.begin(), vc.end(), x);
upper_bound????????????????????????"?¶???????"?????????????????????????????????????????¬???????????????
*/
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#define MAX 100
#define INF 1 << 20
#define LLINF 10e12 // 1<<31 // 2^31
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, a, n) for (int i = (a); i < (n); i++)
#define SET(a, c) memset(a, c, sizeof a)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define FOREACH(i, c) for (auto(i) : (c))
#define BIT(i, j) ((i) >> (j)) & 1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique(ALL((o))), (o).end());
using namespace std;
typedef long long ll;
typedef valarray<int> array_t;
/////
int f(int n) {
if (n == 0)
return 1;
else
return n * f(n - 1);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// FROM HERE
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
/*
NOTE :
*min_element(.begin(),.end())
*max_element(.begin(),.end())
stack push pop top
queue push pop front
priority_queue<> pq
push() pop() size() top()
map<>
find() begin() end() insert(map<>::value_type())
pair<>
sort(.begin(), .end())
sort(arr, arr+N)
sort(a, a+N, greater<int>())
binary_search(vc.begin(), vc.end(), x) //binary_search???true, false?????????
vector<int>::iterator lit = lower_bound(vc.begin(), vc.end(), x);
lower_bound?????????????????????"??\???"????????????????????????????????????????????¬???????????????
vector<int>::iterator uit = upper_bound(vc.begin(), vc.end(), x);
upper_bound????????????????????????"?¶???????"?????????????????????????????????????????¬???????????????
*/
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#define MAX 100
#define INF 1 << 20
#define LLINF 10e12 // 1<<31 // 2^31
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, a, n) for (int i = (a); i < (n); i++)
#define SET(a, c) memset(a, c, sizeof a)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define FOREACH(i, c) for (auto(i) : (c))
#define BIT(i, j) ((i) >> (j)) & 1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique(ALL((o))), (o).end());
using namespace std;
typedef long long ll;
typedef valarray<int> array_t;
/////
ll f(ll n) {
if (n == 0)
return 1;
else
return n * f(n - 1);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// FROM HERE
ll n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 78], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]]
| 1
| 188
| 6
|
#include <iostream>
using namespace std;
int main() {
int y;
int x = 1;
cin >> y;
while (y != 1) {
x = x * y;
y--;
}
cout << x << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int y;
long long int x = 1;
cin >> y;
while (y != 1) {
x = x * y;
y--;
}
cout << x << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 47
| 2
|
#include <stdio.h>
long kai(long i) {
if (i == 1 || i == 0) {
return 1;
}
return i * kai(i - 1);
}
int main() {
long n;
scanf("%d", &n);
printf("%d\n", kai(n));
return 0;
}
|
#include <stdio.h>
long kai(long i) {
if (i == 1 || i == 0) {
return 1;
}
return i * kai(i - 1);
}
int main() {
long n;
scanf("%ld", &n);
printf("%ld\n", kai(n));
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 70
| 4
|
#include <bits/stdc++.h>
using namespace std;
int serch(int n) {
if (n == 1)
return n;
return n * serch(n - 1);
}
int main() {
int n;
cin >> n;
n = serch(n);
cout << n << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int serch(long long int n) {
if (n == 1)
return n;
return n * serch(n - 1);
}
int main() {
long long int n;
cin >> n;
n = serch(n);
cout << n << endl;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 59
| 6
|
#include <iostream>
using namespace std;
int main() {
int n;
int x;
x = 1;
cin >> n;
for (int i = 0; i < n; i++) {
x = x * (n - i);
}
cout << x << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int x;
x = 1;
cin >> n;
for (int i = 0; i < n; i++) {
x = x * (n - i);
}
cout << x << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 58
| 2
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int c = 1;
if (n == 0)
c = 0;
else
for (int i = n; i > 0; i--)
c *= i;
cout << c << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
long long c = 1;
if (n == 0)
c = 0;
else
for (int i = n; i > 0; i--)
c *= i;
cout << c << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 66
| 9
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int c = 1;
if (n == 0)
c = 0;
else
for (int i = n; i > 0; i--)
c *= i;
cout << c << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long c = 1;
if (n == 0)
c = 0;
else
for (int i = n; i > 0; i--)
c *= i;
cout << c << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["-", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 66
| 9
|
#include <iostream>
using namespace std;
int main() {
int n, i = 2, t;
cin >> t;
n = t;
for (; i < t; i++)
n *= i;
cout << n << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long n, i = 2, t;
cin >> t;
n = t;
for (; i < t; i++)
n *= i;
cout << n << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 49
| 2
|
#include <iostream>
using namespace std;
int main() {
int n;
int ans = 1;
int num;
cin >> n;
for (int i = n + 1; i > 1; i--) {
ans *= (i - 1);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int ans = 1;
int num;
cin >> n;
for (int i = n + 1; i > 1; i--) {
ans *= (i - 1);
}
cout << ans << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 62
| 2
|
#include <cstdio>
int main(void) {
int n;
int i;
long sum;
sum = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
sum *= i;
}
printf("%d\n", sum);
return (0);
}
|
#include <cstdio>
int main(void) {
int n;
int i;
long sum;
sum = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
sum *= i;
}
printf("%ld\n", sum);
return (0);
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 66
| 10
|
#include <cstdio>
using namespace std;
int main() {
int x, ans = 1;
scanf("%d", &x);
for (int i = 1; i <= x; i++) {
ans *= i;
}
printf("%d\n", ans);
return (0);
}
|
#include <cstdio>
using namespace std;
int main() {
int n;
long ans = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
ans *= i;
}
printf("%ld\n", ans);
return (0);
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 64
| 11
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
int main(void) {
int i, j, n, sum;
scanf("%d", &n);
sum = 1;
for (i = 2; i <= n; i++)
sum = sum * i;
printf("%d\n", sum);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
int main(void) {
int i, j, n;
long long int sum;
scanf("%d", &n);
sum = 1;
for (i = 2; i <= n; i++)
sum = sum * i;
printf("%lld\n", sum);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 74
| 7
|
#include <iostream>
int main() {
int n;
std::cin >> n;
int factorial = 1;
while (n > 0)
factorial *= n--;
std::cout << factorial << std::endl;
return 0;
}
|
#include <iostream>
int main() {
int n;
std::cin >> n;
long long int factorial = 1;
while (n > 0)
factorial *= n--;
std::cout << factorial << std::endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 46
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long n, ans;
cin >> n;
ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
| 3
|
#include <iostream>
#include <stdio.h>
using namespace std;
int factorial(int D) { return (D > 0 ? D * factorial(D - 1) : 1); }
int main() {
int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
long long factorial(int D) { return (D > 0 ? D * factorial(D - 1) : 1); }
int main() {
int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 59
| 3
|
#include <iostream>
#include <stdio.h>
using namespace std;
int factorial(int n) { return (n > 0 ? n * factorial(n - 1) : 1); }
int main() {
int n;
scanf("%d", &n);
printf("%d \n", factorial(n));
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
long long factorial(int n) { return (n > 0 ? n * factorial(n - 1) : 1); }
int main() {
int n;
scanf("%d", &n);
printf("%lld\n", factorial(n));
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 69
| 5
|
#include <stdio.h>
int main() {
int n;
int i;
long long int ans = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
ans = ans * (i + 1);
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
int i;
long long ans = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
ans = ans * (i + 1);
}
printf("%lld\n", ans);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 69
| 3
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int res = 1;
while (n != 1) {
res *= n;
n--;
}
cout << res << endl;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long int res = 1;
while (n != 1) {
res *= n;
n--;
}
cout << res << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 51
| 2
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, s = 1;
cin >> n;
while (n)
s *= n--;
cout << s << endl;
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long s = 1;
cin >> n;
while (n)
s *= n--;
cout << s << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 65
| 4
|
/*#include<stdio.h>
#include <algorithm>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iostream>
#include<math.h>
#include<queue>
#include<stdlib.h>
#include<string>
#include<vector>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;
int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };
int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;
string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;
int sum = 0;
vector<int> value;
vector<int> weight;
int dp[110][10010];
int data_[210][2] = { -2 };
void input(void) {
CI n;
return;
}
int main(void) {
input();
double money = 100000;
for (int i = 0; i < n; i++) {
money *= 1.05;
}
if ((int)money % 1000 >= 500) {
CO (int)(money - ((int)(money) % 1000) + 1000) E
}
else {
CO (int)(money - ((int)(money) % 1000)) E
}
return 0;
}
*/
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;
string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;
int sum = 0;
vector<int> value;
vector<int> weight;
int dp[110][10010];
int data_[210][2] = {-2};
void input(void) {
CI n;
return;
}
int main(void) {
input();
for (int i = n - 1; i > 1; i--) {
n *= i;
}
CO n E
return 0;
}
|
/*#include<stdio.h>
#include <algorithm>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iostream>
#include<math.h>
#include<queue>
#include<stdlib.h>
#include<string>
#include<vector>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;
int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };
int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;
string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;
int sum = 0;
vector<int> value;
vector<int> weight;
int dp[110][10010];
int data_[210][2] = { -2 };
void input(void) {
CI n;
return;
}
int main(void) {
input();
double money = 100000;
for (int i = 0; i < n; i++) {
money *= 1.05;
}
if ((int)money % 1000 >= 500) {
CO (int)(money - ((int)(money) % 1000) + 1000) E
}
else {
CO (int)(money - ((int)(money) % 1000)) E
}
return 0;
}
*/
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
long long int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;
string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;
int sum = 0;
vector<int> value;
vector<int> weight;
int dp[110][10010];
int data_[210][2] = {-2};
void input(void) {
CI n;
return;
}
int main(void) {
input();
for (int i = n - 1; i > 1; i--) {
n *= i;
}
CO n E
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]]
| 1
| 323
| 2
|
#include <iostream>
using namespace std;
int main() {
int ans = 1;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int ans = 1;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 51
| 2
|
#include <algorithm>
#include <cctype>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int size(string x) {
string::size_type size = x.size();
return size;
}
#define fu(l, k) for (int i = l; i < k; i++)
#define fd(l, k) for (int i = l; i > k; i--)
#define fi first
#define se second
typedef vector<string> vs;
typedef vector<int> vi;
double pi() { return M_PI; }
typedef set<int> set_i;
typedef set<string> set_s;
int main() {
int n, ans = 1;
cin >> n;
fd(n, 0) { ans *= i; }
cout << ans << endl;
}
|
#include <algorithm>
#include <cctype>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int size(string x) {
string::size_type size = x.size();
return size;
}
#define fu(l, k) for (int i = l; i < k; i++)
#define fd(l, k) for (int i = l; i > k; i--)
#define fi first
#define se second
typedef vector<string> vs;
typedef vector<int> vi;
double pi() { return M_PI; }
typedef set<int> set_i;
typedef set<string> set_s;
int main() {
int n;
long long int ans = 1;
cin >> n;
fd(n, 0) { ans *= i; }
cout << ans << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]]
| 1
| 141
| 5
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
unsigned long long Kaijo(int n) {
int m;
if (n == 0)
return 1;
m = Kaijo(n - 1);
return m * n;
}
int main() {
int n;
cin >> n;
cout << Kaijo(n) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
unsigned long long Kaijo(int n) {
long long int m;
if (n == 0)
return 1;
m = Kaijo(n - 1);
return m * n;
}
int main() {
int n;
cin >> n;
cout << Kaijo(n) << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 71
| 2
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int result = 1;
cin >> n;
for (; n > 0; --n) {
result *= n;
}
cout << result << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int result = 1;
cin >> n;
for (; n > 0; --n) {
result *= n;
}
cout << result << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 65
| 2
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
int main(void) {
int i;
int n;
int sum = 1;
cin >> n;
for (i = 1; i <= n; i++) {
sum *= i;
}
cout << sum << endl;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
int main(void) {
int i;
int n;
long long int sum = 1;
cin >> n;
for (i = 1; i <= n; i++) {
sum *= i;
}
cout << sum << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 63
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, res;
res = 1;
cin >> n;
for (int i = 2; i <= n; i++) {
res *= i;
}
cout << res << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, res;
res = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
res *= i;
}
cout << res << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 54
| 4
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int kaijou(int);
int n;
int main() {
cin >> n;
cout << kaijou(n) << endl;
return 0;
}
int kaijou(int i) {
if (i == 0) {
return 1;
} else {
return i * kaijou(i - 1);
}
}
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
long kaijou(long);
long n;
int main() {
cin >> n;
cout << kaijou(n) << endl;
return 0;
}
long kaijou(long i) {
if (i == 0) {
return 1;
} else {
return i * kaijou(i - 1);
}
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40]]
| 1
| 73
| 10
|
#include <iostream>
using namespace std;
int main() {
int n, f = 1;
cin >> n;
for (int i = 1; i <= n; i++)
f = f * i;
cout << f;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long f = 1;
cin >> n;
for (int i = 1; i <= n; i++)
f = f * i;
cout << f << "\n";
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 44]]
| 1
| 50
| 7
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define shosu(x) fixed << setprecision(x)
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, P> pip;
typedef long long ll;
const int inf = (1 << 31) - 1;
const double pi = acos(-1);
int n, ans = 1;
int main() {
cin >> n;
for (int i = 2; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define shosu(x) fixed << setprecision(x)
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, P> pip;
typedef long long ll;
const int inf = (1 << 31) - 1;
const double pi = acos(-1);
int n;
ll ans = 1;
int main() {
cin >> n;
for (int i = 2; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78]]
| 1
| 123
| 3
|
#include <iostream>
using namespace std;
int main() {
int i, j, k;
int n1 = 0, n2 = 1;
cin >> n1;
for (i = 1; i <= n1; i++) {
n2 *= i;
}
cout << n2 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int i, j, k;
int n1 = 0;
long long n2 = 1;
cin >> n1;
for (i = 1; i <= n1; i++) {
n2 *= i;
}
cout << n2 << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 60
| 4
|
#define scanf_s scanf
//#define gets_s gets
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define MAX 81
#define _MAX 100
#define ABC 26
int main(void) {
int n;
long long int ans;
scanf_s("%d", &n);
for (int i = 1; i <= n; ++i) {
ans *= i;
}
printf("%lld\n", ans);
}
|
#define scanf_s scanf
//#define gets_s gets
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define MAX 81
#define _MAX 100
#define ABC 26
int main(void) {
int n;
long long int ans = 1;
scanf_s("%d", &n);
for (int i = 1; i <= n; ++i) {
ans *= i;
}
printf("%lld\n", ans);
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 80
| 2
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#define ll (long long)
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
using namespace std;
int main(void) {
int n;
int answer = 1;
cin >> n;
FOR(i, 1, n + 1)
answer = answer * i;
cout << answer << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#define ll (long long)
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
using namespace std;
int main(void) {
int n;
long long answer = 1;
cin >> n;
FOR(i, 1, n + 1)
answer = answer * i;
cout << answer << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 91
| 3
|
#include <iostream>
using namespace std;
int main() {
long long a[21], b;
a[1] = 1;
for (int i = 2; i < 20; i++)
a[i] = a[i - 1] * i;
cin >> b;
cout << a[b] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long a[21], b;
a[1] = 1;
for (int i = 2; i <= 20; i++)
a[i] = a[i - 1] * i;
cin >> b;
cout << a[b] << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 72
| 2
|
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
long ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 57
| 2
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int f(int n) {
int sum;
if (n == 0 || n == 1) {
return 1;
} else {
return n * f(n - 1);
}
}
int main() {
ios::sync_with_stdio(false);
int n;
scanf("%d", &n);
printf("%d", f(n));
}
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
long long int f(int n) {
int sum;
if (n == 0 || n == 1) {
return 1;
} else {
return n * f(n - 1);
}
}
int main() {
ios::sync_with_stdio(false);
int n;
scanf("%d", &n);
printf("%lld\n", f(n));
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 262
| 5
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int fact = 1;
while (n > 0) {
fact *= n;
n--;
}
cout << fact << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int fact = 1;
while (n > 0) {
fact *= n;
n--;
}
cout << fact << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 48
| 2
|
#include <iostream>
using namespace std;
int fac(long long x) {
if (x == 0ll) {
return 1;
} else {
return x * fac(x - 1);
}
}
int main() {
long long n;
cin >> n;
cout << fac(n) << endl;
}
|
#include <iostream>
using namespace std;
long long fac(long long x) {
if (x == 0ll) {
return 1ll;
} else {
return x * fac(x - 1ll);
}
}
int main() {
long long n;
cin >> n;
cout << fac(n) << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 62
| 7
|
#include <iostream>
using namespace std;
int main() {
int n;
int re = 1;
cin >> n;
while (n >= 2) {
re *= n;
n--;
}
cout << re << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
unsigned long long int re = 1;
cin >> n;
while (n >= 2) {
re *= n;
n--;
}
cout << re << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 48
| 3
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i;
int a = 1;
cin >> n;
for (i = 1; i <= n; i++) {
a *= i;
}
cout << a << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i;
long long int a = 1;
cin >> n;
for (i = 1; i <= n; i++) {
a *= i;
}
cout << a << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 56
| 2
|
#include <iostream>
using namespace std;
int main() {
int n;
int d = 1;
cin >> n;
for (int i = 0; i < n; i++) {
d *= (i + 1);
}
cout << d;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long d = 1;
cin >> n;
for (int i = 0; i < n; i++) {
d *= (i + 1);
}
cout << d << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 52
| 5
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define foreach(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); itr++)
#define dbg(x) cout << #x "=" << (x) << endl
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back(a)
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
using namespace std;
int main() {
ll n, ans;
cin >> n;
rep(i, n) { ans *= i + 1; }
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define foreach(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); itr++)
#define dbg(x) cout << #x "=" << (x) << endl
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back(a)
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
using namespace std;
int main() {
ll n, ans = 1;
cin >> n;
rep(i, n) { ans *= i + 1; }
cout << ans << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 159
| 2
|
#include <iostream>
using namespace std;
int main() {
unsigned int n;
cin >> n;
unsigned int fac = 1;
while (n) {
fac *= n;
n--;
}
cout << fac << endl;
}
|
#include <iostream>
using namespace std;
int main() {
unsigned long long n;
cin >> n;
unsigned long long fac = 1;
while (n) {
fac *= n;
n--;
}
cout << fac << endl;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 45
| 6
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <stack>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define llong long long
int factorial(int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
int main() {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <stack>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define llong long long
llong factorial(int n) {
if (n == 0)
return 1;
return (llong)n * factorial(n - 1);
}
int main() {
int n;
scanf("%d", &n);
printf("%lld\n", factorial(n));
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 78], ["+", 8, 9, 0, 37, 0, 16, 31, 74, 0, 24], ["+", 0, 37, 0, 16, 31, 74, 39, 77, 39, 78], ["+", 8, 9, 0, 37, 0, 16, 31, 74, 0, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 105
| 7
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int ans = 1;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int ans = 1;
long long int n;
cin >> n;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 64
| 4
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 1;
cin >> n;
for (int i = 2; i <= n; i++)
k *= i;
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k = 1;
cin >> n;
for (int i = 2; i <= n; i++)
k *= i;
cout << k << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 50
| 3
|
#include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0019
int main() {
int d;
cin >> d;
int sum = 1;
while (d > 1)
sum *= d--;
cout << sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0019
int main() {
int d;
cin >> d;
long long int sum = 1;
while (d > 1)
sum *= d--;
cout << sum << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 45
| 2
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
int n;
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
int n;
cin >> n;
long long ans = 1;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << '\n';
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 60
| 3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, s = 1;
for (i = 1; i <= n; i++) {
s = s * i;
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long i, s = 1;
for (i = 1; i <= n; i = i + 1) {
s = s * i;
}
cout << s << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 17, 32], ["+", 8, 9, 0, 7, 26, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 26, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 26, 11, 12, 16, 12, 13]]
| 1
| 53
| 7
|
#include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
a = n;
while (true) {
n = n - 1;
if (n == 0)
break;
a = a * n;
}
cout << a << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long n, a;
cin >> n;
a = n;
while (true) {
n = n - 1;
if (n == 0)
break;
a = a * n;
}
cout << a << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 57
| 2
|
#include <iostream>
int main(void) {
int n = 0;
std::cin >> n;
int fact = 1;
for (int i = 1; i <= n; i++) {
fact *= i;
}
std::cout << fact << std::endl;
return 0;
}
|
#include <iostream>
int main(void) {
int n = 0;
std::cin >> n;
long long int fact = 1;
for (int i = 1; i <= n; i++) {
fact *= i;
}
std::cout << fact << std::endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 58
| 2
|
tmp = 1
n = int(input())
for i in range(1, n+1):
n*=i
print(n)
|
tmp = 1
n = int(input())
for i in range(1, n+1):
tmp*=i
print(tmp)
|
[["-", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]]
| 5
| 30
| 4
|
ret = 1
for i in range(2, int(input())):
ret *= i
print(ret)
|
ret = 1
for i in range(2, int(input()) + 1):
ret *= i
print(ret)
|
[["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 25
| 2
|
x=input()
def f(n):
if n==0:return 1
return f(n-1)*n
print(f(int(n)))
|
# -*- coding:shift-jis -*-
x=input()
def f(n):
if n==0:return 1
return f(n-1)*n
print(f(int(x)))
|
[["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]]
| 5
| 37
| 2
|
(lambda n:__import__("functools").reduce(lambda a,b:a*b,range(1,n+1)))(int(input()))
|
print((lambda n:__import__("functools").reduce(lambda a,b:a*b,range(1,n+1)))(int(input())))
|
[["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 63, 23, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 40
| 3
|
n = eval(input())
self = 1
for i in range(1, n + 1):
self = self * i
print(n)
|
n = eval(input())
self = 1
for i in range(1, n + 1):
self = self * i
print(self)
|
[["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]]
| 5
| 32
| 2
|
import math
num = int(input)
print(math.factorial(num))
|
import math
num = int(input())
print(math.factorial(num))
|
[["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 17
| 2
|
from math import factorial
n = int(input())
print(factorial(5))
|
from math import factorial
n = int(input())
print(factorial(n))
|
[["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]]
| 5
| 19
| 2
|
def factorial(n):
if n == 1:
return 1
else:
return n * factorial(n-1)
n=input()
print(factorial(n))
|
def factorial(n):
if n == 1:
return 1
else:
return n * factorial(n-1)
n=input()
print(factorial(int(n)))
|
[["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 36
| 3
|
a=1
for i in range(1,int(input())+1):a*i
print(a)
|
a=1
for i in range(2,int(input())+1):a*=i
print(a)
|
[["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 7, 8, 196, 0, 1, 0, 657, 17, 48], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 17, 108]]
| 5
| 27
| 4
|
import sys
lineNumber = 0
#for line in ["3 6 9 7 5"]:
for line in sys.stdin.readlines():
lineNumber += 1
# get data
List = list(map(int, line.strip().split(" ")))
n = List[0]
ans = 1
for i in range(2, n): ans *= i
print(ans)
|
import sys
lineNumber = 0
#for line in ["3", "6", "9", "7", "5"]:
for line in sys.stdin.readlines():
lineNumber += 1
# get data
List = list(map(int, line.strip().split(" ")))
n = List[0]
ans = 1
for i in range(2, n+1): ans *= i
print(ans)
|
[["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 69
| 2
|
from functools import reduce
print(reduce(lambda x,y:x*y,list(range(1,eval(input())))))
|
from functools import reduce
print(reduce(lambda x,y:x*y,list(range(1,eval(input())+1))))
|
[["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 33
| 2
|
n = int(input())
ans = 1
for i in range(1,n):
ans *= i
print(ans)
|
n = int(input())
ans = 1
for i in range(1,n+1):
ans *= i
print(ans)
|
[["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 28
| 2
|
<?php
$s = rtrim(fgets(STDIN));
echo toUpper($s) . PHP_EOL;
function toUpper($str) {
$diff = 'a' - 'A';
$n = strlen($str);
for ($i = 0; $i < $n; $i++) {
if ($str[$i] < 'a' || $str[$i] > 'z') {
continue;
}
$str[$i] = chr(ord($str[$i]) - $diff);
}
return $str;
}
|
<?php
$s = rtrim(fgets(STDIN));
echo toUpper($s) . PHP_EOL;
function toUpper($str) {
$diff = ord('a') - ord('A');
$n = strlen($str);
for ($i = 0; $i < $n; $i++) {
if ($str[$i] < 'a' || $str[$i] > 'z') {
continue;
}
$str[$i] = chr(ord($str[$i]) - $diff);
}
return $str;
}
|
[["+", 0, 1, 0, 11, 12, 16, 31, 613, 63, 141], ["+", 0, 11, 12, 16, 31, 613, 3, 3, 0, 24], ["+", 0, 11, 12, 16, 31, 613, 3, 3, 0, 25], ["+", 0, 1, 0, 11, 12, 16, 12, 613, 63, 141], ["+", 0, 11, 12, 16, 12, 613, 3, 3, 0, 24], ["+", 0, 11, 12, 16, 12, 613, 3, 3, 0, 25]]
| 6
| 123
| 6
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner c = new Scanner(System.in);
char r[] = c.nextLine().toCharArray();
for (int i = 0; i < r.length; i++) {
if ('z' > r[i] & r[i] > 'a')
r[i] = (char)(r[i] - 'a' + 'A');
}
System.out.println(r);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner c = new Scanner(System.in);
char r[] = c.nextLine().toCharArray();
for (int i = 0; i < r.length; i++) {
if ('z' >= r[i] & r[i] >= 'a')
r[i] = (char)(r[i] - 'a' + 'A');
}
System.out.println(r);
}
}
|
[["-", 0, 57, 15, 15, 0, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 20]]
| 3
| 112
| 4
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
System.out.println(str.toLowerCase());
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
System.out.println(str.toUpperCase());
}
}
|
[["-", 0, 1, 0, 492, 3, 4, 0, 492, 141, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 492, 141, 22]]
| 3
| 77
| 2
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
System.out.println(new Scanner(System.in).next().toUpperCase());
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
System.out.println(new Scanner(System.in).nextLine().toUpperCase());
}
}
|
[["-", 0, 492, 3, 4, 0, 492, 500, 492, 141, 22], ["+", 0, 492, 3, 4, 0, 492, 500, 492, 141, 22]]
| 3
| 47
| 2
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
String s = new Scanner(System.in).next();
System.out.println(s.toUpperCase());
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
String s = new Scanner(System.in).nextLine();
System.out.println(s.toUpperCase());
}
}
|
[["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]]
| 3
| 52
| 2
|
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String n = scanner.next();
System.out.println(n.toUpperCase());
}
}
|
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String s = scanner.nextLine();
System.out.println(s.toUpperCase());
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 1, 0, 492, 3, 4, 0, 492, 500, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 492, 500, 22]]
| 3
| 56
| 6
|
#include <stdio.h>
int main(void) {
char buf[100];
int i;
gets(buf);
while (buf[i] != '\n') {
if (buf[i] >= 97 && buf[i] <= 122)
buf[i] = buf[i] - 32;
i++;
}
printf("%s", buf);
return 0;
}
|
#include <stdio.h>
int main(void) {
char buf[128];
int i;
gets(buf);
while (buf[i] != '\0') {
if (buf[i] >= 97 && buf[i] <= 122)
buf[i] = buf[i] - 32;
i++;
}
printf("%s\n", buf);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 52, 15, 23, 0, 16, 12, 103, 0, 44], ["+", 0, 52, 15, 23, 0, 16, 12, 103, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 79
| 5
|
#include <stdio.h>
int main() {
int a, n;
char word[100];
for (a = 0;; a++) {
if (scanf("%s", &word) == EOF) {
break;
}
if (word[a] >= 97 && word[a] <= 122) {
word[a] -= 32;
}
}
for (n = 0; n < a; n++) {
printf("%c", word[n]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a, n;
char word[10000];
for (a = 0;; a++) {
if (scanf("%c", &word[a]) == EOF) {
break;
}
if (word[a] >= 97 && word[a] <= 122) {
word[a] -= 32;
}
}
for (n = 0; n < a; n++) {
printf("%c", word[n]);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 31, 2, 3, 4, 0, 66, 28, 69, 0, 70], ["+", 31, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 31, 2, 3, 4, 0, 66, 28, 69, 0, 73]]
| 0
| 104
| 7
|
#include <stdio.h>
int main(void) {
char *str;
int i;
scanf("%[^\n]s", str);
for (i = 0; str[i] != '\0'; i++) {
if (str[i] >= 'a' && str[i] <= 'z') {
printf("%c", str[i] - ('a' - 'A'));
} else {
printf("%c", str[i]);
}
}
printf("\n");
return (0);
}
|
#include <stdio.h>
int main(void) {
static char str[100000000];
int i;
scanf("%[^\n]s", str);
for (i = 0; str[i] != '\0'; i++) {
if (str[i] >= 'a' && str[i] <= 'z') {
printf("%c", str[i] - ('a' - 'A'));
} else {
printf("%c", str[i]);
}
}
printf("\n");
return (0);
}
|
[["+", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115], ["-", 0, 14, 8, 9, 0, 43, 49, 84, 0, 48], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 73]]
| 0
| 118
| 5
|
#include <stdio.h>
int main(void) {
char c;
while (scanf("%c", &c) != EOF) {
if ('a' <= c && 'z' >= c) {
c = c - ('a' - 'A');
}
printf("%c\n", c);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
char c;
while (scanf("%c", &c) != EOF) {
if ('a' <= c && 'z' >= c) {
c = c - ('a' - 'A');
}
printf("%c", c);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 71
| 1
|
main(c) {
for (; ~scanf("%c", &c); printf("%c", c - (c > 96) * 32))
exit(0);
}
|
main(c) {
for (; ~scanf("%c", &c); printf("%c", c - (c > 96) * 32))
;
exit(0);
}
|
[["+", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35]]
| 0
| 42
| 1
|
//↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
long long mod_pow(long long a, long long b) {
long long res = 1, mul = a;
for (int i = 0; i < 31; ++i) {
if (b >> i & 1) {
res *= mul;
res %= MOD;
}
mul = (mul * mul) % MOD;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
//↑template↑
int main() {
string h;
cin >> h;
transform(all(h), h.begin(), ::toupper);
cout << h << endl;
}
|
//↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
long long mod_pow(long long a, long long b) {
long long res = 1, mul = a;
for (int i = 0; i < 31; ++i) {
if (b >> i & 1) {
res *= mul;
res %= MOD;
}
mul = (mul * mul) % MOD;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
//↑template↑
int main() {
string h;
getline(cin, h);
transform(all(h), h.begin(), ::toupper);
cout << h << endl;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]]
| 1
| 280
| 5
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
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();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#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 SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int main() {
string str;
getline(cin, str);
REP(i, str.size() - 1) {
if (str[i] >= 'a' && str[i] <= 'z')
cout << (char)(str[i] + ('A' - 'a'));
else
cout << str[i];
}
cout << endl;
}
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
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();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#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 SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int main() {
string str;
getline(cin, str);
REP(i, str.size()) {
if (str[i] >= 'a' && str[i] <= 'z')
cout << (char)(str[i] + ('A' - 'a'));
else
cout << str[i];
}
cout << endl;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 359
| 2
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s
int main() {
string s;
getline(cin, s);
for (int i = 0; s.size() > i; i++) {
{
if (s[i] >= 'a' && s[i] <= 'z')
s[i] -= 32;
cout << s[i] << endl;
}
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s
int main() {
string s;
getline(cin, s);
for (int i = 0; s.size() > i; i++) {
{
if (s[i] >= 'a' && s[i] <= 'z')
s[i] -= 32;
cout << s[i];
}
}
cout << endl;
return 0;
}
|
[["-", 8, 9, 0, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 136
| 6
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 'a' && s[i] <= 'z')
s[i] += 'A' - 'a';
}
cout << s << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
getline(cin, s);
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 'a' && s[i] <= 'z')
s[i] += 'A' - 'a';
}
cout << s << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]]
| 1
| 83
| 5
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
transform(s.begin(), s.end(), s.begin(), ::toupper);
cout << s << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
getline(cin, s);
transform(s.begin(), s.end(), s.begin(), ::toupper);
cout << s << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]]
| 1
| 72
| 5
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
transform(s.begin(), s.end(), s.begin(), ::toupper);
cout << s << endl;
}
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
ios::sync_with_stdio(false);
string s;
getline(cin, s);
transform(s.begin(), s.end(), s.begin(), ::toupper);
cout << s << endl;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]]
| 1
| 235
| 5
|
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string a, b;
getline(cin, a);
for (int i = 0; i < a.length(); i++) {
if (a[i] >= 'a' && a[i] <= 'z')
b[i] = ('A' + (a[i] - 'a'));
else
b[i] = a[i];
}
cout << b << endl;
// while(1);
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string a, b;
getline(cin, a);
for (int i = 0; i < a.length(); i++) {
if (a[i] >= 'a' && a[i] <= 'z')
b += ('A' + (a[i] - 'a'));
else
b += a[i];
}
cout << b << endl;
// while(1);
return 0;
}
|
[["-", 64, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["-", 64, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 64, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["-", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 107]]
| 1
| 131
| 10
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
string s;
cin >> s;
for (char &c : s)
c = toupper(c);
cout << s << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
string s;
getline(cin, s);
for (char &c : s)
c = toupper(c);
cout << s << '\n';
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]]
| 1
| 52
| 5
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
int main() {
string hoge;
getline(cin, hoge);
rep(i, hoge.length()) {
if ('a' < hoge[i] && hoge[i] < 'z') {
hoge[i] -= ('a' - 'A');
}
}
cout << hoge << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
int main() {
string hoge;
getline(cin, hoge);
rep(i, hoge.length()) {
if ('a' <= hoge[i] && hoge[i] <= 'z') {
hoge[i] -= ('a' - 'A');
}
}
cout << hoge << endl;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]]
| 1
| 111
| 4
|
#!/usr/bin/python
def datasets():
s = input().strip()
yield s
def main():
for s in datasets():
print(s.lower())
if __name__ == '__main__':
main()
|
#!/usr/bin/python
def datasets():
s = input().strip()
yield s
def main():
for s in datasets():
print(s.upper())
if __name__ == '__main__':
main()
|
[["-", 0, 652, 3, 4, 0, 652, 63, 319, 319, 22], ["+", 0, 652, 3, 4, 0, 652, 63, 319, 319, 22]]
| 5
| 47
| 2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.