竞赛
考级
YuQing1919
zsy
YFT
*
如果说我是帅哥才怪
题解
Dream
a = int(input()) lst = [] for i in range(a): a = input().split() lst.append(a) for i in lst: print(i[0] + "->" + i[1])
199****3147
#include<bits/stdc++.h> using namespace std; int s[1000]; int main(){ int n; cin>>n; char ch; int x; for(int i=0;i<n;i++) { scanf("%s%d",s,&x); printf("%s->%d\n",s,x); } return 0; }
天之神——summer
#include<iostream> #include<string> using namespace std; struct student { string x; int t; }; int main() { int n; cin>>n; struct student allstu[n]; for(int i=0;i<n;i++) { cin>>allstu[i].x; cin>>allstu[i].t; } for(int j=0;j<n;j++) { cout<<allstu[j].x<<"->"<<allstu[j].t<<endl; } return 0; }
张*程
JMZ詹总
#include<iostream> using namespace std; struct stu{ string name; int x; }a[105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].x; }for(int i=1;i<=n;i++){ cout<<a[i].name<<"->"<<a[i].x<<endl; } return 0; }
排队干饭(幼儿园扛把子)的学生
不多说废话,下面是题解
xiaofeng
werfa
AWM夜鹰 | 鹰击长空
#include<iostream> using namespace std; struct stu{ string name; int weight; }a[999]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].weight; } for(int i=1;i<=n;i++){ cout<<a[i].name<<"->"<<a[i].weight<<endl; } return 0; }
补药预判我法罗隐身啊啊
#include<bits/stdc++.h> using namespace std; struct shabichusheng{ string s; int n; }d[2005]; int main(){ int a; cin>>a; for(int i=1;i<=a;i++){ cin>>d[i].s>>d[i].n; } for(int i=1;i<=a;i++){ cout<<d[i].s<<"->"<<d[i].n<<endl; } return 0; }
???
#include<bits/stdc++.h> #define int long long using namespace std; int n; signed main(){ cin>>n; for(int i=1;i<=n;i++){ string a; int b; cin>>a>>b; cout<<a<<"->"<<b<<endl; } return 0; }
枫萧萧(互关)
枫岚
#include<bits/stdc++.h> using namespace std; struct stu{ string name; int t; }a[1005]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].t; } for(int i=1;i<=n;i++){ cout<< a[i].name <<"->"<<a[i].t<<endl; } return 0; }
爱打工的黑奴bzt
#include<iostream> using namespace std; struct stu{ string name; int x; }a[105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].x; } for(int i=1;i<=n;i++){ cout<<a[i].name<<"->"<<a[i].x<<endl; } return 0; }
乌云B612
#include<iostream> #include<vector> #include<string> struct student { std::string name; int weight; }; int main() { int n; stdcin >> n; stdvector<student> stu(n); for (int i = 0; i < n; i++) { stdcin >> stu[i].name >> stu[i].weight; } for (int i = 0; i < n; i++) { stdcout << stu[i].name << "->" << stu[i].weight << std::endl; } return 0; }
136****7248
共46条