fork download
  1. #include<stdio.h>
  2. #include<string.h>
  3. #include<math.h>
  4. #include<ctype.h>
  5. #include<stdlib.h>
  6. #include<iostream>
  7. #include<algorithm>
  8. #include<vector>
  9. #include<map>
  10. #include<set>
  11. #include<queue>
  12. #include<stack>
  13. #include<sstream>
  14. using namespace std;
  15. #define INF 2000000000
  16. #define INFLL (1LL<<62)
  17. #define SS ({int x;scanf("%d", &x);x;})
  18. #define SSL ({LL x;scanf("%lld", &x);x;})
  19. #define rep(i,n) for(int i=0;i<(n);i++)
  20. #define rept(i,m,n) for(int i=(m);i<(n);i++)
  21. #define ull unsigned long long
  22. #define lint long long
  23. #define MX 10000001
  24.  
  25. int main()
  26. {
  27. int i,j,k,l,n,m,t;
  28. t=SS;
  29. while(t--)
  30. {
  31. cin>>n;
  32. k=(n+3)/5;
  33. if(n==1)
  34. cout<<"poor conductor\n";
  35. else
  36. {
  37. cout<<k;
  38. if(!((n-2)%10)||!((n-1)%10))
  39. cout<<" W L\n";
  40. else
  41. if(!((n-3)%10)||!(n%10))
  42. cout<<" A L\n";
  43. else
  44. if(!((n-4)%10)||!((n+1)%10))
  45. cout<<" A R\n";
  46. else
  47. if(!((n-5)%10)||!((n+2)%10))
  48. cout<<" M R\n";
  49. else
  50. if(!((n-6)%10)||!((n+3)%10))
  51. cout<<" W R\n";
  52. }
  53. }
  54. return 0;
  55. }
  56.  
Success #stdin #stdout 0.01s 5280KB
stdin
3 
1 
2 
3
stdout
poor conductor
1 W L
1 A L