Search is not available for this dataset
name stringlengths 2 88 | description stringlengths 31 8.62k | public_tests dict | private_tests dict | solution_type stringclasses 2
values | programming_language stringclasses 5
values | solution stringlengths 1 983k |
|---|---|---|---|---|---|---|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <stdio.h>
int main(void)
{
int t[4];
int n[4];
int i;
for(i=0;i<4;i++)
scanf("%d %d",&t[i],&n[i]);
for(i=0;i<4;i++){
switch(v[i])}
case 1:t[i]=6000; break;
case 2:t[i]=4000; break;
case 3:t[i]=3000; break;
case 4:t[i]=2000: break;
}
}
for(i=0;i<4;i++)
printf("%d\n",t[i]*n[i]);
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int t;
int n;
int kingaku;
public void kei(){
t = sc.nextInt();
n = sc.nextInt();
switch(t){
case 1:
kingaku = 6000 * n;
break;
case 2:
kingaku = 4000 * n;
break;
case 3:
k... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int data[] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
int t, n;
scanf("%d %d", &t, &n);
printf("%d\n", data[t] * n);
}
return 0;
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java |
public class Main {
public static void main(String[] args) {
int k;
int []intake = new int[4];
int inatai;
int []atai={3,1,4,2};
int []maisu={10,4,1,5};
for(k=0;k<=4;k++){
switch(atai[k]){
case 1:inatai = 6000*maisu[k];break;
case 2:inatai = 4000*maisu[k];break;
case 3:inatai = 3000*maisu[k];break;
case 4:inatai ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | /* ファイル名：問題２
2712 影山加純
*/
import java.util.Scanner;
class Main2{
int tiket[]={0,6000,4000,3000,2000};
int t,n,uriage;
public void solve(){
Scanner sc=new Scanner(System.in);
for(int i=0;i<4;i++){
t=sc.nextInt();
n=sc.nextInt();
uriage=tiket[t]*n;
System.out.println(u... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
int t[4];
int n[4];
int i;
for (i = 0; i < 4; i++) scanf("%d %d", &t[i], &n[i]);
for (i = 0; i < 4; i++) {
if (t[i] == 1) t[i] = 6000;
if (t[i] == 2) t[i] = 4000;
if (t[i] == 3) t[i] = 3000;
if (t[i] == 4) t[i] = 1000;
}
for (i = 0; i < 4; i++) pri... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int koka[] = {1, 5, 10, 50, 100, 500};
int c;
for (int i = 0; i < 6; i++) {
int c;
cin >> c;
sum += c * koka[i];
}
if (sum >= 1000) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
cout << (sum >= 1000 ? ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int ticket[] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 7; i++) {
int t, n;
cin >> t >> n;
cout << ticket[t - 1] * n << endl;
}
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <stdio.h>
int main(void)
{
int t[4];
int n[4];
int i;
for(i=0;i<4;i++)
scanf("%d %d",&t[i],&n[i]);
for(i=0;i<4;i++){
switch(t[i]){
case 1:t[i]=6000; break;
case 2:t[i]=4000; break;
case 3:t[i]=3000; break;
case 4:t[i]=2000: break;
}
}
for(i=0;i<4;i++)
printf("%d\n",t[i]*n[i]);
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int>> price;
for (int i = 0; i < 4; ++i) {
int a, b;
cin >> a;
cin >> b;
price.push_back(make_pair(a, b));
}
int sabc;
for (pair<int, int> e : price) {
if (e.first == 1) {
sabc = 6000 * e.second;
} else i... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
ostream& _ost = cout;
template <class T>
ostream& operator,(ostream& ost, const T& value) {
return ost << value << ",";
}
ostream& operator~(ostream& ost) { return ost << endl; }
template <class T>
string tos(const T& var) {
ostringstream ss;
ss << var;
return ss.st... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
int seki[5], t, n;
seki[1] = 6000;
seki[2] = 4000;
seki[3] = 3000;
seki[4] = 2000;
scanf("%d %d", &t, &n);
printf("%d\n", seki[t] * n);
return 0;
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
class Main{
public void open(){System.out.println("Ｏｐｅｎ");}
public void close(){System.out.println("Ｃｌｏｓｅ");}
public void run(){
Scanner sc = new Scanner(System.in);
String state = sc.nextLine();
if(state.equals("1 0 0"))close();
else if(state.equals("0 1 0"))close();
else i... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int[] kingaku = new int [4];
int n;
public void syurui(){
for(n = 0;n <= 3;n++){
int syurui = sc.nextInt();
int maisu = sc.nextInt();
int kane;
switch(syurui){
case 1:
kane = 2000;
kingaku[n] = kane *... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int kingaku;
int[] goukei = new int[4];
int n;
public void syurui(){
for (n = 0; n <= 3;n++){
int syurui = sc.nextInt();
int maisuu = sc.nextInt();
switch(syurui){
case 1: kingaku = 6000;break;
case 2: kingaku ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[] = {6000, 4000, 3000, 2000};
int k[4] = {0};
for (int i = 0; i < 4; i++) {
int x, y;
cin >> x >> y;
k[x - 1] += a[x - 1] * y;
}
for (int i = 0; i < 4; i++) {
cout << k[i] << endl;
}
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | //２７３１松平 愛実
import java.util.Scanner;
class Main{
int seki;
int maisu;
int cnt=0;
public void solve(){
Scanner sc = new Scanner(System.in);
seki = sc.nextInt();
maisu = sc.nextInt();
while(cnt<4){
switch(seki){
case 1:
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T a) {
for (auto iiiiiiiiii : a) cout << iiiiiiiiii << endl;
}
int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
int main() {
int d[] = {0, 6000, 4000, 3000, 2000};
int ans = 0;
for (int i = 0; i < (int)4; i++) {
int t, n;
cin >... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include<stdio.h>
int main(void)
{
int t,n,i,Sseki,Aseki,Bseki,Cseki;
for(i=1;i<5;i++){
scanf("%d%d",&t,&n);
swich (t)
{
case 1:
Sseki=6000*n;
break;
case 2:
Aseki=3000*n;
break;
case 3:
Bseki=3000*n;
break;
case 4:
Cseki=2000*n;
break;
}
if(t==1){
printf("%d\n",Sseki)... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | package a2;
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int[] sa = new int[7];
for(int i=0;i<4;i++){
int a = sc.nextInt();
int b = sc.nextInt();
switch (a){
case 1:
s... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int kingaku;
int[] goukei = new int[4];
int n;
public void syurui(){
for(n=0;n<=3;n++){
int syurui = sc.nextInt();
int maisuu = sc.nextInt();
switch (syurui){
case 1: kingaku = 6000;break;
case 2: kingaku... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN |
data = Array.new(4)
i = 0
#p data
=begin
File.open("test/0277","r") do |input|
while data[i] = input.gets do
#p data[i]
i += 1
end
end
=end
while data[i] = input.gets do
#p data[i]
i += 1
end
for i in data
if i == nil
break
end
a,b = (i.chomp).split(" ").map(&:to_i)
case a
when 1
a ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include<iostream>
using namespace std;
int main(){
int a,b;
for(int i=0;i<4;i++)
cin>>a>>b;
if(a==1)
cout<<b*6000<<endl;
if(a==2)
cout<<b*4000<<endl;;
if(a==3)
cout<<b*3000<<endl;
if(a==4)
cout<<b*2000<<endl;
}
return 0;
} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int t;
int n;
int kingaku;
int tanka;
public void kei(){
t = sc.nextInt();
n = sc.nextInt();
switch(t){
case 1:tanka = 6000;
break;
case 2:tanka = 4000;
break;
case 3:tanka = 3000;
break;
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int a = 0, b = 0;
for (int i = 0; i < 4; i++) {
scanf("%d%d", &a, &b);
switch (a) {
case 1:
printf("%d", b * 6000);
break;
case 2:
printf("%d", b * 4000);
break;
case 3:
printf("%d", b * 3000);
break;
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main(void) {
int t, n, t1, n1, t2, n2, t3, n3, t4, n4;
scanf("%d", &t1);
t1 = 6000;
scanf("%d", &n1);
scanf("%d", &t2);
t2 = 4000;
scanf("%d", &n2);
scanf("%d", &t3);
t3 = 3000;
scanf("%d", &n3);
scanf("%d", &t4);
t4 = 2000;
scanf("%d", &n4);
printf("%d\n", t1 * ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
using namespace std;
int A[4],B[4],C[4];
int main(){
cin >>A[0]>>B[0]>>A[1]>>B[1]>>A[2]>>B[2]>>A[3]>>B[3];
for(int i = 0; i < 4; i++){
if(A[i]==1){
C[i]=6000*B[i];
}else if(A[i]==2){
C[i]=4000*B[i];
}else if(A[i]==3){
C[i]=3000*B[i];
}else{
C[i]=2000*B[i... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[] = {6000, 4000, 3000, 2000};
long long k[4] = {0};
for (int i = 0; i < 4; i++) {
int x, y;
cin >> x >> y;
k[x - 1] += a[x - 1] * y;
}
for (int i = 0; i < 4; i++) {
cout << k[i] << endl;
}
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main{
int t,n;
public void solve(){
Scanner sc = new Scanner(System.in);
while(t <= 4 && n <= 10000){
t = sc.nextInt();
n = sc.nextInt();
if(t == 1){
System.out.println(6000*n);
}else if(t == 2){
System.o... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace id_0277cs
{
class Program
{
static void Main(string[] args)
{
foreach( var i in Enumerable.Range(0, 4))
{
var vs = Console.ReadLi... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
class Main2{
int tiket[]={0,6000,4000,3000,2000};
int t,n,uriage;
public void solve(){
Scanner sc=new Scanner(System.in);
for(int i=0;i<4;i++){
t=sc.nextInt();
n=sc.nextInt();
uriage=tiket[t]*n;
System.out.println(uriage);
}
}
publ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int k;
int []intake = new int[4];
int inatai;
int atai=sc.nextInt();
int maisu=sc.nextInt();
for(k=0;k<=4;k++){
switch(atai){
case 1:inatai = 6000*maisu;break;
case 2:inatai = 4000*maisu;brea... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include<stdio.h>
int main() {
int i;
int n;
int prices[] = {6000, 4000, 3000, 2000};
unsigned long long int sums[4];
for (i=0; i<4; i++) {
int ind;
unsigned long long int times;
scanf("%d %llu", &ind, ×);
sum[ind-1] = prices[ind-1] * times;
}
for (i=0; i<4; i++) ... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include<stdio.h>
int main(void)
{
int t[4],i,n[4],pokemon[4];
for(i=0;i<4;i++){
scanf("%d %d",&t[i],&n[i]);
if(1==t){
pokemon[i]=6000*n;}
else if(2==t){
pokemon[i]=4000*n;}
else if(3==t){
pokemon[i]=3000*n;}
else{
pokemon[i]=2000*n;}
}
for(i=0;i<4;i++){
printf("%d\n",pokemon[i]);}
return 0;
} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int tick, n;
int temp[5] = {0, 6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> tick >> n;
cout << temp[tick] * n;
}
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, m, n;
int price[4] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> m >> n;
cout << price[m] * n << endl;
}
return 0;
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main() {
int a, b, c = 0;
int out[4];
while (c < 4) {
scanf("%d %d", &a, &b);
if (a == 1) {
out[c] = 6 * b;
} else if (a == 2) {
out[c] = 4 * b;
} else if (a == 3) {
out[c] = 3 * b;
} else {
out[c] = 2 * b;
}
c++;
}
for (c = 0; c... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main{
public void solve(){
Scanner sc = new Scanner(System.in);
int syu,mai,a,uri;
for(int t=0; t<4; t++){
syu = sc.nextInt;
if(syu==1){
a=6000;
}else if(syu==2){
a=4000;
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int[] sell = new int[5];
int t,n;
for(int i=0;i<4;i++){
t=sc.nextInt();
n=sc.nextInt();
sell[t]=n;
}
int[] p =... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python2 | while t,n=map(input,raw_input().split()):
list=[0,0,0,0]
if(t==1):
list[t-1]+=n*6000
if(t==2):
list[t-1]+=n*4000
if(t==3):
list[t-1]+=n*3000
if(t==4):
list[t-1]+=n*2000
for i in range(0,4):
print list[i] |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
int t, n, d, cnt = 1;
while (cnt < 4) {
scanf("%d %d", &t, &n);
if (t == 1)
d = 6000 * n;
else if (t == 2)
d = 4000 * n;
else if (t == 3)
d = 3000 * n;
else
d = 2000 * n;
printf("%d\n", d);
}
return 0;
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
class Main
{
public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int s[]=new int[4];
while(scan.hasNext())
{
int t=scan.nextInt();
int n=scan.nextInt();
if(t==1)s[t-1]+=6000*n;
if(t==2)s[t-1]+=4000*n;
if(t==3)s[t-1]+=3000*n;
if(t==4)s[t-1]+=2000*n;
}
for(int i=0;i<4;i... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <stdio.h>
int main(void)
{
int t[4];
int n[4];
int i;
for(i=0;i<4;i++)
scanf("%d %d",&t[i],&n[i]);
for(i=0;i<4;i++){
switch(t[i])}
case 1:t[i]=6000; break;
case 2:t[i]=4000; break;
case 3:t[i]=3000; break;
case 4:t[i]=2000: break;
}
}
for(i=0;i<4;i++)
printf("%d\n",t[i]*n[i]);
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
int t, n, d[4], cnt = 1;
while (cnt < 4) {
scanf("%d %d", &t, &n);
if (t == 1)
d[cnt] = 6000 * n;
else if (t == 2)
d[cnt] = 4000 * n;
else if (t == 3)
d[cnt] = 3000 * n;
else
d[cnt] = 2000 * n;
cnt++;
}
while (cnt != 4) pr... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
class exe0277
{
public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int s[]=new int[4];
for(int i=0;i<4;i++)
{
int t=scan.nextInt();
int n=scan.nextInt();
if(t==1)s[i]+=6000*n;
if(t==2)s[i]+=4000*n;
if(t==3)s[i]+=3000*n;
if(t==4)s[i]+=2000*n;
}
for(int i=0;i<4;i++)
{
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | using System;
class Program
{
static void Main()
{
for (int i = 0; i < 4; i++)
{
int[] tickets = { 6000, 4000, 3000, 2000 };
var strs = Console.ReadLine().Split(' ');
Console.WriteLine(tickets[int.Parse(strs[0]) - 1] * int.Parse(strs[1]));
}
}
} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | data = Array.new(4)
i = 0
#p data
while data[i] = gets do
#p data[i]
i += 1
end
p data
for i in data
if i == nil
break
end
a,b = (i.chomp).split(" ").map(&:to_i)
case a
when 1
a = 6000
when 2
a = 4000
when 3
a = 3000
when 4
a = 2000
end
p a*b
end |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
using namespace std;
int main () {
int t;
int n;
int result;
for (int i = 0; i < 4; i++) {
cin >> t >> n;
switch (t) {
case 1:
result = 6000 * n;
return;
case 2:
result = 4000 * n;
return;
case 3:
result = 3000 * n;
r... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iosream>
using namespace std;
int A[4],B[4],C[4];
int main(){
cin >>A[0]>>B[0]>>A[1]>>B[1]>>A[2]>>B[2]>>A[3]>>B[3];
for(int i = 0; i < 4; i++){
if(A[i]==1){
C[i]=6000*B[i];
}else if(A[i]==2){
C[i]=4000*B[i];
}else if(A[i]==3){
C[i]=3000*B[i];
}else{
C[i]=2000*B[i]... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include<stdio.h>
int main(void)
{
int i,t,n,k;
for(i=0;i>4;i++){
scanf("%d %d",&t,&n);
if(t==1){
k=6000;
} else{
k=(6-t)*1000;
}
k*=n;
printf("%d\n",k)
}
return(0);
} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
int t, n, d[4], cnt = 0;
while (cnt != 3) {
scanf("%d %d", &t, &n);
if (t == 1)
d[cnt] = 6000 * n;
else if (t == 2)
d[cnt] = 4000 * n;
else if (t == 3)
d[cnt] = 3000 * n;
else
d[cnt] = 2000 * n;
cnt++;
}
cnt = 0;
while (... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | a;main(b){for(;a=~scanf("%d%d",&a,&b);printf("%d\n",(int)((6-a)*1.2)*1000*b));} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int c[] = {0, 6000, 4000, 3000, 2000};
int main() {
int ret = 0;
for (int i = 0; i < 4; i++) {
int a, b;
scanf("%d%d", &a, &b);
ret += c[a] * b;
}
printf("%d\n", ret);
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #encoding:utf-8 No.0277 2014.11.10
sale = Array.new
while true
if (data = gets.chomp.split.map{|elem| elem.to_i}) == []
break
end
sale.push data
end
sale.each do |i|
if i[0] == 1
puts 6000*i[1]
elsif i[0] == 2
puts 4000*i[1]
elsif i[0] == 3
puts 3000*i[1]
else i[0] == 4
puts 2000*i[1... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | using System;
using System.Linq;
using System.Collections.Generic;
namespace ConsoleApplication1 {
class ClassMain {
public static void Main(String[] args) {
//string line;
int[] uriage = new int[5];
for (int i = 0; i < 4; i++) {
int[] ints = C... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Q0277{
public void solve(){
Scanner sc = new Scanner(System.in);
int ninzu,k;
int ban;
for(int i=0;i<4;i++){
ban = sc.nextInt();
if(ban == 1){
k = 6000;
}else if(ban == 2){
k = 4000;
}else if(ban == 3){
k = 3000;
}else{
k = 2000... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
using namespace std;
int main () {
int t;
int n;
int result;
for (int i = 0; i < 4; i++) {
cin >> t >> n;
switch (t) {
case 1:
result = 6000 * n;
return;
case 2:
result = 4000 * n;
return;
case 3:
result = 3000 * n;
r... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Tiket{
Scanner sc = new Scanner(System.in);
int nban,nsyu;
public void handan(){
for(int i = 0; i<4; i++){
nsyu = sc.nextInt();
nban = sc.nextInt();
switch (nsyu){
case 1: System.out.println(nban*6000);break;
case 2: System.out.println(nban*4000);brea... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main() {
int a, b, c = 0;
int out[4];
while (c < 4) {
scanf("%d %d", &a, &b);
if (a == 1) {
out[c] = 6 * b;
} else if (a == 2) {
out[c] = 4 * b;
} else if (a == 3) {
out[c] = 3 * b;
} else {
out[c] = 2 * b;
}
c++;
}
for (c = 0; c... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int kode,mai,a;
int[] kin ={6000,4000,3000,2000};
int[] gou = new int[4];
public void keisan(){
System.out.println("チケットの種類と枚数を入力してください");
for(a=0;a<=3;a++){
kode = sc.nextInt();
mai = sc.nextInt();
switch(kode){
c... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | class Main{
public void run(){
Scanner sc = new Scanner(System.in);
for( int i = 0; i < 4; i++){
int nType = sc.nextLine();
int nNum = sc.nextLine();
switch(nType){
case 1: System.out.println(6000*nNum); break;
case 2: System.out.println(4000*nNum); break;
case 3: System.out.println(3000*nNum)... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int pr[4] = {6000, 4000, 3000, 2000};
int a, b;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
cout << pr[a - 1] * b << endl;
}
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include<stdio.h>
int main(){
int i,input,a[4],b;
for(i=0;i<4;i++){
scanf("%d%d",&input,&);
case (input){
case 1:
a[i]=6000*b;
case 2:
a[i]=4000*b;
case 3:
a[i]=3000*b;
case 4:
a[i]=2000*b;
}
}
for(i=0;i<4;i++){
printf("%d\n",a[i]);
}
return 0;
} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int a, b, c, i;
for (i = 1; i <= 7; i++) {
scanf("%d %d", &a, &b);
if (a == 1) {
c = 6000 * b;
} else if (a == 2) {
c = 4000 * b;
} else if (a == 3) {
c = 3000 * b;
} else if (a == 4) {
c = 2000 * b;
}
printf("%d\n", c);
}
... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(5);
for (int i = 0; i < 4; i++) {
int hoge, tyome;
cin >> hoge >> tyome;
v[hoge] = tyome;
}
cout << v[1] * 6000 << "\n"
<< v[2] * 4000 << "\n"
<< v[3] * 3000 << "\n"
<< v[4] * 2000 << endl;
}
|
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | int main(){
int t,n;
int aka[5]={0};
int i;
for(i=0;i<4;i++){
cin>>t>>n;
if(t==1){
aka[i]=6000*n;
}
else if(t==2){
aka[i]=4000*n;
}
else if(t==3){
aka[i]=3000*n;
}
else{
aka[i]=2000*n;
}
}
for(i=0;i<4;i++){
cout<<aka[i]<<endl;
}
return 0;
} |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
int t, n, i, g;
for (i = 0; i < 4; i++) {
scanf("%d%d", &t, &n);
if (t == 1) {
g = 6000 * n;
printf("%d", g);
} else if (t == 2) {
g = 4000 * n;
printf("%d", g);
} else if (t == 3) {
g = 3000 * n;
printf("%d", g);
} el... |
p00272 Ticket Sales | Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well!
Shortly after ... | {
"input": [
"3 10\n1 4\n4 1\n2 5"
],
"output": [
"30000\n24000\n2000\n20000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int kingaku;
int[] goukei = new int[4];
int n;
public void syurui(){
for (n=0; n<=3;n++){
int syurui = sc.nextInt();
int maisuu = sc.nextInt();
switch(syurui){
case 1: kingaku = 6000;break;
case 2: kingaku = 40... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int N,M,S;
int dp[2][50][3001];
#define AMA (100000)
int solve(){
memset(dp,0,sizeof(dp));
int now;
int next;
int ret = 0;
dp[1][0][0]=1;
for(int m=1;m<=M;m++){
now = m&1;
... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | python3 | import itertools
while 1:
n,m,s=map(int,input().split())
if n==0:break
dp=[[0 for _ in range(s+1)] for _ in range(n*n+1)]
dp[0][0]=1
for i,j in itertools.product(range(1,n*n+1),range(s+1)):
if j>=i:dp[i][j]+=dp[i-1][j-i]+dp[i][j-i]
if j-m>=1:dp[i][j]+=100000-dp[i-1][j-m-1]
dp... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sst... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
using namespace std;
#define ... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
const int MOD = 100000;
int N, M, S;
int dp[50][3010];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
while (cin >> N >... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 100000;
int main() {
while (true) {
int n, numLimit, sum;
cin >> n >> numLimit >> sum;
if (n == 0)break;
n *= n;
vector<vector<int>> dp(n + 1, vector<int>(sum + 1));
dp[0][0] = 1;
... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<iostream>
#include<algorithm>
using namespace std;
#define reps(i,b,n) for(int i = b ; i < n ; ++i )
#define rep(i,n) reps(i,0,n)
#define INF (1 << 30)
#define MOD 100000
int dp[51][3001],N,M,S;
int main(){
while(cin >> N >> M >> S , N){
fill_n(dp[0],51*3001,0);
dp[0][0] = 1;
for(int i = 1 ; i <=... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | /* 剰余取り忘れてしもたwガハハw */
#include <stdio.h>
#include <string.h>
int dp[50][3001];
int main() {
while (1) {
int i;
int n, m, s;
int square;
scanf("%d %d %d", &n, &m, &s);
if (n == 0 && m == 0 && s == 0) {
return 0;
}
memset(dp, 0, sizeof(dp... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdio>
#include <algorithm>
int N, M, S;
int dp[2][2001][3001];
int main()
{
while (true)
{
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &S);
if (N == 0 && M == 0 && S == 0) { break; }
for (int i = 0; i < M; i++)
{
for (int j = 0;... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<stdio.h>
int main()
{
int N,M,S,i,j,k,MOD=100000;
while(scanf("%d%d%d",&N,&M,&S),N)
{
int dp[50][3001]={1};
for(i=M;i>0;--i)
for(j=N*N;j>0;--j)
for(k=S-i;k>=0;--k)
{
int &r=dp[j][i+k];
r=(r+dp[j-1][k])%MOD;
}
printf("%d\n",dp[N*N][S]);
}
return 0;
} |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | python3 | while True:
n, m, s = map(int, input().split())
if not n:
break
n2 = n ** 2
dpp = [0] * (s + 1)
dpp[0] = 1
for i in range(1, n2 + 1):
dpn = [0] * (s + 1)
for j in range(i * (i + 1) // 2, s + 1):
dpn[j] += dpp[j - i] + dpn[j - i]
if j - m - 1 >= 0:... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdio>
#include <algorithm>
#pragma warning(disable: 4996)
#define MOD 100000
#define MAX_M 2000
#define MAX_S 3000
int N, M, S;
int dp[2][MAX_M + 1][MAX_S + 1];
int main()
{
while (true)
{
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &S);
if (N == 0 && M == 0 && S == 0) { break; }
for (... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<bits/stdc++.h>
using namespace std;int d[51][3210],n,m,s,i,j,k;int main(){while(cin>>n>>m>>s&&n){n*=n;memset(d,0,sizeof(d));d[0][0]=1;for(k=1;k<=m;k++)for(i=n;i;i--)for(j=k;j<=s;j++)d[i][j]=(d[i][j]+d[i-1][j-k])%100000;cout<<d[n][s]<<endl;}return 0;} |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#de... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const int mod = 100000;
for(int n, m, s; cin >> n >> m >> s, n;) {
vector<vector<int> > dp(s + 1, vector<int>(n * n + 1, 0));
dp[0][0] = 1;
for(int i = 1; i <= m; ++i) {
for... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdio>
#include <cstring>
using namespace std;
int d[50][3001];
int main() {
int n,m,s;
while(scanf("%d%d%d",&n,&m,&s),n) {memset(d,0,sizeof(d));
d[0][0]=1;for (int i=1;i<=m;++i)for (int j=n*n;j;--j)for (int k=s;k>=i;--k)
d[j][k]=(d[j][k]+d[j-1][k-i])%100000;
printf("%d\n",d[n*n][s]);
}
} |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cctype>
using namespac... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,M,S;
while(1){
int fie[51][3002]={0};
cin>>N>>M>>S;
if(N==0&&M==0&&S==0)break;
fie[0][0]=1;
for(int i=1;i<=M;i++){
for(int j=N*N;0<=j;j--){
... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <stdio.h>
int dp[50][3333];
int dpw[50][3333];
int main()
{
while(1)
{
int n,m,s;
scanf("%d %d %d",&n,&m,&s);
if(n == 0)
{
break;
}
n *= n;
for(int i = 0; i < n; i++)
{
for(int ii = 0; ii <= s; ii++)
{
dp[i][ii] = 0;
}
}
for(int i = 1; i <= m; i++)
{
for(int ii = 0;... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n,m,s;
int dp[55][3003];
int main(void){
while(cin >> n >> m >> s && n){
memset(dp,0,sizeof(dp));
dp[n*n][s] = 1;
for(int i = 1; i <= m; i++){
for(int j = 0; j < n*n; j++){
for(int k = 0; k+i <= ... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <iostream>
#include <vector>
template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }
constexpr int MOD = 100000;
bool solve() {
int n, m, s;
std::cin >> n >> m >> s;
if (n == 0) return false;
n *= n;
auto dp = vec(n + 1, vec(s + 1, 0));
dp[0][0] ... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<iostream>
#include<cstdio>
using namespace std;
#define LATTE 100000
int dp[2][2001][3001];
int main(){
int N,M,S;
while(cin>>N>>M>>S, N||M||S){
for(int i=1;i<=M;i++)for(int j=1;j<=S;j++) dp[0][i][j]=dp[1][i][j]=0;
for(int i=1;i<=M;i++){
dp[1][i][i]=1;
}
fo... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for(int i = ... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int N, M, S;
typedef long long int ll;
int DP[2001][3001];
int MOD = 100000;
int main()
{
while (true){
scanf("%d%d%d", &N, &M, &S);
if (N == 0 && M == 0 && S == 0)break;
for (int i = 0; i <= N*N; i++)for (int j = 0; j <=S; j++)DP[i][j]... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e5;
int main() {
int N, M, S;
while (true) {
cin >> N >> M >> S;
if (N == 0) break;
long long dp[N * N + 1][S + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= N * N; ++i) {
... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
int n,m,s;
while(cin>>n>>m>>s&&(n||m||s)){
ll dp[51][3001] = {};
dp[0][0]=1;
for(int i=1;i<=m;i++){
for(int j=n*n;j>=1;j--){
for(int k=1;k<=s;k++){
if(k-i>=0)dp[j][k] = ( dp... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | java | import static java.util.Arrays.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
static void tr(Object... os) {
System.err.println(deepToString(os));
}
sta... |
p00460 Bingo | problem
In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions.
* The Bingo card is divided into squares of N rows and N columns, and one posi... | {
"input": [
"3 9 45\n3 100 50\n5 50 685\n0 0 0"
],
"output": [
"1\n7\n74501"
]
} | {
"input": [],
"output": []
} | CORRECT | cpp | #include<bits/stdc++.h>
using namespace std;
int mod=100000;
int N,M,S;
int dp[2001][3001];
int dpsum[2001][3001];
//int dp1[2009][3009];
int main()
{
while(true){
scanf("%d%d%d",&N,&M,&S);
if(N==0&&M==0&&S==0)break;
for(int i=0;i<=M;i++){
for(int j=0;j<=S;j++){
dp[i][j]=0;dpsum[i][j]=0;
}
}
dp[0][0]=1;
fo... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.