text stringlengths 49 983k |
|---|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,size;
string s,a,b;
for(cin>>n,getline(cin,s,'\n');n>0;n--){
getline(cin,s,'\n');
//cin>>s;
size = s.size();
if(size<6||size%2){cout<<"NA"<<endl;continue;}
a=">'"; b=">^";
for(int i=0;i<size/2-2;i++){a=a+"=";b=b+"Q=... |
#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... |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
string vbString(int Number,string Character){
string res="";
for(int i=0;i<Number;i++) res+=Character;
return res;
}
string checksnake(string s){
string t;
for(int i=1;i<100;i++){
t=">'... |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
string s;
int main(void){
cin >> n;
for(int k = 0; k < n; k++){
cin >> s;
bool f = true;
if(s[0]== '>' && s[1]=='\''){
int c=0;
int i;
for(i = 2; s[i]=='='; i++) c++;
if(c && ... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>
typedef long long ll;
const doub... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int N;
cin>>N;
while(N--){
string str;
cin>>str;
int len=str.size();
int ans=-1;
if(str[0]=='>'&&str[1]=='\''){
int pos=2;
int cnt=0;
... |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip... |
#include<string>
#include<iostream>
using namespace std;
bool isA(string s)
{
int len=s.length();
if(len<6) return false;
if(s.substr(0,2)!=">'") return false;
if(s.substr(len-1)!="~") return false;
s=s.substr(2,len-3);
len=s.length();
if(len%2==0) return false;
if(s[len/2]!='#') return false;
if(s.su... |
#include <iostream>
#include <algorithm>
using namespace std;
bool isA(const string &s) {
if(s.size() < 6) return false;
if(s.substr(0,2) != ">'") return false;
if(*(s.rbegin()) != '~') return false;
string t = s.substr(2, (int)s.size()-3);
int m = t.find("#");
if(m == string::npos) return false;
if(t.su... |
#include<iostream>
#include<string>
using namespace std;
string makeSnakeA( int a )
{
string s = ">\'";
for( int i = 0; i < a; i++ )
s += "=";
s += "#";
for( int i = 0; i < a; i++ )
s += "=";
s += "~";
return s;
}
string makeSnakeB( int a )
{
string s = ">^";
for( int i... |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define fr first
#define... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include ... |
#include <iostream>
#include <algorithm>
using namespace std;
string judgeSnakeType(string s){
if(s.find( ">'") == 0 && s.find("~") == s.size()-1)
{
s.erase(s.size()-1,1); s.erase(0,2);
int cnt = 0;
if( s.size() == 0 ) return "NA";
while( s.size() > 0 && s[0] == '=' ){
if(s[0] == '='){
... |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))
... |
#include <iostream>
using namespace std;
int main(){
char buf[210];
int bi,n,eqc,ti;
cin >> n;
for (int i=0;i<n;i++){
bi=0;
cin >> buf;
if (buf[bi++]!='>') {
cout << "NA" << endl;
continue;
}
if (buf[bi]=='\''){
bi++;
eqc=0;
if (buf[bi]!='='){
cout << "NA" <... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
using namespace std;
#def... |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string a;
cin >> a;
if (a.substr(0, 2) == ">'") {
int counter = 0;
bool hantei = false;
int i;
for (i = 2; i < a.size(); i++) {
if (a[i] == '=') {
counter++;
} else ... |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
bool b;
int n, i, j, t, c[2];
char s[201];
cin >> n;
for (i = 0; i < n; i++)
{
b = true;
cin >> s;
if (s[0] == '>')
{
if (s[1] == '\'')
{
for (j = 2, t = c[0] = c[1] = 0; j < strlen(s)-1; j++)
{
i... |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n,i,j,s;
string c1,c2,c3;
cin >> n;
for (i=0;i<n;i++) {
cin >> c1;
c2=c3=c1;
s=c1.size();
if (s<6 || s % 2==1) { cout << "NA" << endl; continue; }
for (j=0;j<s;j++) c2[j]=c3[j]='=';
c2[0]=c3[0]='>'; c2... |
#include<bits/stdc++.h>
using namespace std;
char buf[1024];
int M;
bool checkA(){
if( buf[0] != '>' ) return false;
if( buf[1] != '\'') return false;
int cnt1=0,cnt2=0;
bool f = false;
int i;
for(i=2;i<M;i++){
if(!f){
if( buf[i] == '=' ) cnt1++;
else if( buf[i] == '#' ) f = true;
els... |
#include<iostream>
#include<string>
using namespace std;
string S;
int n;
string solve(string T) {
int chain = 0, ok = 0;
if (T.size() >= 3) {
if (T[T.size() - 1] == '~') {
if (T.substr(0, 2) == ">'" && T.size() >= 6) {
for (int i = 2; i < T.size() - 1; i++) {
if (T[i] == '#') {
ok++;
}
... |
#include <bits/stdc++.h>
using namespace std;
bool isOutOfStr(int ind, string str){
return ind >= str.length();
}
int main(void){
int n;
cin >> n;
while(n--){
string str; cin >> str;
if(!isOutOfStr(1, str) &&str[0] == '>' && str[1] == '\''){
int sharp_cnt = 0;
int ind;
ind = 2;
... |
#include<iostream>
#include<string>
using namespace std;
int main(){
int f,i,m;
string s;
for(cin>>f;cin>>s;f?puts(f-2?"A":"B"):puts("NA")){
f=0;
if(s[0]+s[1]==101){
if((m=s.find(35))!=string::npos)
for(i=1;s[m-i]==s[m+i];)
if(m-++i==1 && m+i==s.size()-1 && s[m+i]=='~')f=1;
}else if(s[0]+s[... |
#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;
... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<functional>
#include<map>
using namespace std;
int main() {
int a;
cin >> a;
for (int b = 0; b < a; b++) {
string c; cin >> c;
if ((c.length() & 1)==0&&c.length()>=6) {
if (c[0] ==... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
int main() {
int N;
cin >> N;
REP(n, N) {
string str;
int type = 0, pos = 0;
cin >> str;
if (str[pos] == '>') {
pos++;
if (str[pos] == '\'') {
pos++;
int cnt = 0;
whil... |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
string Sample;
//const regex REA("^>'(=+)#\1~$"), REB("^>\\^(Q=)+~~$");
const regex REA("^>'(=+)#(=+)~$"), REB("^>\\^(Q=)+~~$");
int main() {
int n;
smatch smStr;
cin >> n;
while (n--) {
cin >> Sample;
//cout << Sample << endl;
if (regex_ma... |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL;
typed... |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... |
#include <iostream>
int main()
{
std::string sn; getline(std::cin, sn);
int n = std::stoi(sn);
for (int i=0; i<n; i++) {
std::string snake;
getline(std::cin, snake);
int state = 0;
int equal_count = 0;
for (int k=0; k<snake.length(); k++) {
char c = snake[k];
switch (state) {
case 0:
if (c =... |
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n;
string s;
int main(){
cin>>n;
while(cin>>s){
if(s.siz... |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
string sn;
cin>>sn;
int type=0;
if(sn[0]=='>'&&sn[1]==39)type=1;
if(sn[0]=='>'&&sn[1]=='^')type=2;
int flg=1;
... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
int n,length,second_length;
char snake[201];
scanf("%d",&n);
for(int i=0; i < n; i++){
scanf("%s",snake);
if(snake[1] == '\0'){
printf("NA\n");
continue;
}
if(snake[0] == '>' && snake[1] ... |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string s;
cin>>s;
if(s[0]=='>'){
if(s[1]=='\''){
int sum=0;
if(s.size()<6)goto L;
r(i,s.size())if(s[i]=='=')sum++;
if(s.size()%2==0&&s[s.size()/2]=='#'&&sum==s... |
#include <bits/stdc++.h>
using namespace std;
static inline int in(){ int x; scanf("%d", &x); return x; }
int main()
{
int n = in();
int am[12][256] = {};
am[1]['>'] = 2;
am[2]['\''] = 3;
am[3]['='] = 4;
am[4]['='] = 4;
am[4]['#'] = 5;
am[5]['='] = 5;
am[5]['~'] = 6;
am[2]['^'] = 7;
am[7]['Q'] ... |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(){
int i,j,n,a;
string str,ans;
cin >> n;
for(i=0;i<n;i++){
cin >> str;
ans = "NA";
if(str[0] == '>'){
if(str[1] == '\''){
a = 2;
int c=0,c2=0;
if(str[a] == '='){
while(str[a] == '='){
a++;
... |
#include <iostream>
#include <string>
using namespace std;
int n;
int main()
{
cin >> n;
for (int i = 0; i < n; i++) {
string s, t, w;
cin >> s;
t = "NA";
int m = s.size();
if (m > 4 && m % 2 == 0) {
string u(m - 4, '=');
u.insert(u.begin() +... |
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <deque>
#include <cstdio>
#include <cmath>
using namespace std;
#define reep(i,f,t) for(int i=f ; i<int(t) ; ++i)
#define rep(i,n) reep(i, 0, n)
typedef vector<int> vi;
typedef vector<... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;
bool isA(string s){
int n = 0;
if(s.at(n)!='>' || s.at(++n... |
#include<iostream>
#include<string>
using namespace std;
bool isA(string &s){
if(s.size()<6)return false;
if(s[0]!='>'||s[1]!='\'')return false;
int i=2;
while(s[i]=='=')i++;
int cnt=i-2;
if(cnt==0||s[i]!='#')return false;
for(i++;i<s.size()&&s[i]=='=';i++)cnt--;
if(cnt||i==s.size()||s[i]!='~')return false;
... |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string str;
cin>>str;
if(str[0]!='>')cout<<"NA"<<endl;
else{
if(str[1]=='\''&&str[2]=='='){
int e=2;
for(;str[e]=='=';e++);
if(str[e]==... |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#inc... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
int main(){
int n;
cin>>n;
for(int i = 0; i < n; i++){
string str;
cin>>str;
if(str.size()<=4)
cout<<"NA"<<endl;
else if(str.substr(0,2)==">'"&&str[str.size()-1]=='~'&&str.size()%2==0){
... |
#include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j;
int n;
vector<string> s;
cin>>n;
for(i=0;i<n;i++){
string str;
cin>>str;
s.push_back(str);
}
fo... |
#include<stdio.h>
#include<iostream>
#include<string>
#include<math.h>
#include<algorithm>
using namespace std;
int main(){
string str;
int N;
cin>>N;
for(int i=0;i<N;i++){
cin>>str;
string x=" ";
if(str[0]=='>'){
for(int j=0;j<2;j++)
x[j]=str[j];
if(str[1]=='\''&&str[str.size()-1]=='~'){
bool f=t... |
#include<iostream>
using namespace std;
int n;
string str;
bool check_A(string t){
int cnt=0,i=0,cnt2=0;
while(t[i]=='='){cnt++;i++;}
if(t[i]!='#')return false;
if(cnt==0)return false;
if((int)t.size()==i)return false;
i++;
while(t[i]=='='){cnt2++;i++;}
if(cnt!=cnt2)return false;
if((int)t.size()!... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>... |
#include <iostream>
#include <string>
using namespace std;
bool isA(const string& str, int indx) {
if(str[indx++] != '>')
return false;
if(str[indx++] != '\'')
return false;
int count0 = 0;
for(; indx < str.size(); indx++) {
if(str[indx] == '=')
count0++;
else
break;
}
if(indx >= str.size())
ret... |
#include <iostream>
#include <string>
using namespace std;
string repeat(int n, string s) {
string res = "";
for (int i=0; i<n; ++i)
res += s;
return res;
}
int main() {
int N; cin >> N;
for (int i=0; i<N; ++i) {
string snake; cin >> snake;
int len = snake.size();
... |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int main(){
int n;
cin >> n;
while(n--){
string snake;
cin >> snake;
string s = snake.substr(0,2);
if(s != ">^" && s != ">\'"){
puts("NA");
continue;
}
if(s == ">\'"){
int a = 0;
in... |
#include <stdio.h>
int main(void){
int t,n;
int i;
for(i=0;i<4;i++){
scanf("%d %d",&t,&n);
if(t==1){
printf("%d\n",6000*n);
}
if(t==2){
printf("%d\n",4000*n);
}
if(t==3){
printf("%d\n",3000*n);
}
if(t==4){
printf("%d\n",2000*n);
}
}
return 0;
} |
#include<iostream>
using namespace std;
int t[]={0,6000,4000,3000,2000},a,b;
int main(){
while(cin>>a>>b){
cout<<t[a]*b<<endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
for (int h = 1; h <= 4;h++){
int t, n, p;
cin >> t >> n;
switch (t){
case 1: p = 6000; break;
case 2: p = 4000; break;
case 3: p = 3000; break;
case 4: p = 2000; break;
}
cout << p*n << endl;
}
} |
#include<iostream>
using namespace std;
int main(){
int kingaku[] = {6000, 4000, 3000, 2000};
//????????????
for (int i = 0; i < 4; i++) {
int t,n;
cin >> t >> n;
cout << kingaku[t-1] * n << endl;
}
return 0;
} |
#include <cstdio>
int main() {
int t,n;
for(int i=0;i<4;i++) {
scanf("%d %d",&t,&n);
int sale;
if(t==1) sale=6000*n;
if(t==2) sale=4000*n;
if(t==3) sale=3000*n;
if(t==4) sale=2000*n;
printf("%d\n",sale);
}
} |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int lis[5]={0,6000,4000,3000,2000};
for(int i=0;i<4;i++){
int a,b;
scanf("%d %d",&a,&b);
printf("%d\n",lis[a]*b);
}
return 0;
} |
#include <stdio.h>
int main(void){
int a;
int t,n;
int i;
for(i=0;i<4;i++){
scanf("%d %d",&t,&n);
if(t==1)t=6000;
if(t==2)t=4000;
if(t==3)t=3000;
if(t==4)t=2000;
a=t*n;
printf("%d\n",a);
}
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
for(int i=0 ; i<4 ; ++i){
int t,n;
cin >> t >> n;
if(t==1){
cout << 6000*n << endl;
}else if(t==2){
cout << 4000*n << endl;
}else if(t==3){
cout << 3000*n << endl;
}else{
cout << 2000*n << endl;
}
}
return 0;
} |
#include<cstdio>
int p[4]={6000,4000,3000,2000};
int main(void){
int t,n;
for(int i=0;i<4;i++){
scanf("%d%d",&t,&n);
printf("%d\n",p[t-1]*n);
}
return 0;
} |
#include<cstdio>
int main(){
int t,n,data[4] = {6000,4000,3000,2000};
for(int i=0;i<4;i++){
scanf("%d %d",&t,&n);
printf("%d\n",data[t-1]*n);
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int t[5] = {0, 6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++){
int n, a;
cin >> a >> n;
cout << t[a] * n << endl;
}
return 0;
} |
#include<stdio.h>
int main() {
int i;
int n;
int prices[] = {6000, 4000, 3000, 2000};
for (i=0; i<4; i++) {
int ind;
unsigned long long int times;
scanf("%d %llu", &ind, ×);
printf("%llu\n", prices[ind-1] * times);
}
} |
#include<iostream>
#include<cstdio>
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;
} |
#include<iostream>
using namespace std;
int main(){
int t, n;
int p[4] = {6000, 4000, 3000, 2000};
for(int i = 0; i < 4; i++){
cin >> t >> n;
cout << p[t-1]*n << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int table[] = { 0, 6000, 4000, 3000, 2000 };
for ( int i = 0; i < 4; i++ ) {
int t, n;
cin >> t >> n;
cout << table[t] * n << endl;
}
return ( 0 );
}
|
#include <iostream>
using namespace std;
int main()
{
int t, n;
int sales;
int price[] = { 6000, 4000, 3000, 2000 };
for (int i = 0; i < 4; i++) {
cin >> t >> n;
sales = price[t - 1] * n;
cout << sales << endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
for(int i=0;i<4;i++){
int a,b;
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;
}
|
#include <iostream>
using namespace std;
int main(void){
int p[4] = {6000,4000,3000,2000};
int t,n;
for(int i = 0 ; i < 4 ; i++){
cin >> t >> n;
cout << p[t-1]*n <<endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a[4] = {6000, 4000, 3000, 2000}, b, c;
for (int i = 0; i < 4; i++){
scanf("%d%d", &b, &c);
printf("%d\n", a[b-1]*c);
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int price[] = {6000, 4000, 3000, 2000};
for (int i=0; i<4; i++)
{
int t, n;
cin>>t>>n;
cout<<price[t-1]*n<<endl;
}
} |
#include<iostream>
using namespace std;
int main(){
int a, b;
for(int i=0;i<4;i++){
cin>>a>>b;
if(a == 1) cout<<6000 * b<<endl;
if(a == 2) cout<<4000 * b<<endl;
if(a == 3) cout<<3000 * b<<endl;
if(a == 4) cout<<2000 * b<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int price[4] = {6000, 4000, 3000, 2000};
int main()
{
int t, n;
for (int i = 0; i < 4; i++) {
cin >> t >> n;
cout << price[t - 1] * n << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int ticket[4] = {6000, 4000, 3000, 2000};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
for(int i = 0; i < 4; ++i){
int t, n;
cin >> t >> n;
--t;
cout << ticket[t] * n << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int P[4] = { 6000, 4000, 3000, 2000 };
int t[4], n[4];
for (int i = 0; i < 4; i++)
{
cin >> t[i] >> n[i];
}
for (int i = 0; i < 4; i++)
{
cout << P[t[i] - 1] * n[i] << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int v[] = {6000, 4000, 3000, 2000};
int main() {
for (int i = 0; i < 4; i++) {
int t, n;
cin >> t >> n;
cout << n * v[t - 1] << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int T[] = {-1, 6000, 4000, 3000, 2000};
int main()
{
for (int i = 0; i < 4; i++){
int t, n;
cin >> t >> n;
cout << T[t] * n << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int d[] = {6000,4000,3000,2000};
int m,n;
for(int i=0;i<4;i++){
cin >> m >> n;
cout << d[m-1]*n << endl;
}
} |
#include<iostream>
using namespace std;
int s[5] = { 0,6000,4000,3000,2000 };
int a, b;
int main() {
for (int i = 0; i < 4; i++) {
cin >> a >> b;
cout << s[a] * b << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
int sum;
int i;
for(i=0;i<4;i++){
cin>>a>>b;
if(a==1){
cout<<b*6000<<endl;
}
else if(a==2){
cout<<b*4000<<endl;
}
else if(a==3){
cout<<b*3000<<endl;
}
else{
cout<<b*2000<<endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MoneyTable[] = { 0,6000,4000,3000,2000 };
int main() {
int t, n;
for (int i = 0; i < 4; ++i) {
cin >> t >> n;
cout << (n*MoneyTable[t]) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
for(int i=0;i<4;i++){
cin >> a >> b;
if(a == 1) cout << 6000*b << endl;
if(a == 2) cout << 4000*b << endl;
if(a == 3) cout << 3000*b << endl;
if(a == 4) cout << 2000*b << endl;
}
return (0);
}
|
#include<iostream>
using namespace std;
int main(){
int kane[] = {0,6000,4000,3000,2000};
for(int i = 0; i < 4; i++){
int t,n,sum = 0;
cin >> t >> n;
sum += kane[t] * n;
cout << sum << endl;
}
return 0;
} |
#include<stdio.h>
int main(void){
int t,n,a[]={6000,4000,3000,2000},i,x[10];
for(i=0;i<4;i++){
scanf("%d%d",&t,&n);
x[i]=a[t-1]*n;
}
for(i=0;i<4;i++) printf("%d\n",x[i]);
return 0;
} |
#include<cstdio>
using namespace std;
int main(void)
{
int nedan[5]={0,6000,4000,3000,2000};
int t,n;
int kin,i;
for(i=0;i<4;i++) {
scanf("%d %d",&t,&n);
kin=nedan[t]*n;
printf("%d\n",kin);
}
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int a[4], b, c, n = 4;
a[0] = 6000;
a[1] = 4000;
a[2] = 3000;
a[3] = 2000;
while( n-- )
{
cin >> b >> c;
cout << a[b-1] * c << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
int main() {
int k[] = { 6000,4000,3000,2000 };
rep(i, 4) {
int a, b; cin >> a >> b;
cout << k[--a] * b << endl;
}
} |
#include<iostream>
using namespace std;
int main(){
int cla,yen;
for(int i=0;i<4;i++){
cin>>cla>>yen;
if(cla==1){
cout<<6000*yen<<endl;
}else if(cla==2){
cout<<4000*yen<<endl;
}else if(cla==3){
cout<<3000*yen<<endl;
}else if(cla==4){
cout<<2000*yen<<endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int tt[]={0,6000,4000,3000,2000};
int main(){
int t,n;
while(cin >> t >> n){
cout << tt[t]*n << endl;
}
} |
#include<stdio.h>
int main(void)
{
int a,b,n,i;
for(i=0;i<4;i++){
scanf("%d %d2",&a,&b);
if(a==1) n=b*6000;
if(a==2) n=b*4000;
if(a==3) n=b*3000;
if(a==4) n=b*2000;
printf("%d\n",n);
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int d[4]={0};
int r[4]={6000,4000,3000,2000};
for(int i=0;i<4;i++){
int a,b;
cin>>a>>b;
d[a-1]=b;
cout<<d[a-1]*r[a-1]<<endl;
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int type, num;
int price[4] = {6000, 4000, 3000, 2000};
while(scanf("%d %d\n", &type, &num) == 2) {
printf("%d\n", price[type-1]*num);
};
} |
#include<stdio.h>
int main()
{
int S=6000,A=4000,B=3000,C=2000,a,b,i;
for(i=0;i<4;i++){
scanf("%d %d",&a,&b);
if(a==1){
S=S*b;
printf("%d\n",S);
}else if(a==2){
A=A*b;
printf("%d\n",A);
}else if(a==3){
B=B*b;
printf("%d\n",B);
}else if(a==4){
C=C*b;
printf("%d\n",C);
}
}
return(0);
}
|
#include <cstdio>
int a[4] = {6000, 4000, 3000, 2000};
int main(){
for(int i = 0; i < 4; i++){
int t, n; scanf("%d%d", &t, &n);
t--;
printf("%d\n", a[t]*n);
}
} |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int e,y;
for(int a=1;a<=4;a++){
cin>>e>>y;
if(e==1){cout<<6000*y<<endl;}
else if(e==2){cout<<4000*y<<endl;}
else if(e==3){cout<<3000*y<<endl;}
else if(e==4){cout<<2000*y<<endl;}
}
}
|
#include <cstdio>
using namespace std;
int main(void){
int c[] = {0, 6000, 4000, 3000, 2000};
int t, p;
for (int i = 0; i < 4; i++) {
scanf("%d %d", &t, &p);
printf("%d\n", c[t]*p);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int ans[10]={0},mm[5]={0,6000,4000,3000,2000};
for(int i=0;i<4;i++){
int t,n;
cin>>t>>n;
ans[i]=mm[t]*n;
}
for(int i=0;i<4;i++){
cout<<ans[i]<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main (){
int i,a,b,x;
for( i = 1; i <= 4; i++ ){
cin >> a >> b;
if( a==1 ) x=b*6000;
else if( a==2 ) x=b*4000;
else if( a==3 ) x=b*3000;
else if( a==4 ) x=b*2000;
cout << x <<endl;
}
return 0;
}
|
#include <cstdio>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int p[]={6000,4000,3000,2000};
rep(_,4){
int a,b; scanf("%d%d",&a,&b);
printf("%d\n",p[a-1]*b);
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,b;
int ticket[4] = {6000,4000,3000,2000};
for(int i=0;i<4;i++){
cin >> a >> b;
cout << ticket[a-1]*b << endl;
}
return 0;
} |
#include <iostream>
int main(){
int a,b;
for(int i=0;i<4;++i){
std::cin>>a>>b;
int m=0;
if(a==1)m=6000;
else if(a==2)m=4000;
else if(a==3)m=3000;
else m=2000;
std::cout<<b*m<<std::endl;
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.