problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x;
int i = 1;
while (1) {
cin >> x;
if (x = 0)
break;
cout << "Case " << i << ": " << x << endl;
i++;
}
}
|
#include <iostream>
using namespace std;
int main() {
int x;
int i = 1;
while (1) {
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << endl;
i++;
}
}
|
replace
| 8 | 9 | 8 | 9 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, Case[1000];
Case[0] = 1;
while (1) {
cin >> Case[i];
if (Case[i] == 0) {
break;
}
i++;
}
for (int j = 0; j <= i - 1; j++) {
cout << "Case " << j + 1 << ": " << Case[j] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, Case[10000];
Case[0] = 1;
while (1) {
cin >> Case[i];
if (Case[i] == 0) {
break;
}
i++;
}
for (int j = 0; j <= i - 1; j++) {
cout << "Case " << j + 1 << ": " << Case[j] << endl;
}
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02396
|
C++
|
Time Limit Exceeded
|
// ConsoleApplication3.cpp : コンソール アプリケーションのエントリ
// ポイントを定義します。
//
// #include "stdafx.h"
#include <iostream>
using namespace std;
int main() {
int a, b;
b = 1;
while (1) {
cin >> a;
cout << "Case " << b << ": " << a << endl;
b++;
}
return 0;
}
|
// ConsoleApplication3.cpp : コンソール アプリケーションのエントリ
// ポイントを定義します。
//
// #include "stdafx.h"
#include <iostream>
using namespace std;
int main() {
int a, b;
b = 1;
while (1) {
cin >> a;
if (a == 0) {
break;
} else {
cout << "Case " << b << ": " << a << endl;
b++;
}
}
return 0;
}
|
replace
| 12 | 14 | 12 | 18 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define MAX_N 10000
#define MAX_M 100
typedef long long int ll;
using namespace std;
int main() {
int x;
int i = 0;
while (true) {
scanf("%d", &x);
if (x != 0) {
i++;
printf("Case %s: %d\n", i, x);
} else
break;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define MAX_N 10000
#define MAX_M 100
typedef long long int ll;
using namespace std;
int main() {
int x;
int i = 0;
while (true) {
scanf("%d", &x);
if (x != 0) {
i++;
printf("Case %d: %d\n", i, x);
} else
break;
}
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
-11
| |
p02396
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N[100];
int i = 0;
while (true) {
scanf("%d", &N[i]);
if (N[i] == 0)
break;
i++;
}
for (int j = 0; j < i; j++) {
printf("Case %d: %d\n", j + 1, N[j]);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N[65535];
int i = 0;
while (true) {
scanf("%d", &N[i]);
if (N[i] == 0)
break;
i++;
}
for (int j = 0; j < i; j++) {
printf("Case %d: %d\n", j + 1, N[j]);
}
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p02396
|
C++
|
Time Limit Exceeded
|
/*
* taete.cpp
*
* Created on: 2018/04/26
* Author: J01003
*/
#include <iostream>
using namespace std;
int main() {
int s, t;
s = 1;
while (s > 0) {
cin >> t;
if (t = 0)
break;
cout << "Case"
<< " " << s << ": " << t << endl;
s = s + 1;
}
return 0;
}
|
/*
* taete.cpp
*
* Created on: 2018/04/26
* Author: J01003
*/
#include <iostream>
using namespace std;
int main() {
int s, t;
s = 1;
while (s > 0) {
cin >> t;
if (t == 0)
break;
cout << "Case"
<< " " << s << ": " << t << endl;
s = s + 1;
}
return 0;
}
|
replace
| 15 | 16 | 15 | 16 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int x;
int i = 0;
while ((scanf("%d", &x)) != 0) {
i++;
printf("Case %d: %d\n", i, x);
}
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int x;
int i = 0;
while (cin >> x) {
if (x == 0)
break;
i++;
printf("Case %d: %d\n", i, x);
}
return 0;
}
|
replace
| 8 | 9 | 8 | 11 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
int main() {
for (int i = 1;; i++) {
int x;
scanf("%d", &x);
printf("Case %d: %d\n", i, x);
};
return 0;
}
|
#include <cstdio>
int main() {
for (int i = 1;; i++) {
int x;
scanf("%d", &x);
if (x == 0) {
break;
}
printf("Case %d: %d\n", i, x);
};
return 0;
}
|
insert
| 5 | 5 | 5 | 8 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main() {
int a, b, c, d, i = 0;
while (1) {
scanf("%d", &a);
i++;
printf("Case %d: %d\n", i, a);
}
}
|
#include <stdio.h>
int main() {
int a, b, c, d, i = 0;
while (1) {
scanf("%d", &a);
i++;
if (a == 0)
break;
printf("Case %d: %d\n", i, a);
}
}
|
insert
| 6 | 6 | 6 | 8 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, i;
while (true) {
i++;
cin >> x;
if (x = 0)
break;
cout << "Case " << i << ": " << x << "\n";
}
}
|
#include <iostream>
using namespace std;
int main() {
int x, i;
while (true) {
i++;
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << "\n";
}
}
|
replace
| 10 | 11 | 10 | 11 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int x = 0;
while (1) {
cin >> a;
x = x + 1;
if (a > 0) {
cout << "Case " << x << ": " << a << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int x = 0;
while (1) {
cin >> a;
x = x + 1;
if (a > 0) {
cout << "Case " << x << ": " << a << endl;
}
if (a == 0) {
break;
}
}
}
|
insert
| 11 | 11 | 11 | 14 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
// Copyright 2015 KanatoNagayama
#include <iostream>
#include <vector>
using std ::cin;
using std ::cout;
using std ::endl;
using std ::vector;
int main() {
vector<int> v(1);
int i = 0;
while (true) {
cin >> v[i];
if (v[i] == 0)
break;
i++;
}
for (int k = 0; k < i; k++) {
cout << "Case " << k + 1 << ": " << v[k] << endl;
}
return 0;
}
|
// Copyright 2015 KanatoNagayama
#include <iostream>
#include <vector>
using std ::cin;
using std ::cout;
using std ::endl;
using std ::vector;
int main() {
vector<int> v(10000);
int i = 0;
while (true) {
cin >> v[i];
if (v[i] == 0)
break;
i++;
}
for (int k = 0; k < i; k++) {
cout << "Case " << k + 1 << ": " << v[k] << endl;
}
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
int main() {
int x;
int i = 1;
while (1) {
scanf("%d", &x);
if (x = 0)
break;
printf("Case %d: %d\n", i, x);
i++;
}
return 0;
}
|
#include <cstdio>
int main() {
int x;
int i = 1;
while (1) {
scanf("%d", &x);
if (x == 0)
break;
printf("Case %d: %d\n", i, x);
i++;
}
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int suuji;
int i = 1;
while (true) {
cin >> suuji;
if (suuji != 0) {
cout << "Case " << i << ": " << suuji;
}
i++;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int suuji;
int i = 1;
while (true) {
cin >> suuji;
if (suuji == 0)
break;
cout << "Case " << i << ": " << suuji << endl;
i++;
}
return 0;
}
|
replace
| 9 | 12 | 9 | 12 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int x[100] = {1};
int i = 0;
for (i = 0; i < 100; i++) {
x[i] = 1;
}
i = 1;
while (x[i - 1] != 0) {
cin >> x[i];
i++;
}
i = 1;
while (x[i] != 0) {
cout << "Case " << i << ": " << x[i] << endl;
i++;
}
}
|
#include <iostream>
using namespace std;
int main() {
int x[25565];
x[0] = 1;
int i = 1;
while (x[i - 1] != 0) {
cin >> x[i];
i++;
}
i = 1;
while (x[i] != 0) {
cout << "Case " << i << ": " << x[i] << endl;
i++;
}
}
|
replace
| 4 | 10 | 4 | 7 |
0
| |
p02396
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int x[1000];
x[0] = 1;
for (int i = 1; x[i - 1] != 0; i++) {
cin >> x[i];
cout << "Case " << i << ": " << x[i] << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x;
for (int i = 1;; i++) {
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << endl;
}
return 0;
}
|
replace
| 4 | 9 | 4 | 10 |
0
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
cin >> x;
while (true) {
cout << "Case"
<< " " << i << ":"
<< " " << x << endl;
i = i + 1;
if (x == 0)
break;
}
}
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
cin >> x;
while (true) {
cout << "Case"
<< " " << i << ":"
<< " " << x << endl;
i = i + 1;
cin >> x;
if (x == 0)
break;
}
}
|
insert
| 10 | 10 | 10 | 11 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int buffer, i = 1;
cin >> buffer;
while (buffer != 0) {
cout << "Case " << i << ": " << buffer << endl;
i++;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int buffer, i = 1;
cin >> buffer;
while (buffer != 0) {
cout << "Case " << i << ": " << buffer << endl;
cin >> buffer;
i++;
}
return 0;
}
|
insert
| 8 | 8 | 8 | 9 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main(void) {
int x, i = 0;
while (1) {
cin >> x;
if (x != 0) {
cout << "Case " << ++i << ": " << x << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int x, i = 0;
while (1) {
cin >> x;
if (x != 0) {
cout << "Case " << ++i << ": " << x << endl;
} else {
break;
}
}
return 0;
}
|
insert
| 10 | 10 | 10 | 12 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1;; i++) {
int x;
cin >> x;
cout << "Case " << i << ": " << x << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1;; i++) {
int x;
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << endl;
}
}
|
insert
| 9 | 9 | 9 | 11 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int x[10000];
int n = 0;
while (true) {
if (n > 9999)
return -1;
cin >> x[n];
if (x[n] == 0)
break;
++n;
}
for (int i = 0; i < n; ++i) {
cout << "Case " << i + 1 << ": " << x[i] << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x[10000];
int n = 0;
while (true) {
// if (n>9999) return -1;
cin >> x[n];
if (x[n] == 0)
break;
++n;
}
for (int i = 0; i < n; ++i) {
cout << "Case " << i + 1 << ": " << x[i] << endl;
}
return 0;
}
|
replace
| 8 | 10 | 8 | 9 |
0
| |
p02396
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int x[1000], i = 0;
do {
cin >> x[i];
} while (x[i++] != 0);
int k = 0;
while (k < i - 1) {
cout << "Case " << k + 1 << ": " << x[k] << endl;
k++;
}
}
|
#include <iostream>
using namespace std;
int main() {
int x[10000], i = 0;
do {
cin >> x[i];
} while (x[i++] != 0);
int k = 0;
while (k < i - 1) {
cout << "Case " << k + 1 << ": " << x[k] << endl;
k++;
}
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
while (1) {
cin >> x;
cout << "Case"
<< " " << i << ":"
<< " " << x << endl;
i++;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
while (1) {
cin >> x;
if (x == 0) {
break;
}
cout << "Case"
<< " " << i << ":"
<< " " << x << endl;
i++;
}
return 0;
}
|
insert
| 6 | 6 | 6 | 9 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
for (int x, i = 1;; i++) {
cin >> x;
cout << "Case " << i << ": " << x << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (int x, i = 1;; i++) {
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << endl;
}
return 0;
}
|
insert
| 5 | 5 | 5 | 7 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int i, x;
for (i = 1;; i++) {
cin >> x;
if (x = 0)
break;
cout << "Case " << i << ": " << x << endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int i, x;
for (i = 1;; i++) {
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << endl;
}
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
for (cin >> x; x > 0; i = i + 1) {
cout << "case " << i << ": " << x << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
cin >> x;
while (x > 0) {
cout << "Case " << i << ": " << x << endl;
i++;
cin >> x;
}
}
|
replace
| 5 | 7 | 5 | 10 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
for (int count = 1;; ++count) {
int input;
cin >> input;
cout << "Case " << count << ":"
<< " " << input << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (int count = 1;; ++count) {
int input;
cin >> input;
if (input == 0) {
break;
}
cout << "Case " << count << ":"
<< " " << input << endl;
}
return 0;
}
|
insert
| 6 | 6 | 6 | 9 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1;; ++i) {
int x;
cin >> x;
cout << "Case " << i << ": " << x;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1;; ++i) {
int x;
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << endl;
}
return 0;
}
|
replace
| 6 | 7 | 6 | 9 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main() {
int i = 1;
int x;
while (1) {
if (scanf("%d", &x) == 0)
break;
printf("Case %d: %d\n", i, x);
i++;
}
}
|
#include <stdio.h>
int main() {
int i = 1;
int x;
while (1) {
scanf("%d", &x);
if (x == 0)
break;
printf("Case %d: %d\n", i, x);
i++;
}
}
|
replace
| 6 | 7 | 6 | 8 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
#include <stdio.h>
int main() {
int num[10000], n;
n = 0;
while (1) {
scanf("%d", &num[n]);
if (num[n] == 0)
break;
n = n + 1;
}
while (num[n] != 0, n++) {
printf("Case %d: %d\n", n, num[n]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int num[10000], n;
n = 0;
while (1) {
scanf("%d", &num[n]);
if (num[n] == 0)
break;
n = n + 1;
}
n = 0;
while (num[n] != 0) {
printf("Case %d: %d\n", n + 1, num[n]);
n = n + 1;
}
return 0;
}
|
replace
| 10 | 12 | 10 | 14 |
-11
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x;
int count = 1;
cin >> x;
while (x != 0) {
cout << "Case " << count << ":" << x << endl;
count++;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x;
int count = 1;
cin >> x;
while (x != 0) {
cout << "Case " << count << ": " << x << endl;
cin >> x;
count++;
}
return 0;
}
|
replace
| 8 | 9 | 8 | 10 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> x(1000);
int i = 0;
while (1) {
int flag = 1;
cin >> x[i];
if (x[i] == 0) {
break;
}
i++;
}
for (int t = 0; t < i; t++) {
cout << "Case " << t + 1 << ": " << x[t] << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> x(10000);
int i = 0;
while (1) {
int flag = 1;
cin >> x[i];
if (x[i] == 0) {
break;
}
i++;
}
for (int t = 0; t < i; t++) {
cout << "Case " << t + 1 << ": " << x[t] << endl;
}
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
0
| |
p02396
|
C++
|
Runtime Error
|
#include <stdio.h>
int main() {
int a[100], aa = 0, i;
for (i = 0; aa < 1; i++) {
scanf("%d", &a[i]);
if (a[i] == 0) {
aa = 2;
}
}
for (int j = 1; j < i; j++) {
printf("Case %d: %d\n", j, a[j - 1]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a[1000000], aa = 0, i;
for (i = 0; aa < 1; i++) {
scanf("%d", &a[i]);
if (a[i] == 0) {
aa = 2;
}
}
for (int j = 1; j < i; j++) {
printf("Case %d: %d\n", j, a[j - 1]);
}
return 0;
}
|
replace
| 2 | 3 | 2 | 3 |
0
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int i = 1;
while (x != 0) {
cout << "Case " << i << ": " << x << endl;
i++;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int i = 1;
while (x != 0) {
cout << "Case " << i << ": " << x << endl;
cin >> x;
i++;
}
return 0;
}
|
insert
| 10 | 10 | 10 | 11 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a = 1, b;
while (true) {
cin >> b;
if (b = 0)
break;
cout << "Case " << a << ": " << b << endl;
a++;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a = 1, b;
while (true) {
cin >> b;
if (b == 0)
break;
cout << "Case " << a << ": " << b << endl;
a++;
}
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, i = 1;
cin >> x;
while (x != 0) {
cout << "Case" << i << ":" << x << "\n";
i++;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
for (int i = 1; i >= 0; i++) {
cin >> n;
if (n == 0)
break;
cout << "Case " << i << ": " << n << "\n";
}
return 0;
}
|
replace
| 4 | 9 | 4 | 10 |
TLE
| |
p02396
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int a;
for (int b = 1; scanf("%d", &a); b++) {
printf("Case %d: %d\n", b, a);
}
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int a;
for (int b = 1; scanf("%d", &a), a; b++) {
printf("Case %d: %d\n", b, a);
}
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p02396
|
C++
|
Runtime Error
|
// Copyright 2015 KanatoNagayama
#include <iostream>
#include <vector>
using std ::cin;
using std ::cout;
using std ::endl;
using std ::vector;
int main() {
vector<int> v(5000);
int i = 0;
while (true) {
cin >> v[i];
if (v[i] == 0)
break;
i++;
}
for (int k = 0; k < i; k++) {
cout << "Case " << k + 1 << ": " << v[k] << endl;
}
return 0;
}
|
// Copyright 2015 KanatoNagayama
#include <iostream>
#include <vector>
using std ::cin;
using std ::cout;
using std ::endl;
using std ::vector;
int main() {
vector<int> v(100000);
int i = 0;
while (true) {
cin >> v[i];
if (v[i] == 0)
break;
i++;
}
for (int k = 0; k < i; k++) {
cout << "Case " << k + 1 << ": " << v[k] << endl;
}
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
using namespace std;
int main() {
while (1) {
int i, j;
cin >> i >> j;
if (i <= j) {
cout << i << " " << j << endl;
} else {
cout << j << " " << i << endl;
}
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
using namespace std;
int main() {
while (1) {
int i, j;
cin >> i >> j;
if (i == 0 && j == 0) {
break;
} else if (i <= j) {
cout << i << " " << j << endl;
} else {
cout << j << " " << i << endl;
}
}
return 0;
}
|
replace
| 9 | 10 | 9 | 12 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main(void) {
int x, y, t;
while (1) {
cin >> x >> y;
if (x > y) {
t = x;
x = y;
y = t;
}
cout << x << " " << y << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int x, y, t;
while (1) {
cin >> x >> y;
if (x == 0 && y == 0) {
break;
} else if (x > y) {
t = x;
x = y;
y = t;
}
cout << x << " " << y << endl;
}
return 0;
}
|
replace
| 7 | 8 | 7 | 10 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x;
int y;
int i = 0;
while (i >= 0) {
cin >> x >> y;
if (x <= y) {
cout << x << " " << y << endl;
} else {
cout << y << " " << x << endl;
}
i++;
}
}
|
#include <iostream>
using namespace std;
int main() {
int x;
int y;
int i = 0;
while (i >= 0) {
cin >> x >> y;
if ((x == 0) && (y == 0))
break;
if (x <= y) {
cout << x << " " << y << endl;
} else {
cout << y << " " << x << endl;
}
i++;
}
}
|
insert
| 9 | 9 | 9 | 11 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, y;
while (1) {
cin >> x >> y;
if (x = 0, y = 0) {
break;
} else if (x <= y) {
cout << x << " " << y << endl;
} else if (x > y) {
cout << y << " " << x << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, y;
while (1) {
cin >> x >> y;
if (x == 0 && y == 0) {
break;
} else if (x <= y) {
cout << x << " " << y << endl;
} else if (x > y) {
cout << y << " " << x << endl;
}
}
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p02397
|
C++
|
Runtime Error
|
#include <cstdio>
int main() {
int x, y;
while (1) {
scanf("%d %d", x, y);
if (x == 0 && y == 0)
break;
if (x > y) {
printf("%d %d\n", y, x);
} else {
printf("%d %d\n", x, y);
}
}
return 0;
}
|
#include <cstdio>
int main() {
int x, y;
while (1) {
scanf("%d %d", &x, &y);
if (x == 0 && y == 0)
break;
if (x > y) {
printf("%d %d\n", y, x);
} else {
printf("%d %d\n", x, y);
}
}
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
-11
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, y;
for (;;) {
cin >> x >> y;
if (x > y) {
cout << y << " " << x << endl;
} else if (x <= y) {
cout << x << " " << y << endl;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int x, y;
for (;;) {
cin >> x >> y;
if (x < 1 && y < 1) {
return 0;
}
if (x > y) {
cout << y << " " << x << endl;
} else if (x <= y) {
cout << x << " " << y << endl;
}
}
}
|
insert
| 6 | 6 | 6 | 9 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int in1, in2;
cin >> in1 >> in2;
while ((in1 != 0) || (in2 != 0)) {
if (in1 < in2)
cout << in1 << ' ' << in2 << endl;
else
cout << in2 << ' ' << in1 << endl;
cin >> in1, in2;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int in1, in2;
cin >> in1 >> in2;
while ((in1 != 0) || (in2 != 0)) {
if (in1 < in2)
cout << in1 << ' ' << in2 << endl;
else
cout << in2 << ' ' << in1 << endl;
cin >> in1 >> in2;
}
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, y;
while (true) {
cin >> x >> y;
if ((x | y) != 0) {
if (x < y) {
cout << x << " " << y << endl;
} else {
cout << y << " " << x << endl;
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, y;
while (true) {
cin >> x >> y;
if ((x | y) != 0) {
if (x < y) {
cout << x << " " << y << endl;
} else {
cout << y << " " << x << endl;
}
} else {
break;
}
}
return 0;
}
|
insert
| 13 | 13 | 13 | 15 |
TLE
| |
p02397
|
C++
|
Runtime Error
|
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string input;
int num[2];
int counter = 0;
istringstream stream(input);
while (getline(cin, input)) {
stream.str("");
stream.clear(stringstream::goodbit);
stream.str(input);
stream >> num[0] >> num[1];
if (num[0] == 0 && num[1] == 0)
break;
else if (num[0] <= num[1])
cout << num[0] << " " << num[1] << "\n";
else
cout << num[1] << " " << num[0] << "\n";
}
return 1;
}
|
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string input;
int num[2];
int counter = 0;
istringstream stream(input);
while (getline(cin, input)) {
stream.str("");
stream.clear(stringstream::goodbit);
stream.str(input);
stream >> num[0] >> num[1];
if (num[0] == 0 && num[1] == 0)
break;
else if (num[0] <= num[1])
cout << num[0] << " " << num[1] << "\n";
else
cout << num[1] << " " << num[0] << "\n";
}
}
|
delete
| 27 | 29 | 27 | 27 |
1
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main() {
int x, y;
for (;;) {
scanf("%d %d", &x, &y);
if (x < y) {
printf("%d %d\n", x, y);
} else if (y < x) {
printf("%d %d\n", y, x);
} else if (x == y) {
printf("%d %d\n", x, y);
} else if (x == 0 && y == 0) {
break;
}
}
return 0;
}
|
#include <stdio.h>
int main() {
int x, y;
for (;;) {
scanf("%d %d", &x, &y);
if (x < y) {
printf("%d %d\n", x, y);
} else if (y < x) {
printf("%d %d\n", y, x);
} else if (x == y && x != 0 && y != 0) {
printf("%d %d\n", x, y);
} else if (x == 0 && y == 0) {
break;
}
}
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, emp;
for (int i = 1;; i++) {
cin >> a >> b;
if (a > b) {
emp = a;
a = b;
b = emp;
cout << a << " " << b << endl;
} else
cout << a << " " << b << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, emp;
for (int i = 1;; i++) {
cin >> a >> b;
if (a == 0 && b == 0)
break;
if (a > b) {
emp = a;
a = b;
b = emp;
cout << a << " " << b << endl;
} else
cout << a << " " << b << endl;
}
return 0;
}
|
insert
| 6 | 6 | 6 | 8 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#define _GRIBCXX_DEBUG
#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>
using namespace std;
// ?????¬???????????¬??????
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) != (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), c.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<double> vd;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<long, long> pil;
// ??°?????????????????¬??????
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight
: e.src != f.src ? e.src < f.src
: e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
typedef vector<Weight> Array;
typedef vector<Array> Matrix;
int main() {
int a, b;
while (scanf("%d %d", &a, &b)) {
printf("%d %d\n", min(a, b), max(a, b));
}
return 0;
}
|
#define _GRIBCXX_DEBUG
#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>
using namespace std;
// ?????¬???????????¬??????
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) != (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), c.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<double> vd;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<long, long> pil;
// ??°?????????????????¬??????
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight
: e.src != f.src ? e.src < f.src
: e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
typedef vector<Weight> Array;
typedef vector<Array> Matrix;
int main() {
int a, b;
while (true) {
scanf("%d %d", &a, &b);
if (a == 0 && b == 0)
break;
else
printf("%d %d\n", min(a, b), max(a, b));
}
return 0;
}
|
replace
| 58 | 60 | 58 | 64 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main() {
for (int i = 0;; i++) {
int a, b, r;
scanf("%d %d", &a, &b);
if (a > b) {
r = a;
a = b;
b = r;
}
printf("%d %d\n", a, b);
}
}
|
#include <stdio.h>
int main() {
for (int i = 0;; i++) {
int a, b, r;
scanf("%d %d", &a, &b);
if ((a == 0) && (b == 0))
break;
if (a > b) {
r = a;
a = b;
b = r;
}
printf("%d %d\n", a, b);
}
}
|
insert
| 5 | 5 | 5 | 7 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
while (x | y) {
if (x < y)
cout << x << " " << y << endl;
else
cout << y << " " << x << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, y;
for (cin >> x >> y; x | y; cin >> x >> y) {
if (x < y)
cout << x << " " << y << endl;
else
cout << y << " " << x << endl;
}
return 0;
}
|
replace
| 6 | 8 | 6 | 7 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
while (true) {
int x, y;
cin >> x;
cin >> y;
int small, large;
if (x < y) {
small = x;
large = y;
} else {
small = y;
large = x;
}
cout << small << " " << large << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
while (true) {
int x, y;
cin >> x;
cin >> y;
if (x == 0 && y == 0) {
break;
}
int small, large;
if (x < y) {
small = x;
large = y;
} else {
small = y;
large = x;
}
cout << small << " " << large << endl;
}
}
|
insert
| 13 | 13 | 13 | 17 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main(void) {
int x, y;
scanf("%d%d", &x, &y);
while (x != 0 || y != 0) {
printf("%d %d\n", x < y ? x : y, x < y ? y : x);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int x, y;
scanf("%d%d", &x, &y);
while (x != 0 || y != 0) {
printf("%d %d\n", x < y ? x : y, x < y ? y : x);
scanf("%d%d", &x, &y);
}
return 0;
}
|
insert
| 8 | 8 | 8 | 9 |
TLE
| |
p02397
|
C++
|
Runtime Error
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int x[3000], y[3000];
int i = 0;
int swap;
for (i = 0; i < 100000; ++i) {
scanf("%d%d", x[i], y[i]);
if (x[i] == 0 && y[i] == 0)
break;
if (x[i] > y[i]) {
swap = x[i];
x[i] = y[i];
y[i] = swap;
}
}
for (int j = 0; j < i; ++j)
cout << x[j] << " " << y[j] << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int x[3000], y[3000];
int i = 0;
int swap;
for (i = 0; i < 100000; ++i) {
scanf("%d%d", &x[i], &y[i]);
if (x[i] == 0 && y[i] == 0)
break;
if (x[i] > y[i]) {
swap = x[i];
x[i] = y[i];
y[i] = swap;
}
}
for (int j = 0; j < i; ++j)
cout << x[j] << " " << y[j] << endl;
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
-11
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int x, y;
cin >> x >> y;
if (x > y)
swap(x, y);
cout << x << " " << y << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int x, y;
cin >> x >> y;
if (x == 0 && y == 0)
break;
if (x > y)
swap(x, y);
cout << x << " " << y << endl;
}
return 0;
}
|
insert
| 8 | 8 | 8 | 11 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, y, p;
for (;;) {
cin >> x >> y;
if (x > y) {
p = x;
x = y;
y = p;
}
if (x && y == 0)
break;
cout << x << " " << y << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, y, p;
for (;;) {
cin >> x >> y;
if (x > y) {
p = x;
x = y;
y = p;
}
if (x == 0 && y == 0)
break;
cout << x << " " << y << endl;
}
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p02397
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int x, y;
cin >> x, y;
if (x == 0 && y == 0)
break;
if (x > y)
swap(x, y);
cout << x << " " << y << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int x, y;
cin >> x >> y;
if (x == 0 && y == 0)
break;
if (x > y)
swap(x, y);
cout << x << " " << y << endl;
}
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count = 0;
for (int i = a; a <= b; i++)
if (c % i == 0)
count++;
cout << count << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count = 0;
for (int i = a; i <= b; i++)
if (c % i == 0)
count++;
cout << count << endl;
}
|
replace
| 8 | 9 | 8 | 9 |
TLE
| |
p02398
|
C++
|
Runtime Error
|
// class point の練習（クラスの高度な実装）
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int cnt = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c / i % 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
|
// class point の練習（クラスの高度な実装）
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int cnt = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
-8
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int x = a; x <= b; cnt++) {
if (c % x == 0)
cnt++;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int x = a; x <= b; x++) {
if (c % x == 0)
cnt++;
}
cout << cnt << endl;
}
|
replace
| 7 | 8 | 7 | 8 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
d = 0;
for (a < b; a++;) {
if (a % c == 0) {
d++;
}
}
printf("%d\n", d);
}
|
#include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
d = 0;
for (a; a <= b; a++) {
if (c % a == 0) {
d++;
}
}
printf("%d\n", d);
}
|
replace
| 6 | 8 | 6 | 8 |
TLE
| |
p02398
|
C++
|
Runtime Error
|
#include <stdio.h>
int main() {
int a, b, c, i, d = 0;
scanf("%d %d %d", &a, &b);
for (i = a; i < b; i++) {
if ((c % i) == 0)
d++;
}
printf("%d\n", d);
return 0;
}
|
#include <stdio.h>
int main() {
int a, b, c, i, d = 0;
scanf("%d %d %d", &a, &b, &c);
for (i = a; i <= b; i++) {
if ((c % i) == 0)
d++;
}
printf("%d\n", d);
return 0;
}
|
replace
| 3 | 5 | 3 | 5 |
-11
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, t = 0;
cin >> a >> b >> c;
for (int x = a; a <= b; x++) {
if (c % x == 0)
t++;
}
cout << t << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, t = 0;
cin >> a >> b >> c;
for (int x = a; x <= b; x++) {
if (c % x == 0)
t++;
}
cout << t << endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int x;
int n = 0;
while (1) {
cin >> a >> b >> c;
if (a < b)
break;
}
for (x = a; x <= b; x++) {
if (c % x == 0)
n++;
}
cout << n << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int x;
int n = 0;
while (1) {
cin >> a >> b >> c;
if (a <= b)
break;
}
for (x = a; x <= b; x++) {
if (c % x == 0)
n++;
}
cout << n << endl;
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main() {
int a, b, c;
int i;
int ans = 0;
scanf("%d %d %d", &a, &b, &c);
for (i = a; i <= (b < (c / 2)) ? b : (c / 2); i++) {
if (c % i == 0)
ans++;
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main() {
int a, b, c;
int i;
int ans = 0;
scanf("%d %d %d", &a, &b, &c);
for (i = a; i <= b; i++) {
if (c % i == 0)
ans++;
}
printf("%d\n", ans);
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, x, y = 0;
cin >> a >> b >> c;
for (x = a; x <= b, x++;) {
if (c % x == 0)
y++;
}
cout << y << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, x, y = 0;
cin >> a >> b >> c;
for (x = a; x <= b; x++) {
if (c % x == 0)
y++;
}
cout << y << endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int n = 0;
cin >> a >> b >> c;
while (1) {
if (c % a == 0) {
n++;
}
if (a == b) {
break;
}
}
cout << n << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int n = 0;
cin >> a >> b >> c;
while (1) {
if (c % a == 0) {
n++;
}
if (a == b) {
break;
}
a++;
}
cout << n << endl;
return 0;
}
|
insert
| 14 | 14 | 14 | 15 |
TLE
| |
p02398
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, n = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
n++;
}
return n;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, n = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
return 0;
}
|
replace
| 12 | 13 | 12 | 15 |
3
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, s = 0;
cin >> a >> b >> c;
for (int i = a; a <= b; i++) {
if (c % i == 0)
s++;
}
cout << s << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, s = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
s++;
}
cout << s << endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int count = 0;
cin >> a >> b >> c;
if (c % a == 0)
count += 1;
while (++a != b) {
if (c % a == 0)
count++;
}
cout << count << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int count = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
count += 1;
}
cout << count << endl;
}
|
replace
| 6 | 11 | 6 | 9 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int x, y, z;
int i, l;
l = 0;
cin >> x;
cin >> y;
cin >> z;
for (i = x; i <= y; i++) {
if ((z % i) == 0) {
l++;
}
}
cout << l << endl;
while (1)
;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, y, z;
int i, l;
l = 0;
cin >> x;
cin >> y;
cin >> z;
for (i = x; i <= y; i++) {
if ((z % i) == 0) {
l++;
}
}
cout << l << endl;
return 0;
}
|
delete
| 22 | 25 | 22 | 22 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int count = 0;
cin >> a >> b >> c;
for (int i = a; a <= b; i++) {
if (c % i == 0) {
count++;
}
}
cout << count << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int count = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0) {
count++;
}
}
cout << count << endl;
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, t;
cin >> a >> b >> c;
for (int x = a; x <= b; ++a) {
if (c % x == 0)
++t;
}
cout << t << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, t;
cin >> a >> b >> c;
for (int x = a; x <= b; ++x) {
if (c % x == 0)
++t;
}
cout << t << endl;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int i;
int n = 0;
cin >> a;
cin >> b;
cin >> c;
for (int i = a; a <= i <= b; i++) {
if (c % i == 0) {
n++;
}
}
cout << n << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int i;
int n = 0;
cin >> a;
cin >> b;
cin >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0) {
n++;
}
}
cout << n << endl;
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, sum;
cin >> a >> b >> c;
sum = 0;
for (int i = a; a <= b; i++) {
if (i % c == 0)
sum++;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, sum;
cin >> a >> b >> c;
sum = 0;
for (int i = a; i <= b; i++) {
if (c % i == 0)
sum++;
}
cout << sum << endl;
return 0;
}
|
replace
| 8 | 10 | 8 | 10 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, cnt = 0;
cin >> a >> b >> c;
for (int i = a; a <= b; i++) {
if (c % i == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, cnt = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p02398
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, n = 0;
cin >> a >> b >> c;
for (int i = 0; i <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, n = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
-8
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, count = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; a++)
if (c % i == 0)
count++;
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, count = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++)
if (c % i == 0)
count++;
cout << count << endl;
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
for (; a != b; b++) {
if (c % b == 0)
d += 1;
}
cout << d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
d += 1;
}
cout << d << endl;
return 0;
}
|
replace
| 7 | 9 | 7 | 9 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
int count = 0;
cin >> a >> b >> c;
while (a <= b) {
if (c % a == 0)
a++;
count++;
}
cout << count << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
int count = 0;
cin >> a >> b >> c;
while (a <= b) {
if (c % a == 0)
count++;
a++;
}
cout << count << endl;
return 0;
}
|
replace
| 13 | 15 | 13 | 15 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, i, cnt;
cin >> a >> b >> c;
for (i = a; a <= b; i++) {
if (i % c == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, i, cnt;
cin >> a >> b >> c;
for (i = a; i <= b; i++) {
if (c % i == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
|
replace
| 6 | 8 | 6 | 8 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, count;
cin >> a >> b >> c;
for (int i = a; i <= b; i + 1) {
if (c % i == 0) {
count = count + 1;
}
}
cout << count << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, count;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0) {
count = count + 1;
}
}
cout << count << endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, x;
int y = 0;
cin >> a >> b >> c;
for (x = a; a <= b; x++) {
if (c % x == 0) {
y += 1;
}
}
cout << y << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, x;
int y = 0;
cin >> a >> b >> c;
for (x = a; x <= b; x++) {
if (c % x == 0) {
y += 1;
}
}
cout << y << endl;
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
#define MAX 10000
int main(void) {
int a, b, c, count;
do {
cin >> a >> b >> c;
} while (a < 1 || a > MAX || b < 1 || b > MAX || c < 1 || c > MAX || a > b);
for (int i = a; a <= b; i++) {
if (c % i == 0)
count++;
}
cout << count << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX 10000
int main(void) {
int a, b, c, count;
do {
cin >> a >> b >> c;
} while (a < 1 || a > MAX || b < 1 || b > MAX || c < 1 || c > MAX || a > b);
for (int i = a; i <= b; i++) {
if (c % i == 0)
count++;
}
cout << count << endl;
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
TLE
| |
p02398
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, n = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
return 100;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, n = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
100
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, i, n;
cin >> a >> b >> c;
n = 0;
for (i = a; i = b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, i, n;
cin >> a >> b >> c;
n = 0;
for (i = a; i <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
}
|
replace
| 11 | 12 | 11 | 12 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
int i;
int x = 0;
cin >> a >> b >> c;
for (i = a; i++; i <= b) {
if (c % i == 0) {
x++;
}
}
cout << x << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
int i;
int x = 0;
cin >> a >> b >> c;
for (i = a; i <= b; i++) {
if (c % i == 0) {
x++;
}
}
cout << x << endl;
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> a >> b >> c;
n = 0;
for (int i = a; a <= b; i++) {
if (c % i == 0)
n++;
}
cout << n << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> a >> b >> c;
n = 0;
for (a; a <= b; a++) {
if (c % a == 0)
n++;
}
cout << n << endl;
}
|
replace
| 9 | 11 | 9 | 11 |
TLE
| |
p02398
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = a; i <= b; c++) {
if (c % i == 0) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = a; i <= b; i++) {
if (c % i == 0) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
TLE
| |
p02399
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
long d = a / b;
long r = a % b;
cout << d << " " << r << " " << d << ".";
for (int i = 0; i < 5; ++i) {
int k = -1;
while (r < b) {
r *= 10;
++k;
}
long rr = r / b;
r %= b;
for (int j = 0; j < k; ++j)
cout << 0;
cout << rr;
}
cout << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
long d = a / b;
long r = a % b;
cout << d << " " << r << " " << d << ".";
for (int i = 0; i < 5; ++i) {
int k = -1;
while (r != 0 && r < b) {
r *= 10;
++k;
}
long rr = r / b;
r %= b;
for (int j = 0; j < k; ++j)
cout << 0;
cout << rr;
}
cout << endl;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p02399
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(12);
int a, b;
cin >> a, b;
cout << a / b << " " << a % b << " " << (double)a / b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(12);
int a, b;
cin >> a >> b;
cout << a / b << " " << a % b << " " << (double)a / b << endl;
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p02399
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
int d = a / b;
int r = a % b;
double f = 1.0 * a / b;
printf("%d %d %.5lf\n", d, r, f);
// while(1);
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int d = a / b;
int r = a % b;
double f = 1.0 * a / b;
printf("%d %d %.5lf\n", d, r, f);
// while(1);
return 0;
}
|
insert
| 19 | 19 | 19 | 20 |
0
| |
p02399
|
C++
|
Runtime Error
|
#include <cstdio>
int main() {
float a, b;
scanf("%lf%lf", &a, &b);
printf("%d %d %lf\n", (int)(a / b), (int)a % (int)b, a / b);
return 0;
}
|
#include <cstdio>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d %d %lf\n", a / b, a % b, (double)a / b);
return 0;
}
|
replace
| 3 | 6 | 3 | 6 |
-8
| |
p02399
|
C++
|
Runtime Error
|
// Tuvshee
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define I int
#define D double
#define F float
#define C char
#define S string
#define B bool
#define L long long
#define rep(n) for (int i = 0; i < n; i++)
#define reps(m, n, c) for (int c = m; c < n; c++)
#define repd(m, n, j) for (int j = n; j > m; j--)
#define whL while
#define eL endl
#define oR ||
#define anD &&
#define rtn return
#define pause system("PAUSE")
#define Max 300
#define max(m, n) ((n < m) ? m : n)
#define min(m, n) ((n > m) ? m : n)
int main() {
I m, n;
cin >> m >> n;
cout << m / n << ' ' << m % n << ' ' << setprecision(5) << fixed
<< double(m) / n << eL;
pause;
rtn 0;
}
|
// Tuvshee
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define I int
#define D double
#define F float
#define C char
#define S string
#define B bool
#define L long long
#define rep(n) for (int i = 0; i < n; i++)
#define reps(m, n, c) for (int c = m; c < n; c++)
#define repd(m, n, j) for (int j = n; j > m; j--)
#define whL while
#define eL endl
#define oR ||
#define anD &&
#define rtn return
#define pause system("PAUSE")
#define Max 300
#define max(m, n) ((n < m) ? m : n)
#define min(m, n) ((n > m) ? m : n)
int main() {
I m, n;
cin >> m >> n;
cout << m / n << ' ' << m % n << ' ' << setprecision(5) << fixed
<< double(m) / n << eL;
rtn 0;
}
|
delete
| 36 | 37 | 36 | 36 |
0
|
sh: 1: PAUSE: not found
|
p02399
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
printf("%d %d %.5f\n", a / b, a % b, (double)a / b);
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
printf("%d %d %.5f\n", a / b, a % b, (double)a / b);
}
|
insert
| 9 | 9 | 9 | 10 |
0
| |
p02399
|
C++
|
Runtime Error
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
printf("%d %d %f\n", a / b, a % b, (double)a / b);
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
printf("%d %d %f\n", a / b, a % b, (double)a / b);
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p02399
|
C++
|
Runtime Error
|
#include <cstdio>
using namespace std;
int main(void) {
int a, b;
scanf("%d%d", a, b);
printf("%d %d %.5f", a / b, a % b, (double)a / (double)b);
return 0;
}
|
#include <cstdio>
using namespace std;
int main(void) {
int a, b;
scanf("%d%d", &a, &b);
printf("%d %d %.5f", a / b, a % b, (double)a / (double)b);
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
-11
| |
p02399
|
C++
|
Runtime Error
|
#include <stdio.h>
int main() {
int a, b, c, d;
double f;
scanf("%d %d", &a, &b);
c = a / b;
d = a % d;
f = a / d;
printf("%d %d %d\n", c, d, f);
return 0;
}
|
#include <stdio.h>
main() {
int a, b;
double c;
scanf("%d%d", &a, &b);
c = (double)a / b;
printf("%d %d %f\n", a / b, a % b, c);
return 0;
}
|
replace
| 1 | 9 | 1 | 9 |
0
| |
p02399
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(12);
int a, b;
cout << a / b << " ";
cout << a % b << " ";
cout << (double)a / b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(12);
int a, b;
cin >> a >> b;
cout << a / b << " ";
cout << a % b << " ";
cout << (double)a / b << endl;
return 0;
}
|
insert
| 8 | 8 | 8 | 9 |
0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.