{"image_url":null,"title":"UVa10924 Prime Words","width":"100%","provider_url":"https://hatena.blog","blog_title":"Logfiles","url":"https://logfiles.hatenablog.com/entry/20140827/1409160284","published":"2014-08-27 02:24:44","categories":["UVa"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140827%2F1409160284\" title=\"UVa10924 Prime Words - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","description":"\u89e3\u8aac \u3053\u306e\u554f\u984c\u3067\u306f 1 \u306f\u7d20\u6570\u3068\u3057\u3066\u6271\u3063\u3066\u3044\u308b\u3002 #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for(int i=a;i<(int)b;i++) #define rep(i,n) REP(i,0,n) inline bool isPrime(int x) { int y = x; for(int i=2; i<=sqrt(x); i++) { if(y % i == 0) return false; } return true; } int main() { for(string word; cin >> w\u2026","version":"1.0","height":"190","author_name":"moistx","provider_name":"Hatena Blog","blog_url":"https://logfiles.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/moistx/"}