提出 #39854366

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
 
void solve(){
   int a,b;
   cin>>a>>b;
   unordered_map<int,char> mp;
   int k = 65;
   for(int i = 0 ;i<27 ;i++){
     if(i==0){
        mp[i]='.';
     }
     else mp[i]=k++;
   }
   vector<vector<int>> v;
   for(int i  = 0 ; i<a ; i++){
     vector<int> v2(b);
     for(int j = 0 ; j<b ; j++){
        cin>>v2[j];
     }
     v.push_back(v2);
   }

  
   for(int i  = 0 ; i<v.size() ; i++){
    for(int j = 0 ; j<v[i].size() ; j++){
        cout<<mp[v[i][j]];
    }
    cout<<"\n";
   }

   

   




}
 
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
 
    int t=1;
    while (t--) {
    solve();
    }
 
    return 0;
}
/*0. Enough array size? Integer overflow?
 
 
 
1. Think TWICE, Code ONCE!
 
Are there any counterexamples to your algo?
 
 
 
2. Be careful about the BOUNDARIES!
 
N=1? P=1? Something about 0?
 
 
 
3. Do not make STUPID MISTAKES!
 
Time complexity? Memory usage? Precision error?
 
4.Check special cases when size is same || 1 and 0 always ruins the algo */
 

提出情報

コンパイルエラー

./Main.cpp: In function ‘void solve()’:
./Main.cpp:25:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::vector<int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   25 |    for(int i  = 0 ; i<v.size() ; i++){
      |                     ~^~~~~~~~~
./Main.cpp:26:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   26 |     for(int j = 0 ; j<v[i].size() ; j++){
      |                     ~^~~~~~~~~~~~

ジャッジ結果